An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence

DOI10.1007/978-3-642-29694-9_14zbMath1277.68232OpenAlexW188952929MaRDI QIDQ2866116

Zeng-ke Zhang, Yue Deng, Qionghai Dai

Publication date: 13 December 2013

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_14

zbMATH Keywords

computer visionartificial intelligencemachine learningsparse learninglow rank matrix completion

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Machine vision and scene understanding (68T45) General topics in artificial intelligence (68T01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• A simple proof of the restricted isometry property for random matrices
• The universal Turing machine. A half-century survey.
• TILT: transform invariant low-rank textures
• High-dimensional graphs and variable selection with the Lasso
• Exact matrix completion via convex optimization
• Robust principal component analysis?
• Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Graphical Models, Exponential Families, and Variational Inference
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Atomic Decomposition by Basis Pursuit
• 10.1162/15324430152748236
• A new approach to variable selection in least squares problems
• Bayesian Compressive Sensing
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• De-noising by soft-thresholding
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Regularization and Variable Selection Via the Elastic Net
• Learning with $\ell ^{1}$-graph for image analysis
• Compressed sensing
• Sparse regression ensembles in infinite and finite hypothesis spaces