arXiv Statistics ML
Self-Balancing Sequential Sampling: Fast Convergence with Controlled Predictability
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Jul 27
From Perturbation Correction to Geometry-Aware Sampling: Sharpness-Guided Equilibrium Sampling for Balanced Flat Minima in Long-Tailed Learning
arXiv:2607. 21999v1 Announce Type: new Abstract: Long-tailed learning couples two sources of poor generalization: head classes dominate training exposure, while under-represented classes often converge to sharper regions of the loss landscape.
arXiv Machine Learning
Jun 19
Stabilizing Bandits using Regularization: Precise Regret and A Quantitative Central Limit Theorem
arXiv:2603. 10184v2 Announce Type: replace-cross Abstract: Statistical inference with bandit data presents fundamental challenges owing to adaptive sampling, which violates the independence assumptions underlying classical asymptotic theory.
arXiv AI
Jul 3
ART for Diffusion Sampling: Continuous-Time Control and Actor-Critic Learning
arXiv:2607. 02137v1 Announce Type: cross Abstract: We study timestep allocation for score-based diffusion sampling, where a learned reverse-time dynamics is discretized on a finite grid.
arXiv Machine Learning
Jun 26
Stochastic Gradient Optimization with Model-Assisted Sampling
arXiv:2606. 27171v1 Announce Type: new Abstract: This work addresses the problem of variance in stochastic gradient estimation for machine learning optimization.
arXiv Machine Learning
Jul 2
QuasiMoTTo: Quasi-Monte Carlo Test-Time Scaling
arXiv:2607. 01179v1 Announce Type: new Abstract: Scaling inference compute, by generating many parallel attempts per problem, is a costly but reliable lever for improving language model capabilities.
Hugging Face Trending Papers
Jul 2
ART for Diffusion Sampling: Continuous-Time Control and Actor-Critic Learning
We study timestep allocation for score-based diffusion sampling, where a learned reverse-time dynamics is discretized on a finite grid. Uniform and hand-crafted schedules are standard choices, but they rely on fixed prescriptions and can therefore be suboptimal.