Publication:2896018
From MaRDI portal
zbMath1242.62087MaRDI QIDQ2896018
Jean Ponce, Guillermo Sapiro, Francis Bach, Julien Mairal
Publication date: 13 July 2012
Full work available at URL: http://www.jmlr.org/papers/v11/mairal10a.html
stochastic optimization; stochastic approximations; matrix factorization; nonnegative matrix factorization; dictionary learning; sparse principal component analysis; sparse coding; basis pursuit
62H25: Factor analysis and principal components; correspondence analysis
68T05: Learning and adaptive systems in artificial intelligence
62L20: Stochastic approximation
Related Items
Unnamed Item, A semantic tree method for image classification and video action recognition, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning, First- and Second-Order Methods for Online Convolutional Dictionary Learning, Optimal dictionary for least squares representation, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Identifiability of Complete Dictionary Learning, A Theoretical Perspective on Hyperdimensional Computing, Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction, Unnamed Item, 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, Dictionary Learning for Two-Dimensional Kendall Shapes, Global Optimality in Separable Dictionary Learning with Applications to the Analysis of Diffusion MRI, Smoothing techniques and difference of convex functions algorithms for image reconstructions, A tree-based dictionary learning framework, Sparsity Promoting Hybrid Solvers for Hierarchical Bayesian Inverse Problems, ADMM for multiaffine constrained optimization, Learning Compositional Representations of Interacting Systems with Restricted Boltzmann Machines: Comparative Study of Lattice Proteins, Solving inverse problems using data-driven models, Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data, Decentralized Dictionary Learning Over Time-Varying Digraphs, Accelerated gradient methods for nonconvex nonlinear and stochastic programming, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, 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, Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis, A modified greedy analysis pursuit algorithm for the cosparse analysis model, Indian buffet process dictionary learning: algorithms and applications to image processing, Data-driven model reduction and transfer operator approximation, A tensor-based dictionary learning approach to tomographic image reconstruction, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization, Observable dictionary learning for high-dimensional statistical inference, 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, 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, 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, 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, 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, Wasserstein Loss for Image Synthesis and Restoration, Sparsity and Nullity: Paradigms for Analysis Dictionary Learning, Semisupervised Dictionary Learning with Graph Regularized and Active Points, 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, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, FRIST—flipping and rotation invariant sparsifying transform learning and applications, A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators, Learning the Structural Vocabulary of a Network, GP-Select: Accelerating EM Using Adaptive Subspace Preselection, Discrete Sparse Coding, Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization, A Sparse Decomposition of Low Rank Symmetric Positive Semidefinite Matrices, Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization, Structured sparsity through convex optimization, Two-stage submodular maximization under curvature, An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, LOCUS: a regularized blind source separation method with low-rank structure for investigating brain connectivity, \(\mathrm{C_{enet}Biplot}\): a new proposal of sparse and orthogonal biplots methods by means of elastic net CSVD, Online Covariance Matrix Estimation in Stochastic Gradient Descent, Two-stage BP maximization under \(p\)-matroid constraint, Likelihood-constrained coupled space learning for motion synthesis, A single timescale stochastic quasi-Newton method for stochastic optimization, Bayes in action in deep learning and dictionary learning
Uses Software
