Web This site Trusted
30 result(s) for “if com site www log gov site can kernel org site:arxiv.org” of 82 matched · 434 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)
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
from the top result below
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/list/cond-mat/new
The mixed anomaly between these is accommodated by the not-on-site action of the symmetries
https://arxiv.org/html/2608.02612v1
org perpetual non-exclusive license
arXiv:2608
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/2607.27099v1
org perpetual non-exclusive license
arXiv:2607
https://arxiv.org/html/2511.06451v1
Spectral safety and discrete Green kernel
https://arxiv.org/list/quant-ph/new
While the mathematical structure of matrix product states (MPS) is well understood through the MPS fundamental theorem, an analogous understanding for mixed-state tensor networks remains largely absent: if two purification tensors generate the same density matrix, how are they related
https://arxiv.org/html/2508.02739v1
2 Preliminary
3 Methodology
K-line Tokenization
Hierarchical Autoregressive Modeling
Model Pre-training
Dataset
Model Training
Inference
4 Experiments
Experimental Setup
Main Results
Prediction Tasks
Generative Tasks
Investment
https://arxiv.org/list/math/new
up to 2000 entries per page: fewer | more | all
New submissions (showing 219 of 219 entries)
[1] arXiv:2608
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/html/2508.20101v1
In an empirical application, we demonstrate how the model can be applied to financial stock networks
https://arxiv.org/html/2608.02817v1
3 Log-linear pricing and closed-form pass-through
A
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/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/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/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/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/list/astro-ph.IM/new
EPIC can achieve $\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/list/cs.CR/new
fewer | more | all
New submissions (showing 32 of 32 entries)
[1] arXiv:2608
https://arxiv.org/list/cs.OS/new
| all
New submissions (showing 2 of 2 entries)
[1] arXiv:2608
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/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/cs.AR/new
more | all
New submissions (showing 4 of 4 entries)
[1] arXiv:2608
https://arxiv.org/list/cs.LG/2022-12
2001-2004
Showing up to 50 entries per page: fewer | more | all
[1] arXiv:2212
https://arxiv.org/list/cs.NA/new
all
New submissions (showing 18 of 18 entries)
[1] arXiv:2608
https://arxiv.org/list/econ/new
up to 2000 entries per page: fewer | more | all
New submissions (showing 21 of 21 entries)
[1] arXiv:2608
https://arxiv.org/html/2608.02851v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/list/cs.SE/new
Yet it remains unclear when further evolution helps, how successful and failed trajectories shape revision, and whether extra test-time computation can recover the same gains