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
∙
12/15/2019
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
Hierarchical Clustering is an unsupervised data analysis method which ha...
research
∙
10/13/2019
Fast Fourier Sparsity Testing
A function f : F_2^n →R is s-sparse if it has at most s non-zero Fourier...
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
∙
07/01/2019
Approximate F_2-Sketching of Valuation Functions
We study the problem of constructing a linear sketch of minimum dimensio...
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
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent
Motivated by performance optimization of large-scale graph processing sy...
research
∙
12/27/2018
Hierarchical Clustering for Euclidean Data
Recent works on Hierarchical Clustering (HC), a well-studied problem in ...
research
∙
09/24/2018
Optimality of Linear Sketching under Modular Updates
We study the relation between streaming algorithms and linear sketching ...
research
∙
10/04/2017