Skip to content

Category

data science

3,686 papers

#machine learning Preprint Oct 2026

Asymptotic Analysis of Empirical Risk Minimization on Entry-wise i.i.d. Heavy-Tailed Data

Many real-world datasets exhibit unusually large values far more frequently than predicted by Gaussian models. Heavy-tailed distributions capture this behavior, yet evaluating learning performance under them remains challenging because rare, large feature entries retain non-vanishing effects even in high dimensions. Ev...

Kaito Takanami, Takashi Takahashi, Yoshiyuki Kabashima · 0 citations
#machine learning Preprint Oct 2026

Explicit Asymptotic Bounds for Sequential Calibration Beyond $T^{2/3}$

Probability forecasts are calibrated when predicted probabilities match empirical outcome frequencies: among events assigned a probability $p$, we'd hope that the fraction of positive outcomes is close to $p$. We study the problem of sequential forecasting of binary outcomes. The classical $O(T^{2/3})$ bound on expecte...

Er-Xun Dai, Maxwell Fishelson · 0 citations
#machine learning Preprint Open access Oct 2026

Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions?

Learning Gaussian mixture models (GMMs) using the Expectation-Maximization (EM) algorithm and its gradient-based variants is a fundamental problem in machine learning. It is known that randomly initialized (gradient) EM fails to learn multi-component GMMs in the exact-parameterized setting, where the number of componen...

Yiran Zhang, Mo Zhou, Weihang Xu et al. · 0 citations
#machine learning Preprint Oct 2026

Two-Sample Testing for Random Graphs without Vertex Correspondence

Two populations of graphs often have to be compared without any correspondence between their vertices, for instance when networks come from different communities, or when a graph generative model is evaluated against held-out graphs. We study how many graphs such an unaligned two-sample test needs, and which graph stat...

Soham Dan · 0 citations
#artificial intelligence Preprint Oct 2026

Does Muon Need Fine-Grained Spectral Shaping?

Muon combines current and past gradients into matrix momentum. For $M=U\Sigma V^\top$, the idealized polar update $Q=UV^\top$ gives every singular direction the same weight. We refer to this as the flat profile. Several recent optimizers replace this flat profile with fine-grained spectral maps that give each direction...

Meher Chaitanya, Tian-Yi Zhou, A. Gionis · 0 citations
#machine learning Preprint Oct 2026

Bayesian Optimization on Function Spaces via Sparse RKHS Manifolds

Bayesian Optimization (BO) has become an established methodology for minimizing black-box functions of a vector input. Often, however, this parameter vector arises from the discretization of an inherently functional relationship. Several recent articles have considered the Functional Bayesian Optimization (FBO) setting...

Davide Sartor, Meghan E. Huber, Donghyun Kim et al. · 0 citations
#machine learning Preprint Open access Oct 2026

A perspective note on likelihood approximation and inference for complex simulation models using a chain of aggregated normalizing flows

We present a new perspective on the problem of likelihood approximation within the framework of simulation-based inference that promotes scalable and controllable simulation routines for large-scale data analysis, allows efficient parameter space exploration or smooth interpolation in high-dimensions and, thus, support...

Getachew K Befekadu · 0 citations
#artificial intelligence Preprint Oct 2026

DeepAJM: Deep Association Joint Model for Irregularly Sampled data

Joint Models simultaneously model longitudinal and survival outcomes, leveraging patterns in patients'longitudinal trajectory to improve the prediction of survival outcomes. The classical parametric joint models, however, rely on fixed parametric assumptions, making them susceptible to bias under model misspecification...

B. Halder, J. Thompson · 0 citations
#machine learning Preprint Oct 2026

HyperNSDE: Personalized Neural SDEs for Joint Static-Longitudinal Clinical Data Generation

HyperNSDE is proposed, a continuous-time generative model that conditions a latent Neural SDE on static patient representations through a hypernetwork, allowing baseline characteristics to shape trajectory evolution beyond the initial condition without requiring a trajectory encoder, while stochastic latent dynamics ca...

P. Chassat, A. Guilloux · 0 citations
#machine learning Preprint Oct 2026

Assumption-lean logistic regression with missing covariates

A stochastic approximation method that is based on $Z-estimation with a novel monotone operator is designed, and it is established that this algorithm is computationally efficient and achieves provable signal recovery at parametric rates under the hypothesis that covariates are missing completely at random.

Jyotishka Ray Choudhury, K. A. Verchand, R. Samworth et al. · 0 citations
#machine learning Preprint Open access Oct 2026

A Query Is Not a Commitment: Learning to Correct Expert Answers in Online Deferral

An inaccurate expert can still provide useful information after correction. We study online learning to defer in which the learner chooses an expert and fixes a correction function before purchasing its answer, then applies that function to the answer received. The difficulty is that observed losses reflect both expert...

Yannis Montreuil, Axel Carlier, Lai Xing Ng 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.