Grigory Yaroslavtsev | DeepAI

AI Chat

Featured Co-authors

Samson Zhou
50 publications
Moses Charikar
42 publications
Euiwoong Lee
30 publications
Shachar Lovett
26 publications
Slobodan Mitrović
21 publications
Sergey Pupyrev
20 publications
Rad Niazadeh
19 publications
Alessandro Epasto
18 publications
Vaggos Chatziafratis
17 publications
Konstantin Makarychev
15 publications
Mohammad Mahdian
14 publications

∙ 02/09/2023

Tree Learning: Optimal Algorithms and Sample Complexity

We study the problem of learning a hierarchical tree representation of d...

0 Dmitrii Avdiukhin, et al. ∙

∙ 05/27/2022

HOUDINI: Escaping from Moderately Constrained Saddles

We give the first polynomial time algorithms for escaping from high-dime...

0 Dmitrii Avdiukhin, et al. ∙

∙ 05/21/2021

Escaping Saddle Points with Compressed SGD

Stochastic gradient descent (SGD) is a prevalent optimization technique ...

0 Dmitrii Avdiukhin, et al. ∙

∙ 12/15/2020

Objective-Based Hierarchical Clustering of Deep Embedding Vectors

We initiate a comprehensive experimental study of objective-based hierar...

9 Stanislav Naumov, et al. ∙

∙ 12/15/2019

Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection

Hierarchical Clustering is an unsupervised data analysis method which ha...

0 Sara Ahmadian, et al. ∙

∙ 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...

0 Grigory Yaroslavtsev, et al. ∙

∙ 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 ...

0 Dmitrii Avdiukhin, et al. ∙

∙ 07/01/2019

Approximate F_2-Sketching of Valuation Functions

We study the problem of constructing a linear sketch of minimum dimensio...

0 Grigory Yaroslavtsev, et al. ∙

∙ 05/07/2019

Adversarially Robust Submodular Maximization under Knapsack Constraints

We propose the first adversarially robust algorithm for monotone submodu...

0 Dmitrii Avdiukhin, et al. ∙

∙ 02/10/2019

Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent

Motivated by performance optimization of large-scale graph processing sy...

0 Dmitrii Avdiukhin, et al. ∙

∙ 12/27/2018

Hierarchical Clustering for Euclidean Data

Recent works on Hierarchical Clustering (HC), a well-studied problem in ...

0 Moses Charikar, et al. ∙

∙ 09/24/2018

Optimality of Linear Sketching under Modular Updates

We study the relation between streaming algorithms and linear sketching ...

0 Kaave Hosseini, et al. ∙

∙ 10/04/2017

Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under ℓ_p-Distances

We present massively parallel (MPC) algorithms and hardness of approxima...

0 Grigory Yaroslavtsev, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world