Learning Reductions to Sparse Sets

DOI10.1007/978-3-642-40313-2_23MaRDI QIDQ2849914zbMATH OpenOpenAlexFDO

Authors Harry Buhrman, John M. Hitchcock, Bruno Loff, Lance Fortnow

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_23

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Sparse learning via Boolean relaxations
• On reductions of NP sets to sparse sets
• Sparse sufficient dimension reduction
• Learning the set covering machine by bound minimization and margin-sparsity trade-off
• Learning with Structured Sparsity
• Learning sparse gradients for variable selection and dimension reduction
• A selective overview of sparse sufficient dimension reduction
• Sparse classification: a scalable discrete optimization perspective
• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
• Survey of solving the optimization problems for sparse learning

Cited in

(1)

• Geometric sets of low information content

This page was built for publication: Learning Reductions to Sparse Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849914)