Web This site Trusted
26 result(s) for “okapi bm25 site hotchips pp site github com site met appear net site can kernel org site:arxiv.org” of 56 matched · page 2 · 740 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)
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/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/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/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
Applications may therefore slow down before the kernel kills a process
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
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/html/2608.02817v1
expressed here are those of the authors and not necessarily those of the Federal Reserve Bank of Atlanta or the Federal Reserve System. The authors are grateful for the invaluable feedback they received on an earlier draft from Jón
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/abs/2504.02246
C* extends C with verification capabilities, powered by a symbolic execution engine and an LCF-style proof kernel
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/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/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
https://arxiv.org/html/2508.02739v1
Our pre-trained model is publicly available at https://github
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/cs.NA/new
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Numerical Analysis
New submissions
Cross-lists
Replacements
See recent articles
Showing new listings for Monday, 17 August 2026
Total
https://arxiv.org/list/astro-ph.SR/new
Skip to main content Search Submit Donate Log in
Search arXiv
Press Enter to search · Advanced search
Solar and Stellar Astrophysics
New submissions
Cross-lists
Replacements
See recent articles
Showing new listings for Friday, 7 August
https://arxiv.org/list/cs.CL/2020-05
Thomas McCoy
Comments: To appear in Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics (ACL-2020)
Subjects: Computation and Language (cs
https://arxiv.org/html/2407.20441v1
I Introduction
Training reinforcement learning (RL) algorithms is well-known to be a critically time consuming task that can require several data samples to achieve a desired level of accuracy
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/list/quant-ph/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
Quantum Physics
New submissions
Cross-lists
Replacements
See recent articles
https://arxiv.org/html/2407.18010v2
We prove the game respects a dynamic programming principle and that the Markov perfect equilibrium can be computed as a limit point of a sequence of Bellman operations
https://arxiv.org/html/2407.05763v1
However, centralized observers for plants modeled by nonlinear systems satisfying Ho¨¨o\ddot{\mathrm{o}}over¨ start_ARG roman_o end_ARGlder condition can be found in the recent literature (see, e