YoVDO

A Tight Analysis of Bethe Approximation for Permanent

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Mathematics Courses Theoretical Computer Science Courses

Course Description

Overview

Explore a rigorous analysis of the Bethe approximation for permanent in this 23-minute IEEE conference talk. Delve into the problem, its approximation history, and various approximation factors. Learn about better approximation techniques, including the Beta approximation, and understand the distribution on perfect matchings and trees. Examine upper bounds and gain insights into both good and bad approximation methods. Presented by Nima Anari and Alireza Rezaei, this talk provides a comprehensive overview of the topic, from introduction to summary.

Syllabus

Introduction
The Problem
Approximation History
Approximation Factors
Better Approximation
Beta Approximation
Bad Approximation
Distribution on Perfect Matchings
Distribution on Trees
Upper Bounds
Summary


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Introduction to Logic
Stanford University via Coursera
Networked Life
University of Pennsylvania via Coursera
Introduction to Mathematical Thinking
Stanford University via Coursera
Computational Photography
Georgia Institute of Technology via Coursera
Initiation à la théorie des distributions
École Polytechnique via Coursera