Optimization with Sparsity-Inducing Penalties
From MaRDI portal
Publication:2903300
DOI10.1561/2200000015OpenAlexW4205213118MaRDI QIDQ2903300
Julien Mairal, Rodolphe Jenatton, Francis Bach, Guillaume Obozinski
Publication date: 8 August 2012
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.0775
Related Items
Combining a relaxed EM algorithm with Occam's razor for Bayesian variable selection in high-dimensional regression, Structured regularization for conditional Gaussian graphical models, Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm, Nonsmoothness in machine learning: specific structure, proximal identification, and applications, A joint convex penalty for inverse covariance matrix estimation, A reproducing kernel Hilbert space approach to high dimensional partially varying coefficient model, Minimum distance Lasso for robust high-dimensional regression, An active-set algorithm for norm constrained quadratic problems, On some steplength approaches for proximal algorithms, Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems, Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares, A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions, A Convex Approach for Image Restoration with Exact Poisson--Gaussian Likelihood, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, Sparse optimization on measures with over-parameterized gradient descent, Low-Rank Inducing Norms with Optimality Interpretations, Transaction cost optimization for online portfolio selection, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Multi-view kernel completion, Safe feature screening rules for the regularized Huber regression, A lasso for hierarchical interactions, Sparse and kernel OPLS feature extraction based on eigenvalue problem solving, Statistical properties of convex clustering, A conjugate subgradient algorithm with adaptive preconditioning for the least absolute shrinkage and selection operator minimization, An optimal subgradient algorithm with subspace search for costly convex optimization problems, An iterative SVM approach to feature selection and classification in high-dimensional datasets, Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Block coordinate descent algorithms for large-scale sparse multiclass classification, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, Efficient nonconvex sparse group feature selection via continuous and discrete optimization, Learning with optimal interpolation norms, An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso, Sampling in the analysis transform domain, Fast projections onto mixed-norm balls with applications, A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems, Variational Gram Functions: Convex Analysis and Optimization, A unified formulation for generalized oilfield development optimization, A characterization of proximity operators, Compressed sensing with structured sparsity and structured acquisition, Proximal methods for the latent group lasso penalty, Polynomial Norms, Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification, Sparse time-frequency representation of nonlinear and nonstationary data, Oracle Inequalities for Local and Global Empirical Risk Minimizers, Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property, Global convergence of ADMM in nonconvex nonsmooth optimization, Conditional gradient algorithms for norm-regularized smooth convex optimization, Robust graph regularized nonnegative matrix factorization for clustering, Optimization Methods for Large-Scale Machine Learning, The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex, Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals, Adapting Regularized Low-Rank Models for Parallel Architectures, Sparse and constrained stochastic predictive control for networked systems, Continuous relaxation for discrete DC programming, Robust tracking via locally structured representation, Beyond support in two-stage variable selection, Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice, Sparse inference of the drift of a high-dimensional Ornstein-Uhlenbeck process, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, Data-driven time-frequency analysis, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Point process estimation with Mirror Prox algorithms, Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems, Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator, Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness, Regularized optimization with spatial coupling for robust decision making, Block-based refitting in \(\ell_{12}\) sparse regularization, Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs, Convergent inexact penalty decomposition methods for cardinality-constrained problems, Perspective maximum likelihood-type estimation via proximal decomposition, Distributed Learning with Sparse Communications by Identification, A Laplacian approach to \(\ell_1\)-norm minimization, An effective procedure for feature subset selection in logistic regression based on information criteria, Convex relaxations of penalties for sparse correlated variables with bounded total variation, A second-order method for convex1-regularized optimization with active-set prediction, Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods, Error Estimates for Multivariate Regression on Discretized Function Spaces, Sequential convergence of AdaGrad algorithm for smooth convex optimization, Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach, Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems, A Derivative-Free Method for Structured Optimization Problems, Sparse classification: a scalable discrete optimization perspective, Sharp Oracle Inequalities for Square Root Regularization, Gap Safe screening rules for sparsity enforcing penalties, Data scarcity, robustness and extreme multi-label classification, Sparsest piecewise-linear regression of one-dimensional data, Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies, A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption, Dualize, split, randomize: toward fast nonsmooth optimization algorithms, On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization, A proximal framework for fuzzy subspace clustering, A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning, Unnamed Item, An efficient primal dual prox method for non-smooth optimization, Unnamed Item, A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm, A Trust-region Method for Nonsmooth Nonconvex Optimization, Safe Rules for the Identification of Zeros in the Solutions of the SLOPE Problem, Global optimization for sparse solution of least squares problems, A penalty decomposition approach for multi-objective cardinality-constrained optimization problems, Parameter choices for sparse regularization with the ℓ1 norm *, Unnamed Item, A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer, Multivariate Monotone Inclusions in Saddle Form, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, Newton acceleration on manifolds identified by proximal gradient methods, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions, A computational framework for edge-preserving regularization in dynamic inverse problems, Penalized wavelet nonparametric univariate logistic regression for irregular spaced data, A unifying framework for sparsity-constrained optimization, Root-finding approaches for computing conformal prediction set, Smooth over-parameterized solvers for non-smooth structured optimization, Optimal analysis of method with batching for monotone stochastic finite-sum variational inequalities, Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements, Global optimization using random embeddings, Compression and data similarity: combination of two techniques for communication-efficient solving of distributed variational inequalities, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, Locally Sparse Function-on-Function Regression, High-dimensional composite quantile regression: optimal statistical guarantees and fast algorithms, Recent Theoretical Advances in Non-Convex Optimization, Unnamed Item, Unnamed Item, The Signature Kernel Is the Solution of a Goursat PDE, Convex Optimization and Parsimony of $L_p$-balls Representation, Structured sparsity through convex optimization, A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm, On Algorithms for Difference of Monotone Operators, On Algorithms for Difference of Monotone Operators, Sparsity-promoting algorithms for the discovery of informative Koopman-invariant subspaces, Convergence of proximal gradient algorithm in the presence of adjoint mismatch *, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, Unnamed Item, Unnamed Item, Unnamed Item, On the Effectiveness of Richardson Extrapolation in Data Science, Proximal Gradient Methods with Adaptive Subspace Sampling, Proximal Gradient Methods for Machine Learning and Imaging
