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

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera