Follow
Dmitrii Avdiukhin
Title
Cited by
Cited by
Year
Relaxed parsing of regular approximations of string-embedded languages
E Verbitskaia, S Grigorev, D Avdyukhin
International Andrei Ershov Memorial Conference on Perspectives of System …, 2015
202015
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
142019
Objective-Based Hierarchical Clustering of Deep Embedding Vectors.
S Naumov, G Yaroslavtsev, D Avdiukhin
AAAI, 9055-9063, 2021
122021
Multi-dimensional balanced graph partitioning via projected gradient descent
D Avdiukhin, S Pupyrev, G Yaroslavtsev
arXiv preprint arXiv:1902.03522, 2019
122019
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
122013
“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
112020
Federated learning under arbitrary communication patterns
D Avdiukhin, S Kasiviswanathan
International Conference on Machine Learning, 425-435, 2021
102021
Escaping saddle points with inequality constraints via noisy sticky projected gradient descent
D Avdiukhin, C Jin, G Yaroslavtsev
11th Annual Workshop on Optimization for Machine Learning, 2019
62019
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
42017
Escaping Saddle Points with Compressed SGD
D Avdiukhin, G Yaroslavtsev
Advances in Neural Information Processing Systems 34, 10273-10284, 2021
22021
HOUDINI: Escaping from Moderately Constrained Saddles
D Avdiukhin, G Yaroslavtsev
arXiv preprint arXiv:2205.13753, 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
Bi-directional Adaptive Communication for Heterogenous Distributed Learning
D Avdiukhin, N Ivkin, SU Stich, V Braverman
“Bring Your Own Greedy”+ Max: Near-Optimal/2-Approximations for Submodular Knapsack
G Yaroslavtsev, S Zhou, D Avdiukhin
The system can't perform the operation now. Try again later.
Articles 1–14