Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site cdn kernel org site:arxiv.org” of 54 matched · 357 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 23 d ago · median age of these results 23 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
We evaluate five open-weight readers with Vanilla context, BM25-RAG, Oracle retrieval, Memobase, and MemSearch as memory backends
https://arxiv.org/html/2609.02852v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/html/2607.27099v1
org perpetual non-exclusive license
arXiv:2607
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.03048v1
×
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/2609.03027v1
Report GitHub Issue
Description:
arXiv is now an independent nonprofit
https://arxiv.org/list/cs.AI/new
Lean 4 checks kernel analogues for positions, evidence, clocks, monitors, atomicity, and branch source retention; 88 tests, 3,534 bounded checks, and 32 Lean/Python runtime-kernel cases bound the implementation claim to the checked cases
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/list/cond-mat/new
The mixed anomaly between these is accommodated by the not-on-site action of the symmetries
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/math.ST/2024-03
00186 [pdf, html, other]
Title: Warped Kernel Estimator for I
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/abs/2608.12700
Those rates come from a single loose test: run the kernel on a few random inputs at one fixed shape and accept it if the output is close to a reference
https://arxiv.org/html/2608.02851v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/abs/2204.04218
Our attention module uses the convolution operation to perform joint spatial-channel attention on multiple concatenated input tensors, where the kernel (receptive field) size controls the reduction rate of the spatial attention, and the number of convolutional filters controls the reduction rate of the channel
https://arxiv.org/abs/2608.02851v1
The design relies on two affine Volterra transformations involving both Fredholm- and Volterra-type integral terms, which results in a four-PIDE kernel equations
https://arxiv.org/html/2508.20101v1
The model combines classical GARCH(pp, qq) dynamics with spatially correlated innovations and spatially varying parameters, estimated using local likelihood methods
https://arxiv.org/abs/2512.09590
09590] On Inhomogeneous Affine Volterra Processes: Stationarity and Applications to the Volterra Heston Model
Skip to main content
arXiv is now an independent nonprofit
https://arxiv.org/abs/2608.01651
We present Bole, a kernel--runtime co-design that enables efficient tree speculation for hybrid-attention LLMs
https://arxiv.org/list/math.ST/new
| all
New submissions (showing 6 of 6 entries)
[1] arXiv:2608
https://arxiv.org/html/2608.02612v1
org perpetual non-exclusive license
arXiv:2608
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.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/list/cs.DB/new
showing 2 of 2 entries)
[1] arXiv:2608
https://arxiv.org/list/cs.DC/new
Several components are the subject of pending United States patent applications by the first author and are presented here as candidate open architectural principles
[2] arXiv:2608
https://arxiv.org/list/cs.OS/new
| all
New submissions (showing 2 of 2 entries)
[1] arXiv:2608
https://arxiv.org/abs/2609.14858
-->
Computer Science > Computation and Language
arXiv:2609