Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site dlmultimedia era in site can kernel org site:arxiv.org” of 55 matched · 568 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
A benchmark for personal memory in this setting should therefore evaluate the full stack on device, not just whether a model can retrieve the relevant information
https://arxiv.org/html/2607.27099v1
org perpetual non-exclusive license
arXiv:2607
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
for large language models, as recent recurrent-memory approaches face two inherent challenges: sequential chunk-wise updates can overwrite early critical evidence with later irrelevant content, and serial inter-chunk dependencies limit parallelism and cause latency to increase with context length
https://arxiv.org/html/2609.03027v1
EPIC can achieve 𝒪(NlogN)\mathcal{O}(N\log N) computational scaling for dense aperture arrays and has been demonstrated on the Long Wavelength Array (LWA) station in Sevilleta (USA) using Graphics Processing Unit (GPU)
https://arxiv.org/html/2609.02852v1
The second challenge is disruption of misaligned action: in situations where misaligned planning cannot be detected and derailed, how can we prevent a model from actually engaging with the external world in malicious ways
https://arxiv.org/list/cs.AI/new
In practice, many field descriptions remain ambiguous or incomplete, as much of the essential context (e
https://arxiv.org/html/2607.22511v2
When a theorem is formalized in Lean 4 and its proof is accepted by the kernel, the proof is guaranteed to be correct relative to Lean 4’s trusted core
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.03860
In contrast, an MS MARCO-trained cross-encoder reranker reduces precision on the scientific corpus, suggesting that domain mismatch can outweigh the benefits of stronger query-passage interaction
https://arxiv.org/list/cs.CL/new
LG)
Half a million cuneiform clay tablets survive in museums worldwide, yet modern users can neither read nor write in the world's oldest writing system, leaving a 4,000-year cultural barrier that existing NLP tools have only partially addressed
https://arxiv.org/list/astro-ph.IM/new
In particular, the maximal light deflection of a given Solar System body can be easily estimated for a given observer
https://arxiv.org/abs/2608.12700
A kernel can pass that test and still be silently wrong
https://arxiv.org/abs/2204.04218
In many situations, computed tomography (CT) or magnetic resonance imaging (MRI) techniques capture several scans (modes) during a single investigation, which can jointly be used (in a multimodal fashion) to further boost the quality of super-resolution results
https://arxiv.org/html/2608.02851v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2508.20101v1
In an empirical application, we demonstrate how the model can be applied to financial stock networks
https://arxiv.org/html/2608.02612v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2607.26188v1
org perpetual non-exclusive license
arXiv:2607
https://arxiv.org/abs/2608.03883
All submitted systems follow a staged retrieval design in which BM25 retrieves candidates at scale and semantic or LLM rerankers refine the final rankings
https://arxiv.org/abs/2104.08663
Benchmark for Zero-shot Evaluation of Information Retrieval Models, by Nandan Thakur and 4 other authors
View PDF HTML (experimental)
Abstract:Existing neural information retrieval (IR) models have often been studied in homogeneous and narrow settings, which has considerably limited insights into their out-of
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
Our results show that skill representation itself matters, and that simply preserving the structure already present in skill files can substantially improve retrieval
https://arxiv.org/list/math.ST/2024-03
00186 [pdf, html, other]
Title: Warped Kernel Estimator for I
https://arxiv.org/html/2407.16741v3
In particular, AI agents, systems that can perceive and act upon the external environment, have recently received ever-increasing research focus
https://arxiv.org/list/cs.DC/new
SE)
Automating GPU kernel optimization remains difficult in practice: generated variants can violate correctness constraints, runtime measurements are noisy, and search often stalls early
https://arxiv.org/list/cs.DB/new
We propose an architectural pattern for such systems, a trusted kernel with a generative shell, resting on one invariant: a component that can fabricate may influence which question the system answers, never which value it returns
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/list/cs.OS/new
Linux provides several ways to observe and respond: Pressure Stall Information (PSI) can detect memory-related task stalls, zram can provide compressed in-memory swap space, and cgroup v2 can request memory reclamation within a selected control group
https://arxiv.org/abs/2512.09590
Using an extension of the exponential-affine transformation formula for those processes, we establish in the long run the existence of limiting distributions, which (unlike in the case of classical affine diffusion processes) may depend on the initial state of the process, unless the Volterra kernel coincides with the
https://arxiv.org/abs/2608.01651
Bole transforms the linear-attention recurrence into a tree-structured closed form and realizes it with a resource-efficient GPU kernel, verifying all proposal nodes in parallel and accelerating linear-attention tree verification by 3