Conference
May 2026
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.
Sreejeet Maity, Feng Zhu, Aritra Mitra et al.
· American Control Conference · 0 citations