February 10, 2021
Suhas Vijaykumar (MIT Sloan)
Offset Rademacher complexities have been shown to imply sharp, data-dependent upper bounds for the square loss in a broad class of problems including improper statistical learning and online learning. We show that in the statistical setting, the...
February 17, 2021
Farzan Farnia (LIDS)
Generative adversarial networks (GANs) learn the distribution of observed samples through a zero-sum game between two machine players, a generator and a discriminator. While GANs achieve great success in learning the complex distribution of image...
February 24, 2021
Shuvomoy Das Gupta (ORC)
We present the nonconvex exterior-point operator splitting algorithm (NExOS), a novel linearly convergent first-order algorithm tailored for constrained nonconvex learning problems. We consider the problem of minimizing a convex cost function over a...
March 3, 2021
Raj Agrawal (CSAIL)
Many real-world decision-making tasks require learning causal relationships between a set of variables. Typical causal discovery methods, however, require that all variables are observed, which might not be realistic in practice. Unfortunately, in...
March 10, 2021
James Siderius (EECS)
March 17, 2021
Ryan Cory-Wright (ORC)
March 24, 2021
Heng Yang (LIDS)
March 31, 2021
Andreas Alexander Haupt (IDSS / LIDS)
April 7, 2021
Jason Altschuler (EECS / LIDS)
April 14, 2021
Manon Revel (IDSS / LIDS)
April 21, 2021
Vishrant Tripathi (EECS / LIDS)
April 28, 2021
Xiaoyue Gong (ORC)
May 5, 2021
Sarah Cen (LIDS)
May 12, 2021
Ifueko Nosakhare Igbinedion (EECS / LIDS)
May 19, 2021
Ruihao Zhu ( IDSS / LIDS)
May 26, 2021
Eren Can Kizildag (LIDS)
