82 citations · 83 across the 2 of their papers we have counts for
2 papers
cs.LG2022★ 1 cited
On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds
Ming Jin, Vanshaj Khattar, Harshal Kaushik +2
We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of…
eess.SP2021★ 82 cited
Unitary Approximate Message Passing for Sparse Bayesian Learning
Man Luo, Qinghua Guo, Ming Jin +4
Sparse Bayesian learning (SBL) can be implemented with low complexity based on the approximate message passing (AMP) algorithm. However, it does not work well for a generic measure…