Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems

12/15/2022
by   Jérôme Bolte, et al.
0

We leverage path differentiability and a recent result on nonsmooth implicit differentiation calculus to give sufficient conditions ensuring that the solution to a monotone inclusion problem will be path differentiable, with formulas for computing its generalized gradient. A direct consequence of our result is that these solutions happen to be differentiable almost everywhere. Our approach is fully compatible with automatic differentiation and comes with assumptions which are easy to check, roughly speaking: semialgebraicity and strong monotonicity. We illustrate the scope of our results by considering three fundamental composite problem settings: strongly convex problems, dual solutions to convex minimization problems and primal-dual solutions to min-max problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2022

Accelerated Algorithms for Monotone Inclusions and Constrained Nonconvex-Nonconcave Min-Max Optimization

We study monotone inclusions and monotone variational inequalities, as w...
research
02/20/2020

Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalities

We leverage the connections between nonexpansive maps, monotone Lipschit...
research
06/08/2021

Nonsmooth Implicit Differentiation for Machine Learning and Optimization

In view of training increasingly complex learning architectures, we esta...
research
11/12/2019

Inducing strong convergence of trajectories in dynamical systems associated to monotone inclusions with composite structure

In this work we investigate dynamical systems designed to approach the s...
research
01/19/2022

On the Complexity of a Practical Primal-Dual Coordinate Method

We prove complexity bounds for the primal-dual algorithm with random ext...
research
07/01/2017

Angle-monotone Paths in Non-obtuse Triangulations

We reprove a result of Dehkordi, Frati, and Gudmundsson: every two verti...
research
04/10/2022

On dually-CPT and strong-CPT posets

A poset is a containment of paths in a tree (CPT) if it admits a represe...

Please sign up or login with your details

Forgot password? Click here to reset