Grigory Yaroslavtsev
11 papers · 2018–2024 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (19) 🌍 Conference Polyglot · Silver
🏆
Grand Slam
🗃️
Keyword Collector
(50)
💎
Century Club · Bronze
Top co-authors
Research topics
Keywords
approximation algorithm
(5)
hierarchical clustering
(4)
representation learning
(2)
combinatorial optimization
(2)
metric learning
(2)
learning theory
(2)
contrastive learning
(2)
second-order stationary point
(2)
saddle point
(2)
sample complexity
(2)
constrained optimization
(1)
distributed learning
(1)
stochastic gradient descent
(1)
gradient descent
(1)
communication complexity
(1)
single-linkage clustering
(1)
pac learning
(1)
communication efficiency
(1)
graph partitioning
(1)
gaussian kernel
(1)
Papers
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams
AAAI 2024
Embedding Dimension of Contrastive Learning and k-Nearest Neighbors
NeurIPS 2024
Optimal Sample Complexity of Contrastive Learning
ICLR 2024
HOUDINI: Escaping from Moderately Constrained Saddles
IJCAI 2023
Tree Learning: Optimal Sample Complexity and Algorithms
AAAI 2023
Escaping Saddle Points with Compressed SGD
NeurIPS 2021
Objective-Based Hierarchical Clustering of Deep Embedding Vectors
AAAI 2021
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
AISTATS 2020
“Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack
AISTATS 2020
Hierarchical Clustering for Euclidean Data
AISTATS 2019
Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under ℓ_p Distances
ICML 2018