How the Experts Algorithm Can Help Solve LPs Online Marco Molinaro TU Delft Anupam Gupta Carnegie Mellon University.

Slides:

Advertisements

Similar presentations

Iterative Rounding and Iterative Relaxation

Advertisements

Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.

Primal Dual Combinatorial Algorithms Qihui Zhu May 11, 2009.

Submodular Set Function Maximization via the Multilinear Relaxation & Dependent Rounding Chandra Chekuri Univ. of Illinois, Urbana-Champaign.

Incremental Linear Programming Linear programming involves finding a solution to the constraints, one that maximizes the given linear function of variables.

C&O 355 Lecture 23 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.

1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.

Randomized Sensing in Adversarial Environments Andreas Krause Joint work with Daniel Golovin and Alex Roper International Joint Conference on Artificial.

A Simple Distribution- Free Approach to the Max k-Armed Bandit Problem Matthew Streeter and Stephen Smith Carnegie Mellon University.

Auction Algorithms for Market Equilibrium Rahul Garg IBM India Research Sanjiv Kapoor Illionis Institute of Technology.

1 Online and Stochastic Survivable Network Design Ravishankar Krishnaswamy Carnegie Mellon University joint work with Anupam Gupta and R. Ravi.

Distributed Association Control in Shared Wireless Networks Krishna C. Garikipati and Kang G. Shin University of Michigan-Ann Arbor.

Instructor Neelima Gupta Table of Contents Lp –rounding Dual Fitting LP-Duality.

1 Approximation Algorithms for Demand- Robust and Stochastic Min-Cut Problems Vineet Goyal Carnegie Mellon University Based on, [Golovin, G, Ravi] (STACS’06)

Introduction to Linear and Integer Programming Lecture 7: Feb 1.

Dual Problem of Linear Program subject to Primal LP Dual LP subject to ※ All duality theorems hold and work perfectly!

A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.

Approximation Algorithms

Shuchi Chawla, Carnegie Mellon University Static Optimality and Dynamic Search Optimality in Lists and Trees Avrim Blum Shuchi Chawla Adam Kalai 1/6/2002.

Online Oblivious Routing Nikhil Bansal, Avrim Blum, Shuchi Chawla & Adam Meyerson Carnegie Mellon University 6/7/2003.

On Stochastic Minimum Spanning Trees Kedar Dhamdhere Computer Science Department Joint work with: Mohit Singh, R. Ravi (IPCO 05)

Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.

1 Introduction to Approximation Algorithms Lecture 15: Mar 5.

Approximation Algorithms: Bristol Summer School 2008 Seffi Naor Computer Science Dept. Technion Haifa, Israel TexPoint fonts used in EMF. Read the TexPoint.

Commitment without Regrets: Online Learning in Stackelberg Security Games Nika Haghtalab Carnegie Mellon University Joint work with Maria-Florina Balcan,

Course: Advanced Algorithms CSG713, Fall 2008 CCIS Department, Northeastern University Dimitrios Kanoulas.

1/24 Algorithms for Generalized Caching Nikhil Bansal IBM Research Niv Buchbinder Open Univ. Israel Seffi Naor Technion.

Approximation Algorithms for Stochastic Combinatorial Optimization Part I: Multistage problems Anupam Gupta Carnegie Mellon University.

Online Oblivious Routing Nikhil Bansal, Avrim Blum, Shuchi Chawla & Adam Meyerson Carnegie Mellon University 6/7/2003.

Geometry of Online Packing Linear Programs Marco Molinaro and R. Ravi Carnegie Mellon University.

C&O 355 Mathematical Programming Fall 2010 Lecture 4 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.

1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.

An Approximation Algorithm for Binary Searching in Trees Marco Molinaro Carnegie Mellon University joint work with Eduardo Laber (PUC-Rio)

Approximation Algorithms Department of Mathematics and Computer Science Drexel University.

Stochastic Multicast with Network Coding Ajay Gopinathan, Zongpeng Li Department of Computer Science University of Calgary ICDCS 2009, June , Montreal.

Online Social Networks and Media

A Membrane Algorithm for the Min Storage problem Dipartimento di Informatica, Sistemistica e Comunicazione Università degli Studi di Milano – Bicocca WMC.

How the Experts Algorithm Can Help Solve LPs Online Marco Molinaro TU Delft Anupam Gupta Carnegie Mellon University.

Linear Program Set Cover. Given a universe U of n elements, a collection of subsets of U, S = {S 1,…, S k }, and a cost function c: S → Q +. Find a minimum.

Sparse Cutting-Planes Marco Molinaro TU Delft Santanu Dey, Andres Iroume Georgia Tech.

Linear Programming Maximize Subject to Worst case polynomial time algorithms for linear programming 1.The ellipsoid algorithm (Khachian, 1979) 2.Interior.

Lecture.6. Table of Contents Lp –rounding Dual Fitting LP-Duality.

Stochastic Optimization is (almost) as easy as Deterministic Optimization Chaitanya Swamy Joint work with David Shmoys done while at Cornell University.

1 Approximation Algorithms for Generalized Min-Sum Set Cover Ravishankar Krishnaswamy Carnegie Mellon University joint work with Nikhil Bansal and Anupam.

Linear Programming: Formulations, Geometry and Simplex Method Yi Zhang January 21 th, 2010.

Lecture notes for Stat 231: Pattern Recognition and Machine Learning 1. Stat 231. A.L. Yuille. Fall 2004 Linear Separation and Margins. Non-Separable and.

1 Approximation Algorithms for Generalized Scheduling Problems Ravishankar Krishnaswamy Carnegie Mellon University joint work with Nikhil Bansal, Anupam.

Instructor: Shengyu Zhang 1. Offline algorithms Almost all algorithms we encountered in this course assume that the entire input is given all at once.

The minimum cost flow problem. Solving the minimum cost flow problem.

Approximation Algorithms based on linear programming.

Unconstrained Submodular Maximization Moran Feldman The Open University of Israel Based On Maximizing Non-monotone Submodular Functions. Uriel Feige, Vahab.

Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.

Data Driven Resource Allocation for Distributed Learning

Market Equilibrium Ruta Mehta.

Moran Feldman The Open University of Israel

The minimum cost flow problem

Balancing Weather Risk and Crop Yield for Soybean Variety Selection

Maximum Matching in the Online Batch-Arrival Model

Static Optimality and Dynamic Search Optimality in Lists and Trees

Combinatorial Optimization Under Uncertainty

The Price of information in combinatorial optimization

Bin Fu Department of Computer Science

Dynamic and Online Algorithms for Set Cover

Estimating Networks With Jumps

(22nd August, 2018) Sahil Singla

The Byzantine Secretary Problem

On Approximating Covering Integer Programs

Online Algorithms via Projections set cover, paging, k-server

the k-cut problem better approximate and exact algorithms

Non-clairvoyant Precedence Constrained Scheduling

Presentation transcript:

How the Experts Algorithm Can Help Solve LPs Online Marco Molinaro TU Delft Anupam Gupta Carnegie Mellon University

Applications: (optimal) gen load-balancing, packing/covering LPs Primal-dual algo for online random order problems using black-box online learning to compute duals

GENERALIZED LOAD-BALANCING … 0

GENERALIZED LOAD-BALANCING Random permutation model + +…

GENERALIZED LOAD-BALANCING

Primal-dual, using black-box online linear optimization for dual Abstracts exponential update of Devanur et al., explains why works Abstraction allow us handle dependencies in random permutation GENERALIZED LOAD-BALANCING

ALGORITHM

Online linear optimization

ONLINE LINEAR OPTIMIZATION

ALGORITHM

ANALYSIS (1/3) (dual) guarantee of online lin optimization (primal) greedy wrt duals

ANALYSIS (2/3) Uses a maximal Bernstein inequality to take care of all time steps in iid

ANALYSIS (3/3)

ONLINE PACKING/COVERING LP

Optimal guarantee for packing (indep Kesselheim et al. 14, Devanur-Agrawal 15) First general result for packing/covering (but requires technical assump)

Idea: reduce online LP to gen load-balancing Elements – Handle slightly negative loads in gen load balancing (well-bounded instances) – Simple reduction to gen load balancing assuming knows OPT – Estimate OPT: pick out very valuable items, sampling + chernoff on rest Cannot “scale down” solution to get feasibility – Crucially used in Kesselheim et al. 14, Devanur-Agrawal 15… ONLINE PACKING/COVERING LP

Solving random order problems using duals from black-box online linear optimization Clean abstraction, allows to handle dependencies in random perm. – Separates “optimization” and “probability” parts Applications – Generalized load-balancing – (optimal) guarantees for packing/covering LPs Open questions 1.Seems very flexible. Apply techniques to other problems? 2.More general, realistic models 3.Remove technical assumption in packing/covering, or prove LB (minimax?) CONCLUSION

THANK YOU!