Web This site Trusted
30 result(s) for “okapi bm25 site terms com pp site learn ca site teslaside com site can kernel org site:arxiv.org” of 64 matched · page 2 · 978 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/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.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/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/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/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/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/cs.OS/new
Applications may therefore slow down before the kernel kills a process
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/html/2609.03371v1
Operators can replace or upgrade their instruments and distribute longitude coverage across a network
https://arxiv.org/html/2607.29442v2
In an asymptotic framework inspired by Rosenbaum2018, we show that the rescaled price process converges to a Bachelier-type semimartingale plus a Gaussian moving average whose kernel is determined explicitly by the trawl function
https://arxiv.org/html/2608.03411v1
com
Abstract
Accurate Uncertainty Quantification (UQ) is critical for reliable deployment of Large Language Models (LLMs), yet traditional probability-based metrics often fail to capture the model’s true epistemic state
https://arxiv.org/html/2608.02612v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2511.06451v1
Spectral safety and discrete Green 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/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
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/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/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/html/2508.02739v1
We pre-train Kronos using an autoregressive objective on a massive, multi-market corpus of over 12 billion K-line records from 45 global exchanges, enabling it to learn nuanced temporal and cross-asset representations
https://arxiv.org/html/2608.02813v1
Existing approaches can be broadly classified into trajectory-based [6] and feedback-based methods [7]
https://arxiv.org/list/quant-ph/new
In this work, we initiate the study of a fundamental theorem for matrix product locally purifiable density operators (LPDOs) and focus on sequentially generated LPDOs (sLPDOs), a broad subclass admitting an interpretation in terms of successive applications of quantum channels on an initial state
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/cs.CR/new
We also show that coarse-to-fine label selection can create near-perfect measured correlation without learned dependence
https://arxiv.org/html/2608.03099v1
For each role, we trace the path from linguistic content to its embodied consumer and identify the observations or interventions that can test the claimed responsibility
https://arxiv.org/html/2407.00575v3
The global performance at NE can be improved by imposing linear constraints on the NE, also known as a generalized Nash equilibrium (GNE)
https://arxiv.org/html/2608.03655v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2410.19947v2
org perpetual non-exclusive license
arXiv:2410
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