Skip to content

Category

data science

3,686 papers

#machine learning Open access May 2026

On Kernel Eigen-Alignments of KRR: Reconstruction and Generalization

The findings reveal that in kernel methods, as long as the kernel is of high rank, the near-zero reconstruction error can be trivially obtained, implying that the reconstruction error will have limited predictive power for generalization.

Yang Liu, Ernest Fokoué, Richard D. Lange et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Trustworthy Predictive Distributions for Tail Events with Semiparametric Diagnostic Transport Maps

Machine learning forecast systems are moving beyond point predictions to full predictive distributions for future outcomes y conditional on complex inputs x. However, these distributions are often locally miscalibrated, especially for high-stakes tail events where accurate uncertainty quantification is most needed to e...

Elizabeth Cucuzzella, Rafael Izbicki, Ann B. Lee · 0 citations
#machine learning Preprint Open access Sep 2026

Attack-Resistant Uniform Fairness for Linear and Smooth Contextual Bandits

Modern digital platforms use contextual bandits to allocate valuable exposure and opportunities among competing participants. Fair treatment is therefore an important concern, yet reward maximization alone does not ensure that preferential allocation reflects participants' merits. We develop algorithms for linear and s...

Qingwen Zhang, Wenjia Wang · 0 citations

Small Gradient Norm Regret for Online Convex Optimization

A new problem-dependent regret measure for online convex optimization with smooth losses that strictly refines the existing small loss regret, and that it can be arbitrarily sharper when the losses have vanishing curvature around the hindsight decision.

Wenzhi Gao, Chang He, Madeleine Udell · 0 citations

Accelerated stochastic first-order method for convex optimization under heavy-tailed noise

This paper establishes that an accelerated stochastic proximal subgradient method achieves a first-order oracle complexity for finding an approximate optimal solution in expectation that is universally optimal for smooth, weakly smooth, and nonsmooth convex optimization, as well as for stochastic convex optimization un...

Chuan He, Bo-Wen Li, Zhaosong Lu · 5 citations · ⚡1

Transfer Learning for Matrix Completion

The analysis reveals that with the source matrices close enough to the target matrix, out method outperforms the traditional method using the single target data and proves the minimax optimality.

Da-Li Liu, Hao-Lei Weng · 0 citations
#machine learning Open access May 2025

ALPCAHUS: Subspace Clustering for Heteroscedastic Data

This paper develops a heteroscedastic-based subspace clustering method that can estimate the sample-wise noise variances and use this information to improve the estimate of the subspace bases associated with the low-rank structure of the data.

Javier Salazar Cavazos, Jeffrey A. Fessler, Laura Balzano · 1 citation

Thompson Sampling for Infinite-Horizon Discounted Decision Processes

This paper develops a framework for learning in discounted infinite-horizon Markov decision processes (MDPs) with Borel state and action spaces, whose rewards and transitions depend on an unknown parameter, and introduces a canonical probability space that explicitly incorporates sampled parameters into the history of...

Daniel Adelman, Çağla Keçeli, Alba V. Olivares-Nadal · 1 citation
#machine learning Preprint Open access Sep 2026

Combinatorial Inference on the Optimal Assortment in Multinomial Logit Models

Assortment optimization has received active explorations in the past few decades due to its practical importance. Despite the extensive literature dealing with optimization algorithms and latent score estimation, uncertainty quantification for the optimal assortment still needs to be explored and is of great practical...

Shuting Shen, Xi Chen, Ethan X. Fang et al. · 0 citations
#artificial intelligence Preprint Open access Sep 2026

Active Inference as a Convex Markov Decision Process

Active Inference (AIF) frames adaptive behavior as the minimization of expected free energy (EFE), combining epistemic and pragmatic objectives within a single variational principle. We frame AIF as policy optimization and show that, for closed-loop control policies, EFE minimization can be formulated as a convex Marko...

Nikola Milosevic, Nicol\'as Hinrichs, Nico Scherf · 0 citations
#artificial intelligence Preprint Open access Sep 2026

Scaling Laws of SignSGD in Linear Regression: When Does It Outperform SGD?

We study scaling laws of signSGD under a power-law random features (PLRF) model that accounts for both feature and target decay. We analyze the population risk of a linear model trained with one-pass signSGD on Gaussian-sketched features. We express the risk as a function of model size, training steps, learning rate, a...

Jihwan Kim, Dogyoon Song, Chulhee Yun · 0 citations
#machine learning Preprint Open access Sep 2026

Vector-Valued Distributional Reinforcement Learning Policy Evaluation: A Hilbert Space Embedding Approach

We propose Kernel Embedding Distributional Reinforcement Learning (KE-DRL) an offline method to estimate kernel mean embeddings of conditional multivariate return distributions from observed offline trajectories with continuous state-action inputs and vector-valued rewards. KE-DRL approximates the conditional embedding...

Mehrdad Mohammadi, Qi Zheng, Ruoqing Zhu · 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.