Web This site Trusted
30 result(s) for “okapi bm25 site hotchips pp site can kernel org site can kernel org site www most site:arxiv.org” of 65 matched · 774 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
(3) Search latency bites only at very small reader: on a Spark GB10 edge node, memory-search adds a moderate and fixed 8787/77/4848 ms (BM25-RAG/Memobase/MemSearch) that composes a small part of TTFT for most reader-backend combinations
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
However, various strands of evidence indicate that an LLM’s externalized linguistic outputs and mechanistically-extracted linguistic features can be an unreliable lens for understanding internal model computation
https://arxiv.org/html/2607.27099v1
org perpetual non-exclusive license
arXiv:2607
https://arxiv.org/list/cs.AI/new
We demonstrate that it can self-assemble functional circuits from scratch and rapidly re-route logic around permanent, previously unseen hardware faults
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
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/list/math.ST/2024-03
00186 [pdf, html, other]
Title: Warped Kernel Estimator for I
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.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/2607.22511v2
A statement can be free of sorry and still be mathematically uninformative: a definition may reduce to True; or an unproven step may be introduced as an axiom that the kernel accepts
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.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.OS/new
Applications may therefore slow down before the kernel kills a process
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
We present Bole, a kernel--runtime co-design that enables efficient tree speculation for hybrid-attention LLMs
https://arxiv.org/abs/2504.02246
C* extends C with verification capabilities, powered by a symbolic execution engine and an LCF-style proof kernel
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/list/eess/new
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/abs/2609.14858
Our key insight is that accumulated discovery history can serve as a replay simulator over the realized search space
https://arxiv.org/abs/1202.3424
, dust particles), but may also be 1-d or 2-d periodic arrays of "target unit cells", which can be used to study absorption, scattering, and electric fields around arrays of nanostructures
https://arxiv.org/list/cs.AR/new
Our analysis shows that, despite its limited write performance, HBF can significantly improve the batch size, throughput, and flexibility of LLM-serving systems while reducing the minimum GPU requirements, but realizing these benefits critically depends on sustaining HBM-comparable read bandwidth and requires
https://arxiv.org/list/cs.LG/2022-12
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
Machine Learning
Authors and titles for December 2022
Total of 2004 entries : 1
https://arxiv.org/list/cs.LG/2024-12
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Machine Learning
Authors and titles for December 2024
Total of 3298 entries : 1-50 51-100 101-150 151-200 ... 3251-3298
Showing up
https://arxiv.org/list/econ/new
The paper develops a mechanism-design model showing that the same delegated intermediation structure can generate both Stiglitz-Weiss underinvestment and De Meza-Webb overinvestment distortions
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/html/2609.03371v1
Operators can replace or upgrade their instruments and distribute longitude coverage across a network
https://arxiv.org/list/math.ST/new
If \(T_\star\) is the selected physical trajectory length and \(a_\star=\sqrt m\,T_\star\), a terminal-depth transfer argument yields restricted conductance and warm-start mixing without lazifying either kernel