Skip to content

Category

data science

2,952 papers

#machine learning Preprint Sep 2026

Why Learning Rediscovers the Closed-Form Diagonal Regularizer

We identify a diagonal saturation principle in modal inverse problems: when truncation noise is isotropic, the Bayes-optimal Tikhonov shape is a closed-form power law Gamma_k proportional to lambda_k^|s| set by the prior alone, independent of the domain. Berry's random-wave conjecture decorrelates the truncation noise...

Jeahn Han, Pyojin Kim · 0 citations
#machine learning Preprint Sep 2026

Distillation of Synthetic Data for Time Series Foundation Models

Time series foundation models (TSFMs) are increasingly pre-trained on synthetically generated time series trajectories, where the data generating process is known. Current pre-training recipes are based on loss objectives which compare TSFM outputs to realized future values of each trajectory. We instead propose loss o...

N. Biswas, Noureddine El Karoui · 0 citations
#machine learning Preprint Sep 2026

Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps

The lower bound holds against any randomized algorithm that succeeds with constant probability and extends to settings with ``sparse''noise, ruling out the possibility of improving oracle complexity as a function of $\varepsilon$ by measuring variance in a non-matching $\ell_p$ norm.

Jelena Diakonikolas, Cristóbal Guzmán, David Martínez-Rubio · 0 citations
#machine learning Preprint Sep 2026

Gaussian Approximation for Multivariate Martingale Sums from Uniformly Ergodic Markov Chains

We develop Gaussian approximation bounds in higher-order Wasserstein distance $W_p$, $p\geq2$, for sums of multivariate martingale differences generated by a uniformly ergodic Markov chain. Under an $L^{(2+\eta)p}$-moment condition with $\eta>0$, we establish the explicit bound $$ O\left( p^3 \|A\|_4^2 + pd^{1/4}\|A\|_...

Yi-Xuan Zhang, Qiao-Min Xie · 2 citations
#machine learning Preprint Sep 2026

Mode Coverage in Normalizing Flow Boltzmann Generators via Log-Ratio Variation

The log-ratio variation $\X_\omega$, the mean absolute pairwise difference of the target-to-pushforward log-density ratio under a weighting measure under a weighting measure, is introduced and used to define KLXX, a new loss function and the Fisher--Rao gradient flow of KLXX is derived, where both variations contribute...

Qi-Han Feng, Rong-Jie Lai, Di Qi et al. · 0 citations
#machine learning Preprint Open access Sep 2026

MiNCE: Nonparametric, Strongly Consistent Confidence Envelopes for Band-Limited Functions and their Smoothed Spectra

Minimum-norm confidence envelope strategies offer a nonparametric approach to constructing nonasymptotic, simultaneous confidence regions for band-limited functions, exploiting the theory of Reproducing Kernel Hilbert Spaces (RKHS). While the finite-sample coverage guarantees of these envelopes have been established, t...

Bal\'azs Csan\'ad Cs\'aji, B\'alint Horv\'ath · 0 citations
#machine learning Preprint Open access Sep 2026

Tensor Network Moral Graph Recovery of Discrete Probability Distributions

We present a method for recovering the moral graph of a causal DAG from a probability distribution over discrete variables, using fully connected tensor networks (FCTNs) with nuclear-norm-regularized bond corrections. Each bond matrix is parameterized as a baseline all-ones matrix plus a low-rank correction $C_{ij} = U...

\'A. Troyano Olivas, Chi-Hang Fred Fung, Hans H. Brunner et al. · 0 citations
#machine learning Preprint Sep 2026

CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs

CAST (Canonical Approximate Schur Tree) is introduced, which replaces this clique with a weighted random spanning tree sampled directly from it, and it is proved that its leverage-score marginals minimize the largest normalized reweighted-edge contribution among unbiased inverse-marginal one-tree estimators.

Meher Chaitanya, Cameron Musco, A. Gionis · 1 citation
#machine learning Preprint Open access Sep 2026

A Subsampled Davis-Kahan Bound for Large-Scale Eigenspace Estimation

The Davis-Kahan theorem is a fundamental tool in spectral analysis, providing quantitative control over the distance between the eigenspaces of a symmetric matrix and its perturbation. However, when the matrix dimension is large, computing leading eigenvectors is computationally expensive, limiting the practical use of...

Huan Qing · 0 citations
#machine learning Preprint Sep 2026

A positive resolution of the gap-entropy conjecture

We prove the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in $[0,1]$, and a unique optimal arm. For each suboptimal arm $i$, let $\Delta_i=\mu_*-\mu_i$ be its gap from the optimal mean, and write $H=\sum_{i\ne *}\Delta_i^{-2}$. Let $p_r$ be the...

P. M. Aronow, Nathan Kallus, Patrick Lopatto · 1 citation
#machine learning Preprint Sep 2026

An Exponential Deterministic--Randomized Gap in ERM-Oracle Complexity for Thresholds on an Unknown Order

Attias, Hanneke and Ramaswami (NeurIPS 2025) asked whether randomization provably reduces the oracle calls needed for online learning when the class is accessible only through an oracle. We study the instance they singled out: transductive online learning of thresholds on an unknown total order of T instances, with a c...

Xuan Li · 0 citations

From tech blogs

See all →

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.