Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site github com site lemma would site databases com site:arxiv.org” of 80 matched · page 2 · 987 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 databases 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/2608.02800v1
com in China, Walmart Marketplace and Target Plus in the United States, Otto in Germany, Flipkart in India, and Rakuten in Japan
https://arxiv.org/list/cs.PL/current
Andrew Uderian, Sridhar Gopinath, Jan Szczepaniec, Daniel Neilson, Blaine Burton Rister, Jordan Fix, Jazlyn Li, Zejun Huang, Lite Ye, Nan Zhang, Xinchen Guo, Andiry Xu, Michael Roberts, Kunming Ho, Site Cao, Suryadev Sahadevan Rajesh, Tristan Trouwen, Mike Tsai, Jake Lee, Wayne Su, Yuhan Chen, Xiaolong Xie
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/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/html/2608.02943v1
After projection through the recursion, the quantile terms admit a residual-rank-and-spacing representation, yielding feasible inference without innovation-density estimation or quantile smoothing
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
Although IA is Pareto-efficient and DA is not, conditional on truth-telling, we do not know how much better IA’s placement is in quantitative terms
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/html/1802.00050v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2608.02942v1
×
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 Abstract Download PDF
https://arxiv.org/html/2607.29442v2
1footnoteFootnotefootnotesFootnotes1footnote 1We are grateful to Carsten Chong for fruitful discussions on rough noise. We benefitted from comments by and discussions with Kim Christensen, Mikko Pakkanen, Bent Jesper Christensen, and Mikkel
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/list/cs.PF/current
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Performance
Authors and titles for August 2026
Total of 47 entries
Showing up to 50 entries per page: fewer | more | all
[1] arXiv:
https://arxiv.org/list/cs.AI/2018-02
AI)
Journal-ref: Problems in programming, 2012, (2-3), pp
https://arxiv.org/list/cs.DC/2019-11
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Distributed, Parallel, and Cluster Computing
Authors and titles for November 2019
Total of 166 entries : 1-50 51-100 101-150 151-166
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.DC/2021-12
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Distributed, Parallel, and Cluster Computing
Authors and titles for December 2021
Total of 203 entries : 1-50 51-100 101-150 151-200
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.ET/current
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Emerging Technologies
Authors and titles for August 2026
Total of 71 entries : 1-50 51-71
Showing up to 50 entries per page: fewer
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/abs/2006.02833
Our results reveal that MongoDB and MySQL Cluster work efficient in terms of throughput and operations latency if they burst into a public cloud to supply their resources
https://arxiv.org/abs/2608.10863
s success story in terms of language design
https://arxiv.org/html/2511.06451v1
Problem statement and motivation.
Thesis: risk-neutral pricing as a structured operator.
From selective scan to a risk-neutral operator layer.
Geometry in the loop: Q-Align and convex–monotone decoding.
Spectral stability as a first-class
https://arxiv.org/html/2407.04889v1
(2019b); however, in general settings it is not known how to best play against mean-based learners, even if the agent knows everything about the learners, and can predict with certainty what actions they would take as a function of the history of play
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/eess/new
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/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