Research map / Learning theory and algorithms / Combinatorial and search optimization
Learning Sparse Group Models Through Boolean Relaxation
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Selective inference for group-sparse linear models (NeurIPS 2016 · similarity 0.87)
- Structured Sparse Regression via Greedy Hard Thresholding (NeurIPS 2016 · similarity 0.87)
- GAP Safe Screening Rules for Sparse-Group Lasso (NeurIPS 2016 · similarity 0.86)
- Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity (ICML 2025 · similarity 0.86)
- Group Distributionally Robust Optimization with Flexible Sample Queries (NeurIPS 2026 · similarity 0.84)
- Group Distributionally Robust Dataset Distillation with Risk Minimization (ICLR 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.