No article text was recorded for this version.
direct sparsity optimization
Version 1 of 132 papers40 conceptsfrozen 2026-10-04
Papers in this version
- Blog: The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization
- Blog: MobilePrune: Neural Network Compression via ℓ0 Sparse Group Lasso on the Mobile System
- Blog: User-Guided Interpretable Models: Rashomon Effect, Interaction, and Computation
- Blog: Learning as MAP Inference in Discrete Graphical Models
- Blog: A Constructive Approach to $L_0$ Penalized Regression
- Blog: Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoders
- Blog: Interpretable Generalized Additive Models for Datasets with Missing Values
- Blog: Feature subset selection for the multinomial logit model via mixed-integer optimization
- Blog: Preface: special issue of MOA 2018
- Blog: An Efficient Optimization Approach for a Cardinality-Constrained Index Tracking Problem
- Blog: Semi-parametric order-based generalized multivariate regression
- Blog: Zero Norm Least Squares Proximal SVR
- Blog: A Block Decomposition Algorithm for Sparse Optimization
- Blog: Dependence Guided Unsupervised Feature Selection
- Blog: Hard-Thresholding Meets Evolution Strategies in Reinforcement Learning
- Blog: Rejoinder: Sparse Regression: Scalable Algorithms and Empirical Performance
- Blog: A Variational Approach to Sparse Model Error Estimation in Cardiac Electrophysiological Imaging
- Blog: A DC Programming Approach for Sparse Eigenvalue Problem
- Blog: Multi-view Sparse Co-clustering via Proximal Alternating Linearized Minimization
- Blog: Sparse Approximation via Penalty Decomposition Methods
- Blog: Diffusion Compartmentalization Using Response Function Groups with Cardinality Penalization
- Blog: Distributed Inexact Newton-type Pursuit for Non-convex Sparse Learning
- Blog: Structured nonlinear variable selection
- Blog: Grouped variable selection with discrete optimization: Computational and statistical perspectives
- Blog: Boosting Classifiers with Tightened L0-Relaxation Penalties
- Blog: A Novel Integer Linear Programming Approach for Global L0 Minimization
- Blog: Sparse Coding and Counting for Robust Visual Tracking
- Blog: Fast Learning of Multidimensional Hawkes Processes via Frank-Wolfe
- Blog: Sparsified Linear Programming for Zero-Sum Equilibrium Finding
- Blog: Nonconvex Regularization in Remote Sensing
- Blog: Efficient Multi-view Unsupervised Feature Selection with Adaptive Structure Learning and Inference
- Blog: Convolutional Sparse Coding for Time Series Via a ℓ 0 Penalty: An Efficient Algorithm With Statistical Guarantees
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_direct_sparsity_optimization_682efe8c,
title = {direct sparsity optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/direct-sparsity-optimization/rdr_682efe8c34bc4de398155f82859dcacc},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_direct_sparsity_optimization_682efe8c_v1,
title = {direct sparsity optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/direct-sparsity-optimization/rdr_682efe8c34bc4de398155f82859dcacc/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}