arXiv (OAI Expanded)
open access
Efficient Support Recovery of Mixtures of Sparse Linear Classifiers with Fewer Measurements
The support recovery problem in mixture of linear classifiers aims to identify the features relevant to the underlying decision rules when data is generated by a mixture of several linear decision rules. In particular, the goal is to recover the support (nonzero coordinates) of $l$ unknown $k$-spars
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient Support Recovery of Mixtures of Sparse Linear Classifiers with Less Measurements#1116507
- Robust LassoNet: Enhancing Feature Selection in Neural Networks via Robust Loss Functions#1142864
- Robust blind unmixing: A geometric approach to overcoming basis variation#1199365
- Efficiency and generalization of sparse neural networks#476210
- Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances#1078291
Record · ID 1348962
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive