Optimization of the Sherrington-Kirkpatrick Hamiltonian
Offered By: IEEE via YouTube
Course Description
Overview
Explore the optimization of the Sherrington-Kirkpatrick Hamiltonian in this 23-minute IEEE conference talk by Andrea Montanari. Delve into key concepts such as the Stochastic Block Model, Adjacency Matrix, and the Sherrington-Kirkpatrick Model and Theorem. Examine random graphs, formulas, and assumptions while gaining insights into the geometric interpretation of the problem. Learn about algorithm structures, including two crucial insights on orthogonality and optimization techniques, to enhance your understanding of this complex topic in statistical physics and machine learning.
Syllabus
Introduction
Stochastic Block Model
Adjacency Matrix
SherringtonKirkpatrick Model
SherringtonKirkpatrick
Theorem
Random Graphs
Formula
Assumption
Geometric Interpretation
Algorithm
Algorithms
Algorithm structure
Two insights
Orthogonality
Optimization
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Deep Learning for Natural Language ProcessingUniversity of Oxford via Independent Improving Deep Neural Networks: Hyperparameter Tuning, Regularization and Optimization
DeepLearning.AI via Coursera Deep Learning Part 1 (IITM)
Indian Institute of Technology Madras via Swayam Deep Learning - Part 1
Indian Institute of Technology, Ropar via Swayam Logistic Regression with Python and Numpy
Coursera Project Network via Coursera