Cover Image

A Note on How to Remove the $\ln\ln T$ Term from the Squint Bound

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Orabona, Francesco
Format:	Preprint
Published:	2026
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

A Modern Introduction to Online Learning
by: Orabona, Francesco
Published: (2019)

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
by: Saad, El Mehdi, et al.
Published: (2025)

An Equivalence Between Static and Dynamic Regret Minimization
by: Jacobsen, Andrew, et al.
Published: (2024)

A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
by: Lee, Wei-Cheng, et al.
Published: (2025)

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
by: Lee, Wei-Cheng, et al.
Published: (2025)

New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results
by: Orabona, Francesco, et al.
Published: (2025)

Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
by: Cutkosky, Ashok, et al.
Published: (2023)

Beyond the Ideal: Analyzing the Inexact Muon Update
by: Shulgin, Egor, et al.
Published: (2025)

Cover meets Robbins while Betting on Bounded Data: $\ln n$ Regret and Almost Sure $\ln\ln n$ Regret
by: Agrawal, Shubhada, et al.
Published: (2026)

ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning
by: Maranjyan, Artavazd, et al.
Published: (2025)

Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective
by: Lin, Wu, et al.
Published: (2024)

Clapping: Removing Per-sample Storage for Pipeline Parallel Distributed Optimization with Communication Compression
by: Kong, Boao, et al.
Published: (2025)

Bounds on Perfect Node Classification: A Convex Graph Clustering Perspective
by: Shahriari-Mehr, Firooz, et al.
Published: (2025)

Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis
by: Cortild, Daniel, et al.
Published: (2025)

Tight Generalization Bounds for Noiseless Inverse Optimization
by: Fatemi, Pouria, et al.
Published: (2026)

Reinforcement Learning and Regret Bounds for Admission Control
by: Weber, Lucas, et al.
Published: (2024)

Improved Compression Bounds for Scenario Decision Making
by: Berger, Guillaume O.
Published: (2025)

Byzantine-Robust Distributed SGD: A Unified Analysis and Tight Error Bounds
by: Ruan, Boyuan, et al.
Published: (2026)

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems
by: Guyard, Theo, et al.
Published: (2024)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

Empirical Risk Minimization with Shuffled SGD: A Primal-Dual Perspective and Improved Bounds
by: Cai, Xufeng, et al.
Published: (2023)

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
by: Elvira, Clément, et al.
Published: (2025)

A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
by: Dagréou, Mathieu, et al.
Published: (2023)

Residual subspace evolution strategies for nonlinear inverse problems
by: Alemanno, Francesco
Published: (2025)

Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints
by: Sid-Ali, Ahmed, et al.
Published: (2023)

Solving Stochastic Variational Inequalities without the Bounded Variance Assumption
by: Alacaoglu, Ahmet, et al.
Published: (2026)

Improved Scalable Lipschitz Bounds for Deep Neural Networks
by: Syed, Usman, et al.
Published: (2025)

Mean-Field Generalisation Bounds for Learning Controls in Stochastic Environments
by: Baros, Boris, et al.
Published: (2025)

Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
by: Huang, Hao, et al.
Published: (2025)

Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator
by: Xu, Wenhao, et al.
Published: (2024)

Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems
by: Ziemann, Ingvar, et al.
Published: (2022)

Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
by: Armacki, Aleksandar, et al.
Published: (2026)

Exponentially Weighted Algorithm for Online Network Resource Allocation with Long-Term Constraints
by: Sid-Ali, Ahmed, et al.
Published: (2024)

First and Second Order Approximations to Stochastic Gradient Descent Methods with Momentum Terms
by: Lu, Eric
Published: (2025)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Lower Bounds on Adversarial Robustness for Multiclass Classification with General Loss Functions
by: Trillos, Camilo Andrés García, et al.
Published: (2025)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, et al.
Published: (2024)