mlsanityData to 7 Oct 2026

Distributed function estimation: adaptation using minimal communication

arXiv 2003.12838 ↗First posted 28 Mar 2020math.ST stat.ML stat.THcited by 6

Not on the map. Why?

Abstract (arXiv)

We investigate whether in a distributed setting, adaptive estimation of a smooth function at the optimal rate is possible under minimal communication. It turns out that the answer depends on the risk considered and on the number of servers over which the procedure is distributed. We show that for the L_∞-risk, adaptively obtaining optimal rates under minimal communication is not possible. For the L2-risk, it is possible over a range of regularities that depends on the relation between the number of local servers and the total sample size.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Mar 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 1; 2025: 1; 2026: 1.

6 papers.