Abstract: Modern machine learning and scientific computing pose optimization challenges of unprecedented scale and complexity, demanding fundamental advances in both theory and algorithmic design for nonconvex optimization. This talk presents recent advances that address these challenges by exploiting matrix and tensor structures, integrating adaptivity, and leveraging sampling techniques. In the first part, I introduce AdaGO, […]

Hunter's theorem ensures that the complete homogeneous symmetric (CHS) polynomials of even degree are positive definite functions.  We provide new proofs of Hunter's theorem, applications to operator theory, and a noncommutative (NC) generalization that sheds light even on the commutative case.  Surprisingly, this work emerged from a problem in analytic combinatorics.

We welcome all undergraduate/graduate students and faculty to attend topology seminar! Speaker: Indraneel Tambe (UCLA) Title: Steinberg skein relations at roots of unity Abstract: This talk discusses some of the relationships between skein theory and the representation theory of quantum sl2 when q is a root of unity. Specifically, I focus on the Frobenius pullback […]

CCMS Colloquium invites you to a talk by Konstantin Zuev (Caltech) Title: Course-Prerequisite Networks Abstract: An academic curriculum is a complex system of courses and their interactions that lies at the heart of an academic institution and underlies its educational mission. Understanding these systems is essential for providing high-quality education. Course-prerequisite networks (CPNs) are directed […]

This GEMS session will be facilitated by Professor Ryan Aschoff from the Claremont Graduate University. Title: Randomness: Creating Order from Chaos Abstract: From the hiss of white noise to the gentle hum of ocean waves, randomness surrounds us — yet hidden within that chaos lies remarkable order. In this talk, we’ll explore how unpredictable events, […]