Grigory Yaroslavtsev
11 papers · 2018–2024 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
π Cross-Pollinator (15) π§ Keyword Pioneer π£ Hot Topic Early Bird π Conference Polyglot (6) π Academic Marathon (6)
π
Interdisciplinary Bridge
πΊοΈ
Taxonomy Completionist
(19)
π
Grand Slam
π
Century Club
(11)
Conferences
AAAI (3)
AISTATS (3)
NIPS (2)
ICLR (1)
ICML (1)
IJCAI (1)
Top co-authors
Keywords
approximation algorithm
(5)
hierarchical clustering
(4)
second-order stationary point
(2)
combinatorial optimization
(2)
saddle point
(2)
online learning
(1)
metric learning
(1)
learning theory
(1)
distributed learning
(1)
communication complexity
(1)
stochastic gradient descent
(1)
constrained optimization
(1)
gradient descent
(1)
linear programming
(1)
communication efficiency
(1)
pac learning
(1)
graph partitioning
(1)
single-linkage clustering
(1)
pairwise similarity
(1)
gaussian kernel
(1)
Papers
Optimal Sample Complexity of Contrastive Learning
ICLR 2024
Embedding Dimension of Contrastive Learning and $k$-Nearest Neighbors
NIPS 2024
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams
AAAI 2024
HOUDINI: Escaping from Moderately Constrained Saddles
IJCAI 2023
Tree Learning: Optimal Sample Complexity and Algorithms
AAAI 2023
Escaping Saddle Points with Compressed SGD
NIPS 2021
Objective-Based Hierarchical Clustering of Deep Embedding Vectors
AAAI 2021
βBring Your Own Greedyβ+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack
AISTATS 2020
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
AISTATS 2020
Hierarchical Clustering for Euclidean Data
AISTATS 2019
Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under $\ell_p$ Distances
ICML 2018