{"total":32,"rows":[{"id":"2504.13173","title":"It's All Connected: A Journey Through Test-Time Memorization, Attentional Bias, Retention, and Online Optimization","created":"2025-04-17","cited_by_count":64,"area":null},{"id":"2208.12345","title":"Light-weight probing of unsupervised representations for Reinforcement Learning","created":"2022-08-25","cited_by_count":15,"area":null},{"id":"2104.12112","title":"Improved Analysis and Rates for Variance Reduction under Without-replacement Sampling Orders","created":"2021-04-25","cited_by_count":13,"area":null},{"id":"2103.11333","title":"ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Method","created":"2021-03-21","cited_by_count":9,"area":null},{"id":"2305.12672","title":"Block Coordinate Plug-and-Play Methods for Blind Inverse Problems","created":"2023-05-22","cited_by_count":8,"area":null},{"id":"2306.05637","title":"On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement Learning","created":"2023-06-09","cited_by_count":8,"area":null},{"id":"2111.13322","title":"Random-reshuffled SARAH does not need a full gradient computations","created":"2021-11-26","cited_by_count":7,"area":null},{"id":"2212.05149","title":"Stochastic Optimization for Spectral Risk Measures","created":"2022-12-10","cited_by_count":7,"area":null},{"id":"2302.03542","title":"Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy","created":"2023-02-07","cited_by_count":7,"area":null},{"id":"2304.11737","title":"Sarah Frank-Wolfe: Methods for Constrained Optimization with Best Rates and Practical Features","created":"2023-04-23","cited_by_count":7,"area":null},{"id":"2311.05589","title":"A Coefficient Makes SVRG Effective","created":"2023-11-09","cited_by_count":7,"area":null},{"id":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","cited_by_count":5,"area":null},{"id":"2202.10640","title":"Convergence of online $k$-means","created":"2022-02-22","cited_by_count":4,"area":null},{"id":"2211.01877","title":"Convex Clustering through MM: An Efficient Algorithm to Perform Hierarchical Clustering","created":"2022-11-03","cited_by_count":4,"area":null},{"id":"2206.10860","title":"Bregman Power k-Means for Clustering Exponential Family Data","created":"2022-06-22","cited_by_count":3,"area":null},{"id":"2405.20127","title":"SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2104.04757","title":"Adversarially-Trained Nonnegative Matrix Factorization","created":"2021-04-10","cited_by_count":2,"area":null},{"id":"2206.11426","title":"On a class of geodesically convex optimization problems solved via Euclidean MM methods","created":"2022-06-22","cited_by_count":1,"area":null},{"id":"2207.14019","title":"Online Inference for Mixture Model of Streaming Graph Signals with Non-White Excitation","created":"2022-07-28","cited_by_count":1,"area":null},{"id":"2210.12277","title":"The Stochastic Proximal Distance Algorithm","created":"2022-10-21","cited_by_count":1,"area":null},{"id":"2207.08195","title":"SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization","created":"2022-07-17","cited_by_count":0,"area":null},{"id":"2208.03811","title":"Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity","created":"2022-08-07","cited_by_count":0,"area":null},{"id":"2210.05994","title":"SARAH-based Variance-reduced Algorithm for Stochastic Finite-sum Cocoercive Variational Inequalities","created":"2022-10-12","cited_by_count":0,"area":null},{"id":"2210.07290","title":"Joint control variate for faster black-box variational inference","created":"2022-10-13","cited_by_count":0,"area":null},{"id":"2211.07375","title":"Reconstruction of gene regulatory network via sparse optimization","created":"2022-11-11","cited_by_count":0,"area":null},{"id":"2304.08051","title":"Accelerated Distributed Aggregative Optimization","created":"2023-04-17","cited_by_count":0,"area":null},{"id":"2311.04158","title":"Computing Approximate $\\ell_p$ Sensitivities","created":"2023-11-07","cited_by_count":0,"area":null},{"id":"2401.07694","title":"Stochastic optimization with arbitrary recurrent data sampling","created":"2024-01-15","cited_by_count":0,"area":null},{"id":"2404.16505","title":"Efficient algorithms for regularized Poisson Non-negative Matrix Factorization","created":"2024-04-25","cited_by_count":0,"area":null},{"id":"2506.12444","title":"Adjusted Shuffling SARAH: Advancing Complexity Analysis via Dynamic Gradient Weighting","created":"2025-06-14","cited_by_count":0,"area":null},{"id":"2602.05304","title":"A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2605.28513","title":"Learning Theory of the SVRG: Generalization and Convergence Analysis","created":"2026-05-27","cited_by_count":0,"area":null}],"next_cursor":null}