-
Scalable Bottom-Up Hierarchical Clustering
Bottom-up algorithms such as the classic hierarchical agglomerative clus...
10/22/2020 ∙ by Nicholas Monath, et al. ∙
9
∙
share
read it
-
Contracts under Moral Hazard and Adverse Selection
In the classical principal-agent problem, a principal must design a cont...
10/14/2020 ∙ by Guru Guruganesh, et al. ∙
0
∙
share
read it
-
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions
The connection between games and no-regret algorithms has been widely st...
09/14/2020 ∙ by Zhe Feng, et al. ∙
0
∙
share
read it
-
Big Bird: Transformers for Longer Sequences
Transformers-based models, such as BERT, have been one of the most succe...
07/28/2020 ∙ by Manzil Zaheer, et al. ∙
72
∙
share
read it
-
Dimension-Free Bounds on Chasing Convex Functions
We consider the problem of chasing convex functions, where functions arr...
05/28/2020 ∙ by C. J. Argue, et al. ∙
0
∙
share
read it
-
Chasing Convex Bodies with Linear Competitive Ratio
We study the problem of chasing convex bodies online: given a sequence o...
05/28/2019 ∙ by C. J. Argue, et al. ∙
0
∙
share
read it
-
Stochastic Online Metric Matching
We study the minimum-cost metric perfect matching problem under online i...
04/19/2019 ∙ by Anupam Gupta, et al. ∙
0
∙
share
read it
-
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
Semidefinite programming is a powerful tool in the design and analysis o...
12/19/2018 ∙ by Sepehr Abbasi-Zadeh, et al. ∙
0
∙
share
read it
-
Fully-Dynamic Bin Packing with Limited Repacking
We consider the bin packing problem in a fully-dynamic setting, where ne...
11/06/2017 ∙ by Anupam Gupta, et al. ∙
0
∙
share
read it
