scientific article
From MaRDI portal
Publication:2896018
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic optimizationstochastic approximationsmatrix factorizationnonnegative matrix factorizationdictionary learningsparse principal component analysissparse codingbasis pursuit
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05) Stochastic approximation (62L20)
Related Items
FRIST—flipping and rotation invariant sparsifying transform learning and applications, 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, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, 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, 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, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization, Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data, Decentralized Dictionary Learning Over Time-Varying Digraphs, A dictionary learning algorithm for compression and reconstruction of streaming data in preset order, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, 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, Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction, Observable dictionary learning for high-dimensional statistical inference, Wasserstein Loss for Image Synthesis and Restoration, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, Sparse topical analysis of dyadic data using matrix tri-factorization, Unnamed Item, Sparsity and Nullity: Paradigms for Analysis Dictionary Learning, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, Robust classifier using distance-based representation with square weights, Tomographic image reconstruction using training images, Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets, Autoencoders reloaded, Unnamed Item, Unnamed Item, Unnamed Item, Hyperspectral image fusion with a new hybrid regularization, A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure, Geometric mode decomposition, Compressive statistical learning with random feature moments, Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps, A globally convergent algorithm for nonconvex optimization based on block coordinate update, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, Learning rates for least square regressions with coefficient regularization, Non-uniform deblurring for shaken images, An alternating direction and projection algorithm for structure-enforced matrix factorization, Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization, Sparse time-frequency decomposition based on dictionary adaptation, Dictionary Learning for Two-Dimensional Kendall Shapes, Adaptive spatial-spectral dictionary learning for hyperspectral image restoration, Subspace learning by \(\ell^0\)-induced sparsity, Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis, Global Optimality in Separable Dictionary Learning with Applications to the Analysis of Diffusion MRI, Online Schatten quasi-norm minimization for robust principal component analysis, Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting), Penalty methods with stochastic approximation for stochastic nonlinear programming, Estimating networks with jumps, Principal trend analysis for time-course data with applications in genomic medicine, Matrix factorization for evolution data, Smoothing techniques and difference of convex functions algorithms for image reconstructions, An image similarity acceleration detection algorithm based on sparse coding, A tree-based dictionary learning framework, Semisupervised Dictionary Learning with Graph Regularized and Active Points, A semantic tree method for image classification and video action recognition, Sparsity Promoting Hybrid Solvers for Hierarchical Bayesian Inverse Problems, Efficient histogram dictionary learning for text/image modeling and classification, Convergence radius and sample complexity of ITKM algorithms for dictionary learning, Unnamed Item, Unnamed Item, A modified greedy analysis pursuit algorithm for the cosparse analysis model, Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays, Indian buffet process dictionary learning: algorithms and applications to image processing, Stochastic variance reduced gradient methods using a trust-region-like scheme, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, Poisson noise reduction with non-local PCA, 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, Unnamed Item, Data-driven model reduction and transfer operator approximation, Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning, Large-scale hyperspectral image compression via sparse representations based on online learning, Riemannian gradient descent methods for graph-regularized matrix completion, An online incremental orthogonal component analysis method for dimensionality reduction, First- and Second-Order Methods for Online Convolutional Dictionary Learning, A tensor-based dictionary learning approach to tomographic image reconstruction, Geometric component analysis and its applications to data analysis, Lower bounds for matrix factorization, 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, Lower Bounds for Sparse Coding, ADMM for multiaffine constrained optimization, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems, Learning Compositional Representations of Interacting Systems with Restricted Boltzmann Machines: Comparative Study of Lattice Proteins, Compressed dictionary learning, Solving inverse problems using data-driven models, Generalized uniformly optimal methods for nonlinear programming, Optimal dictionary for least squares representation, Higher order Langevin Monte Carlo algorithm, Robust reservoir rock fracture recognition based on a new sparse feature learning and data training method, Unnamed Item, Risk bound of transfer learning using parametric feature mapping and its application to sparse coding, Identifiability of Complete Dictionary Learning, A Theoretical Perspective on Hyperdimensional Computing, Variational texture synthesis with sparsity and spectrum constraints, Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Uses Software
