research
∙
10/30/2022
One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization
Decentralized learning has been studied intensively in recent years moti...
share
research
∙
07/31/2022
Online Decentralized Frank-Wolfe: From theoretical bound to applications in smart-building
The design of decentralized learning algorithms is important in the fast...
research
∙
11/02/2021
Competitive Algorithms for Online Weighted Bipartite Matching and its Variants
Online bipartite matching has been extensively studied. In the unweighte...
research
∙
10/01/2021
Online Primal-Dual Algorithms with Predictions for Packing Problems
The domain of online algorithms with predictions has been extensively st...
research
∙
09/25/2019
Online Non-Monotone DR-submodular Maximization
In this paper, we study problems at the interface of two important field...
research
∙
07/12/2019
Online-Learning for min-max discrete problems
We study various discrete nonlinear combinatorial optimization problems ...
research
∙
05/23/2019
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees
Diminishing-returns (DR) submodular optimization is an important field w...
research
∙
04/23/2018
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
In this paper, we consider the online problem of scheduling independent ...
research
∙
02/28/2018
Online Non-preemptive Scheduling on Unrelated Machines with Rejections
When a computer system schedules jobs there is typically a significant c...
research
∙
08/22/2017
Game Efficiency through Linear Programming Duality
The efficiency of a game is typically quantified by the price of anarchy...
research
∙
08/16/2017
