Federated learning under arbitrary communication patterns D Avdiukhin, S Kasiviswanathan
International Conference on Machine Learning, 425-435, 2021
26 2021 Relaxed parsing of regular approximations of string-embedded languages E Verbitskaia, S Grigorev, D Avdyukhin
Perspectives of System Informatics: 10th International Andrei Ershov …, 2016
21 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
18 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
18 2019 Multi-dimensional balanced graph partitioning via projected gradient descent D Avdiukhin, S Pupyrev, G Yaroslavtsev
arXiv preprint arXiv:1902.03522, 2019
15 2019 “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
14 2020 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
12 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
6 2019 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
4 2017 Escaping saddle points with compressed sgd D Avdiukhin, G Yaroslavtsev
Advances in Neural Information Processing Systems 34, 10273-10284, 2021
2 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 (AISTATS), 2020
1 2020 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 HOUDINI: Escaping from Moderately Constrained Saddles D Avdiukhin, G Yaroslavtsev
arXiv preprint arXiv:2205.13753, 2022
2022 "Bring Your Own Greedy"+Max: Near-Optimal D Avdiukhin, G Yaroslavtsev, S Zhou
arXiv preprint arXiv:1910.05646, 2019
2019 Escaping from Moderately Constrained Saddles D Avdiukhin, G Yaroslavtsev
OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop), 0
Bidirectional Adaptive Communication for Heterogeneous Distributed Learning D Avdiukhin, V Braverman, N Ivkin, SU Stich
OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop), 0
