{"total":17,"rows":[{"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":"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":"2202.06880","title":"Black-Box Generalization: Stability of Zeroth-Order Learning","created":"2022-02-14","cited_by_count":1,"area":null},{"id":"2211.16457","title":"Estimating the minimizer and the minimum value of a regression function under passive design","created":"2022-11-29","cited_by_count":1,"area":null},{"id":"2406.19617","title":"Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity","created":"2024-06-28","cited_by_count":1,"area":null},{"id":"2506.02980","title":"Non-stationary Bandit Convex Optimization: A Comprehensive Study","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2602.24263","title":"Active Bipartite Ranking with Smooth Posterior Distributions","created":"2026-02-27","cited_by_count":1,"area":null},{"id":"2607.18652","title":"The Price of Hidden Curvature: Improved Lower Bounds for Bandit Convex Optimization","created":"2026-07-21","cited_by_count":1,"area":null},{"id":"2210.05222","title":"Stochastic Direct Search Method for Blind Resource Allocation","created":"2022-10-11","cited_by_count":0,"area":null},{"id":"2406.05714","title":"A conversion theorem and minimax optimality for continuum contextual bandits","created":"2024-06-09","cited_by_count":0,"area":null},{"id":"2407.02279","title":"How to Boost Any Loss Function","created":"2024-07-02","cited_by_count":0,"area":null},{"id":"2407.11035","title":"Optimal estimators of cross-partial derivatives and surrogates of functions","created":"2024-07-05","cited_by_count":0,"area":null},{"id":"2412.14744","title":"Finite Sample Bounds for Non-Parametric Regression: Optimal Sample Efficiency and Space Complexity","created":"2024-12-19","cited_by_count":0,"area":null},{"id":"2503.02131","title":"Gradient-free stochastic optimization for additive models","created":"2025-03-03","cited_by_count":0,"area":null},{"id":"2509.21484","title":"High-probability zeroth-order online convex optimisation beyond Euclidean geometry","created":"2025-09-25","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":"2607.12938","title":"Sharp Optimal Algorithm for Derivative-Free Stochastic Convex Optimization in One Dimension","created":"2026-07-14","cited_by_count":0,"area":null}],"next_cursor":null}