Skip to content

Category

data science

3,686 papers

Quantum Maximum Likelihood Prediction via Hilbert Space Embeddings

This approach provides a unified framework to handle MLP within both classical and quantum LLMs and shows that the Pythagorean inequality continues to hold in the infinite-dimensional setting whenever the convex information-projection problem attains a finite minimum.

S. Sreekumar, Nir Weinberger · 0 citations
#machine learning Preprint Oct 2025

Neural Variational Cut Posteriors without Upstream Data

This work proposes a modular and provably accurate cut-Bayes approach requiring no access to upstream data or model, and establishes, to the knowledge, first results on uniform Kullback-Leibler approximation rates of conditional distributions by common flow classes, yielding widely applicable fixed-data error rates for...

Jia-Fang Song, Sandipan Pramanik, Abhirup Datta · 2 citations · ⚡1

DLM-One: Diffusion Language Models for One-Step Sequence Generation

DLM-One eliminates iterative refinement by aligning the scores of a student model's outputs with the score function of a pretrained teacher DLM in the forward-diffused noisy space, which positions one-step score distillation as a viable path for the efficient deployment of continuous diffusion models operating in conti...

Tianqi Chen, Shujian Zhang, Mi Zhou · 16 citations
#machine learning Preprint Open access Sep 2026

Clustering Three-Way Data with Outliers

Matrix-variate distributions are a relatively recent addition to the model-based clustering literature, thereby making it possible to analyze data in matrix form with complex structure such as images and time series. Due to its recent appearance, there is limited literature on matrix-variate data, with even less on dea...

Katharine M. Clark, Paul D. McNicholas · 0 citations
#machine learning Preprint Open access Sep 2026

Generalized Regret Analysis of Thompson Sampling using Fractional Posteriors

Thompson sampling (TS) is one of the most popular and earliest algorithms to solve stochastic multi-armed bandit problems. We consider a variant of TS, named $\alpha$-TS, where we use a fractional or $\alpha$-posterior ($\alpha\in(0,1)$) instead of the standard posterior distribution. To compute an $\alpha$-posterior,...

Prateek Jaiswal, Debdeep Pati, Anirban Bhattacharya et al. · 0 citations

Robust Streaming PCA

This work analyzes the convergence of the noisy power method and Oja's algorithm, both studied for the stationary data generating model, and argues that the noisy power method is rate-optimal in this setting.

D. Bienstock, Minchan Jeong, A. Shukla et al. · 8 citations · ⚡1
#machine learning Preprint Jan 2026

Cantelli Constrained Policy Optimization

Canon, a risk-averse method designed to optimize Value-at-Risk (VaR) constrained reinforcement learning (RL) problems, is introduced and Cantelli's inequality is employed to obtain a tractable, conservative and smooth bound on the VaR constraint based on the first two moments of the cost return.

Rohan Tangri, Jan-Peter Calliess · 0 citations

A Multivariate Bernoulli-Based Sampling Method for Multi-Label Data with Application to Meta-Research

A novel sampling algorithm is presented that uses observed label frequencies to estimate multivariate Bernoulli distribution parameters and calculates weights for each label combination, to preserve category frequency order, reduce frequency differences between most and least common categories, and account for category...

Simon Chung, Colby J. Vorland, D. L. Maney et al. · 2 citations
#machine learning Preprint Nov 2025

Gradient Prediction with Control Variates in the Cheap-Forward Regime

On a 124M-parameter language model and selected short training windows, the method can lower simulated ledger cost relative to the tested baselines when fleet work is sufficiently cheap, and can lower simulated ledger cost relative to the tested baselines when fleet work is sufficiently cheap.

K. Ciosek, Nicolò Felicioni, Juan Elenter et al. · 2 citations
#machine learning Preprint Sep 2026

Improved Gradient Descent Lower Bounds Beyond Nesterov

The anytime lower bound shows that the rate of non-anytime silver schedules (Altschuler and Parrilo, 2025; Grimmer et al., 2025) is unattainable in the anytime setting, and establishes a strict separation between the two settings.

Yu-Tian Ye, Kai-Zhao Liu · 6 citations
#machine learning Preprint Sep 2026

Full-Model Optimality for Tunable Linear Generative Priors in Compressed Sensing

It is proved that in noiseless Gaussian compressed sensing, the full-dimensional linear prior attains the minimum expected reconstruction error over the entire family of linear priors, indicating that the experimental benefits of tunability in compressed sensing with neural network priors arises due to nonlinearities i...

Zhaowu Li, Paul Hand · 0 citations
#machine learning Preprint Sep 2026

Momentum in large-batch training: Polyak enlarges the critical batch size, Nesterov improves data efficiency

A three-regime batch-size phase diagram that reveals how the role of momentum changes with batch size is revealed, with Polyak enlarging the critical batch size, the largest batch size preserving the best small-batch data-scaling exponent, thereby enabling greater parallelism without sacrificing data efficiency.

Jia-Nan Wang, Zi-Xun Huang, Kai-Rui Li et al. · 0 citations

From tech blogs

See all →
GPT-Lab Nov 3, 2026

Sovereignty Is the Option to Leave

Is your company’s AI sovereign? A practical guide for CIOs on AI vendor lock-in, EU Data Act switching, cloud sovereignty, and testing your exit plan before you need it. The post Sovereignty Is the Option to Leave appeared first on GPT-Lab.

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