No article text was recorded for this version.
decomposable norm regularization
Version 1 of 125 papers32 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
- Blog: On model selection consistency of penalized M-estimators: a geometric theory
- Blog: Regularized EM Algorithms: A Unified Framework and Statistical Guarantees
- Blog: Simulated Data for Linear Regression with Structured and Sparse Penalties: Introducing <b>pylearn-simulate</b>
- Blog: A variational approach to stable principal component pursuit
- Blog: Decomposable norm minimization with proximal-gradient homotopy algorithm
- Blog: A Simple Unified Framework for High Dimensional Bandit Problems
- Blog: Simple bounds for recovering low-complexity models
- Blog: Elementary Estimators for Sparse Covariance Matrices and other Structured Moments
- Blog: Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Sets
- Blog: A Unified Framework for Sparse Relaxed Regularized Regression: SR3
- Blog: Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
- Blog: Multi-Layer Feature Reduction for Tree Structured Group Lasso via Hierarchical Projection
- Blog: A Simple Unified Framework for High Dimensional Bandit Problems
- Blog: A Universal Analysis of Large-Scale Regularized Least Squares Solutions
- Blog: Exponential Family Matrix Completion under Structural Constraints
- Blog: Convex relaxations of penalties for sparse correlated variables with bounded total variation
- Blog: A Unifying Representer Theorem for Inverse Problems and Machine Learning
- Blog: Structured Low-Rank Matrix Factorization: Global Optimality, Algorithms, and Applications
- Blog: Generalized Dantzig Selector: Application to the k-support norm
- Blog: Structured Low-Rank Matrix Factorization: Optimality, Algorithm, and Applications to Image Processing
- Blog: Nonconvex Theory of $M$-estimators with Decomposable Regularizers
- Blog: Constant Nullspace Strong Convexity and Fast Convergence of Proximal Methods under High-Dimensional Settings
- Blog: Greedy Algorithms for Structurally Constrained High Dimensional Problems
- Blog: Precise Phase Transition of Total Variation Minimization
History & citation
Current · Permanent link
- This direction split from Unified High Dimensional Analysis with Decomposable Regularizers (72% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_decomposable_norm_regularization_17e924fb,
title = {decomposable norm regularization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/decomposable-norm-regularization/rdr_17e924fbc7ab4069b0898be756aceeb9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_decomposable_norm_regularization_17e924fb_v1,
title = {decomposable norm regularization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/decomposable-norm-regularization/rdr_17e924fbc7ab4069b0898be756aceeb9/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}