3 papers
cs.IT2026
Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem
Vikrant Malik, Babak Hassibi
Approximate message passing (AMP) provides fast iterative algorithms for high-dimensional signal recovery with Gaussian design matrices, while the Convex Gaussian Min-max Theorem (…
cs.LG2026
Distributionally Robust K-Means Clustering
Vikrant Malik, Taylan Kargin, Babak Hassibi
K-means clustering is a workhorse of unsupervised learning, but it is notoriously brittle to outliers, distribution shifts, and limited sample sizes. Viewing k-means as Lloyd--Max…
math.OC2024
Optimal Infinite-Horizon Mixed Control
Vikrant Malik, Taylan Kargin, Joudi Hajar +1
We study the problem of mixed control in the infinite-horizon setting. We identify the optimal causal controller that minimizes the …