Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site github com site lemma would site does names com site:arxiv.org” of 80 matched · page 2 · 907 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 does names 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/pdf/2006.02318
stream xÚÓÎP(Îà ýðendstream endobj 11 0 obj > stream xÚÓÎP(Îà ýðendstream endobj 17 0 obj > stream xÚÓÎP(Îà ýðendstream endobj 20 0 obj > stream xÚÓÎP(Îà ýðendstream endobj 23 0 obj > stream xÚÓÎP(Îà ýðendstream endobj
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/html/2403.16413v3
For testing a simple null hypothesis against a simple alternative one, Neyman-Pearson’s fundamental lemma yields an optimal power property of the likelihood ratio test even for the case of parameter-dependent support
https://arxiv.org/html/2607.28294v1
Report GitHub Issue
×
Title:
Content selection saved. Describe the issue below:
Description:
Submit without GitHub Submit in GitHub
arXiv is now an independent nonprofit! Learn more ×
Back to arXiv
Why HTML? Report Issue Back to
https://arxiv.org/html/2607.24970v2
In this paper, we ask: does IA produce meaningfully better average ranks than DA, conditional on truth-telling
https://arxiv.org/html/2608.02942v1
On-policy distillation aligns supervision with student-visited states, but it does not determine how far a transition should advance
https://arxiv.org/html/2608.02851v1
The design relies on two affine Volterra transformations involving both Fredholm- and Volterra-type integral terms, which results in a four-PIDE kernel equations
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/html/2607.29442v2
That is, does there exist a tick-by-tick model, replicating the salient features of ultrahigh-frequency prices, whose scaling limit is of the form Yt=Xt+ZtY_{t}=X_{t}+Z_{t} with ZZ a continuous-time rough process
https://arxiv.org/html/2607.26405v1
& Optimal Design
Report GitHub Issue
×
Title:
Content selection saved. Describe the issue below:
Description:
Submit without GitHub Submit in GitHub
arXiv is now an independent nonprofit! Learn more ×
Back to arXiv
Why HTML? Report
https://arxiv.org/html/2608.03504v1
com/wp-content/uploads/2025/04/IAB_PwC-Internet-Ad-Revenue-Report-Full-Year-2024
https://arxiv.org/html/2508.20108v2
, 2023) reduces the distribution difference; however, it does not fully align the distributions
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/html/2508.20101v1
The model combines classical GARCH(pp, qq) dynamics with spatially correlated innovations and spatially varying parameters, estimated using local likelihood methods
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/q-fin.MF/2021-04
A lacuna in the proof of the old Lemma 3
https://arxiv.org/list/cs.LG/2022-12
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
Machine Learning
Authors and titles for December 2022
Total of 2004 entries : 1
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/html/2608.03573v1
Multi-Task Learning Paradigms for LLMs
Report GitHub Issue
×
Title:
Content selection saved. Describe the issue below:
Description:
Submit without GitHub Submit in GitHub
arXiv is now an independent nonprofit! Learn more ×
Back to
https://arxiv.org/list/cs.IT/new
However, the existing works have difficulty accommodating user heterogeneity in terms of communication channel quality, expected quality-of-service (QoS) targets, and the available local energy
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/html/2407.00419v1
Two natural assumptions in such settings are that: 1) all agents in the population are individually rational learners, and 2) when any two members of the population are paired together, with high-probability they will achieve at least the same utility as they would under some Pareto efficient equilibrium strategy
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.08254v2
Results suggest that, in the presence of frequent failures, our solution improves substantially over the best existing approaches in terms of global utility and scalability
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.15077v2
Meanwhile, the sequential updates of HAPPO and A2PO are established upon the assumption that each agent’s update does not depend on and impact the policies of others