Search Results for author: Patrick R. Johnstone

Found 8 papers, 2 papers with code

Density Estimation via Measure Transport: Outlook for Applications in the Biological Sciences

no code implementations27 Sep 2023 Vanessa Lopez-Marrero, Patrick R. Johnstone, Gilchan Park, Xihaier Luo

One among several advantages of measure transport methods is that they allow for a unified framework for processing and analysis of data distributed according to a wide class of probability measures.

Density Estimation

Stochastic Projective Splitting: Solving Saddle-Point Problems with Multiple Regularizers

no code implementations24 Jun 2021 Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn, Shinjae Yoo

We present a new, stochastic variant of the projective splitting (PS) family of algorithms for monotone inclusion problems.

regression

Single-Forward-Step Projective Splitting: Exploiting Cocoercivity

2 code implementations24 Feb 2019 Patrick R. Johnstone, Jonathan Eckstein

In the convex optimization context, cocoercivity is equivalent to Lipschitz differentiability.

Projective Splitting with Forward Steps only Requires Continuity

no code implementations17 Sep 2018 Patrick R. Johnstone, Jonathan Eckstein

A recent innovation in projective splitting algorithms for monotone operator inclusions has been the development of a procedure using two forward steps instead of the customary proximal steps for operators that are Lipschitz continuous.

Convergence Rates for Projective Splitting

no code implementations11 Jun 2018 Patrick R. Johnstone, Jonathan Eckstein

Second, for strongly monotone inclusions, strong convergence is established as well as an ergodic $O(1/\sqrt{k})$ convergence rate for the distance of the iterates to the solution.

Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting

1 code implementation19 Mar 2018 Patrick R. Johnstone, Jonathan Eckstein

Forward steps can be used for any Lipschitz-continuous operators provided the stepsize is bounded by the inverse of the Lipschitz constant.

feature selection

Faster Subgradient Methods for Functions with Hölderian Growth

no code implementations1 Apr 2017 Patrick R. Johnstone, Pierre Moulin

Thirdly we develop a novel "descending stairs" stepsize which obtains this faster convergence rate and also obtains linear convergence for the special case of weakly sharp functions.

Local and Global Convergence of a General Inertial Proximal Splitting Scheme

no code implementations8 Feb 2016 Patrick R. Johnstone, Pierre Moulin

Our local analysis is applicable to certain recent variants of the Fast Iterative Shrinkage-Thresholding Algorithm (FISTA), for which we establish active manifold identification and local linear convergence.

Cannot find the paper you are looking for? You can Submit a new open access paper.