
IFML Seminar
IFML Seminar: 09/12/25 - Accelerating Nonconvex Optimization via Online Learning
Abstract: A fundamental problem in optimization is finding an ε-first-order stationary point of a smooth function using only gradient information. The best-known gradient query complexity for this task, assuming both the gradient and Hessian...
Upcoming Events
- September1212:15 - 1:15pm
IFML Seminar
Abstract: A fundamental problem in optimization is finding an ε-first-order stationary point of a smooth function using only gradient information...
- September1912:15 - 1:15pm
IFML Seminar
Abstract: LLMs have not only revolutionized text-based natural language processing, but their multimodal extensions have proven to be extremely powerful...
Past Events
- February2312:15 - 1 pm
IFML Seminar
Abstract: The problem of parallel stochastic convex optimization (SCO) was first formalized by Nemirovski in ’94. In this problem, there...
- February1612:15 - 1 pm
IFML Seminar
Abstract: Foundational large language models, while successful at shorter contexts, struggle to scale to longer context inputs. Preventing performance decay…
- February212:15 - 1 pm
IFML Seminar
Abstract: The Gromov-Wasserstein (GW) distance quantifies dissimilarity between metric measure (mm) spaces and provides a natural correspondence between them…
- January2612:15 - 1 pm
IFML Seminar
Abstract: How can we find and apply the best optimization algorithm for a given problem? This question is as old...
- January262 - 4 pm
Connecting undergraduate and graduate students with machine learning research opportunities across campus.
- January25All day
The University of Texas at Austin is creating one of the most powerful artificial intelligence hubs in the academic world...