Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site github com site re if site web archive org site:arxiv.org” of 37 matched · 986 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)
The query asks the model to recall the topic of an earlier conversation about Tesla; the gold answer is anchored in one specific session about Pooja’s dig site
from the top result below
https://arxiv.org/html/2608.02613v1
We evaluate five open-weight readers with Vanilla context, BM25-RAG, Oracle retrieval, Memobase, and MemSearch as memory backends
https://arxiv.org/html/2608.03048v1
com/JetAstra/PI-Mem
Introduction
The ability to reason over long contexts is increasingly important for large language models (LLMs), supporting applications such as long-document question answering (Gemini Team 2025; Yang et al
https://arxiv.org/html/2407.16741v3
OpenDevin), a platform for the development of powerful and flexible AI agents that interact with the world in similar ways to those of a human developer: by writing code, interacting with a command line, and browsing the web
https://arxiv.org/html/2608.02918v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2501.13956v1
com
Abstract
We introduce Zep, a novel memory layer service for AI agents that outperforms the current state-of-the-art system, MemGPT, in the Deep Memory Retrieval (DMR) benchmark
https://arxiv.org/html/2608.02668v1
Sphere pp-Angular Retraction Normalization
https://arxiv.org/html/2608.03063v1
8 pp in a production fraud detector serving billion-scale transaction traffic
https://arxiv.org/html/2608.03011v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/list/cs.AI/new
Biological systems, in contrast, exhibit adaptive plasticity, maintaining function through dynamic re-organisation around damage
https://arxiv.org/html/2607.22511v2
The source code, formal library, and run records are available at https://github
https://arxiv.org/html/2608.02609v1
Code and pretrained model: https://github
https://arxiv.org/html/2407.17789v2
org perpetual non-exclusive license
arXiv:2407
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
https://arxiv.org/html/2509.22186v2
\metadata
[* Equal contribution ✉ Corresponding author ‡\ddagger Project leader] \correspondenceConghui He, \metadata[Code:]https://github
https://arxiv.org/html/2607.26245v1
Initial analyses establish Polymarket stylized facts (one-tick top-of-book spreads) and characterize cross-venue timing: an apparent 16 ms median lag on venue source clocks, with relative clock drift bounded to ≤6{\leq}6{} ms over the archive but a remaining single-vantage constant-offset ambiguity of roughly ±99
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/list/cs.CL/new
3% coverage), and a visual tablet renderer, packaged as a pip-installable toolkit with CLI and web demo
https://arxiv.org/html/2608.02616v1
com
Abstract
We present the first independent, systematic evaluation of OpenAI’s Privacy Filter (OPF), a 1
https://arxiv.org/html/2608.02612v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2608.03446v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2508.16279v1
org perpetual non-exclusive license
arXiv:2508
https://arxiv.org/html/2210.00131v4
Code and open-source demos available at https://github
https://arxiv.org/html/2407.02518v2
com
Abstract
Large language models (LLMs) for code are typically trained to align with natural language instructions to closely follow their intentions and requirements
https://arxiv.org/html/2402.03300v3
com/deepseek-ai/DeepSeek-Math
Abstract
Mathematical reasoning poses a significant challenge for language models due to its complex and structured nature
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/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.IR/new
CL)
Existing deep-research agents use a search-visit workflow that retrieves and reads whole pages, without considering the addressable structure that web sources expose through titles, headings, sections, and metadata
https://arxiv.org/html/2608.03486v1
At the same time, the recent theoretical work of Kolesár and Plagborg-Møller (2025) has demonstrated that statistical identification strategies developed under linearity may fail when the structural relationship between the reduced-form innovations and shocks is nonlinear, even if the shocks themselves satisfy
https://arxiv.org/html/2608.00785v1
com
Abstract
Content discovery systems depend on relevance judgment for search quality evaluation, but human annotation faces inter-annotator disagreement and scaling costs