No article text was recorded for this version.
high-order smoothness exploitation
Version 1 of 127 papers40 conceptsfrozen 2026-10-04
Papers in this version
- Blog: The "Black-Box" Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation
- Blog: Accelerated Zero-Order SGD under High-Order Smoothness and Overparameterized Regime
- Blog: Acceleration in First Order Quasi-strongly Convex Optimization by ODE Discretization
- Blog: Smooth Bandit Optimization: Generalization to Holder Space
- Blog: Improved Iteration Complexity in Black-Box Optimization Problems under Higher Order Smoothness Function Condition
- Blog: Highly-Smooth Zero-th Order Online Optimization
- Blog: Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits
- Blog: Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
- Blog: Continuum-Armed Bandits: A Function Space Perspective
- Blog: Gradient-Free Algorithms for Solving Stochastic Saddle Optimization Problems with the Polyak-Łojasiewicz Condition
- Blog: Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization
- Blog: Nonparametric Regression Analysis of Growth Curves
- Blog: Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning
- Blog: Estimate Sequences for Stochastic Composite Optimization: Variance Reduction, Acceleration, and Robustness to Noise
- Blog: Distributed Zero-Order Optimization under Adversarial Noise
- Blog: Order Optimal One-Shot Distributed Learning
- Blog: Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives
- Blog: Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
- Blog: An Online Sample-Based Method for Mode Estimation Using ODE Analysis of Stochastic Approximation Algorithms
- Blog: Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities
- Blog: Smooth Non-stationary Bandits
- Blog: Optimal score estimation via empirical Bayes smoothing
- Blog: Contracting Proximal Methods for Smooth Convex Optimization
- Blog: Cutting plane methods can be extended into nonconvex optimization
- Blog: High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm
- Blog: Near-optimal method for highly smooth convex optimization
- Blog: New Methods for Parametric Optimization via Differential Equations
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_high_order_smoothness_exploitation_6123ad92,
title = {high-order smoothness exploitation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-order-smoothness-exploitation/rdr_6123ad92222a44d791f58939a7e60033},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_high_order_smoothness_exploitation_6123ad92_v1,
title = {high-order smoothness exploitation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-order-smoothness-exploitation/rdr_6123ad92222a44d791f58939a7e60033/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}