Publications (Including workshops)
- ICML 2024
(under review)
- D. Avdiukhin, M. Dinitz, C. Fan, Grigory Yaroslavtsev.
"Approximation Scheme for Weighted Metric Clustering via Sherali-Adams"
- AAAI 2024
-
D. Avdiukhin,
Vaggos Chatziafratis,
Konstantin Makarychev,
G. Yaroslavtsev.
"Approximation Scheme for Metric Kernel Clustering via Sherali-Adams"
- ICLR 2024
-
N. Alon,
D. Avdiukhin,
D. Elboim,
O. Fischer,
G. Yaroslavtsev.
"Optimal Sample Complexity of Contrastive Learning"
- IJCAI 2023
- D. Avdiukhin, and G. Yaroslavtsev.
"HOUDINI: Escaping from Moderately Constrained Saddles"
- AAAI 2023
- D. Avdiukhin,
G. Yaroslavtsev,
D. Vainstein,
O. Fischer,
S. Das, and
F. Mirza.
"Tree Learning: Optimal Algorithms and Sample Complexity"
- OPT 2022
- D. Avdiukhin, and G. Yaroslavtsev.
"HOUDINI: Escaping from Moderately Constrained Saddles"
- OPT 2022
- D. Avdiukhin,
V. Braverman,
N. Ivkin, and
S. U. Stich.
"Bidirectional Adaptive Communication for Heterogeneous Distributed Learning"
- NeurIPS 2021
- D. Avdiukhin., and G. Yaroslavtsev.
"Escaping Saddle Points with Compressed SGD"[paper]
- ICML 2021
- D. Avdiukhin., and S. Kasiviswanathan.
"Federated Learning under Arbitrary Communication Patterns" [paper]
- AAAI 2021
- D. Avdiukhin., S. Naumov, and G. Yaroslavtsev.
"Objective-Based Hierarchical Clustering of Deep Embedding Vectors" [paper]
- OPT 2020
- D. Avdiukhin., and G. Yaroslavtsev. "Escaping Saddle Points with Compressed SGD"
- AISTATS 2020
- G. Yaroslavtsev , S. Zhou, and D. Avdiukhin.
““Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack”
- OPT 2019
- D. Avdiukhin, G. Yaroslavtsev, and C. Jin.
“Escaping Saddle Points with Inequality Constraints via Noisy Sticky Projected Gradient Descent”
- VLDB 2019
- D. Avdiukhin, S. Pupyrev and G. Yaroslavtsev.
“Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent” [paper]
- KDD 2019
- D. Avdiukhin, S. Mitrovic, G. Yaroslavtsev and S. Zhou.
“Adversarially Robust Submodular Maximization under Knapsack Constraints”. Oral presentation, 9.2% acceptance rate.
- INDIN 2017
- D. Avdyukhin, D. Chivilikhin, G. Korneev,
V. Ulyantsev and A. Shalyto.
“Plant trace generation for formal plant model inference: methods and case study”
- Perspectives of System Informatics 2015
- E. Verbitskaia, S. Grigorev and D. Avdyukhin.
“Relaxed Parsing of Regular Approximations of String-Embedded Languages”