Skip to content

Category

data science

3,686 papers

#machine learning Preprint Sep 2026

Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs

It is shown that a simple Follow-the-Perturbed-Leader algorithm with Gaussian perturbation for each observed context achieves the optimal $\widetilde O(\sqrt{T\log N})$ expected regret for a class of $N$ experts, while requiring one optimization-oracle call per round and no explicit enumeration of the class.

G. Buzaglo, Elad Hazan · 4 citations · ⚡1
#machine learning Preprint Sep 2026

Benign Overfitting for General Norms and Distributions

This paper develops a method to analyze benign overfitting in linear regression for general norms and general (sub-Gaussian) distributions and proves that minimum-p-norm interpolation with p>1 can benignly overfit even for non-Gaussian distributions, under suitable conditions.

Daniel Barzilai, Ohad Shamir · 0 citations
#machine learning Preprint Sep 2026

Quantifying Behavioral Tails in Black-Box Language Models

RareTrap provides model developers a principled approach for evaluating language models under a common distribution, and prioritizing alignment effort to improve safety and mitigate risks.

Elsayed Eshra, Ali Al-Lawati, Dongwon Lee et al. · 0 citations
#machine learning Preprint Sep 2026

Correct then Forecast: Observer State-Space Models for Time Series Forecasting

Observational State-Space Models are introduced, a class of recurrent models that interprets the observed input time series as measurements of an underlying autonomous dynamical system and supports a simple principle for recurrent forecasting: observations should correct the estimated latent state, rather than control...

Alexis-Raja Brachet, Guillaume Clavier-Frémond, Abdelhakim Ziani et al. · 0 citations
#machine learning Preprint Sep 2026

SLP-ProbHard: Probabilistic Hard-Constrained Learning via Structural Latent Parameterization

SLP-ProbHard is introduced, a cross-family, representation-centered framework for probabilistic hard-constrained learning when explicit structural parameterizations are available, and how feasible coordinates and maps affect stochastic dimension, dependence, calibration, expressiveness, and computation is studied.

W. Bekele, M. D'Oria · 0 citations
#machine learning Preprint Sep 2026

Minimax-Optimality of Posterior Sampling for Reinforcement Learning

Posterior sampling for reinforcement learning (PSRL) is one of the simplest and most effective exploration methods, but a basic question has remained open: does unmodified PSRL achieve minimax regret without structural assumptions on the prior? We answer yes. Exact vanilla PSRL is minimax optimal in leading-order Bayes...

T. Goo, Kihyuk Hong · 0 citations
#machine learning Preprint Sep 2026

Simulation-Free Learning of GP-SDEs from Irregular Observations

This work analytically marginalize the sparse GP posterior to derive a tractable drift-matching objective that accounts for both the posterior mean and uncertainty of the unknown drift, and introduces an irregular-time-aware variational state posterior that incorporates the actual observation times during both encoding...

Zhi-Di Lin, Yu-Hao Liu, Ying Li et al. · 0 citations
#machine learning Preprint Sep 2026

Low-Rank Single-Index Bandits with Unknown Links: From Matrices to Tensors

Low-rank matrix and tensor bandits exploit structured interactions but typically assume a known reward link. Recent single-index bandit methods accommodate unknown links without directly exploiting matrix or tensor rank. We address this gap by studying stochastic matrix and tensor bandits with an unknown shared Lipschi...

Zhong-Xu Liu, Yue Kang, T. C. M. Lee · 0 citations
#machine learning Preprint Sep 2026

Generative Priors Conditioned on Natural Language for Bayesian Inversion in PDEs

Two parallel approaches to inference and uncertainty quantification over QoI are developed, one uses conditional diffusion and the other conditional autoencoders, and are compared against classical Bayesian methodology, unconditional generative models and deterministic supervised methods.

Peng-Yu Zhang, Mark Girolami, Arnaud Vadeboncoeur · 0 citations
#machine learning Preprint Sep 2026

Distributionally Robust Average-Reward Reinforcement Learning: Finite-Sample Guarantees under Weak Communication

This work establishes explicit radius conditions under which the robust average-reward Bellman equation admits a constant-gain solution, while for total variation and Wasserstein balls, any positive radius suffices without requiring the nominal MDP to be weakly communicating.

Chen-Yu Lu, Zi-Jun Chen, Nian Si · 0 citations
#machine learning Preprint Sep 2026

Recovery-Directed Symbolic Distillation of Neural Likelihoods

This work introduces a symbolic distillation pipeline that converts trained neural likelihoods into explicit, interpretable expressions optimized for efficient parameter estimation, and uses a recovery-directed objective to guide symbolic regression toward expressions that preserve parameter-recovery accuracy.

Kiante Fernandez, Xin-Wei Li · 0 citations

How Reusable Are Benchmarks with Richer Feedback?

We study whether benchmarks reliably guide model selection as developers adapt to evaluation feedback across multiple criteria. We find that the worst-case test-set size needed to estimate the best score among $k$ adaptively chosen models, under any convex combination of the criteria, grows exponentially with the numbe...

Youssef Allouah, John C. Duchi · 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.