Online learning for matrix factorization and sparse coding
From MaRDI portal
Recommendations
- Gradient-based sparse principal component analysis with extensions to online learning
- Online matrix factorization for Markovian data and applications to network dictionary learning
- scientific article; zbMATH DE number 6860836
- Feature-aware regularization for sparse online learning
- Online learning in the embedded manifold of low-rank matrices
- Sparse online principal component analysis for parameter estimation in factor model
- Spatially-Dimension-Adaptive Sparse Grids for Online Learning
- Analyzing Sparse Dictionaries for Online Learning With Kernels
- Sparse online learning via truncated gradient
- Approximation vector machines for large-scale online learning
Cited in
(only showing first 100 items - show all)- Observable dictionary learning for high-dimensional statistical inference
- A novel multivariate performance optimization method based on sparse coding and hyper-predictor learning
- Geometric mode decomposition
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- An alternating direction and projection algorithm for structure-enforced matrix factorization
- Matrix factorization for evolution data
- An image similarity acceleration detection algorithm based on sparse coding
- Efficient histogram dictionary learning for text/image modeling and classification
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Large-scale hyperspectral image compression via sparse representations based on online learning
- Extrinsic methods for coding and dictionary learning on Grassmann manifolds
- Structured overcomplete sparsifying transform learning with convergence guarantees and applications
- Efficient dictionary learning with sparseness-enforcing projections
- Toward fast transform learning
- Image restoration via simultaneous sparse coding: where structured sparsity meets Gaussian scale mixture
- Image deblurring with coupled dictionary learning
- Generalized dictionaries for multiple instance learning
- Dictionary learning for fast classification based on soft-thresholding
- Learning rates for least square regressions with coefficient regularization
- Non-uniform deblurring for shaken images
- Estimating networks with jumps
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- Stochastic variance reduced gradient methods using a trust-region-like scheme
- Image anomalies: a review and synthesis of detection methods
- Segmentation of hyperacute cerebral infarcts based on sparse representation of diffusion weighted imaging
- Online optimization for max-norm regularization
- Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent
- Riemannian gradient descent methods for graph-regularized matrix completion
- Geometric component analysis and its applications to data analysis
- Lower bounds for matrix factorization
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- Robust sparse coding via self-paced learning for data representation
- A dictionary learning algorithm for compression and reconstruction of streaming data in preset order
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Autoencoders reloaded
- Hyperspectral image fusion with a new hybrid regularization
- Adaptive spatial-spectral dictionary learning for hyperspectral image restoration
- Subspace learning by \(\ell^0\)-induced sparsity
- Online Schatten quasi-norm minimization for robust principal component analysis
- Model-based sparse coding beyond Gaussian independent model
- Poisson noise reduction with non-local PCA
- An online incremental orthogonal component analysis method for dimensionality reduction
- Compressed dictionary learning
- Generalized uniformly optimal methods for nonlinear programming
- Higher order Langevin Monte Carlo algorithm
- Robust reservoir rock fracture recognition based on a new sparse feature learning and data training method
- Risk bound of transfer learning using parametric feature mapping and its application to sparse coding
- Variational texture synthesis with sparsity and spectrum constraints
- Principal trend analysis for time-course data with applications in genomic medicine
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Compressive statistical learning with random feature moments
- Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization
- Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting)
- Lower bounds for sparse coding
- Spatially-Dimension-Adaptive Sparse Grids for Online Learning
- Sparse factor analysis for learning and content analytics
- Block stochastic gradient iteration for convex and nonconvex optimization
- Sparse time-frequency decomposition based on dictionary adaptation
- Penalty methods with stochastic approximation for stochastic nonlinear programming
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- Smooth sparse coding via marginal regression for learning sparse representations
- Wasserstein loss for image synthesis and restoration
- Sparsity and nullity: paradigms for analysis dictionary learning
- Semisupervised dictionary learning with graph regularized and active points
- Bag of pursuits and neural gas for improved sparse coding
- Sparse topical analysis of dyadic data using matrix tri-factorization
- Robust classifier using distance-based representation with square weights
- Tomographic image reconstruction using training images
- A least-squares method for sparse low rank approximation of multivariate functions
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- Variational Bayesian sparse additive matrix factorization
- Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity
- Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces
- Online Dictionary Learning for Kernel LMS
- Online Hyperparameter-Free Sparse Estimation Method
- Correlation Based Online Dictionary Learning Algorithm
- Online Forecasting Matrix Factorization
- A semantic tree method for image classification and video action recognition
- Optimal dictionary for least squares representation
- scientific article; zbMATH DE number 6860836 (Why is no real title available?)
- Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
- First- and second-order methods for online convolutional dictionary learning
- scientific article; zbMATH DE number 1844603 (Why is no real title available?)
- Online sufficient dimension reduction through sliced inverse regression
- Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
- A class of parallel doubly stochastic algorithms for large-scale learning
- Identifiability of complete dictionary learning
- A theoretical perspective on hyperdimensional computing
- scientific article; zbMATH DE number 7625169 (Why is no real title available?)
- scientific article; zbMATH DE number 7625181 (Why is no real title available?)
- Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
- Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ Regularization
- Dictionary Learning for Two-Dimensional Kendall Shapes
- Global optimality in separable dictionary learning with applications to the analysis of diffusion MRI
This page was built for publication: Online learning for matrix factorization and sparse coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896018)
