Cover Image

Fixed-Point Automatic Differentiation of Forward--Backward Splitting Algorithms for Partly Smooth Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mehmood, Sheheryar, Ochs, Peter
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Automatic Differentiation of Optimization Algorithms with Time-Varying Updates
by: Mehmood, Sheheryar, et al.
Published: (2024)

Understanding the Curse of Unrolling
by: Mehmood, Sheheryar, et al.
Published: (2026)

A Double Inertial Forward-Backward Splitting Algorithm With Applications to Regression and Classification Problems
by: Işik, İrfan, et al.
Published: (2025)

From Learning to Optimize to Learning Optimization Algorithms
by: Castera, Camille, et al.
Published: (2024)

Lyapunov Analysis For Monotonically Forward-Backward Accelerated Algorithms
by: Fu, Mingwei, et al.
Published: (2024)

A Family of Controllable Momentum Coefficients for Forward-Backward Accelerated Algorithms
by: Fu, Mingwei, et al.
Published: (2025)

On the Convergence of Stochastic Gradient Descent with Perturbed Forward-Backward Passes
by: Kong, Boao, et al.
Published: (2026)

A Generalization Result for Convergence in Learning-to-Optimize
by: Sucker, Michael, et al.
Published: (2024)

Smoothing Methods for Automatic Differentiation Across Conditional Branches
by: Kreikemeyer, Justin N., et al.
Published: (2023)

Learning-to-Optimize with PAC-Bayesian Guarantees: Theoretical Considerations and Practical Implementation
by: Sucker, Michael, et al.
Published: (2024)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
by: Richtárik, Peter, et al.
Published: (2024)

Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions
by: Tran-Dinh, Quoc, et al.
Published: (2026)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
by: Curtis, Frank E., et al.
Published: (2023)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
by: Kovalev, Dmitry, et al.
Published: (2024)

Faster Fixed-Point Methods for Multichain MDPs
by: Zurek, Matthew, et al.
Published: (2025)

(Almost) Smooth Sailing: Towards Numerical Stability of Neural Networks Through Differentiable Regularization of the Condition Number
by: Nenov, Rossen, et al.
Published: (2024)

Convergence of Some Convex Message Passing Algorithms to a Fixed Point
by: Voracek, Vaclav, et al.
Published: (2024)

Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithm on Stochastic Smooth Functions
by: Ye, Haishan
Published: (2025)

Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization
by: Maier, Severin, et al.
Published: (2023)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

A Smoothing Algorithm for l1 Support Vector Machines
by: Emirahmetoglu, Ibrahim, et al.
Published: (2023)

Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces
by: Zhang, Zhe, et al.
Published: (2025)

An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2024)

Projected Forward Gradient-Guided Frank-Wolfe Algorithm via Variance Reduction
by: Rostami, M., et al.
Published: (2024)

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

On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2025)

Randomized Forward Mode of Automatic Differentiation For Optimization Algorithms
by: Shukla, Khemraj, et al.
Published: (2023)

Integration Matters for Learning PDEs with Backward SDEs
by: Park, Sungje, et al.
Published: (2025)

Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
by: Cao, Daniel Yiming, et al.
Published: (2025)

Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization
by: Kotary, James, et al.
Published: (2023)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
by: Gruntkowska, Kaja, et al.
Published: (2025)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
by: Alacaoglu, Ahmet, et al.
Published: (2024)

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
by: Huang, Ruichuan, et al.
Published: (2025)

Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis
by: Hao, Jie, et al.
Published: (2024)

Deep Backward and Galerkin Methods for the Finite State Master Equation
by: Cohen, Asaf, et al.
Published: (2024)

A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2024)

Inertial Newton Algorithms Avoiding Strict Saddle Points
by: Castera, Camille
Published: (2021)

Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization
by: Sato, Naoki, et al.
Published: (2023)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
by: Crawshaw, Michael, et al.
Published: (2025)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)