arXiv (OAI Expanded)
open access
Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
The ProxSkip algorithm for distributed optimization is gaining increasing attention due to its effectiveness in reducing communication. However, existing analyses of ProxSkip are limited to the strongly convex setting and fail to achieve linear speedup with respect to the number of nodes. Key questi
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
- Nonlinear-Gain Distributed Zeroth-Order Optimization for Networked Black-Box Control#1062908
- Toward Communication-Efficient Space Data Centers: Bottlenecks, Architectures, and New Paradigms#180619
- Stochastic Lanczos Quadrature for Computational Uncertainty in Linear Algebra#996996
- Deterministic Self-Stabilizing BFS Construction in Constant Space#1144716
- OPTIMIZING BACKOFF PROCEDURE FOR ENHANCED THROUGHPUT AND FAIRNESS IN WIRELESS LANs#284562
Record · ID 1083953
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