IDEAS

The remarkable recent success of Machine Learning (ML) is driven by our ability to develop and deploy interactive models that can solve complicated tasks by understanding and adapting to the ever-changing state of the world. However, the development of such models demands significant data and computing resources. Moreover, as these models increasingly interact with humans, […]

Zoom link https://upenn.zoom.us/j/98220304722   Abstract We present computational tools for analyzing and designing first-order methods in parametric convex optimization. These methods are popular for their low per-iteration cost and warm-starting capabilities. However, precisely quantifying the number of iterations required to compute high-quality solutions remains a key challenge, especially in real-time applications. First, we introduce a […]

Zoom link: https://upenn.zoom.us/j/98220304722 Abstract: Modern ML models produce valuable predictions across various applications, influencing people’s lives, opportunities, and scientific advancements. However, these systems can fail in unexpected ways, generating unreliable inferences and perpetuating biases present in the data. These issues are particularly troubling in high-stakes applications, where models are trained on increasingly diverse, incomplete, and […]

Zoom link: https://upenn.zoom.us/j/98220304722 Abstract: We study the generalization properties of neural networks through the lens of data complexity.  Recent work by Buzaglo et al. (2024) shows that random (nearly) interpolating networks generalize, provided there is a small ``teacher'' network that achieves small excess risk. We give a short single-sample PAC-Bayes proof of this result and […]