Discovering Sparse Recovery Algorithms Using Neural Architecture Search
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911338953965568 |
|---|---|
| author | Yubeaton, Patrick Gupta, Sarthak Asif, M. Salman Hegde, Chinmay |
| author_facet | Yubeaton, Patrick Gupta, Sarthak Asif, M. Salman Hegde, Chinmay |
| contents | The design of novel algorithms for solving inverse problems in signal processing is an incredibly difficult, heuristic-driven, and time-consuming task. In this short paper, we the idea of automated algorithm discovery in the signal processing context through meta-learning tools such as Neural Architecture Search (NAS). Specifically, we examine the Iterative Shrinkage Thresholding Algorithm (ISTA) and its accelerated Fast ISTA (FISTA) variant as candidates for algorithm rediscovery. We develop a meta-learning framework which is capable of rediscovering (several key elements of) the two aforementioned algorithms when given a search space of over 50,000 variables. We then show how our framework can apply to various data distributions and algorithms besides ISTA/FISTA. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_21563 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Discovering Sparse Recovery Algorithms Using Neural Architecture Search Yubeaton, Patrick Gupta, Sarthak Asif, M. Salman Hegde, Chinmay Machine Learning The design of novel algorithms for solving inverse problems in signal processing is an incredibly difficult, heuristic-driven, and time-consuming task. In this short paper, we the idea of automated algorithm discovery in the signal processing context through meta-learning tools such as Neural Architecture Search (NAS). Specifically, we examine the Iterative Shrinkage Thresholding Algorithm (ISTA) and its accelerated Fast ISTA (FISTA) variant as candidates for algorithm rediscovery. We develop a meta-learning framework which is capable of rediscovering (several key elements of) the two aforementioned algorithms when given a search space of over 50,000 variables. We then show how our framework can apply to various data distributions and algorithms besides ISTA/FISTA. |
| title | Discovering Sparse Recovery Algorithms Using Neural Architecture Search |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2512.21563 |