{"total":17,"rows":[{"id":"2504.09951","title":"Towards Weaker Variance Assumptions for Stochastic Optimization","created":"2025-04-14","cited_by_count":17,"area":null},{"id":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-10-04","cited_by_count":11,"area":null},{"id":"2411.04845","title":"Asymptotic regularity of a generalised stochastic Halpern scheme","created":"2024-11-07","cited_by_count":5,"area":null},{"id":"2402.05071","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","created":"2024-02-07","cited_by_count":4,"area":null},{"id":"2608.12043","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","created":"2026-08-12","cited_by_count":4,"area":null},{"id":"2607.09097","title":"Solving Stochastic Fixed-Point Equations with High Probability","created":"2026-07-10","cited_by_count":3,"area":null},{"id":"2402.06033","title":"An Inexact Halpern Iteration with Application to Distributionally Robust Optimization","created":"2024-02-08","cited_by_count":2,"area":null},{"id":"2609.08380","title":"How to Make the Gradient Mapping Small for Constrained Stochastic Min-Max Problems and Beyond","created":"2026-09-08","cited_by_count":2,"area":null},{"id":"2608.15966","title":"A Banach-Space Theory of Markovian Halpern Iteration for Non-Expansive Maps","created":"2026-08-16","cited_by_count":1,"area":null},{"id":"2606.21528","title":"Accelerated and Stable Convergence with Anchored Generalized Optimistic Method","created":"2026-06-19","cited_by_count":0,"area":null},{"id":"2608.06182","title":"On Same-Sample and Independent-Sample Stochastic Extragradient for Monotone Variational Inequalities","created":"2026-08-06","cited_by_count":0,"area":null},{"id":"2609.09524","title":"Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.15257","title":"Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2609.26581","title":"Polyak-Type Extragradient Methods for Monotone Root-Finding Problems","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2609.28543","title":"Stochastic Inertial Krasnosel'skii-Mann Iteration Achieves Near-Optimal Sample Complexity","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2609.36033","title":"Dual-Anchor Acceleration Is Near-Optimal for Stochastic Monotone Root-Finding","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.05038","title":"Optimal Oracle Complexity for Finite-Sum Monotone Inclusions","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}