research
∙
02/09/2023
Tree Learning: Optimal Algorithms and Sample Complexity
We study the problem of learning a hierarchical tree representation of d...
share
research
∙
05/27/2022
HOUDINI: Escaping from Moderately Constrained Saddles
We give the first polynomial time algorithms for escaping from high-dime...
research
∙
05/21/2021
Escaping Saddle Points with Compressed SGD
Stochastic gradient descent (SGD) is a prevalent optimization technique ...
research
∙
12/15/2020
Objective-Based Hierarchical Clustering of Deep Embedding Vectors
We initiate a comprehensive experimental study of objective-based hierar...
research
∙
10/12/2019
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack
The problem of selecting a small-size representative summary of a large ...
research
∙
05/07/2019
Adversarially Robust Submodular Maximization under Knapsack Constraints
We propose the first adversarially robust algorithm for monotone submodu...
research
∙
02/10/2019