Predicting Satisfiability at the Phase Transition via End-to-End Learning

Channel:

Subscribers:

68,700

Published on April 29, 2021 3:04:27 AM ● Video Link: https://www.youtube.com/watch?v=OoHMRhPXunw

Duration: 44:19

295 views

Kevin Leyton Brown (University of British Columbia)
https://simons.berkeley.edu/talks/predicting-satisfiability-phase-transition-end-end-learning
Theoretical Foundations of SAT/SMT Solving

Other Videos By Simons Institute for the Theory of Computing

2021-05-03	Data-Driven Synthesis of a Provably Sound Side-Channel Analysis
2021-05-03	Synthesizing Network Configuration Updates
2021-04-30	Computational Aspects of Equilibria and Fixed Points
2021-04-30	Data Privacy \| Polylogues
2021-04-29	Symmetric Properties and Boolean Complexity
2021-04-29	Constraint Satisfaction and Expansion
2021-04-29	Theoretically Speaking — Market Design through the Lens of Approximation
2021-04-28	Learning to Solve SMT Formulas
2021-04-28	Extensions of CDCL Branching Heuristics by Exploration during Conflict Depression
2021-04-28	Learning to Schedule Heuristics in Branch and Bound
2021-04-28	Predicting Satisfiability at the Phase Transition via End-to-End Learning
2021-04-28	Can the PvsNP Question Be Independent of the Axioms of Mathematical Reasoning?
2021-04-28	TAUT, TFNP and SAT
2021-04-28	P, NP and Proof Complexity
2021-04-28	Panel Discussion on Quantum Benchmarking \| Quantum Colloquium
2021-04-28	Classical Shadows of Quantum States \| Quantum Colloquium
2021-04-27	Quantified Boolean Formulas
2021-04-27	A Finite-Model-Theoretic View on Propositional Proof Complexity
2021-04-27	Reasoning Systems from Descriptive Complexity
2021-04-27	Past and Present of Descriptive Complexity Theory
2021-04-26	Provably Correct Training of Neural Network Controllers

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Kevin Leyton Brown

Theoretical Foundations of SAT/SMT Solving