PulseAugur
EN
LIVE 12:02:21

New Monte Carlo algorithms reduce variance in stochastic gradient methods

Researchers have developed new variance reduction techniques for stochastic gradient generalized non-reversible Langevin Monte Carlo algorithms. These methods aim to improve the accuracy of estimators for generalized non-reversible Langevin dynamics, particularly in the vanishing-stepsize regime. Numerical experiments on Bayesian regression tasks demonstrate that the proposed non-reversible schemes consistently reduce root mean squared error compared to their reversible counterparts. AI

IMPACT These algorithmic improvements could enhance the efficiency and accuracy of sampling methods used in complex machine learning models.

RANK_REASON The cluster contains an academic paper detailing new algorithms and theoretical findings in machine learning.

Read on arXiv stat.ML →

AI-generated summary · Google Gemini · from 2 sources. How we write summaries →

New Monte Carlo algorithms reduce variance in stochastic gradient methods

COVERAGE [2]

  1. arXiv stat.ML TIER_1 English(EN) · Bingye Ni, Xiaoyu Wang, Yingli Wang, Lingjiong Zhu ·

    Variance Reduction for Stochastic Gradient Generalized Non-reversible Langevin Monte Carlo Algorithms

    arXiv:2606.28808v1 Announce Type: new Abstract: We study the leading-order fluctuation of stochastic gradient Euler-Maruyama estimators for generalized non-reversible Langevin dynamics. Under structural assumptions tailored to the small-stepsize central limit theorem and under an…

  2. arXiv stat.ML TIER_1 English(EN) · Lingjiong Zhu ·

    Variance Reduction for Stochastic Gradient Generalized Non-reversible Langevin Monte Carlo Algorithms

    We study the leading-order fluctuation of stochastic gradient Euler-Maruyama estimators for generalized non-reversible Langevin dynamics. Under structural assumptions tailored to the small-stepsize central limit theorem and under an unbiased stochastic gradient oracle, we prove t…