Gradient flows and randomised thresholding: sparse inversion and classification*The author thanks the anonymous reviewers for their helpful remarks. (1st December 2022)

• Record Type: Journal Article
• Authors: Latz, Jonas
• Is Part Of: Inverse problems. Volume 38:Number 12(2022)
• Publication Date: 2022-12-01
• Subjects: sparsity -- classification -- stochastic processes -- piecewise-deterministic Markov processes -- subgradient flows -- Allen–Cahn equation; Inverse problems (Differential equations) -- Periodicals; 515.357
• DOI: 10.1088/1361-6420/ac9b84
• Languages: English
• ISSNs: 0266-5611

Abstract

Abstract: Sparse inversion and classification problems are ubiquitous in modern data science and imaging. They are often formulated as non-smooth minimisation problems. In sparse inversion, we minimise, e.g., the sum of a data fidelity term and an L1/LASSO regulariser. In classification, we consider, e.g., the sum of a data fidelity term and a non-smooth Ginzburg–Landau energy. Standard (sub)gradient descent methods have shown to be inefficient when approaching such problems. Splitting techniques are much more useful: here, the target function is partitioned into a sum of two subtarget functions—each of which can be efficiently optimised. Splitting proceeds by performing optimisation steps alternately with respect to each of the two subtarget functions. In this work, we study splitting from a stochastic continuous-time perspective. Indeed, we define a differential inclusion that follows one of the two subtarget function's negative subdifferential at each point in time. The choice of the subtarget function is controlled by a binary continuous-time Markov process. The resulting dynamical system is a stochastic approximation of the underlying subgradient flow. We investigate this stochastic approximation for an L1-regularised sparse inversion flow and for a discrete Allen–Cahn equation minimising a Ginzburg–Landau energy. In both cases, we study the longtime behaviour of the stochastic dynamical system and its ability to approximate the underlying subgradient flow at any accuracy. We illustrate our theoretical findings in a simple sparse estimation problem and also in low- and high-dimensional classification problems.