NishiSearch

Web This site Trusted

17 result(s) for “okapi bm25 site terms com pp site uscode house gov site gain co site:arxiv.org” of 47 matched · page 2 · 564 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.

Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)

[2608.03883] DS@GT-ARC at eRisk 2026 Task 3: Sparse, Semantic, and LLM

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

[2104.08663] BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of

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

[2608.03860] SciRet: A Compute-Aware Empirical Study of Retrieval and

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

[2608.04003] PAST-Bench: Benchmarking the Foundations of Recursive Self

https://arxiv.org/abs/2608.04003
Agents with the same headline gain can differ markedly in whether that gain is supported by evidence of the intended pathway

Stress-Relief Annealing: Polynomial-Time Simulation-Free Layout

https://arxiv.org/html/2608.01024v1
org perpetual non-exclusive license arXiv:2608

1 Introduction

https://arxiv.org/html/2410.15608v2
2 Issues with fixed sequence length encoder 3 Approach 3.1 Model architecture 3.2 Training data collection & preprocessing 3.3 Training 4 Evaluations 4.1 Accuracy vs. Input Length 4.2 Robustness to Input Speech Signal Level 4.3 Robustness

Systems and Control

https://arxiv.org/list/cs.SY/new
more | all New submissions (showing 8 of 8 entries) [1] arXiv:2608

arXiv is now an independent nonprofit! Learn more ×

https://arxiv.org/html/1802.00048v2
Description: arXiv is now an independent nonprofit

Software Engineering

https://arxiv.org/list/cs.SE/new
96 points behind on SpreadsheetBench; Sequential Refinement recovers neither gain

Report GitHub Issue

https://arxiv.org/html/2608.02942v1
org perpetual non-exclusive license arXiv:2608

Report GitHub Issue

https://arxiv.org/html/1802.00050v1
Report GitHub Issue Description: arXiv is now an independent nonprofit

Looking under the Wrong Lamppost: On the Limitations of Automated

https://arxiv.org/html/2608.03577v1
org/standards/popular/iso-9000-family specifically ISO 9001:2015 Applying the same logic to translation production workflows means that MT and AI must be incorporated sensibly to achieve manufacturing-grade reliability, risk guarantees, and robustness

Report GitHub Issue

https://arxiv.org/html/2608.03372v1
org  GitHub sourcecontextcandidatememoryalign claimscontent-word overlapseven checkspolarity ⋅\cdot condition ⋅\cdot temporalhedge ⋅\cdot attributionbrittle ⋅\cdot truncatedflagsevidence + citationverdict policyhard-codedpasspass_w_flagsrewriterejectuncheckablenever a passwitness (optional)one sentence, one

Report GitHub Issue

https://arxiv.org/html/2608.03077v1
org perpetual non-exclusive license arXiv:2608

The Last Costly Signal: How Generative AI Collapses Competence Signaling

https://arxiv.org/html/2607.26327v3
and Why Liability Sustains Markets for Expert Services 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

SFT Conflicts, RL Coexists: A Theoretical and Empirical Analysis of

https://arxiv.org/html/2608.03573v1
org perpetual non-exclusive license arXiv:2608

Maximizing utility in multi-agent environments by anticipating the

https://arxiv.org/html/2407.04889v1
behavior of other learners 1 Introduction Setting. Zero-sum games. General-sum games. 1.1 Preliminaries 1.2 Algorithms for the learner 1.3 Our results 1.3.1 Zero sum games Continuous-time games. Discrete-time games. 1.3.2 A lower bound