High-Probability Complexity Bounds for Non-smooth Stochastic Convex Optimization with Heavy-Tailed Noise.

MLA

Gorbunov, Eduard, et al. “High-Probability Complexity Bounds for Non-Smooth Stochastic Convex Optimization with Heavy-Tailed Noise.” Journal of Optimization Theory & Applications, vol. 203, no. 3, Dec. 2024, pp. 2679–738. EBSCOhost, https://doi.org/10.1007/s10957-024-02533-z.

APA

Gorbunov, E., Danilova, M., Shibaev, I., Dvurechensky, P., & Gasnikov, A. (2024). High-Probability Complexity Bounds for Non-smooth Stochastic Convex Optimization with Heavy-Tailed Noise. Journal of Optimization Theory & Applications, 203(3), 2679–2738. https://doi.org/10.1007/s10957-024-02533-z

Chicago

Gorbunov, Eduard, Marina Danilova, Innokentiy Shibaev, Pavel Dvurechensky, and Alexander Gasnikov. 2024. “High-Probability Complexity Bounds for Non-Smooth Stochastic Convex Optimization with Heavy-Tailed Noise.” Journal of Optimization Theory & Applications 203 (3): 2679–2738. doi:10.1007/s10957-024-02533-z.