{"total":78,"rows":[{"id":"2107.07467","title":"Only Train Once: A One-Shot Neural Network Training And Pruning Framework","created":"2021-07-15","cited_by_count":70,"area":null},{"id":"2110.14074","title":"Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee","created":"2021-10-26","cited_by_count":54,"area":null},{"id":"2303.06862","title":"OTOV2: Automatic, Generic, User-Friendly","created":"2023-03-13","cited_by_count":32,"area":null},{"id":"2205.13891","title":"Transformers from an Optimization Perspective","created":"2022-05-27","cited_by_count":27,"area":null},{"id":"2102.07158","title":"Distributed Second Order Methods with Fast Rates and Compressed Communication","created":"2021-02-14","cited_by_count":25,"area":null},{"id":"2402.05468","title":"Implicit Diffusion: Efficient Optimization through Stochastic Sampling","created":"2024-02-08","cited_by_count":24,"area":null},{"id":"2204.13170","title":"AdaBest: Minimizing Client Drift in Federated Learning via Adaptive Bias Estimation","created":"2022-04-27","cited_by_count":21,"area":null},{"id":"2206.00737","title":"Walk for Learning: A Random Walk Approach for Federated Learning from Heterogeneous Data","created":"2022-06-01","cited_by_count":19,"area":null},{"id":"2112.13109","title":"Accelerated and instance-optimal policy evaluation with linear function approximation","created":"2021-12-24","cited_by_count":18,"area":null},{"id":"2109.04522","title":"Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees","created":"2021-09-09","cited_by_count":17,"area":null},{"id":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","cited_by_count":17,"area":null},{"id":"2106.03056","title":"MURANA: A Generic Framework for Stochastic Variance-Reduced Optimization","created":"2021-06-06","cited_by_count":14,"area":null},{"id":"2208.06058","title":"An Accelerated Doubly Stochastic Gradient Method with Faster Explicit Model Identification","created":"2022-08-11","cited_by_count":14,"area":null},{"id":"2102.09026","title":"Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm","created":"2021-02-17","cited_by_count":13,"area":null},{"id":"2304.07504","title":"Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysis","created":"2023-04-15","cited_by_count":11,"area":null},{"id":"2305.17581","title":"Knowledge Distillation Performs Partial Variance Reduction","created":"2023-05-27","cited_by_count":11,"area":"distill"},{"id":"2403.03562","title":"Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond","created":"2024-03-06","cited_by_count":11,"area":null},{"id":"2110.11688","title":"Differentially Private Coordinate Descent for Composite Empirical Risk Minimization","created":"2021-10-22","cited_by_count":10,"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":"2202.02491","title":"Distributed Learning With Sparsified Gradient Differences","created":"2022-02-05","cited_by_count":9,"area":null},{"id":"2206.08627","title":"RECAPP: Crafting a More Efficient Catalyst for Convex Optimization","created":"2022-06-17","cited_by_count":8,"area":null},{"id":"2303.18047","title":"Differentially Private Stochastic Convex Optimization in (Non)-Euclidean Space Revisited","created":"2023-03-31","cited_by_count":8,"area":null},{"id":"2305.15546","title":"Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time","created":"2023-05-24","cited_by_count":8,"area":null},{"id":"2112.02612","title":"Training Structured Neural Networks Through Manifold Identification and Variance Reduction","created":"2021-12-05","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":"2201.07684","title":"On the Complexity of a Practical Primal-Dual Coordinate Method","created":"2022-01-19","cited_by_count":6,"area":null},{"id":"2209.04551","title":"Sparsity-guided Network Design for Frame Interpolation","created":"2022-09-09","cited_by_count":6,"area":null},{"id":"2204.00406","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","created":"2022-04-01","cited_by_count":5,"area":null},{"id":"2206.00285","title":"Stochastic Gradient Methods with Preconditioned Updates","created":"2022-06-01","cited_by_count":5,"area":null},{"id":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2301.03573","title":"Balance is Essence: Accelerating Sparse Training via Adaptive Gradient Correction","created":"2023-01-09","cited_by_count":5,"area":null},{"id":"2305.05828","title":"A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties","created":"2023-05-10","cited_by_count":5,"area":null},{"id":"2512.24265","title":"Joint Selection for Large-Scale Pre-Training Data via Policy Gradient-based Mask Learning","created":"2025-12-30","cited_by_count":5,"area":null},{"id":"2105.12062","title":"Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2110.10093","title":"Stochastic Primal-Dual Deep Unrolling","created":"2021-10-19","cited_by_count":4,"area":null},{"id":"2207.01560","title":"High-Dimensional Private Empirical Risk Minimization by Greedy Coordinate Descent","created":"2022-07-04","cited_by_count":4,"area":null},{"id":"2301.03125","title":"Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation","created":"2023-01-09","cited_by_count":4,"area":null},{"id":"2406.03006","title":"Quantum Algorithms and Lower Bounds for Finite-Sum Optimization","created":"2024-06-05","cited_by_count":4,"area":null},{"id":"2406.13936","title":"Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods","created":"2024-06-20","cited_by_count":4,"area":null},{"id":"2501.15941","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","created":"2025-01-27","cited_by_count":4,"area":null},{"id":"2404.14758","title":"Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients","created":"2024-04-23","cited_by_count":3,"area":null},{"id":"2101.01505","title":"Delayed Projection Techniques for Linearly Constrained Problems: Convergence Rates, Acceleration, and Applications","created":"2021-01-05","cited_by_count":2,"area":null},{"id":"2111.03820","title":"Distributed stochastic proximal algorithm with random reshuffling for non-smooth finite-sum optimization","created":"2021-11-06","cited_by_count":2,"area":null},{"id":"2211.15310","title":"Stochastic Steffensen method","created":"2022-11-28","cited_by_count":2,"area":null},{"id":"2212.08815","title":"FSCNN: A Fast Sparse Convolution Neural Network Inference System","created":"2022-12-17","cited_by_count":2,"area":null},{"id":"2403.00853","title":"Parallel Momentum Methods Under Biased Gradient Estimations","created":"2024-02-29","cited_by_count":2,"area":null},{"id":"2410.07272","title":"Boosting the Performance of Decentralized Federated Learning via Catalyst Acceleration","created":"2024-10-09","cited_by_count":2,"area":null},{"id":"2506.16283","title":"Random feature approximation for general spectral methods","created":"2025-06-19","cited_by_count":2,"area":null},{"id":"2101.01473","title":"Learning Sign-Constrained Support Vector Machines","created":"2021-01-05","cited_by_count":1,"area":null},{"id":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2112.10389","title":"Decentralized Stochastic Proximal Gradient Descent with Variance Reduction over Time-varying Networks","created":"2021-12-20","cited_by_count":1,"area":null},{"id":"2204.10981","title":"Distributed Dynamic Safe Screening Algorithms for Sparse Regularization","created":"2022-04-23","cited_by_count":1,"area":null},{"id":"2207.09350","title":"Riemannian Stochastic Gradient Method for Nested Composition Optimization","created":"2022-07-19","cited_by_count":1,"area":null},{"id":"2308.10767","title":"GBM-based Bregman Proximal Algorithms for Constrained Learning","created":"2023-08-21","cited_by_count":1,"area":null},{"id":"2405.17761","title":"Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2410.03760","title":"On the SAGA algorithm with decreasing step","created":"2024-10-02","cited_by_count":1,"area":null},{"id":"2410.06482","title":"OledFL: Unleashing the Potential of Decentralized Federated Learning via Opposite Lookahead Enhancement","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2506.20630","title":"First-order methods for stochastic and finite-sum convex optimization with deterministic constraints","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2108.04482","title":"Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth","created":"2021-08-10","cited_by_count":0,"area":null},{"id":"2109.15292","title":"Accelerating Perturbed Stochastic Iterates in Asynchronous Lock-Free Optimization","created":"2021-09-30","cited_by_count":0,"area":null},{"id":"2202.10923","title":"MSTGD:A Memory Stochastic sTratified Gradient Descent Method with an Exponential Convergence Rate","created":"2022-02-21","cited_by_count":0,"area":null},{"id":"2208.01631","title":"Stochastic Primal-Dual Three Operator Splitting Algorithm with Extension to Equivariant Regularization-by-Denoising","created":"2022-08-02","cited_by_count":0,"area":null},{"id":"2208.11075","title":"A Stochastic Variance Reduced Gradient using Barzilai-Borwein Techniques as Second Order Information","created":"2022-08-23","cited_by_count":0,"area":null},{"id":"2301.10958","title":"Learning Large Scale Sparse Models","created":"2023-01-26","cited_by_count":0,"area":null},{"id":"2305.18030","title":"Automated Search-Space Generation Neural Architecture Search","created":"2023-05-25","cited_by_count":0,"area":null},{"id":"2306.15848","title":"Ordering for Non-Replacement SGD","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2308.15434","title":"Random feature approximation for general spectral methods","created":"2023-08-29","cited_by_count":0,"area":null},{"id":"2406.04731","title":"Efficient Continual Finite-Sum Minimization","created":"2024-06-07","cited_by_count":0,"area":null},{"id":"2407.14618","title":"SOREL: A Stochastic Algorithm for Spectral Risks Minimization","created":"2024-07-19","cited_by_count":0,"area":null},{"id":"2410.02559","title":"Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms","created":"2024-10-03","cited_by_count":0,"area":null},{"id":"2505.18289","title":"Convexified Message-Passing Graph Neural Networks","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2506.09451","title":"Safe Screening Rules for Group SLOPE","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2601.22274","title":"Server-Proximal Aggregation for Federated Domain-Incremental Learning under Partial Participation: Task-Uniform Convergence and Backward Transfer","created":"2026-01-29","cited_by_count":0,"area":null},{"id":"2605.09813","title":"Optimizing Server Placement for Vertical Federated Learning in Dynamic Edge/Fog Networks","created":"2026-05-10","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},{"id":"2606.06687","title":"Towards Serverless Semi-Decentralized Federated Learning with Heterogeneous Optimizers","created":"2026-06-04","cited_by_count":0,"area":null},{"id":"2608.03001","title":"Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2609.23735","title":"ScholarStack: Layered Research Asset Orchestration and Cross-Task Reuse for Scientific Agents","created":"2026-09-20","cited_by_count":0,"area":null}],"next_cursor":null}