Cover Image

Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Losses

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bao, Han, Sakaue, Shinsaku, Takezawa, Yuki
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis
by: Sakaue, Shinsaku, et al.
Published: (2025)

Online Structured Prediction with Fenchel--Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss
by: Sakaue, Shinsaku, et al.
Published: (2024)

Non-Stationary Online Structured Prediction with Surrogate Losses
by: Sakaue, Shinsaku, et al.
Published: (2025)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
by: Sakaue, Shinsaku, et al.
Published: (2026)

Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness
by: Sakaue, Shinsaku
Published: (2026)

Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming
by: Sakaue, Shinsaku, et al.
Published: (2023)

Parameter-free Clipped Gradient Descent Meets Polyak
by: Takezawa, Yuki, et al.
Published: (2024)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
by: Oki, Taihei, et al.
Published: (2026)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
by: Sakaue, Shinsaku, et al.
Published: (2025)

Bandit and Delayed Feedback in Online Structured Prediction
by: Shibukawa, Yuki, et al.
Published: (2025)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
by: Oki, Taihei, 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)

A Fenchel-Young Loss Approach to Data-Driven Inverse Optimization
by: Li, Zhehao, et al.
Published: (2025)

PhiNets: Brain-inspired Non-contrastive Learning Based on Temporal Prediction Hypothesis
by: Ishikawa, Satoki, et al.
Published: (2024)

Fenchel-Young Variational Learning
by: Sklaviadis, Sophia, et al.
Published: (2025)

The Implicit Bias of Gradient Descent on Separable Data
by: Soudry, Daniel, et al.
Published: (2017)

Multiclass Loss Geometry Matters for Generalization of Gradient Descent in Separable Classification
by: Schliserman, Matan, et al.
Published: (2025)

The Implicit Bias of Gradient Descent on Separable Multiclass Data
by: Ravi, Hrithik, et al.
Published: (2024)

Learning from Samples: Inverse Problems over measures via Sharpened Fenchel-Young Losses
by: Andrade, Francisco, et al.
Published: (2025)

Necessary and Sufficient Watermark for Large Language Models
by: Takezawa, Yuki, et al.
Published: (2023)

Scalable Decentralized Learning with Teleportation
by: Takezawa, Yuki, et al.
Published: (2025)

AnyLoss: Transforming Classification Metrics into Loss Functions
by: Han, Doheon, et al.
Published: (2024)

Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes
by: Meng, Si Yi, et al.
Published: (2024)

Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation
by: Otsuka, Kaoru, et al.
Published: (2025)

Hopfield-Fenchel-Young Networks: A Unified Framework for Associative Memory Retrieval
by: Santos, Saul, et al.
Published: (2024)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
by: Davis, Damek, et al.
Published: (2024)

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

Spectral Gradient Descent Mitigates Anisotropy-Driven Misalignment: A Case Study in Phase Retrieval
by: Braun, Guillaume, et al.
Published: (2026)

Exponential Convergence of (Stochastic) Gradient Descent for Separable Logistic Regression
by: Kale, Sacchit, et al.
Published: (2026)

Quadratic polarity and polar Fenchel-Young divergences from the canonical Legendre polarity
by: Nielsen, Frank, et al.
Published: (2026)

Harmonized Gradient Descent for Class Imbalanced Data Stream Online Learning
by: Zhou, Han, et al.
Published: (2025)

Stochastic Gradient Descent with Adaptive Data
by: Che, Ethan, et al.
Published: (2024)

Gradient Descent as Loss Landscape Navigation: a Normative Framework for Deriving Learning Rules
by: Vastola, John J., et al.
Published: (2025)

Occam Gradient Descent
by: Kausik, B. N.
Published: (2024)

Unraveling the Gradient Descent Dynamics of Transformers
by: Song, Bingqing, et al.
Published: (2024)

Modified Loss of Momentum Gradient Descent: Fine-Grained Analysis
by: Cattaneo, Matias D., et al.
Published: (2025)

On Penalty-based Bilevel Gradient Descent Method
by: Shen, Han, et al.
Published: (2023)

FedMuon: Federated Learning with Bias-corrected LMO-based Optimization
by: Takezawa, Yuki, et al.
Published: (2025)

Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization
by: Takezawa, Yuki, et al.
Published: (2025)

Scaling Laws for Gradient Descent and Sign Descent for Linear Bigram Models under Zipf's Law
by: Kunstner, Frederik, et al.
Published: (2025)