Generalized Conditional Gradient for Sparse Estimation
From MaRDI portal
Publication:4637076
zbMath1444.62084arXiv1410.4828MaRDI QIDQ4637076
Dale Schuurmans, Xinhua Zhang, Yaoliang Yu
Publication date: 17 April 2018
Full work available at URL: https://arxiv.org/abs/1410.4828
matrix completionmulti-class classificationsparse estimationdictionary learningmulti-view learningFrank-Wolfemulti-view dictionary learninggeneralized conditional gradient
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (9)
Screening for a reweighted penalized conditional gradient method ⋮ Affine Invariant Convergence Rates of the Conditional Gradient Method ⋮ A unified analysis of stochastic gradient‐free Frank–Wolfe methods ⋮ Asymptotic linear convergence of fully-corrective generalized conditional gradient methods ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization ⋮ Adaptive conditional gradient method ⋮ Complexity bounds for primal-dual methods minimizing the model of objective function ⋮ Generalized Conditional Gradient for Sparse Estimation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Sublinear time algorithms for approximate semidefinite programming
- Gradient methods for minimizing composite functions
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Statistics for high-dimensional data. Methods, theory and applications.
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Convex multi-task feature learning
- Conditional gradient algorithms with open loop step size rules
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- The convex geometry of linear inverse problems
- Regularizers for structured sparsity
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Local minima and convergence in low-rank semidefinite programming
- Exact matrix completion via convex optimization
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Sparse Modeling for Image and Vision Processing
- Duality Between Subgradient and Conditional Gradient Methods
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
- On the Complexity of Nonnegative Matrix Factorization
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- Some comments on Wolfe's ‘away step’
- A generalized proximal point algorithm for certain non-convex minimization problems
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
- Variational Analysis
- Generalized Conditional Gradient for Sparse Estimation
- An extension of the frank and Wolfe method of feasible directions
- Low-Rank Optimization with Trace Norm Penalty
- Model Selection and Estimation in Regression with Grouped Variables
- Sparse Approximate Solutions to Semidefinite Programs
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- Accelerated Frank–Wolfe Algorithms
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- New analysis and results for the Frank-Wolfe method
- Structured sparsity through convex optimization
This page was built for publication: Generalized Conditional Gradient for Sparse Estimation
