Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Iteration complexity and finite-time efficiency of adaptive sampling trust-region methods for stochastic derivative-free optimization
ASTRO-DF is a prominent trust-region method using adaptive sampling for stochastic
derivative-free optimization of nonconvex problems. Its salient feature is an easy-to …
derivative-free optimization of nonconvex problems. Its salient feature is an easy-to …
Ensemble-based gradient inference for particle methods in optimization and sampling
We propose an approach based on function evaluations and Bayesian inference to extract
higher-order differential information of objective functions from a given ensemble of …
higher-order differential information of objective functions from a given ensemble of …
Error bounds for overdetermined and underdetermined generalized centred simplex gradients
Abstract Using the Moore–Penrose pseudoinverse this work generalizes the gradient
approximation technique called the centred simplex gradient to allow sample sets …
approximation technique called the centred simplex gradient to allow sample sets …
A matrix algebra approach to approximate Hessians
This work presents a novel matrix-based method for constructing an approximation Hessian
using only function evaluations. The method requires less computational power than …
using only function evaluations. The method requires less computational power than …
Improved complexity of trust-region optimization for zeroth-order stochastic oracles with adaptive sampling
We present an enhanced stochastic trust-region optimization with adaptive sampling
(ASTRO-DF) in which optimizing an iteratively constructed local model on estimates of …
(ASTRO-DF) in which optimizing an iteratively constructed local model on estimates of …
Approximating the diagonal of a Hessian: which sample set of points should be used
G Jarry–Bolduc - Numerical Algorithms, 2022 - Springer
An explicit formula based on matrix algebra to approximate the diagonal entries of a
Hessian matrix with any number of sample points is introduced. When the derivative-free …
Hessian matrix with any number of sample points is introduced. When the derivative-free …
Using generalized simplex methods to approximate derivatives
This paper presents two methods for approximating a proper subset of the entries of a
Hessian using only function evaluations. These approximations are obtained using the …
Hessian using only function evaluations. These approximations are obtained using the …
Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations
S Ma, H Huang - The Thirteenth International Conference on Learning … - openreview.net
In this paper, we explore the two-point zeroth-order gradient estimator and identify the
optimal distribution of random perturbations that minimizes the estimator's variance. We …
optimal distribution of random perturbations that minimizes the estimator's variance. We …