{"total":36,"rows":[{"id":"2305.15938","title":"First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2311.00465","title":"Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimization","created":"2023-11-01","cited_by_count":11,"area":null},{"id":"2305.02456","title":"Streaming PCA for Markovian Data","created":"2023-05-03","cited_by_count":9,"area":null},{"id":"2404.09536","title":"Noiseless Privacy-Preserving Decentralized Learning","created":"2024-04-15","cited_by_count":9,"area":null},{"id":"2305.05097","title":"Self-Repellent Random Walks on General Graphs -- Achieving Minimal Sampling Variance via Nonlinear Markov Chains","created":"2023-05-08","cited_by_count":8,"area":null},{"id":"2402.07471","title":"Differentially Private Decentralized Learning with Random Walks","created":"2024-02-12","cited_by_count":8,"area":null},{"id":"2305.19259","title":"On Convergence of Incremental Gradient for Non-Convex Smooth Functions","created":"2023-05-30","cited_by_count":7,"area":null},{"id":"2401.09339","title":"Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications","created":"2024-01-17","cited_by_count":7,"area":null},{"id":"2410.12918","title":"Boosting Asynchronous Decentralized Learning with Model Fragmentation","created":"2024-10-16","cited_by_count":6,"area":null},{"id":"2405.19463","title":"Stochastic Optimization Algorithms for Instrumental Variable Regression with Streaming Data","created":"2024-05-29","cited_by_count":4,"area":null},{"id":"2407.20611","title":"The Entrapment Problem in Random Walk Decentralized Learning","created":"2024-07-30","cited_by_count":4,"area":null},{"id":"2410.05690","title":"Long-Context Linear System Identification","created":"2024-10-08","cited_by_count":3,"area":null},{"id":"2501.15259","title":"Scalable Decentralized Learning with Teleportation","created":"2025-01-25","cited_by_count":3,"area":null},{"id":"2508.05663","title":"Random Walk Learning and the Pac-Man Attack","created":"2025-08-01","cited_by_count":3,"area":null},{"id":"2510.19934","title":"Mitigating Privacy-Utility Trade-off in Decentralized Federated Learning via $f$-Differential Privacy","created":"2025-10-22","cited_by_count":3,"area":null},{"id":"2304.13426","title":"FLEX: an Adaptive Exploration Algorithm for Nonlinear Systems","created":"2023-04-26","cited_by_count":2,"area":null},{"id":"2401.09665","title":"Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks","created":"2024-01-18","cited_by_count":2,"area":null},{"id":"2409.17499","title":"Does Worst-Performing Agent Lead the Pack? Analyzing Agent Dynamics in Unified Distributed SGD","created":"2024-09-26","cited_by_count":2,"area":null},{"id":"2601.07674","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","created":"2026-01-12","cited_by_count":2,"area":null},{"id":"2601.16563","title":"Process-Tensor Tomography of SGD: Measuring Non-Markovian Memory via Back-Flow of Distinguishability","created":"2026-01-23","cited_by_count":2,"area":null},{"id":"2603.14514","title":"High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise","created":"2026-03-15","cited_by_count":2,"area":null},{"id":"2410.01209","title":"Debiasing Federated Learning with Correlated Client Participation","created":"2024-10-02","cited_by_count":1,"area":null},{"id":"2505.18300","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","created":"2025-05-23","cited_by_count":1,"area":null},{"id":"2509.13628","title":"Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds","created":"2025-09-17","cited_by_count":1,"area":null},{"id":"2605.10237","title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","created":"2026-05-11","cited_by_count":1,"area":null},{"id":"2609.00078","title":"RW-LoRA: Communication-Efficient Decentralized LoRA Fine-Tuning via Random Walks","created":"2026-08-31","cited_by_count":1,"area":null},{"id":"2401.07694","title":"Stochastic optimization with arbitrary recurrent data sampling","created":"2024-01-15","cited_by_count":0,"area":null},{"id":"2410.08361","title":"Markov Chain Gradient Descent in Hilbert Spaces","created":"2024-10-10","cited_by_count":0,"area":null},{"id":"2502.03551","title":"Gradient Descent Algorithm in Hilbert Spaces under Stationary Markov Chains with $\\phi$- and $\\beta$-Mixing","created":"2025-02-05","cited_by_count":0,"area":null},{"id":"2507.05929","title":"Online Regularized Learning Algorithms in RKHS with $\\beta$- and $\\phi$-Mixing Sequences","created":"2025-07-08","cited_by_count":0,"area":null},{"id":"2601.01160","title":"Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian Stochasticity","created":"2026-01-03","cited_by_count":0,"area":null},{"id":"2604.12260","title":"Decentralized Learning via Random Walk with Jumps","created":"2026-04-14","cited_by_count":0,"area":null},{"id":"2606.26316","title":"High-Probability PL-SGD with Markovian Noise: Optimal Mixing and Tail Dependence","created":"2026-06-24","cited_by_count":0,"area":null},{"id":"2607.06643","title":"The Power of Backdoor Absorption in Community Training","created":"2026-07-07","cited_by_count":0,"area":null},{"id":"2607.25785","title":"Variance-Reduced Conditional Gradient Methods under Markovian Sampling for Nonconvex Composite Optimization","created":"2026-07-28","cited_by_count":0,"area":null},{"id":"2610.14716","title":"Multi-Token Random-Walk Learning via Meeting-Triggered Information Exchange","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}