Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site github com site foundation rest land org site:arxiv.org” of 37 matched · 960 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/list/cs.AI/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
Artificial Intelligence
New submissions
Cross-lists
Replacements
See recent
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/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/2407.16741v3
com/All-Hands-AI/OpenHands
Slack http://bit
https://arxiv.org/list/cs.CL/new
We evaluate five open-weight readers with Vanilla context, BM25-RAG, Oracle retrieval, Memobase, and MemSearch as memory backends
https://arxiv.org/html/2608.02668v1
com/hazdzz/deep_connection \ncudata[Correspondence]Jie Zhang (),
Correspondence: Cheng-Fang Su ()
“Geometry is not true, it is advantageous
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/html/2608.02918v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2506.01844v1
While complementary in terms of modalities, such advances in developing multi-modal foundation models stem from (i) the adoption of scalable architectures, such as the Transformer (Vaswani, 2017) and (ii) internet-scale training datasets
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/2607.22511v2
The source code, formal library, and run records are available at https://github
https://arxiv.org/html/2508.16279v1
org perpetual non-exclusive license
arXiv:2508
https://arxiv.org/html/2509.22186v2
com/opendatalab/MinerU \metadata[Model:]https://huggingface
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
https://arxiv.org/html/2210.00131v4
Code and open-source demos available at https://github
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.19205v1
com/microsoft/VibeVoice
Hugging Face: microsoft/VibeVoice
Demo: aka
https://arxiv.org/html/2608.03486v1
Keywords: Nonlinear SVAR, nonlinear structural vector autoregressive model, independent innovation analysis, feed-forward neural network, statistical identification
††The author thanks the Research Council of Finland (Grant 347986) and the Yrjö Jahnsson Foundation (Grant 20247849) for the financial support
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/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/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/list/cs.SE/new
However, this widespread use rests on a fragile foundation