Alternating proximal regularized dictionary learning
From MaRDI portal
Recommendations
- A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
- Proximal alternating method for dictionary learning
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Analysis of fast structured dictionary learning
- Consistent learning by composite proximal thresholding
Cites work
- K-Dimensional Coding Schemes in Hilbert Spaces
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fused lasso latent feature model for analyzing multi-sample aCGH data
- A theorem of the complement and some new o-minimal structures
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Accelerated and inexact forward-backward algorithms
- Algorithms for nonnegative matrix factorization with the -divergence
- Alternating proximal regularized dictionary learning
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Dictionary Learning Algorithms for Sparse Representation
- Dictionary Learning for Stereo Image Representation
- Dualization of signal recovery problems
- Estimating the dimension of a model
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 5077050 (Why is no real title available?)
- Inexact and accelerated proximal point algorithms
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal methods for hierarchical sparse coding
- Proximity for sums of composite functions
- Sample Complexity of Dictionary Learning and Other Matrix Factorizations
- Sparse and Spurious: Dictionary Learning With Noise and Outliers
- Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
- Sparsity and Smoothness Via the Fused Lasso
- The sample complexity of dictionary learning
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(4)
This page was built for publication: Alternating proximal regularized dictionary learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383811)