Skip to content

Category

data science

3,686 papers

#machine learning Preprint Sep 2026

Geometric Moment Contraction for Stochastic Nesterov Acceleration

We study geometric moment contraction (GMC) of the constant-parameter stochastic Nesterov recursion \[ Y_k=\Theta_k+\beta(\Theta_k-\Theta_{k-1}),\qquad \Theta_{k+1}=Y_k-\gamma G(Y_k,X_{k+1}). \] Under mean strong monotonicity and stochastic $L^p$ Lipschitz continuity, an explicit Perron comparison proves synchronous $L...

Wei-Biao Wu · 0 citations
#machine learning Preprint Sep 2026

A Flatness-Generalization Relation in the Teacher-Student Tree-Committee Machine

The flatness of the loss landscape at a minimizer is a widely used heuristic for reasoning about neural-network generalization, yet evidence for this relation is mostly empirical and controversial, and it is found that the answer strongly depends on the learning task and on the ratio of the number of parameters to the...

B. Annesi, Davide Straziota, E. M. Malatesta · 0 citations
#machine learning Preprint Sep 2026

Conformal Prediction under Exponential-Tilt Joint Shift

This work uses Exponential Tilt Reweighting Alignment (ExTRA), introduced for classification by Maity et al. (2023), to estimate structured distribution shifts and compares using its estimated weights in conformal calibration with additionally tilting the source predictive distribution.

Seung-Jin Choi · 1 citation
#machine learning Preprint Sep 2026

TR-SSQP: A Trust-Region Method for Constrained Stochastic Optimization under Heavy-Tailed Noise

This work proposes a novel trust-region method within the stochastic sequential quadratic programming framework, termed TR-SSQP, which employs a normal-tangential decomposition in the step computation to balance optimality and feasibility and establishes the first asymptotic convergence result for constrained stochasti...

Hao-Xuan Wang, Yu-Chen Fang, Sen Na · 0 citations
#machine learning Preprint Sep 2026

Parameter Estimation for Unnormalized Discrete Models via Empirically Localized Deformed Bregman Divergence

The technique of empirical localization makes it possible to drastically reduce computational cost of the calculation of the normalization constant, and appropriate choice of the deformation for the Bregman divergence can invest the proposed estimator with various kinds of favorable statistical properties, such as effi...

Takashi Takenouchi · 0 citations
#machine learning Preprint Sep 2026

MARCEDES: Score-based causal discovery under non-Gaussianity with continuous optimization

A score-based DAG learning method, named MARCEDES, formulated as an unconstrained score minimization problem, which can be efficiently solved using gradient-based optimization techniques, thereby circumventing the challenges associated with constrained optimization.

Anamitra Chaudhuri, A. Bhattacharya, Yang Ni · 0 citations
#machine learning Preprint Sep 2026

Learning to Replace MCMC in Split-Gibbs Diffusion Posterior Sampling via Deep Unfolding

A learning-based framework is proposed to replace this MCMC step by reformulating both Gibbs updates as Gaussian denoising problems and implementing them through ODE diffusion, resulting in an alternative to MCMC-based split Gibbs at lower likelihood-update cost.

Yi Zhang, Rui Guo, Meng-Chu Xu et al. · 0 citations
#machine learning Preprint Sep 2026

Bayesian Uncertainty Quantification for fMRI Functional Connectivity via Simulation-Based Inference

Together these findings provide concrete, scanner-specific guidance for protocol optimization, with direct implications for reducing acquisition costs and improving the reliability of connectivity-based clinical biomarkers, and provide code enabling researchers to derive principled uncertainty bounds from their own dat...

Simon Carter, Ze-Ming Kuang, L. Mujica-Parodi et al. · 0 citations
#machine learning Preprint Sep 2026

An End-to-End Pipeline for Causal ML with Continuous Treatments: An Application to Financial Decision Making

An end-to-end causal machine learning pipeline designed for real-world applications with continuous treatments that offers a more computationally efficient approach and produces less biased estimates compared to standard methods for problems with continuous treatment and high-dimensional data is presented.

Javier Moral, Clara Higuera-Cabañes, Álvaro Ibrain · 2 citations
#machine learning Preprint Sep 2026

Low-Rank Friction for Memory-Efficient Transformer Pretraining

iKFAD is a recently proposed optimiser that replaces adaptive learning rates with adaptive friction in the momentum dynamics, yet performs as well as Adam. Its limitation is that the full friction tensor $\xi\in\mathbb{R}^{m\times n}$ carries the same $\mathcal{O}(mn)$ memory overhead per layer as Adam's second-moment...

Rajit Rajpal, B. Leimkuhler · 0 citations
#machine learning Preprint Sep 2026

Adaptive Random Matrices in Gaussian Bandits: Spectral Universality and Selection-Induced Outliers

Adaptive arm selection changes the distribution of the observations collected by a bandit algorithm, but it need not change their limiting empirical spectrum. We study Gaussian bandit designs in which the dimension and the number of observations grow proportionally. A quantitative coupling theorem compares the design g...

Sudarshan Manikantan, Abhishek Bhattacharjee · 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.