Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows

zbMath1317.68175arXiv1204.4539MaRDI QIDQ2933903

Julien Mairal, Bin Yu

Publication date: 8 December 2014

Full work available at URL: https://arxiv.org/abs/1204.4539

zbMATH Keywords

network flow optimizationconvex and nonconvex optimizationgraph sparsity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Ridge regression; shrinkage estimators (Lasso) (62J07) Learning and adaptive systems in artificial intelligence (68T05) Flows in graphs (05C21)

Related Items (5)

Minimum distance Lasso for robust high-dimensional regression ⋮ Network assisted analysis to reveal the genetic basis of autism ⋮ An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems ⋮ Convex relaxations of penalties for sparse correlated variables with bounded total variation ⋮ Graph-Based Regularization for Regression Problems with Alignment and Highly Correlated Designs

This page was built for publication: Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows