arXiv (All)
open access
Heavy-Ball Method under Randomized Schedules
We study how predefined randomized parameter schedules accelerate the heavy-ball method on general smooth convex objectives. Our analysis distinguishes two levels of randomization: sampling gradient-evaluation times within intervals whose boundaries are deterministic, and additionally randomizing th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sampling bias corrections for discrete and Gaussian partial information decompositions#1110855
- Delayed Acceptance Slice Sampling#1035365
- Poisson-Corrector Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling#1070083
- Greedy sampling designs via reduced basis methods: optimal recovery in the uniform norm#821603
- Sampling bias corrections for discrete and Gaussian partial information decompositions.#975473
Record · ID 996568
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive