Web This site Trusted
20 result(s) for “okapi bm25 site terms com pp site github com site lemma would site github com site:arxiv.org” of 80 matched · page 3 · 1320 ms
Scope: Nishi’s own index (our crawl + Common Crawl) — not the whole live web. Some sites block all automated crawlers (anti-bot walls), so their pages may be absent here even though we never filter lawful content.
Did you mean okapi bm25 site terms com pp site github com site lemmy would site github com site:arxiv.org?
Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)
https://arxiv.org/html/2407.18010v2
Since acting at each available opportunity would accumulate prohibitively large costs, the resulting decision problem is one in which players must make strategic decisions about when to execute actions in addition to their choice of action
https://arxiv.org/list/math/new
Skip to main content
System maintenance August 4th and 5th Learn more ×
Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Mathematics
New submissions
Cross-lists
Replacements
See recent articles
Showing
https://arxiv.org/abs/2608.03883
Our systems combine sparse BM25 retrieval, evidence-aware rescoring for self-referential symptom reports, embedding-based reranking, query-prototype expansion, and LLM-based reranking
https://arxiv.org/abs/2104.08663
Our results show BM25 is a robust baseline and re-ranking and late-interaction-based models on average achieve the best zero-shot performances, however, at high computational costs
https://arxiv.org/abs/2608.03860
The pipeline combines sentence-window chunking, BM25, BGE-M3 dense retrieval, reciprocal rank fusion, optional cross-encoder reranking, and grounded answer generation
https://arxiv.org/list/cs.IR/recent
Skip to main content
System maintenance August 4th and 5th Learn more ×
Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Information Retrieval
Authors and titles for recent submissions
Wed, 5 Aug 2026
https://arxiv.org/list/cs.CG/new
PR)
The Johnson--Lindenstrauss lemma asserts that every set of $n$ points in $d$-dimensional Euclidean space embeds into $O(\varepsilon^{-2}\log n)$-dimensional Euclidean space with distortion at most $1+\varepsilon$
https://arxiv.org/list/cs.IR/new
Skip to main content
System maintenance August 4th and 5th Learn more ×
Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Information Retrieval
New submissions
Cross-lists
Replacements
See recent
https://arxiv.org/list/q-fin.MF/2021-04
A lacuna in the proof of the old Lemma 3
https://arxiv.org/list/cs.DS/new
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Data Structures and Algorithms
New submissions
Cross-lists
Replacements
See recent articles
Showing new listings for Monday, 17 August
https://arxiv.org/list/cs.AR/new
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Hardware Architecture
New submissions
Cross-lists
Replacements
See recent articles
Showing new listings for Monday, 17 August 2026
https://arxiv.org/list/cs.SY/new
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Systems and Control
New submissions
Cross-lists
Replacements
See recent articles
Showing new listings for Monday, 17 August 2026
Total
https://arxiv.org/list/cs.CR/new
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Cryptography and Security
New submissions
Cross-lists
Replacements
See recent articles
Showing new listings for Friday, 7 August 2026
https://arxiv.org/html/2407.06328v2
I Introduction
II Preliminaries and Problem Description
II-A Task Allocation Game Model
II-B Learning Rule, Stochastic Alarm Clock, and Evolutionary Dynamics Model
II-C Payoff Vector Estimation
III Convergence Analysis and Revision Rate
https://arxiv.org/html/2407.20441v1
I Introduction
II System Model and Problem Formulation
III Main result
IV Proof of the main result
V Simulations
VI Conclusion and Future Work
Finite-Time Analysis of Asynchronous Multi-Agent TD Learning
Nicolò Dal Fabbro, Arman Adibi
https://arxiv.org/html/2309.08431v3
Finance and Automated Market Making: Predictable Loss and Optimal Liquidity Provision
1 Introduction
2 Constant function markets and concentrated liquidity
2.1 Constant function markets
2.2 Concentrated liquidity markets
3 The wealth of
https://arxiv.org/html/2407.20187v1
1 Introduction
1.1 The Illusion Elimination Problem
1.2 Our Contributions.
1.3 Related Work.
2 Preliminaries
3 Majority Illusion Addition Elimination (MIAE)
3.1 A First Attempt
3.2 A Second Attempt
3.3 A TDI System
3.4 A Polynomial Time
https://arxiv.org/html/2407.15077v2
2 Problem Definition
3 Method
3.1 Monotonic Improvement of B2MAPO scheme
3.2 B2MAPO Framework
3.2.1 Batch Sequence Generation Layer
3.2.2 Batch by Batch Policy Optimization Layer
4 DAG-based B2MAPO Algorithm
4.1 Hierarchical DAG
https://arxiv.org/pdf/1811.12628
ioAJyU# LFg¡C}zO7tXW,۽ݭDZbn; ] ,= h粂7'6m.>tv }u/|8 pqMP7f3E( )ֽa\dYD3,V:A3 K+r :t4!4}wLod#౭6?q2UdQL %ʔc7_Vo1qo
https://arxiv.org/html/2407.05763v1
1 Introduction
2 Preliminaries
2.1 Graph Theory
2.2 Generalized Homogeneity
3 Problem Statement
4 Basic Idea of the Observer Design
5 Homogeneous Observer Design
5.1 Globally Homogeneous Distributed Observer
5.2 Locally Homogeneous