Skip to main content
Skip to main menu Skip to spotlight region Skip to secondary region Skip to UGA region Skip to Tertiary region Skip to Quaternary region Skip to unit footer


Antony Joseph

Yale University

We provide theoretical analysis of iterative algorithms for two problems in high-dimensional regression. In the first, a sparse linear model with a specific coefficient structure provides a framework for a problem in communication. We show that the algorithm has optimal performance when compared to information-theoretic limits. This provides theoretically provable, low computational complexity communication systems based on our statistical framework. For the second, we analyze the Orthogonal Matching Pursuit algorithm for the general statistical problem of recovery in high-dimensions. We show that the thresholds of recovery are similar to that shown in recent results on the Lasso. Further, oracle inequalities for estimation under l_2-loss are also demonstrated.

Support us

We appreciate your financial support. Your gift is important to us and helps support critical opportunities for students and faculty alike, including lectures, travel support, and any number of educational events that augment the classroom experience. Click here to learn more about giving.

Every dollar givenĀ has a direct impact upon ourĀ students and faculty.