Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site github com site does github com site www vol site:arxiv.org” of 36 matched · 1120 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
6 Ingest Overhead: When Does Structured Memory Pay Off
https://arxiv.org/html/2608.02918v1
Miranda is also with LCTI, Télécom Paris, IP Paris, France
https://arxiv.org/html/2608.03011v1
via Disentangled Audio Infilling
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
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/2407.16741v3
com/All-Hands-AI/OpenHands
Slack http://bit
https://arxiv.org/html/2609.03103v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2608.00458v1
The central challenge is that transmitting more message content does not necessarily improve the downstream performance
https://arxiv.org/html/2608.01366v2
com Affiliation: Department of Design and Manufacturing, Indian Institute of Science (IISc) , Bangalore , India , Srinidhi Ranjini Girish email: srinidhirgirish@gmail
https://arxiv.org/html/2608.03703v1
begun on July 20, 2026; the present version is dated August 4, 2026. Claude Opus 5 and Fable 5 provided research assistance throughout, spanning code development, data construction and empirical analysis, and the drafting of the manuscript.
https://arxiv.org/html/2407.00575v3
Gradient play converges to a unique Nash equilibrium (NE) that does not optimize the global objective
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/2607.27188v1
5 Real NIFTY data: adaptation helps but does not close the gap
6 Discussion
6
https://arxiv.org/html/2607.28577v1
Production forecasting systems retrain models regularly, but a retrained candidate does not necessarily outperform a continuously maintained incumbent that has continued to learn
https://arxiv.org/html/2608.02813v1
Wind Turbine Generators
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?
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/2412.12213v2
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/2407.10811v1
Recently, employing reinforcement learning (RL) to solve TSC has become a research hotspot since it does not require too much artificial priori and can improve performance significantly through the paradigm of trial and error
https://arxiv.org/html/2407.02342v1
com/qiongwu86/Optimizing-AoI-in-VEC-with-Federated-Graph-Neural-Network-Multi-Agent-Reinforcement-Learnin
https://arxiv.org/html/2609.03159v1
2, which are to Understand the Sun, Solar System, and Universe: “How does the Universe work
https://arxiv.org/html/2407.04974v1
Unlike many existing dec-POMDP-based RL approaches, the proposed algorithm is suitable for model-free multi-agent reinforcement learning as it does not require knowledge of a transition model
https://arxiv.org/html/2407.00762v1
Attackers
I Introduction
II Problem Formulation
II-A Notation
II-B Problem Statement
III Preliminary: Single-Attacker Game
IV Main Results
IV-A Optimization Formulation of a Geometric Solution
IV-B Proof of Equilibrium
V Numerical
https://arxiv.org/html/2407.13076v1
Index Terms:
LoRa, multigateway, system energy efficiency, matching-based, multiagent deep reinforcement learning
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/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/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.03388v1
– Agatha Christie, in The Mysterious Affair at Styles 111https://www
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/html/2608.03210v1
They bypass explicit safety mechanisms by replacing harmful terms in original harmful questions with benign alternatives and leveraging contextual information to induce the target model to reinterpret these alternatives as their corresponding harmful concepts