
-
Scalable Bottom-Up Hierarchical Clustering
Bottom-up algorithms such as the classic hierarchical agglomerative clus...
read it
-
Contracts under Moral Hazard and Adverse Selection
In the classical principal-agent problem, a principal must design a cont...
read it
-
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions
The connection between games and no-regret algorithms has been widely st...
read it
-
Big Bird: Transformers for Longer Sequences
Transformers-based models, such as BERT, have been one of the most succe...
read it
-
Dimension-Free Bounds on Chasing Convex Functions
We consider the problem of chasing convex functions, where functions arr...
read it
-
Chasing Convex Bodies with Linear Competitive Ratio
We study the problem of chasing convex bodies online: given a sequence o...
read it
-
Stochastic Online Metric Matching
We study the minimum-cost metric perfect matching problem under online i...
read it
-
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
Semidefinite programming is a powerful tool in the design and analysis o...
read it
-
Fully-Dynamic Bin Packing with Limited Repacking
We consider the bin packing problem in a fully-dynamic setting, where ne...
read it