{"total":100,"rows":[{"id":"2305.17333","title":"Fine-Tuning Language Models with Just Forward Passes","created":"2023-05-27","cited_by_count":345,"area":null},{"id":"2404.01650","title":"Test-Time Model Adaptation with Only Forward Passes","created":"2024-04-02","cited_by_count":74,"area":null},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2102.01583","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","created":"2021-02-02","cited_by_count":31,"area":null},{"id":"2209.07807","title":"Model Inversion Attacks against Graph Neural Networks","created":"2022-09-16","cited_by_count":26,"area":null},{"id":"2310.09639","title":"DPZero: Private Fine-Tuning of Language Models without Backpropagation","created":"2023-10-14","cited_by_count":26,"area":null},{"id":"2312.15184","title":"ZO-AdaMU Optimizer: Adapting Perturbation by the Momentum and Uncertainty in Zeroth-order Optimization","created":"2023-12-23","cited_by_count":25,"area":null},{"id":"2307.04504","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","created":"2023-07-10","cited_by_count":23,"area":null},{"id":"2105.00321","title":"Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization","created":"2021-05-01","cited_by_count":21,"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":"2102.03389","title":"Online Statistical Inference for Stochastic Optimization via Kiefer-Wolfowitz Methods","created":"2021-02-05","cited_by_count":14,"area":null},{"id":"2102.07567","title":"Learning Accurate Decision Trees with Bandit Feedback via Quantized Gradient Descent","created":"2021-02-15","cited_by_count":14,"area":null},{"id":"2306.02159","title":"Gradient-free optimization of highly smooth functions: improved analysis and a new algorithm","created":"2023-06-03","cited_by_count":12,"area":null},{"id":"2308.09858","title":"Tensor-Compressed Back-Propagation-Free Training for (Physics-Informed) Neural Networks","created":"2023-08-18","cited_by_count":12,"area":null},{"id":"2305.01094","title":"Performative Prediction with Bandit Feedback: Learning through Reparameterization","created":"2023-05-01","cited_by_count":11,"area":null},{"id":"2302.13144","title":"Revisiting LQR Control from the Perspective of Receding-Horizon Policy Gradient","created":"2023-02-25","cited_by_count":10,"area":null},{"id":"2305.16671","title":"A Unified Approach for Maximizing Continuous DR-submodular Functions","created":"2023-05-26","cited_by_count":10,"area":null},{"id":"2406.12771","title":"First-Order Methods for Linearly Constrained Bilevel Optimization","created":"2024-06-18","cited_by_count":10,"area":null},{"id":"2105.01850","title":"Preference learning along multiple criteria: A game-theoretic perspective","created":"2021-05-05","cited_by_count":9,"area":null},{"id":"2203.10329","title":"Desirable Companion for Vertical Federated Learning: New Zeroth-Order Gradient Based Algorithm","created":"2022-03-19","cited_by_count":9,"area":null},{"id":"2504.20314","title":"Perturbation-efficient Zeroth-order Optimization for Hardware-friendly On-device Training","created":"2025-04-28","cited_by_count":9,"area":null},{"id":"2402.09152","title":"Improved Regret for Bandit Convex Optimization with Delayed Feedback","created":"2024-02-14","cited_by_count":8,"area":null},{"id":"2406.19579","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","created":"2024-06-27","cited_by_count":8,"area":null},{"id":"2205.13910","title":"A gradient estimator via L1-randomization for online zero-order optimization with two point feedback","created":"2022-05-27","cited_by_count":7,"area":null},{"id":"2311.17586","title":"Federated Online and Bandit Convex Optimization","created":"2023-11-29","cited_by_count":7,"area":null},{"id":"2501.18183","title":"Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization","created":"2025-01-30","cited_by_count":7,"area":null},{"id":"2102.05198","title":"Statistical Inference for Polyak-Ruppert Averaged Zeroth-order Stochastic Gradient Algorithm","created":"2021-02-10","cited_by_count":6,"area":null},{"id":"2106.09215","title":"Optimum-statistical Collaboration Towards General and Efficient Black-box Optimization","created":"2021-06-17","cited_by_count":6,"area":null},{"id":"2101.02137","title":"Smoothed functional-based gradient algorithms for off-policy reinforcement learning: A non-asymptotic viewpoint","created":"2021-01-06","cited_by_count":5,"area":null},{"id":"2403.10063","title":"Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization","created":"2024-03-15","cited_by_count":5,"area":null},{"id":"2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","created":"2026-02-04","cited_by_count":5,"area":null},{"id":"2105.11818","title":"SGD with Coordinate Sampling: Theory and Practice","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2107.12416","title":"Asynchronous Distributed Reinforcement Learning for LQR Control via Zeroth-Order Block Coordinate Descent","created":"2021-07-26","cited_by_count":4,"area":null},{"id":"2109.12213","title":"Adaptive Sampling Quasi-Newton Methods for Zeroth-Order Stochastic Optimization","created":"2021-09-24","cited_by_count":4,"area":null},{"id":"2110.14485","title":"Fast rates for prediction with limited expert advice","created":"2021-10-27","cited_by_count":4,"area":null},{"id":"2204.13087","title":"Faster online calibration without randomization: interval forecasts and the power of two choices","created":"2022-04-27","cited_by_count":4,"area":null},{"id":"2303.04030","title":"PyXAB -- A Python Library for $\\mathcal{X}$-Armed Bandit and Online Blackbox Optimization Algorithms","created":"2023-03-07","cited_by_count":4,"area":null},{"id":"2402.08621","title":"A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization","created":"2024-02-13","cited_by_count":4,"area":null},{"id":"2406.01484","title":"Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization","created":"2024-06-03","cited_by_count":4,"area":null},{"id":"2410.05880","title":"Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization","created":"2024-10-08","cited_by_count":4,"area":null},{"id":"2102.07387","title":"Optimal Regret Algorithm for Pseudo-1d Bandit Convex Optimization","created":"2021-02-15","cited_by_count":3,"area":null},{"id":"2112.12373","title":"Decentralized Multi-Task Stochastic Optimization With Compressed Communications","created":"2021-12-23","cited_by_count":3,"area":null},{"id":"2210.05279","title":"Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity","created":"2022-10-11","cited_by_count":3,"area":null},{"id":"2306.09778","title":"Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2602.02634","title":"A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees","created":"2026-02-02","cited_by_count":3,"area":null},{"id":"2202.11046","title":"A policy gradient approach for optimization of smooth risk measures","created":"2022-02-22","cited_by_count":2,"area":null},{"id":"2206.07126","title":"Lazy Queries Can Reduce Variance in Zeroth-order Optimization","created":"2022-06-14","cited_by_count":2,"area":null},{"id":"2210.02256","title":"Constant regret for sequence prediction with limited advice","created":"2022-10-05","cited_by_count":2,"area":null},{"id":"2210.07703","title":"Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence","created":"2022-10-14","cited_by_count":2,"area":null},{"id":"2311.02423","title":"Payoff-based learning with matrix multiplicative weights in quantum games","created":"2023-11-04","cited_by_count":2,"area":null},{"id":"2405.01731","title":"Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization","created":"2024-05-02","cited_by_count":2,"area":null},{"id":"2411.13999","title":"Accelerated zero-order SGD under high-order smoothness and overparameterized regime","created":"2024-11-21","cited_by_count":2,"area":null},{"id":"2502.12384","title":"Scalable Back-Propagation-Free Training of Optical Physics-Informed Neural Networks","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2510.19953","title":"On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization","created":"2025-10-22","cited_by_count":2,"area":null},{"id":"2608.15050","title":"Online Convex Optimization with Dueling Feedback","created":"2026-08-15","cited_by_count":2,"area":null},{"id":"2202.06880","title":"Black-Box Generalization: Stability of Zeroth-Order Learning","created":"2022-02-14","cited_by_count":1,"area":null},{"id":"2208.04579","title":"Adaptive Zeroth-Order Optimisation of Nonconvex Composite Objectives","created":"2022-08-09","cited_by_count":1,"area":null},{"id":"2211.15936","title":"Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks","created":"2022-11-29","cited_by_count":1,"area":null},{"id":"2301.08830","title":"ApproxED: Approximate exploitability descent via learned best responses","created":"2023-01-20","cited_by_count":1,"area":null},{"id":"2301.11267","title":"Online Convex Optimization with Stochastic Constraints: Zero Constraint Violation and Bandit Feedback","created":"2023-01-26","cited_by_count":1,"area":null},{"id":"2305.06743","title":"Implicitly normalized forecaster with clipping for linear and non-linear heavy-tailed multi-armed bandits","created":"2023-05-11","cited_by_count":1,"area":null},{"id":"2402.01621","title":"Stochastic Two Points Method for Deep Model Zeroth-order Optimization","created":"2024-02-02","cited_by_count":1,"area":null},{"id":"2402.05050","title":"Federated Learning Can Find Friends That Are Advantageous","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2405.14519","title":"A New Formulation for Zeroth-Order Optimization of Adversarial EXEmples in Malware Detection","created":"2024-05-23","cited_by_count":1,"area":null},{"id":"2502.20565","title":"Communication-Efficient and Differentially Private Vertical Federated Learning with Zeroth-Order Optimization","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2505.13954","title":"VAMO: Efficient Zeroth-Order Variance Reduction for SGD with Faster Convergence","created":"2025-05-20","cited_by_count":1,"area":null},{"id":"2603.14773","title":"HO-SFL: Hybrid-Order Split Federated Learning with Backprop-Free Clients and Dimension-Free Aggregation","created":"2026-03-16","cited_by_count":1,"area":null},{"id":"2604.09276","title":"Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications","created":"2026-04-10","cited_by_count":1,"area":null},{"id":"2605.03373","title":"Learning Dynamics of Zeroth-Order Optimization: A Kernel Perspective","created":"2026-05-05","cited_by_count":1,"area":null},{"id":"2605.22191","title":"Bandit Convex Optimization with Gradient Prediction Adaptivity","created":"2026-05-21","cited_by_count":1,"area":null},{"id":"2606.11711","title":"Capacity-Constrained Online Convex Optimization with Delayed Feedback","created":"2026-06-10","cited_by_count":1,"area":null},{"id":"2105.03527","title":"Scalable Projection-Free Optimization","created":"2021-05-07","cited_by_count":0,"area":null},{"id":"2211.11710","title":"Adaptive Stochastic Optimisation of Nonconvex Composite Objectives","created":"2022-11-21","cited_by_count":0,"area":null},{"id":"2308.08693","title":"AI planning in the imagination: High-level planning on learned abstract search spaces","created":"2023-08-16","cited_by_count":0,"area":null},{"id":"2310.10946","title":"Multi-point Feedback of Bandit Convex Optimization with Hard Constraints","created":"2023-10-17","cited_by_count":0,"area":null},{"id":"2406.08687","title":"AlphaZeroES: Direct score maximization outperforms planning loss minimization","created":"2024-06-12","cited_by_count":0,"area":null},{"id":"2409.15680","title":"Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret","created":"2024-09-24","cited_by_count":0,"area":null},{"id":"2409.16866","title":"Risk-averse learning with delayed feedback","created":"2024-09-25","cited_by_count":0,"area":null},{"id":"2410.23574","title":"Online Convex Optimization with Memory and Limited Predictions","created":"2024-10-31","cited_by_count":0,"area":null},{"id":"2505.19720","title":"A Structured Tour of Optimization with Finite Differences","created":"2025-05-26","cited_by_count":0,"area":null},{"id":"2506.19294","title":"Duality and Policy Evaluation in Distributionally Robust Bayesian Diffusion Control","created":"2025-06-24","cited_by_count":0,"area":null},{"id":"2510.13560","title":"Multi-Objective $\\textit{min-max}$ Online Convex Optimization","created":"2025-10-15","cited_by_count":0,"area":null},{"id":"2510.16157","title":"Zeroth-Order Sharpness-Aware Learning with Exponential Tilting","created":"2025-10-17","cited_by_count":0,"area":null},{"id":"2511.02757","title":"ConMeZO: Adaptive Descent-Direction Sampling for Gradient-Free Finetuning of Large Language Models","created":"2025-11-04","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":"2601.13519","title":"Small Gradient Norm Regret for Online Convex Optimization","created":"2026-01-20","cited_by_count":0,"area":null},{"id":"2601.20422","title":"Guiding the Recommender: Information-Aware Auto-Bidding for Content Promotion","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2603.02639","title":"Convex and Non-convex Federated Learning with Stale Stochastic Gradients: Diminishing Step Size is All You Need","created":"2026-03-03","cited_by_count":0,"area":null},{"id":"2603.25029","title":"Logarithmic High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback","created":"2026-03-26","cited_by_count":0,"area":null},{"id":"2604.14669","title":"Zeroth-Order Optimization at the Edge of Stability","created":"2026-04-16","cited_by_count":0,"area":null},{"id":"2605.10673","title":"Compander-Aligned Query Geometry for Quantized Zeroth-Order Optimization","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2606.19891","title":"Adversarial Bandit Optimization with Globally Bounded Perturbations to Convex Losses","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2606.23414","title":"Leveraging Similarities in Multi-Armed Bandits","created":"2026-06-22","cited_by_count":0,"area":null},{"id":"2608.02073","title":"Accelerating Evolutionary Strategy via Rao-Blackwellizing Realization of Uncertain Input","created":"2026-08-03","cited_by_count":0,"area":null},{"id":"2608.16216","title":"Beyond Peak Backlog: Conditional Energy and Temporal Geometry in Capacity-Constrained Delayed Bandit Optimization","created":"2026-08-17","cited_by_count":0,"area":null},{"id":"2609.23837","title":"The Exponential Price of Determinism in Nonsmooth Nonconvex Optimization","created":"2026-09-20","cited_by_count":0,"area":null},{"id":"2609.38561","title":"Parameter-Free Zeroth-Order Optimization with Ellipsoidal Sampling","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.13787","title":"Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.14942","title":"Probabilistic Multi-Source Data Selection via Learnable Categorical Priors: Variance Reduction and Guaranteed Derandomization","created":"2026-10-10","cited_by_count":0,"area":null},{"id":"2610.19322","title":"Generalization Analysis of Biased Stochastic Gradient Methods for Minimax Problems","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}