Andre Wibisono, Yale University Abstract: Sampling is a fundamental algorithmic task with many connections to optimization. In this talk, we survey a recent algorithm for sampling known as the Proximal Sampler, which can be seen as a proximal discretization of the continuous-time Langevin dynamics, and achieves the current state-of-the-art iteration complexity for sampling in discrete […]
Sahil Rajesh Dhayalkar, Brain Corporation Abstract: Autonomous navigation in dynamic environments faces immense challenges. Traditional rigid, rules-based systems often fail due to a lack of semantic understanding needed to adapt to continuous environmental shifts. Conversely, emerging end-to-end Vision-Language-Action (VLA) models introduce a critical "black box" dilemma; they inherently lack the explicit application context, deterministic guardrails, […]
Ellen Vitercik, Stanford University Abstract: Many of the most important optimization problems in practice are massive in scale, mathematically complex, and involve numerous unknown parameters. Machine learning offers a powerful way to address these challenges by uncovering hidden structure across problem instances, but integrating predictions into algorithms raises fundamental questions: which architectures align with combinatorial […]
Tengyu Ma, Stanford University Abstract: I will discuss RL algorithms for automated theorem proving with LLMs, especially in the possible future regime where we run out of high-quality training data. To keep improving the models with limited data, we draw inspiration from mathematicians, who continuously develop new results, partly by proposing novel conjectures or exercises […]
Tianyi Lin, Columbia University Direct alignment methods are increasingly used for aligning large language models (LLMs) with human preferences. However, these methods suffer from the likelihood displacement, which can be driven by noisy preference pairs that induce similar likelihood for preferred and dis-preferred responses. To address this issue, we consider doing derivative-free optimization based on […]
Nigel Goldenfeld, UC San Diego Department of Physics and HDSI Abstract: The remarkable ability of modern neural networks to generalize improves with increasing network capacity, even when the number of model parameters or effective degrees of freedom exceeds the number of training data points. This phenomenon is all the more surprising given that generalization error […]
Andrej Risteski, Carnegie Mellon University Abstract: Modern AI systems are increasingly built by placing trained models inside larger computational loops. Inference-time algorithms are a basic instance of this idea: they use one or more trained models at test time to incorporate new information, exploit pretrained models as priors, and trade computational effort for accuracy, sample […]
