| Publication | Date of Publication | Type |
|---|
WITHDRAWN: Fast Spectral Low Rank Matrix Approximation (available as arXiv preprint) | N/A | Paper |
Accelerating Random Kaczmarz Algorithm Based on Clustering Information (available as arXiv preprint) | N/A | Paper |
Tighter bound of Sketched Generalized Matrix Approximation (available as arXiv preprint) | N/A | Paper |
WITHDRAWN: A Simple Approach to Optimal CUR Decomposition (available as arXiv preprint) | N/A | Paper |
Anderson Acceleration Without Restart: A Novel Method with n-Step Super Quadratic Convergence Rate (available as arXiv preprint) | N/A | Paper |
HALO: hardness-aware bilevel-inspired contrastive graph clustering International Journal of Approximate Reasoning | 2026-08-18 | Paper |
Why Does Adaptive Zeroth-Order Optimization Work? (available as arXiv preprint) | 2026-01-01 | Paper |
Riemannian Momentum Tracking: Distributed Optimization with Momentum on Compact Submanifolds (available as arXiv preprint) | 2026-01-01 | Paper |
High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent (available as arXiv preprint) | 2026-01-01 | Paper |
Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions (available as arXiv preprint) | 2026-01-01 | Paper |
High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions (available as arXiv preprint) | 2026-01-01 | Paper |
High-Probability Last-Iterate Guarantees for Two-Point Gaussian Zeroth-Order Stochastic Gradient Descent (available as arXiv preprint) | 2026-01-01 | Paper |
Leveraging Extragradient for Effective Sharpness-Aware Minimization in Deep Learning (available as arXiv preprint) | 2026-01-01 | Paper |
Accelerated double-sketching subspace Newton European Journal of Operational Research | 2025-05-19 | Paper |
Stochastic Diagonal Estimation Based on Matrix Quadratic Form Oracles (available as arXiv preprint) | 2025-01-01 | Paper |
Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity? (available as arXiv preprint) | 2025-01-01 | Paper |
A Unified Zeroth-Order Optimization Framework via Oblivious Randomized Sketching (available as arXiv preprint) | 2025-01-01 | Paper |
Zero-Order Sharpness-Aware Minimization (available as arXiv preprint) | 2025-01-01 | Paper |
DINE: decentralized inexact Newton with exact linear convergence rate IEEE Transactions on Signal Processing | 2024-09-16 | Paper |
| Optimal Decentralized Composite Optimization for Strongly Convex Functions | 2023-12-25 | Paper |
Towards explicit superlinear convergence rate for SR1 Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Optimal Decentralized Composite Optimization for Convex Functions (available as arXiv preprint) | 2023-01-01 | Paper |
| Snap-Shot Decentralized Stochastic Gradient Tracking Methods | 2022-12-10 | Paper |
Snap-Shot Decentralized Stochastic Gradient Tracking Methods (available as arXiv preprint) | 2022-01-01 | Paper |
| Greedy and Random Broyden's Methods with Explicit Superlinear Convergence Rates in Nonlinear Equations | 2021-10-16 | Paper |
| Explicit Superlinear Convergence Rates of Broyden's Methods in Nonlinear Equations | 2021-09-04 | Paper |
Approximate Newton methods (available as arXiv preprint) | 2021-07-09 | Paper |
| Approximate Newton methods | 2021-07-09 | Paper |
| Explicit Convergence Rates of Greedy and Random Quasi-Newton Methods | 2021-04-18 | Paper |
DeEPCA: Decentralized Exact PCA with Linear Convergence Rate (available as arXiv preprint) | 2021-02-07 | Paper |
Greedy and Random Broyden's Methods with Explicit Superlinear Convergence Rates in Nonlinear Equations (available as arXiv preprint) | 2021-01-01 | Paper |
Explicit Superlinear Convergence Rates of Broyden's Methods in Nonlinear Equations (available as arXiv preprint) | 2021-01-01 | Paper |
| Nesterov's acceleration for approximate Newton | 2020-10-05 | Paper |
| Revisiting Sub-sampled Newton Methods | 2016-08-07 | Paper |
Revisiting Sub-sampled Newton Methods (available as arXiv preprint) | 2016-01-01 | Paper |