2 citations · 3 across the 9 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
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.IT2024
A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance
Vikrant Malik, Taylan Kargin, Victoria Kostina +1
We consider the rate-distortion function for lossy source compression, as well as the channel capacity for error correction, through the lens of distributional robustness. We assum…