{"total":14,"rows":[{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31,"area":null},{"id":"2102.07245","title":"Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimization","created":"2021-02-14","cited_by_count":21,"area":null},{"id":"2210.16402","title":"GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity","created":"2022-10-28","cited_by_count":18,"area":null},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14,"area":null},{"id":"2106.03524","title":"Theoretically Better and Numerically Faster Distributed Optimization with Smoothness-Aware Quantization Techniques","created":"2021-06-07","cited_by_count":9,"area":null},{"id":"2306.16484","title":"Towards a Better Theoretical Understanding of Independent Subnetwork Training","created":"2023-06-28","cited_by_count":6,"area":null},{"id":"2105.11818","title":"SGD with Coordinate Sampling: Theory and Practice","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2510.00823","title":"Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2505.13723","title":"Turbocharging Gaussian Process Inference with Approximate Sketch-and-Project","created":"2025-05-19","cited_by_count":3,"area":null},{"id":"2203.03808","title":"A Fast Scale-Invariant Algorithm for Non-negative Least Squares with Non-negative Data","created":"2022-03-08","cited_by_count":2,"area":null},{"id":"2206.00529","title":"Variance Reduction is an Antidote to Byzantines: Better Rates, Weaker Assumptions and Communication Compression as a Cherry on the Top","created":"2022-06-01","cited_by_count":2,"area":null},{"id":"2310.02698","title":"Enhanced Federated Optimization: Adaptive Unbiased Client Sampling with Reduced Variance","created":"2023-10-04","cited_by_count":2,"area":null},{"id":"2602.15996","title":"Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation","created":"2026-02-17","cited_by_count":0,"area":null},{"id":"2605.00740","title":"Randomized Subspace Nesterov Accelerated Gradient","created":"2026-05-01","cited_by_count":0,"area":null}],"next_cursor":null}