YoVDO

Breaking of 1RSB in Random MAX-NAE-SAT

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Theoretical Computer Science Courses Optimization Algorithms Courses

Course Description

Overview

Explore the intricacies of random MAX-NAE-SAT problem-solving in this 19-minute IEEE conference talk. Delve into the solution space, unsatisfied regime, and model analysis as presented by Zsolt Bartha, Nike Sun, and Yumeng Zhang. Examine the Garnet transition, moment bound, free variables, linked variables, and branch rate. Gain insights into previous work in the field and draw valuable conclusions from this comprehensive discussion on breaking 1RSB in random MAX-NAE-SAT.

Syllabus

Intro
Solution space
Unsatisfied regime
Model
Previous work
Garnet transition
moment bound
free variables
linked variables
branch rate
conclusion


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Deep Learning for Natural Language Processing
University 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