Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site github com site text org de site no not gov site:arxiv.org” of 38 matched · 1121 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: newest result fetched 24 d ago · median age of these results 24 d · 1 of 30 carry a fetch time
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
4 Permission-Aware Access: Why Non-Leaks Are Not Refusals
A
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/2510.03215v2
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2608.03011v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2608.03063v1
8 pp in a production fraud detector serving billion-scale transaction traffic
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
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/html/2608.02668v1
On nanoGPT, all three methods outperform existing lightweight deep connection schemes, and the best validation loss is attained at finite pp, indicating that the exponential map is not the preferred retraction for spherical residual streams but merely one end of a spectrum
https://arxiv.org/list/cs.CL/new
Prior work enables one-way, scholar-oriented translation from Akkadian to English, but offers no path in the reverse direction: non-specialist users cannot compose new content in cuneiform, and therefore remain passive consumers of ancient culture rather than active participants
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/html/2608.02918v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2608.03486v1
While linear SVAR models are useful in many applications, they are not able to capture nonlinear features of economic dynamics
https://arxiv.org/html/2407.04503v4
team, Université de Bordeaux, France
Abstract
As large language models (LLMs) start interacting with each other and generating an increasing amount of text online, it becomes crucial to better understand how information is transformed as it passes from one LLM to the next
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/abs/2104.08663
We leverage a careful selection of 18 publicly available datasets from diverse text retrieval tasks and domains and evaluate 10 state-of-the-art retrieval systems including lexical, sparse, dense, late-interaction and re-ranking architectures on the BEIR benchmark
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
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/2608.02616v1
2 Related Work
De-identification and text anonymization
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/2608.02609v1
It is not a barrier between two living communities that might learn each other’s languages, but a one-way temporal asymmetry: ancient texts can be partially decoded for modern readers, but modern users have no productive channel into the ancient script
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/2210.00131v4
where X𝑋Xitalic_X & Y𝑌Yitalic_Y are the dataset’s text-based features & labels, B𝐵Bitalic_B & G𝐺Gitalic_G are common causes of X𝑋Xitalic_X & Y𝑌Yitalic_Y: one a shortcut and one intended, and W𝑊Witalic_W & S𝑆Sitalic_S are not causes of Y𝑌Yitalic_Y, but included due to their
https://arxiv.org/html/2608.02612v1
org perpetual non-exclusive license
arXiv:2608
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/2607.22511v2
Because a machine-checked proof establishes only that a formal statement follows from its assumptions—not that the statement faithfully captures the intended scientific claim—the pipeline augments kernel verification with a statement audit that compares each formal theorem against the informal claim it is intended
https://arxiv.org/html/2607.26245v1
No strategy iteration survived fees and spread; out-of-sample, the strongest published model does not beat, and slightly underperforms the probability already implied by Polymarket’s own order book (Section 10
https://arxiv.org/html/2407.03956v3
It must also encode additional constraints: the Football and Red houses occupy House 1 or House 3, respectively, and they must not be the same house