Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site hotchips pp site types no site www uses gov site:arxiv.org” · 579 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
2 pp, exceeding MemSearch reader scaling (+10
https://arxiv.org/html/2608.00648v1
mdgam uses an extended graph attention mechanism to jointly update node and edge features, and employs multiple decoders to generate task-selection decisions and communication messages
https://arxiv.org/html/2608.03048v1
PI-Mem gathers evidence from all chunks in parallel and uses it to update a shared memory over a bounded number of turns
https://arxiv.org/html/2608.03011v1
Built upon the flow-matching-based F5-TTS, it uses a speech-environment separation module to decompose environmental speech into speech, noise, and reverberation components, which are injected into the Diffusion Transformer for environment-aware generation
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/2501.13956v1
2 Knowledge Graph Construction
2.1 Episodes
2.2 Semantic Entities and Facts
2.2.1 Entities
2.2.2 Facts
2.2.3 Temporal Extraction and Edge Invalidation
2.3 Communities
3 Memory Retrieval
3.1 Search
3.2 Reranker
4 Experiments
4.1 Choice
https://arxiv.org/html/2608.03154v1
×
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 Abstract Download PDF
https://arxiv.org/html/2608.00328v2
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/list/cs.CL/new
2 pp, exceeding MemSearch reader scaling (+10
https://arxiv.org/html/2608.02999v1
We test that premise constructively with Sigil, a purpose-built generative emblem system whose 3,000-text core corpus carries explicit compositional meanings although no sign has a phonological value
https://arxiv.org/list/math/new
The network switches between the two descriptions only where both are valid and the corresponding fixed linear cascade updates agree, so the switch is exact and requires no multiplication by a variable selector
https://arxiv.org/html/2407.16741v3
2 OpenHands Architecture
2.1 Agent Definition and Implementation
2.2 Agent Runtime: How Execution of Actions Results in Observations
2.3 Agent Skills: The Extensible Agent-Computer Interface
2.4 Agent Delegation: Cooperative Multi-agent
https://arxiv.org/html/2608.03118v1
Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other
https://arxiv.org/list/cs.SE/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
Software Engineering
New submissions
Cross-lists
Replacements
See recent
https://arxiv.org/list/cs.CV/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
Computer Vision and Pattern Recognition
New submissions
Cross-lists
Replacements
https://arxiv.org/list/cs.IR/new
KGD improves over strong pretrain-transfer baselines by 4-12% on eight public benchmarks and sustains its advantage over a 90-day production stream where baselines show no gains
https://arxiv.org/html/2509.22186v2
ocr, PP-StructureV3), establishing new performance records in text recognition, formula recognition, table recognition, and reading order prediction
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/abs/2608.03883
Because no annotated training data were released for this first edition of the task, we relied on zero-shot experimentation, manual validation, and unsupervised or weakly guided retrieval pipelines
https://arxiv.org/html/2503.11576v1
SmolDocling exhibits robust performance in correctly reproducing document features such as code listings, tables, equations, charts, lists, and more across a diverse range of document types including business documents, academic papers, technical reports, patents, and forms — significantly extending beyond the
https://arxiv.org/html/2608.02616v1
Error analysis shows OPF is strongest on structurally regular PII types (email: 0
https://arxiv.org/html/1802.00048v2
While many games are already deceptive to some extent, we designed a series of games in the Video Game Description Language (VGDL) implementing specific types of deception, classified by the cognitive biases they exploit
https://arxiv.org/html/2407.00419v1
If we make no assumptions about the target population, we can do little more than attempt to mimic observed behavior as closely as possible, reducing the problem to one of imitation learning
https://arxiv.org/html/2607.26327v3
Below a critical headroom, no separating equilibrium in production-side signals exists; the market pools, high-competence providers earn no premium, and those with outside options exit—Akerlof’s lemons dynamic
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.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/2504.19413v1
2 Proposed Methods
2.1 Mem0
2.2 Mem0gsuperscriptMem0𝑔\texttt{Mem0}^{\tiny g}Mem0 start_POSTSUPERSCRIPT italic_g end_POSTSUPERSCRIPT
3 Experimental Setup
3.1 Dataset
3.2 Evaluation Metrics
(1) Performance Metrics
(2) Deployment Metrics
https://arxiv.org/html/2508.16279v1
Our design emphasizes strong modular decoupling, broad compatibility across different application types, and extensibility for downstream customization
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.02518v2
2 Related Work
3 INDICT Framework
3.1 Problem Definition
3.2 Safety-driven and Helpfulness-driven Critics
3.3 Autonomous Collaboration between Critics
3.4 Knowledge-grounded Critics with External Tools
3.5 Preemptive and Post-hoc Critic