Proximal algorithms in statistics and machine learning
From MaRDI portal
Publication:1790304
DOI10.1214/15-STS530zbMath1426.62213arXiv1502.03175OpenAlexW2962943048MaRDI QIDQ1790304
James G. Scott, Brandon T. Willard, Nicholas G. Polson
Publication date: 2 October 2018
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.03175
ADMMoptimizationregularizationsplittingnonconvexenvelopesshrinkagesparsitydivide and concurKurdyka-ŁojasiewiczBayes MAP
Related Items
Active-set algorithm-based statistical inference for shape-restricted generalized additive Cox regression models, A User-Friendly Computational Framework for Robust Structured Regression with the L2 Criterion, Phase-only transmit beampattern design for large phased array antennas with multi-point nulling, Sparse Single Index Models for Multivariate Responses, Estimating Multiple Precision Matrices With Cluster Fusion Regularization, Homogeneity detection for the high-dimensional generalized linear model, Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee, Weighted Bayesian bootstrap for scalable posterior distributions, Hot-spots detection in count data by Poisson assisted smooth sparse tensor decomposition, Proximal variable metric method with spectral diagonal update for large scale sparse optimization, Gradient-Based Markov Chain Monte Carlo for Bayesian Inference With Non-differentiable Priors, Bayesian quickest detection of credit card fraud, Unnamed Item, Binned multinomial logistic regression for integrative cell-type annotation, Alternating direction method of multipliers for nonconvex log total variation image restoration, Global-local mixtures: a unifying framework, Proximal statistic: asymptotic normality, Unnamed Item, A covariance-enhanced approach to multitissue joint eQTL mapping with application to transcriptome-wide association studies, Penalized Estimation and Forecasting of Multiple Subject Intensive Longitudinal Data, The horseshoe-like regularization for feature subset selection, Lasso meets horseshoe: a survey, An MM Algorithm for Split Feasibility Problems, Convex clustering for binary data, Solving Fused Penalty Estimation Problems via Block Splitting Algorithms, Is EM really necessary here? Examples where it seems simpler not to use EM, Rendition: Reclaiming What a Black Box Takes Away, Dualize, split, randomize: toward fast nonsmooth optimization algorithms, High-performance statistical computing in the computing environments of the 2020s, Unnamed Item, One-Step Estimation with Scaled Proximal Methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- A lasso for hierarchical interactions
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- The solution path of the generalized lasso
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A proximal-based deomposition method for compositions method for convex minimization problems
- A fast dual proximal gradient algorithm for convex minimization and applications
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Proximity algorithms for the L1/TV image denoising model
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Weiszfeld's method: old and new results
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Adaptive restart for accelerated gradient schemes
- Adaptive piecewise polynomial estimation via trend filtering
- Multiplier and gradient methods
- Proximal Markov chain Monte Carlo algorithms
- Kullback proximal algorithms for maximum-likelihood estimation
- Proximal Splitting Methods in Signal Processing
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- Proximity algorithms for image models: denoising
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- An EM algorithm for wavelet-based image restoration
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Sparsity and Smoothness Via the Fused Lasso
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Regularization and Variable Selection Via the Elastic Net
- On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
- Mixtures, Envelopes and Hierarchical Duality
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- Local Shrinkage Rules, Lévy Processes and Regularized Regression
- A variational formulation for frame-based inverse problems
- Bayesian computation: a summary of the current state, and samples backwards and forwards
