Rescaled ASGD recovers convergence to the true global objective by rescaling worker stepsizes proportional to computation times, matching the known time lower bound in the leading term under non-convex smoothness and bounded heterogeneity.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Second-generation serverless platforms using lightweight isolates and edge deployment achieve roughly 10 ms warm latency and negligible cold starts, according to architecture analysis of seven platforms and microbenchmarks totaling over 38 million function calls.
citing papers explorer
-
Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity
Rescaled ASGD recovers convergence to the true global objective by rescaling worker stepsizes proportional to computation times, matching the known time lower bound in the leading term under non-convex smoothness and bounded heterogeneity.
-
New Kids: An Architecture and Performance Investigation of Second-Generation Serverless Platforms
Second-generation serverless platforms using lightweight isolates and edge deployment achieve roughly 10 ms warm latency and negligible cold starts, according to architecture analysis of seven platforms and microbenchmarks totaling over 38 million function calls.