:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Keslaki, Ben
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2504.01875
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

DRIFT: Data Reduction via Informative Feature Transformation- Generalization Begins Before Deep Learning starts
by: Keslaki, Ben
Published: (2025)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
by: Kovalev, Dmitry
Published: (2026)

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
by: Zheng, Yuping, et al.
Published: (2025)

Mitigating Gradient Overlap in Deep Residual Networks with Gradient Normalization for Improved Non-Convex Optimization
by: Yun, Juyoung
Published: (2024)

Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency
by: Wu, Jingfeng, et al.
Published: (2024)

Simple Optimizers for Convex Aligned Multi-Objective Optimization
by: Kretzu, Ben, et al.
Published: (2025)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization
by: Schliserman, Matan, et al.
Published: (2024)

Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)

Shuffling Momentum Gradient Algorithm for Convex Optimization
by: Tran, Trang H., et al.
Published: (2024)

On Convex Optimization with Semi-Sensitive Features
by: Ghazi, Badih, et al.
Published: (2024)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

It's Our Loss: No Privacy Amplification for Hidden State DP-SGD With Non-Convex Loss
by: Annamalai, Meenatchi Sundaram Muthu Selva
Published: (2024)

Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations
by: Yu, Hang, et al.
Published: (2026)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Non-Convex Optimization with Spectral Radius Regularization
by: Sandler, Adam, et al.
Published: (2021)

Adaptive Proximal Gradient Method for Convex Optimization
by: Malitsky, Yura, et al.
Published: (2023)

Grokfast: Accelerated Grokking by Amplifying Slow Gradients
by: Lee, Jaerin, et al.
Published: (2024)

Non-Convex Optimization in Federated Learning via Variance Reduction and Adaptive Learning
by: Thakur, Dipanwita, et al.
Published: (2024)

How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization
by: Lowy, Andrew, et al.
Published: (2024)

Expressive Losses for Verified Robustness via Convex Combinations
by: De Palma, Alessandro, et al.
Published: (2023)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2024)

Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems
by: Sato, Kanji, et al.
Published: (2022)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

Federated Smoothing Proximal Gradient for Quantile Regression with Non-Convex Penalties
by: Mirzaeifard, Reza, et al.
Published: (2024)

Convex Distillation: Efficient Compression of Deep Networks via Convex Optimization
by: Varshney, Prateek, et al.
Published: (2024)

Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses
by: Cao, Yuzhou, et al.
Published: (2025)

Loss Gradient Gaussian Width based Generalization and Optimization Guarantees
by: Banerjee, Arindam, et al.
Published: (2024)

Muon in Vision Transformers: Optimizer-Recipe Interactions and Gradient Spectra
by: Southworth, Ben S., et al.
Published: (2026)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
by: Borodich, Ekaterina, et al.
Published: (2025)

Non-stationary Bandit Convex Optimization: A Comprehensive Study
by: Liu, Xiaoqi, et al.
Published: (2025)

You Shall Pass: Dealing with the Zero-Gradient Problem in Predict and Optimize for Convex Optimization
by: Veviurko, Grigorii, et al.
Published: (2023)

Understanding Transformer Optimization via Gradient Heterogeneity
by: Tomihari, Akiyoshi, et al.
Published: (2025)

Bayesian Risk-Sensitive Policy Optimization For MDPs With General Loss Functions
by: Wang, Xiaoshuang, et al.
Published: (2025)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems
by: Buckingham, Jack M., et al.
Published: (2024)

Gradient Aligned Regression via Pairwise Losses
by: Zhu, Dixian, et al.
Published: (2024)

Efficient Test-Time Finetuning of LLMs via Convex Reconstruction and Gradient Caching
by: Khamis, Alaa, et al.
Published: (2026)