| Federated learning under arbitrary communication patterns D Avdiukhin, S Kasiviswanathan International Conference on Machine Learning, 425-435, 2021 | 53 | 2021 |
| Adversarially robust submodular maximization under knapsack constraints D Avdiukhin, S Mitrović, G Yaroslavtsev, S Zhou Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019 | 27 | 2019 |
| Relaxed parsing of regular approximations of string-embedded languages E Verbitskaia, S Grigorev, D Avdyukhin Perspectives of System Informatics: 10th International Andrei Ershov …, 2016 | 23 | 2016 |
| Objective-based hierarchical clustering of deep embedding vectors S Naumov, G Yaroslavtsev, D Avdiukhin Proceedings of the AAAI Conference on Artificial Intelligence 35 (10), 9055-9063, 2021 | 22 | 2021 |
| “bring your own greedy”+ max: near-optimal 1/2-approximations for submodular knapsack G Yaroslavtsev, S Zhou, D Avdiukhin International Conference on Artificial Intelligence and Statistics, 3263-3274, 2020 | 22 | 2020 |
| Multi-dimensional balanced graph partitioning via projected gradient descent D Avdiukhin, S Pupyrev, G Yaroslavtsev arXiv preprint arXiv:1902.03522, 2019 | 19 | 2019 |
| Syntax analyzers development in automated reengineering of informational system. St. Petersburg State Polytechnical University Journal I Kirilenko, S Grigorev, D Avdiukhin Computer Science. Telecommunications and Control Systems 174 (3), 94-98, 2013 | 13 | 2013 |
| Escaping saddle points with inequality constraints via noisy sticky projected gradient descent D Avdiukhin, C Jin, G Yaroslavtsev Optimization for Machine Learning Workshop, 2019 | 9 | 2019 |
| Escaping saddle points with compressed sgd D Avdiukhin, G Yaroslavtsev Advances in Neural Information Processing Systems 34, 10273-10284, 2021 | 7 | 2021 |
| Plant trace generation for formal plant model inference: methods and case study D Avdyukhin, D Chivilikhin, G Korneev, V Ulyantsev, A Shalyto 2017 IEEE 15th International Conference on Industrial Informatics (INDIN …, 2017 | 3 | 2017 |
| Optimal Sample Complexity of Contrastive Learning N Alon, D Avdiukhin, D Elboim, O Fischer, G Yaroslavtsev arXiv preprint arXiv:2312.00379, 2023 | 1 | 2023 |
| Tree learning: optimal sample complexity and algorithms D Avdiukhin, G Yaroslavtsev, D Vainstein, O Fischer, S Das, F Mirza Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 6701-6708, 2023 | 1 | 2023 |
| Bidirectional Adaptive Communication for Heterogeneous Distributed Learning D Avdiukhin, V Braverman, N Ivkin, SU Stich OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop), 2022 | 1 | 2022 |
| HOUDINI: escaping from moderately constrained saddles D Avdiukhin, G Yaroslavtsev arXiv preprint arXiv:2205.13753, 2022 | 1 | 2022 |
| Approximation Scheme for Weighted Metric Clustering via Sherali-Adams D Avdiukhin, V Chatziafratis, K Makarychev, G Yaroslavtsev Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 7926-7934, 2024 | | 2024 |
| Tree Learning: Optimal Algorithms and Sample Complexity D Avdiukhin, G Yaroslavtsev, D Vainstein, O Fischer, S Das, F Mirza arXiv preprint arXiv:2302.04492, 2023 | | 2023 |
| New Directions in Distributed and Constrained Non-convex Optimization D Avdiukhin Indiana University, 2023 | | 2023 |
| Escaping from Moderately Constrained Saddles D Avdiukhin, G Yaroslavtsev OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop), 2022 | | 2022 |
| "Bring Your Own Greedy"+Max: Near-Optimal -Approximations for Submodular Knapsack D Avdiukhin, G Yaroslavtsev, S Zhou arXiv preprint arXiv:1910.05646, 2019 | | 2019 |
| “Bring Your Own Greedy”+ Max: Near-Optimal/2-Approximations for Submodular Knapsack G Yaroslavtsev, S Zhou, D Avdiukhin | | |
