|
Oral
|
Wed 15:30
|
Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
Matthew Zurek · Yudong Chen
|
|
|
Poster
|
Thu 11:00
|
Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
Alexander Tyurin · Marta Pozzi · Ivan Ilin · Peter Richtarik
|
|
|
Poster
|
Thu 16:30
|
Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
Kaja Gruntkowska · Alexander Tyurin · Peter Richtarik
|
|
|
Poster
|
Wed 16:30
|
Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
Matthew Zurek · Yudong Chen
|
|
|
Oral
|
Wed 15:50
|
The Sample-Communication Complexity Trade-off in Federated Q-Learning
Sudeep Salgia · Yuejie Chi
|
|
|
Poster
|
Wed 16:30
|
The Sample-Communication Complexity Trade-off in Federated Q-Learning
Sudeep Salgia · Yuejie Chi
|
|
|
Workshop
|
Sat 10:45
|
Towards characterizing the value of edge embeddings in Graph Neural Networks
Dhruv Rohatgi · Tanya Marwah · Zachary Lipton · Jianfeng Lu · Ankur Moitra · Andrej Risteski
|
|
|
Workshop
|
|
Towards characterizing the value of edge embeddings in Graph Neural Networks
Dhruv Rohatgi · Tanya Marwah · Zachary Lipton · Jianfeng Lu · Ankur Moitra · Andrej Risteski
|
|
