Metraipolis › archive › dc_215413b985f4
Sparse Experimental Design for Nonsmooth Estimators via Bilevel Optimization — arXiv:2610.01237
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01237
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T12:38:06.127Z
- SHA-256 of the archived text
af0a91c963b831cda9515c6f1ac366b2727c8939e14a8b211755de72d28875f3- Stable URL of this page
https://metraipolis.com/documento/dc_215413b985f4
How to cite
Sparse Experimental Design for Nonsmooth Estimators via Bilevel Optimization — arXiv:2610.01237 — arXiv (en), https://arxiv.org/abs/2610.01237 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_215413b985f4 (Metraipolis archive dc_215413b985f4, sha256 af0a91c963b831cda9515c6f1ac366b2727c8939e14a8b211755de72d28875f3)
BibTeX
@misc{dc215413b985f4,
title = {Sparse Experimental Design for Nonsmooth Estimators via Bilevel Optimization — arXiv:2610.01237},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01237},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_215413b985f4; sha256 af0a91c963b831cda9515c6f1ac366b2727c8939e14a8b211755de72d28875f3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01237. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Optimal experimental design (OED) decides which measurements to acquire for downstream estimation. Classically, this is done by optimizing an information criterion derived from a linear-Gaussian model, for which the estimator is available in closed form. Many modern estimators such as Lasso, elastic net, or total-variation-based estimators, however, are nonsmooth and lack a closed-form solution. To extend OED to these scenarios, we recast the problem as what it implicitly is: a bilevel program whose lower level computes the deployed nonsmooth estimator and whose upper level scores its validation prediction risk. Rather than fixing the number of measurements in advance, we charge each continuous acquisition weight a concave sparsity price. As a result, how many and which measurements to keep are both outcomes of the optimization. A measurement survives only if its estimator-aware value exceeds its price, and progressively increasing the price yields a sequence of designs that explores the trade-off between measurement cardinality and estimation accuracy. Using a value-function penalty reformulation, we develop a single-loop proximal-gradient algorithm that avoids differentiating the nonsmooth solution map and establish its convergence to an (approximate) stationary point. Experiments on synthetic sparse recovery and image reconstruction demonstrate the benefits of the proposed method. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-10-02 in eess.SP). Categorie arXiv: Signal Processing (eess.SP). Pagina del lavoro: https://arxiv.org/abs/2610.01237 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T12:10:56.196Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).