Dmitrii Avdiukhin
Dmitrii Avdiukhin
Подтвержден адрес электронной почты в домене iu.edu - Главная страница
Название
Процитировано
Процитировано
Год
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
182015
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
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
82019
Multi-dimensional balanced graph partitioning via projected gradient descent
D Avdiukhin, S Pupyrev, G Yaroslavtsev
arXiv preprint arXiv:1902.03522, 2019
72019
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 inequality constraints via noisy sticky projected gradient descent
D Avdiukhin, C Jin, G Yaroslavtsev
Optimization for Machine Learning Workshop, 2019
32019
Objective-Based Hierarchical Clustering of Deep Embedding Vectors
S Naumov, G Yaroslavtsev, D Avdiukhin
arXiv preprint arXiv:2012.08466, 2020
22020
“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
22020
Federated Learning under Arbitrary Communication Patterns
D Avdiukhin, S Kasiviswanathan
International Conference on Machine Learning, 425-435, 2021
12021
Escaping Saddle Points with Compressed SGD
D Avdiukhin, G Yaroslavtsev
arXiv preprint arXiv:2105.10090, 2021
2021
"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
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–13