Intersecting singularities for multi-structured estimation

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Conference on Machine Learning

• Publication date

  2013-06-16

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization

  2013cited by this paper
• Joint low-rank and sparse light field modelling for dense multiview data compression

  2013cited by this paper
• Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm

  2013cited by this paper
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

  2012cited by this paper
• Estimation of Simultaneously Sparse and Low Rank Matrices

  2012cited by this paper
• Fused sparsity and robust estimation for linear models with unknown variance

  2012cited by this paper
• Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices

  2012cited by this paper
• Computational and statistical tradeoffs via convex relaxation

  2012cited by this paper
• Convex optimization with sparsity-inducing norms

  2011cited by this paper
• A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging

  2011cited by this paper
• Trace Lasso: a trace norm regularization for correlated designs

  2011influential reference
• Robust Sparse Analysis Regularization

  2011cited by this paper
• The Convex Geometry of Linear Inverse Problems

  2010influential reference
• Fast detection of multiple change-points shared by many signals using group LARS

  2010cited by this paper
• Finding approximately rank-one submatrices with the nuclear norm and l1 norm

  2010cited by this paper
• Nuclear norm penalization and optimal rates for noisy low rank matrix completion

  2010cited by this paper
• User-Friendly Tail Bounds for Sums of Random Matrices

  2010cited by this paper
• Robust principal component analysis?

  2009cited by this paper
• Rank-Sparsity Incoherence for Matrix Decomposition

  2009cited by this paper
• A Direct Formulation for Sparse PCA Using Semidefinite Programming

  2004cited by this paper
• Finding a large hidden clique in a random graph

  1998cited by this paper

• Co-Exploring Structured Sparsification and Low-Rank Tensor Decomposition for Compact DNNs

  2024cites this paper
• CEPD: C O -E XPLORING P RUNING AND D ECOMPOSI - TION FOR C OMPACT DNN M ODELS

  2022cites this paper
• Variable Selection and Task Grouping for Multi-Task Learning

  2018cites this paper
• Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery

  2018cites this paper
• On Representer Theorems and Convex Regularization

  2018cites this paper
• CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction

  2018cites this paper
• A Convex Variational Model for Learning Convolutional Image Atoms from Incomplete Data

  2018cites this paper
• Convex matrix sparsity for demixing with an application to graphical model structure estimation. (Parcimonie matricielle convexe pour les problèmes de démixage avec une application à l'apprentissage de structure de modèles graphiques)

  2018influential citation
• Square Deal : Lower Bounds and Improved Convex Relaxations for Tensor Recovery

  2015cites this paper
• Model Consistency of Partly Smooth Regularizers

  2014influential citation
• Low Complexity Regularization of Linear Inverse Problems

  2014cites this paper
• Interactions between rank and sparsity in penalized estimation, and detection of structured objects

  2014cites this paper
• Tight convex relaxations for sparse matrix factorization

  2014cites this paper
• Interactions entre Rang et Parcimonie en Estimation Pénalisée, et Détection d'Objets Structurés

  2014cites this paper
• Sharp MSE Bounds for Proximal Denoising

  2013cites this paper
• (k, q)-trace norm for sparse matrix factorization

  2013cites this paper
• Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery

  2013cites this paper