Skip to content

Category

data science

2,791 papers

#machine learning Preprint Open access Sep 2026

Vocabulary-size-independent Convergence of Discrete Diffusion Models: adjoint equations induce the right space

Discrete diffusion has become a leading framework for generative modeling in various applications including language, vision, and biology. Existing convergence theory, however, exhibits fundamental limitations. KL-based analyses diverge under singular priors such as the masked distribution, while bounds in total variat...

Kelvin Kan, Xingjian Li, Benjamin J. Zhang et al. · 0 citations

Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations

This work proposes a refined analysis of the non-consecutive gradient variation, a fundamental quantity in gradient variation with bandit feedback, and improves the dimension dependence for both convex and strongly convex functions compared with the best known results.

Hang Yu, Yu-Hu Yan, Peng Zhao · 7 citations
#machine learning Preprint Open access Sep 2026

Low-Rank Plus Sparse Matrix Transfer Learning under Growing Representations and Ambient Dimensions

Learning systems often expand their ambient features or latent representations over time, embedding earlier representations into larger spaces with limited new latent structure. We study transfer learning for structured matrix estimation under simultaneous growth of the ambient dimension and the intrinsic representatio...

Jinhang Chai, Xuyuan Liu, Elynn Chen et al. · 0 citations
#machine learning Open access Aug 2025

Comparison of D-Wave Quantum Annealing and Gibbs Monte Carlo for Sampling from a Probability Distribution of a Restricted Boltzmann Machine

A local-valley (LV)-centered approach to assessing the quality of sampling from Restricted Boltzmann Machines (RBMs) was applied to the latest generation of the D-Wave quantum annealer, revealing some potential for improvement, e.g., using a combined classical–quantum approach.

Abdelmoula El Yazizi, S. U. Khan, Y. Koshka · 1 citation
#machine learning Preprint Open access Sep 2026

Learning Latent Graph Geometry via Fixed-Point Schr\"odinger-Type Activation: A Theoretical Study

We study neural architectures in which each hidden layer is defined by the stationary state of a dissipative Schr\"odinger-type dynamics on a learned latent graph. On stable branches, the local stationary problem defines a differentiable implicit graph layer. To learn the graph itself, we optimize over the stratified m...

Dmitry Pasechnyuk-Vilensky, Martin Tak\'a\v{c} · 0 citations
#machine learning Preprint Open access Sep 2026

A Review of the Long Horizon Forecasting Problem in Time Series Analysis

The long horizon forecasting (LHF) problem has come up in the time series literature for over the last 35 years or so. This review covers aspects of LHF in this period and how deep learning has incorporated variants of trend, seasonality, fourier and wavelet transforms, misspecification bias reduction and bandpass filt...

Hans Krupakar, Kandappan V A · 0 citations
#machine learning Preprint Apr 2025

The Dynamics of Generalization in Deep Learning

This work derives a differential equation that governs the evolution of the generalization gap when a model is trained by gradient descent-based methods and shows that the generalization gap is given by a quadratic form that consists of an ``effective Gram matrix'' that depends upon the training trajectory and a certai...

Ru-Bing Yang, Pratik Chaudhari · 3 citations
#machine learning Preprint Open access Sep 2026

Projected Neural Differential Equations for Learning Constrained Dynamics

Neural differential equations offer a powerful approach for learning dynamical systems from data. However, they do not inherently respect known constraints, such as conservation laws, that should be obeyed by the learned dynamics. It is well known that enforcing constraints in data-driven models can enhance their gener...

Alistair White, Anna B\"uttner, Maximilian Gelbrecht et al. · 0 citations
#machine learning Conference Nov 2023

High-dimensional Linear Bandits with Knapsacks

An online variant of the hard thresholding algorithm that performs the sparse estimation in an online manner is developed and embedded in a primal-dual scheme: every knapsack constraint is paired with a dual variable, which is updated by an online learning rule to keep the cumulative resource consumption within budget.

Wan-Teng Ma, Dong Xia, Jia-Shuo Jiang · 3 citations
#machine learning Open access Oct 2023

Latent class analysis by regularized spectral clustering

Two new algorithms for estimating the parameters of a latent class model for ordered categorical data with polytomous responses are introduced based on a newly defined regularized Laplacian matrix derived from the response matrix.

Huan Qing · 2 citations
#machine learning Preprint Jul 2023

Understanding Uncertainty Sampling via Equivalent Loss

The equivalent loss is introduced, whose gradient is the original loss gradient multiplied by the query probability, which derives a finite-sample excess-risk bound with a fixed learning rate and an explicit constant controlling the tradeoff between initial error and query-weighted gradient variance.

Shang Liu, Xiaocheng Li · 14 citations · ⚡1

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.