A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
In this talk, I will present a new algorithm for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set K in Rn that is contained in a box of radius R, I will show how to either compute a point in K or prove that K does not contain a ball of radius eps using an expected O(n log(nR/eps)) evaluations of the oracle and additional time O~(n3). This improves upon the O~(n3.373) additional time of the previous fastest algorithm achieved over 25 years ago by Vaidya.
As an example, I will show how to use it to obtain a faster algorithm for the following problems: 1. Submodular Function Minimization 2. Submodular Flow 3. Matroid Intersection 4. Semidefinite Programming
Speaker Details
Yin Tat Lee is a PhD student at MIT, studying theoretical computer science under Professor Jonathan Kelner. His areas of research span convex optimization, linear programming, spectral graph theory and algorithmic graph theory. He is particularly interested in combining convex optimization and combinations techniques to design fast algorithms for fundamental optimization problems, such as linear programs, maxflow, submodular minimization, etc.
- Series:
- Microsoft Research Talks
- Date:
- Speakers:
- Yin-Tat Lee
- Affiliation:
- MIT
-
-
Jeff Running
-
Series: Microsoft Research Talks
-
-
-
-
Galea: The Bridge Between Mixed Reality and Neurotechnology
Speakers:- Eva Esteban,
- Conor Russomanno
-
Current and Future Application of BCIs
Speakers:- Christoph Guger
-
Challenges in Evolving a Successful Database Product (SQL Server) to a Cloud Service (SQL Azure)
Speakers:- Hanuma Kodavalla,
- Phil Bernstein
-
Improving text prediction accuracy using neurophysiology
Speakers:- Sophia Mehdizadeh
-
-
DIABLo: a Deep Individual-Agnostic Binaural Localizer
Speakers:- Shoken Kaneko
-
-
Recent Efforts Towards Efficient And Scalable Neural Waveform Coding
Speakers:- Kai Zhen
-
-
Audio-based Toxic Language Detection
Speakers:- Midia Yousefi
-
-
From SqueezeNet to SqueezeBERT: Developing Efficient Deep Neural Networks
Speakers:- Sujeeth Bharadwaj
-
Hope Speech and Help Speech: Surfacing Positivity Amidst Hate
Speakers:- Monojit Choudhury
-
-
-
-
-
'F' to 'A' on the N.Y. Regents Science Exams: An Overview of the Aristo Project
Speakers:- Peter Clark
-
Checkpointing the Un-checkpointable: the Split-Process Approach for MPI and Formal Verification
Speakers:- Gene Cooperman
-
Learning Structured Models for Safe Robot Control
Speakers:- Ashish Kapoor
-
-