Variance-Reduced Q-Learning over Static and Time-Varying Networks
It is proved that such speedups in sample-complexity require only $\tilde O\left( 1 \right)$ communication, substantially improving upon the communication costs in prior work.
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
It is proved that such speedups in sample-complexity require only $\tilde O\left( 1 \right)$ communication, substantially improving upon the communication costs in prior work.
This work proposes Batched SGD, a simple variant that partitions online samples into epochs and performs a single update per epoch using a refined, low-variance gradient estimate, and provides the first high-probability guarantees for FL.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.