- About
- Events
- Calendar
- Graduation Information
- Cornell Learning Machines Seminar
- Student Colloquium
- BOOM
- Spring 2025 Colloquium
- Conway-Walker Lecture Series
- Salton 2024 Lecture Series
- Seminars / Lectures
- Big Red Hacks
- Cornell University / Cornell Tech - High School Programming Workshop and Contest 2025
- Game Design Initiative
- CSMore: The Rising Sophomore Summer Program in Computer Science
- Explore CS Research
- ACSU Research Night
- Cornell Junior Theorists' Workshop 2024
- People
- Courses
- Research
- Undergraduate
- M Eng
- MS
- PhD
- Admissions
- Current Students
- Computer Science Graduate Office Hours
- Advising Guide for Research Students
- Business Card Policy
- Cornell Tech
- Curricular Practical Training
- A & B Exam Scheduling Guidelines
- Fellowship Opportunities
- Field of Computer Science Ph.D. Student Handbook
- Graduate TA Handbook
- Field A Exam Summary Form
- Graduate School Forms
- Instructor / TA Application
- Ph.D. Requirements
- Ph.D. Student Financial Support
- Special Committee Selection
- Travel Funding Opportunities
- Travel Reimbursement Guide
- The Outside Minor Requirement
- Diversity and Inclusion
- Graduation Information
- CS Graduate Minor
- Outreach Opportunities
- Parental Accommodation Policy
- Special Masters
- Student Spotlights
- Contact PhD Office
Speaker
Monday, October 21, 2024 - 15:45 to 16:45
Gates 114 and streaming (via Zoom)
Host:
Eshan Chattopadhyay
Categories:
Sampling From Mean-Field Spin Glass Gibbs Measures
Abstract: I will discuss the questions of sampling and finding solutions of a prescribed energy in the mean-field p-spin Gibbs measure. Whether these tasks are efficiently possible is connected to the geometric properties of the measure, which undergoes a sequence of phase transition phenomena as the temperature is changed. I will present the phase diagram and discuss what is supposed to happen in each phase. I will present an efficient sampling algorithm in a large sub-interval of temperatures where this task is believed to be possible, and rule out a large sub-family of algorithms in the complement regime by showing that the Gibbs measure is chaotic in a certain sense.
Bio: Ahmed El Alaoui joined the SDS faculty as an assistant professor in January 2021. He received his PhD in 2018 in Electrical Engineering and Computer Sciences from UC Berkeley, advised by Michael I. Jordan. He was afterwards a postdoctoral researcher at Stanford University, hosted by Andrea Montanari. His research interests revolve around high-dimensional phenomena in statistics and probability theory, statistical physics, algorithms, and problems where these areas meet.