Imagen de Portada

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Suvorikova, Alexandra, Pavlov, Igor, Vasin, Artem, Bychkov, Georgii, Antsiferova, Anastasia, Dvinskikh, Darina, Gasnikov, Alexander
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control Machine Learning 90C56, 68Q25
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Accelerated zero-order SGD under high-order smoothness and overparameterized regime
por: Bychkov, Georgii, et al.
Publicado: (2024)

Birkhoff interpolation models for optimization with some available derivatives
por: Larson, Jeffrey, et al.
Publicado: (2026)

Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
por: Lakshmanan, K
Publicado: (2023)

Curvature-Aware Derivative-Free Optimization
por: Kim, Bumsu, et al.
Publicado: (2021)

Dimension-free estimators of gradients of functions with(out) non-independent variables
por: Lamboni, Matieyendou
Publicado: (2025)

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
por: Liu, Zekun, et al.
Publicado: (2026)

A derivative-free trust-region approach for Low Order-Value Optimization problems
por: Schwertner, Anderson E., et al.
Publicado: (2025)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
por: Zhang, Minxin, et al.
Publicado: (2024)

A particle consensus approach to solving nonconvex-nonconcave min-max problems
por: Borghi, Giacomo, et al.
Publicado: (2024)

Well-posedness and mean-field limit estimate of a consensus-based algorithm for min-max problems
por: Huang, Hui, et al.
Publicado: (2026)

Topological structure and a polynomial-time solution of linear programming over the real numbers
por: Wei, Jing-Yuan
Publicado: (2018)

A non-iterative polynomial algorithm for linear programming
por: Jing-Yuan, Wei
Publicado: (2013)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
por: Petrov, Petar P.
Publicado: (2022)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
por: Nesterov, Yurii
Publicado: (2025)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
por: Starnes, Andrew, et al.
Publicado: (2023)

Consensus-Based Optimization Methods Converge Globally
por: Fornasier, Massimo, et al.
Publicado: (2021)

Convergence of Anisotropic Consensus-Based Optimization in Mean-Field Law
por: Fornasier, Massimo, et al.
Publicado: (2021)

On the convergence of PINNs for inverse source problem in the complex Ginzburg-Landau equation
por: Cheng, Xing, et al.
Publicado: (2025)

Fast and robust consensus-based optimization via optimal feedback control
por: Huang, Yuyang, et al.
Publicado: (2024)

Micro-Macro Decomposition of Particle Swarm Optimization Methods
por: Herty, Michael, et al.
Publicado: (2025)

Zeroth-Order Methods for Nonconvex Stochastic Problems with Decision-Dependent Distributions
por: Hikima, Yuya, et al.
Publicado: (2024)

Incremental Certificate Learning for Hybrid Neural Network Verification . A Solver Architecture for Piecewise-Linear Safety Queries
por: Gokavarapu, Chandrasekhar
Publicado: (2025)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
por: Lara, Felipe, et al.
Publicado: (2024)

Improved physics-informed neural network in mitigating gradient related failures
por: Niu, Pancheng, et al.
Publicado: (2024)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
por: Mohammadisiahroudi, Mohammadhossein, et al.
Publicado: (2023)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
por: Rando, Marco, et al.
Publicado: (2026)

A Theoretical Study of (Hyper) Self-Attention through the Lens of Interactions: Representation, Training, Generalization
por: Ustaomeroglu, Muhammed, et al.
Publicado: (2025)

Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
por: Beddrich, Jonas, et al.
Publicado: (2024)

On the Global Convergence of Particle Swarm Optimization Methods
por: Huang, Hui, et al.
Publicado: (2022)

Optimal phase change for a generalized Grover's algorithm
por: Cardullo, Christopher, et al.
Publicado: (2025)

Fidelity and interruption control for expensive constrained multi-fidelity blackbox optimization
por: Alarie, Stéphane, et al.
Publicado: (2023)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
por: Goerigk, Marc, et al.
Publicado: (2026)

High-Fidelity Modeling of Stochastic Chemical Dynamics on Complex Manifolds: A Multi-Scale SIREN-PINN Framework for the Curvature-Perturbed Ginzburg-Landau Equation
por: Chrisnanto, Julian Evan, et al.
Publicado: (2026)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
por: Hua, Zheng, et al.
Publicado: (2021)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
por: Ouyang, Wenqing, et al.
Publicado: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
por: Ouyang, Wenqing
Publicado: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
por: Zhang, Liwei, et al.
Publicado: (2025)

Tight complexity bounds for diagram commutativity verification
por: Malko, Artem, et al.
Publicado: (2025)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
por: Rando, Marco, et al.
Publicado: (2025)

The n-vehicle exploration problem is NP-complete
por: Cui, Jinchuan, et al.
Publicado: (2023)