Yury Demidovich

Yury Demidovich

Postdoctoral Fellow, Optimization and Machine Learning Lab, KAUST

Research

I am interested mainly in Machine Learning, Stochastic Optimization, Algorithm Design, Randomized and Distributed Optimization Methods, Federated Learning, Graph Theory and Combinatorics, Probability Theory, Statistics.

Preprints/submitted papers

  1. Y. Demidovich, Y. Panichkin, M. Zhukovskii, “Reconstruction of graph colourings”, Link
  2. I. Sokolov, A. Sadiev, Y. Demidovich, F. Al-Qahtani, P. Richtárik, “Bernoulli-LoRA: A Theoretical Framework for Randomized Low-Rank Adaptation”, Link

Published/accepted papers

  1. A. Panferov, Y. Demidovich, A. Rammal, P. Richtárik, “Correlated quantization for faster nonconvex distributed optimization”, UAI’25 (Oral), Link
  2. Y. Demidovich, P. Ostroukhov, G. Malinovsky, S. Horváth, M. Takáč, P. Richtárik, E. Gorbunov, “Methods with local steps and random reshuffling for generally smooth non-convex federated optimization”, ICLR’25 Link
  3. Y. Demidovich, G. Malinovsky, Egor Shulgin, Peter Richtárik, “MAST: Model-Agnostic Sparsified Training”, ICLR’25 Link
  4. Y. Demidovich, G. Malinovsky, I. Sokolov, Peter Richtárik, “A Guide Through the Zoo of Biased SGD”, NeurIPS’23 Link
  5. Y. Demidovich, A. Skorkin, M. Zhukovskii, “Cycle saturation in random graphs”, SIAM Journal on Discrete Mathematics, 37(3) (2023) Link
  6. Y. Demidovich, M. Zhukovskii, “Tight asymptotics of clique-chromatic numbers of dense random graphs”, Journal of Graph Theory, 103(3), 451-461 (2023) Link
  7. L. Prokhorenkova-Ostroumova, N. Bogachev, D. Baranchuk, Y. Demidovich, A. Kolpakov, “Graph-Based Nearest Neighbor Search in Hyperbolic Spaces”, ICLR’2022 Link
  8. Yu.A. Demidovich, D.A. Shabanov, “On Two Limit Values of the Chromatic Number of a Random Hypergraph”, Theory of Probability & Its Applications, 67(2) (2022) Link
  9. Y. Demidovich, “New lower bound for the minimal number of edges of simple uniform hypergraph without the property $B_k$”, Discrete Mathematics and Applications, 32(3), 155-176 (2022) Link
  10. Y. Demidovich, “On some generalizations of property $B$-problem of an $n$-uniform hypergraph”, Journal of Mathematical Sciences, 262, 457–475 (2022) Link
  11. Y. Demidovich, M. Zhukovskii, “Cycle saturation in random graphs”, Extended Abstracts EuroComb 2021, Birkhauser, Cham, 811-816 Link
  12. Y.A. Demidovich, D.A. Shabanov, “On the Chromatic Number of a Random 3-Uniform Hypergraph:, Recent Developments in Stochastic Methods and Applications. ICSM-5 2020. Springer Proceedings in Mathematics & Statistics, 371, Springer, Cham. (2021) Link
  13. Yu.A. Demidovich, M.E. Zhukovskii, “Chromatic Numbers of Distance Graphs without Short Odd Cycles in Rational Spaces”, Math. Notes, 109(5) (2021), 727–734 Link
  14. Y. Demidovich, D. Shabanov, “On the Chromatic Numbers of Random Hypergraphs”, Doklady Mathematics, 102, 380–383 (2020) Link
  15. Yu.A. Demidovich, “2-Colorings of Hypergraphs with Large Girth”, Math. Notes, 108(2) (2020), 188–200 Link
  16. Yu.A. Demidovich, “Distance Graphs with Large Chromatic Number and without Cliques of Given Size in the Rational Space”, Math. Notes, 106(1) (2019), 38–51 Link
  17. Yu.A. Demidovich, “Lower Bound for the Chromatic Number of a Rational Space with Metric $\ell_u$ and with One Forbidden Distance”, Math. Notes, 102(4) (2017), 492–507 Link
  18. Yu.A. Demidovich, A.M. Raigorodskii, “2-Colorings of Uniform Hypergraphs”, Math. Notes, 100(4) (2016), 629–632 Link