From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Introduction to derivative-free optimization, , , , , и . (2009)Superposition of protein structures using electrostatic isopotentials., , , и . BIBM, стр. 75-82. IEEE Computer Society, (2015)High Probability Complexity Bounds for Line Search Based on Stochastic Oracles., , и . NeurIPS, стр. 9193-9203. (2021)Inexact SARAH Algorithm for Stochastic Optimization., , и . CoRR, (2018)Efficient SVM Training Using Low-Rank Kernel Representations., и . J. Mach. Learn. Res., (2001)Stochastic Adaptive Regularization Method with Cubics: a High Probability Complexity Bound., и . WSC, стр. 3520-3531. IEEE, (2023)Map approach to learning sparse Gaussian Markov networks., , , , и . ICASSP, стр. 1721-1724. IEEE, (2009)Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach., и . ECML/PKDD (3), том 6323 из Lecture Notes in Computer Science, стр. 196-212. Springer, (2010)SGD and Hogwild! Convergence Without the Bounded Gradients Assumption., , , , , и . ICML, том 80 из Proceedings of Machine Learning Research, стр. 3747-3755. PMLR, (2018)High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles., , и . SIAM J. Optim., 34 (3): 2411-2439 (2024)