Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes

DOI10.1287/moor.2023.1356MaRDI QIDQ6189906

Unnamed Author, Laurent El Ghaoui, Alexandre d'Aspremont

Publication date: 5 March 2024

Published in: Mathematics of Operations Research (Search for Journal in Brave)

zbMATH Keywords

nonconvex optimizationFenchel dualitysparsityShapley-Folkman theoremLagrangian duality

Mathematics Subject Classification ID

Convex programming (90C25) Statistical ranking and selection procedures (62F07)

This page was built for publication: Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes