arXiv:2210.00679
High Probability Convergence for Accelerated Stochastic Mirror Descent
원문 초록
In this work, we describe a generic approach to show convergence with high probability for stochastic convex optimization. In previous works, either the convergence is only in expectation or the bound depends on the diameter of the domain. Instead, we show high probability convergence with bounds depending on the initial distance to the optimal solution as opposed to the domain diameter. The algorithms use step sizes analogous to the standard settings and are universal to Lipschitz functions, smooth functions, and their linear combinations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Scaling Laws of Dynamic High-Capacity Ride-Sharing
CUTS+: High-dimensional Causal Discovery from Irregular Time-series
CosmoPower-JAX: high-dimensional Bayesian inference with differentiable cosmological emulators
HumanRF: High-Fidelity Neural Radiance Fields for Humans in Motion
MIReAD: Simple Method for Learning High-quality Representations from Scientific Documents
High-Fidelity 3D Face Generation from Natural Language Descriptions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.