Web This site Trusted
26 result(s) for “okapi bm25 site hotchips pp site doris apache org site www roman com site:arxiv.org” · 787 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/2407.02342v1
org) Wen Chen is with the Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai 200240, China(e-mail: wenchen@sjtu
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.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.13076v1
Transmission Parameter Allocation in Multi-Gateway LoRa Networks
I INTRODUCTION
II RELATED WORK
III SYSTEM MODEL
III-A The Traffic Pattern of LoRa Networks
III-B Capture Effect and Quasi-Orthogonality between SFs
III-C Packet Delivery
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.04974v1
Observable Environments
I Introduction
II State of the art
II-A Settings
II-B State estimation in model-based learning
II-C State estimation in model-free RL
II-C1 Neural Network-based Approaches
II-C2 Non-neural-based Approach
II-D
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/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/2407.16741v3
com/All-Hands-AI/OpenHands
Slack http://bit
https://arxiv.org/list/cs.AI/new
Research artifact available under the Apache-2
https://arxiv.org/list/cs.IR/recent
IR)
Tue, 4 Aug 2026 (showing first 34 of 45 entries )
[17] arXiv:2608
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/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
https://arxiv.org/html/2407.00419v1
Let ΘΘ\Thetaroman_Θ denote the finite type space, where θ1,θ2∈Θsubscript𝜃1subscript𝜃2Θ\theta_{1},\theta_{2}\in\Thetaitalic_θ start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT , italic_θ start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT ∈ roman_Θ denote the private types of the two agents, and 𝜽=(θ1,θ2)
https://arxiv.org/html/2407.20004v1
10 Supplementary Note 10: Exponential Relationship Between ΔDrΔsubscript𝐷𝑟\Delta D_{r}roman_Δ italic_D start_POSTSUBSCRIPT italic_r end_POSTSUBSCRIPT and ΔErΔsubscript𝐸𝑟\Delta E_{r}roman_Δ italic_E start_POSTSUBSCRIPT italic_r end_POSTSUBSCRIPT
Navigation services amplify concentration of
https://arxiv.org/html/2407.05763v1
However, centralized observers for plants modeled by nonlinear systems satisfying Ho¨¨o\ddot{\mathrm{o}}over¨ start_ARG roman_o end_ARGlder condition can be found in the recent literature (see, e
https://arxiv.org/html/2407.05132v1
1 Introduction
1.1 Background and Motivation
1.2 Objectives
2 Literature Review
2.1 Related Works on Karma
2.2 Value proposition of Karma
3 Materials and Methods
3.1 Game Theoretic Formalism
3.1.1 Notation
3.1.2 Karma as a game
3.1.3
https://arxiv.org/html/2407.06328v2
I Introduction
II Preliminaries and Problem Description
II-A Task Allocation Game Model
II-B Learning Rule, Stochastic Alarm Clock, and Evolutionary Dynamics Model
II-C Payoff Vector Estimation
III Convergence Analysis and Revision Rate
https://arxiv.org/html/2407.18010v2
start_POSTSUPERSCRIPT italic_i end_POSTSUPERSCRIPT start_POSTSUBSCRIPT italic_t end_POSTSUBSCRIPT = italic_S start_POSTSUPERSCRIPT italic_i end_POSTSUPERSCRIPT ( italic_ω ) : blackboard_R start_POSTSUBSCRIPT > 0 end_POSTSUBSCRIPT × roman_Ω → blackboard_R which is a stochastic process
https://arxiv.org/html/2407.20441v1
I Introduction
II System Model and Problem Formulation
III Main result
IV Proof of the main result
V Simulations
VI Conclusion and Future Work
Finite-Time Analysis of Asynchronous Multi-Agent TD Learning
Nicolò Dal Fabbro, Arman Adibi
https://arxiv.org/html/2309.08431v3
Finance and Automated Market Making: Predictable Loss and Optimal Liquidity Provision
1 Introduction
2 Constant function markets and concentrated liquidity
2.1 Constant function markets
2.2 Concentrated liquidity markets
3 The wealth of
https://arxiv.org/html/2407.20187v1
1 Introduction
1.1 The Illusion Elimination Problem
1.2 Our Contributions.
1.3 Related Work.
2 Preliminaries
3 Majority Illusion Addition Elimination (MIAE)
3.1 A First Attempt
3.2 A Second Attempt
3.3 A TDI System
3.4 A Polynomial Time
https://arxiv.org/html/2407.15077v2
2 Problem Definition
3 Method
3.1 Monotonic Improvement of B2MAPO scheme
3.2 B2MAPO Framework
3.2.1 Batch Sequence Generation Layer
3.2.2 Batch by Batch Policy Optimization Layer
4 DAG-based B2MAPO Algorithm
4.1 Hierarchical DAG