Proximal algorithms in statistics and machine learning
From MaRDI portal
Abstract: In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Forward-Backward, Douglas-Rachford and Half-Quadratic envelopes. Envelope representations lead to novel proximal algorithms for statistical optimisation of composite objective functions which include both non-smooth and non-convex objectives. We illustrate our methodology with regularized Logistic and Poisson regression and non-convex bridge penalties with a fused lasso norm. We provide a discussion of convergence of non-descent algorithms with acceleration and for non-convex functions. Finally, we provide directions for future research.
Recommendations
- General parameterized proximal point algorithm with applications in statistical learning
- Kullback proximal algorithms for maximum-likelihood estimation
- Publication:3035147
- Proximal Gradient Methods for Machine Learning and Imaging
- Proximal-proximal-gradient method
- On EM algorithms and their proximal generalizations
- Proximal Algorithms for Large-Scale Statistical Modeling and Sensor/Actuator Selection
- Statistical Inference via Convex Optimization
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- Proximal Methods in Vector Optimization
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3872359 (Why is no real title available?)
- scientific article; zbMATH DE number 4159863 (Why is no real title available?)
- scientific article; zbMATH DE number 3986503 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- A fast dual proximal gradient algorithm for convex minimization and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A lasso for hierarchical interactions
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A proximal-based deomposition method for compositions method for convex minimization problems
- A variational formulation for frame-based inverse problems
- Adaptive piecewise polynomial estimation via trend filtering
- Adaptive restart for accelerated gradient schemes
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- An EM algorithm for wavelet-based image restoration
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Gradient-based algorithms with applications to signal-recovery problems
- Kullback proximal algorithms for maximum-likelihood estimation
- Local shrinkage rules, Lévy processes and regularized regression
- Mixtures, envelopes and hierarchical duality
- Monotone Operators and the Proximal Point Algorithm
- Multiplier and gradient methods
- Nonlinear total variation based noise removal algorithms
- On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal Markov chain Monte Carlo algorithms
- Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds
- Proximal splitting methods in signal processing
- Proximity algorithms for image models: denoising
- Proximity algorithms for the L1/TV image denoising model
- Regularization and Variable Selection Via the Elastic Net
- Sparsity and Smoothness Via the Fused Lasso
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The solution path of the generalized lasso
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Variational Analysis
- Weiszfeld's method: old and new results
Cited in
(50)- Weighted Bayesian bootstrap for scalable posterior distributions
- scientific article; zbMATH DE number 7626740 (Why is no real title available?)
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization
- Proximal statistic: asymptotic normality
- Binned multinomial logistic regression for integrative cell-type annotation
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces
- Bayesian \(l_0\)-regularized least squares
- The proximal distance algorithm
- General parameterized proximal point algorithm with applications in statistical learning
- Alternating direction method of multipliers for nonconvex log total variation image restoration
- Convex clustering for binary data
- One-Step Estimation with Scaled Proximal Methods
- Gradient-Based Markov Chain Monte Carlo for Bayesian Inference With Non-differentiable Priors
- Hierarchical nuclear norm penalization for multi-view data integration
- Multiresolution categorical regression for interpretable cell-type annotation
- Hot-spots detection in count data by Poisson assisted smooth sparse tensor decomposition
- On perturbed proximal gradient algorithms
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Matrix completion from a computational statistics perspective
- An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee
- Active-set algorithm-based statistical inference for shape-restricted generalized additive Cox regression models
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- Phase-only transmit beampattern design for large phased array antennas with multi-point nulling
- A varying coefficient model with matrix valued covariates
- Rendition: reclaiming what a black box takes away
- Homogeneity detection for the high-dimensional generalized linear model
- The horseshoe-like regularization for feature subset selection
- Discussion: ``A brief survey of modern optimization for statisticians
- Proximal distance algorithms: theory and practice
- Lasso meets horseshoe: a survey
- Mixtures, envelopes and hierarchical duality
- Structure-leveraged methods in breast cancer risk prediction
- Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators
- Perspective maximum likelihood-type estimation via proximal decomposition
- Global-local mixtures: a unifying framework
- Is EM really necessary here? Examples where it seems simpler not to use EM
- Solving Fused Penalty Estimation Problems via Block Splitting Algorithms
- Penalized Estimation and Forecasting of Multiple Subject Intensive Longitudinal Data
- The stochastic proximal distance algorithm
- A User-Friendly Computational Framework for Robust Structured Regression with the L2 Criterion
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms
- Estimating Multiple Precision Matrices With Cluster Fusion Regularization
- An MM Algorithm for Split Feasibility Problems
- Sparse Single Index Models for Multivariate Responses
- scientific article; zbMATH DE number 7370577 (Why is no real title available?)
- Bayesian quickest detection of credit card fraud
- High-performance statistical computing in the computing environments of the 2020s
- Consistent learning by composite proximal thresholding
- A covariance-enhanced approach to multitissue joint eQTL mapping with application to transcriptome-wide association studies
This page was built for publication: Proximal algorithms in statistics and machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790304)
