Cover Image

Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dorn, Yuriy, Katrutsa, Aleksandr, Latypov, Ilgam, Pudovikov, Andrey
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Functional multi-armed bandit and the best function identification problems
by: Dorn, Yuriy, et al.
Published: (2025)

$γ$-Competitiveness: An Approach to Multi-Objective Optimization with High Computation Costs in Lipschitz Functions
by: Latypov, Ilgam, et al.
Published: (2024)

UCB-type Algorithm for Budget-Constrained Expert Learning
by: Latypov, Ilgam, et al.
Published: (2025)

Robust autobidding for noisy conversion prediction models
by: Pudovikov, Andrey, et al.
Published: (2025)

Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms
by: Pudovikov, Andrey, et al.
Published: (2025)

Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling
by: Vukovic, Manojlo, et al.
Published: (2026)

EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement
by: Demin, Alexander, et al.
Published: (2024)

Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization
by: Fan, Zheyi, et al.
Published: (2024)

WeightLoRA: Keep Only Necessary Adapters
by: Veprikov, Andrey, et al.
Published: (2025)

Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
by: Godichon-Baggioni, Antoine, et al.
Published: (2024)

Accelerated stochastic approximation with state-dependent noise
by: Ilandarideva, Sasila, et al.
Published: (2023)

Variance reduction techniques for stochastic proximal point algorithms
by: Traoré, Cheik, et al.
Published: (2023)

Primal-dual algorithm for contextual stochastic combinatorial optimization
by: Bouvier, Louis, et al.
Published: (2025)

Distributed gradient methods under heavy-tailed communication noise
by: Vukovic, Manojlo, et al.
Published: (2025)

Preconditioned Norms: A Unified Framework for Steepest Descent, Quasi-Newton and Adaptive Methods
by: Veprikov, Andrey, et al.
Published: (2025)

Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers
by: Riabinin, Artem, et al.
Published: (2026)

A framework for bilevel optimization that enables stochastic and global variance reduction algorithms
by: Dagréou, Mathieu, et al.
Published: (2022)

Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffer
by: Nakul, Milind, et al.
Published: (2026)

A stochastic gradient descent algorithm with random search directions
by: Gbaguidi, Eméric
Published: (2025)

Zero-Order Optimization for LLM Fine-Tuning via Learnable Direction Sampling
by: Parfenov, Valery, et al.
Published: (2026)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
by: Zhang, Huiling, et al.
Published: (2023)

Mean-square and linear convergence of a stochastic proximal point algorithm in metric spaces of nonpositive curvature
by: Pischke, Nicholas
Published: (2025)

Nonsmooth nonconvex stochastic heavy ball
by: Le, Tam
Published: (2023)

Leveraging Coordinate Momentum in SignSGD and Muon: Memory-Optimized Zero-Order
by: Petrov, Egor, et al.
Published: (2025)

Random-reshuffled SARAH does not need a full gradient computations
by: Beznosikov, Aleksandr, et al.
Published: (2021)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
by: Alecsa, Cristian Daniel
Published: (2021)

Uncertainty Quantification of Click and Conversion Estimates for the Autobidding
by: Zhigalskii, Ivan, et al.
Published: (2026)

Full error analysis of policy gradient learning algorithms for exploratory linear quadratic mean-field control problem in continuous time with common noise
by: Frikha, Noufel, et al.
Published: (2024)

Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
by: Mohammadi, Hesameddin, et al.
Published: (2022)

Accelerated stochastic first-order method for convex optimization under heavy-tailed noise
by: He, Chuan, et al.
Published: (2025)

Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learning
by: Bylinkin, Dmitry, et al.
Published: (2024)

Sarah Frank-Wolfe: Methods for Constrained Optimization with Best Rates and Practical Features
by: Beznosikov, Aleksandr, et al.
Published: (2023)

Enhancing GNNs Performance on Combinatorial Optimization by Recurrent Feature Update
by: Pugacheva, Daria, et al.
Published: (2024)

Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation
by: Beznosikov, Aleksandr, et al.
Published: (2026)

Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting
by: Ustimenko, Aleksei, et al.
Published: (2023)

Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?
by: Jiang, Liwei, et al.
Published: (2026)

Optimal Data Splitting in Distributed Optimization for Machine Learning
by: Medyakov, Daniil, et al.
Published: (2024)

Convergence of Clipped-SGD for Convex $(L_0,L_1)$-Smooth Optimization with Heavy-Tailed Noise
by: Chezhegov, Savelii, et al.
Published: (2025)

Enhancing Stability of Physics-Informed Neural Network Training Through Saddle-Point Reformulation
by: Bylinkin, Dmitry, et al.
Published: (2025)

Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian Stochasticity
by: Prokhorov, Boris, et al.
Published: (2026)