Dimension-Free Estimators of Gradients of Functions with(out) Non-Independent Variables

This study proposes a unified stochastic framework for approximating and computing the gradient of every smooth function evaluated at non-independent variables, using ℓp-spherical distributions on Rd with d,p≥1. The upper-bounds of the bias of the gradient surrogates do not suffer from the curse of dimensionality for any p≥1. Additionally, the mean squared errors (MSEs) of the gradient estimators are bounded by K0N−1d for any p∈[1,2], and by K1N−1d2/p when 2≤p≪d with N the sample size and K0,K1 some constants. Taking max2,log(d)<p≪d allows for achieving dimension-free upper-bounds of MSEs. In the case where d≪p<+∞, the upper-bound K2N−1d2−2/p/(d+2)2 is reached with K2 a constant. Such results lead to dimension-free MSEs of the proposed estimators, which boil down to estimators of the traditional gradient when the variables are independent. Numerical comparisons show the efficiency of the proposed approach.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2025-12-27
DOI
https://doi.org/10.3390/axioms15010022
Citations
2
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dimension-Free Estimators of Gradients of Functions with(out) Non-Independent Variables

Matieyendou Lamboni
2 citations
Axioms
Stochastic Gradient Optimization Techniques
4.96
article

Dimension-Free Estimators of Gradients of Functions with(out) Non-Independent Variables

Matieyendou Lamboni
article en
2 citations

Abstract

This study proposes a unified stochastic framework for approximating and computing the gradient of every smooth function evaluated at non-independent variables, using ℓp-spherical distributions on Rd with d,p≥1. The upper-bounds of the bias of the gradient surrogates do not suffer from the curse of dimensionality for any p≥1. Additionally, the mean squared errors (MSEs) of the gradient estimators are bounded by K0N−1d for any p∈[1,2], and by K1N−1d2/p when 2≤p≪d with N the sample size and K0,K1 some constants. Taking max2,log(d)<p≪d allows for achieving dimension-free upper-bounds of MSEs. In the case where d≪p<+∞, the upper-bound K2N−1d2−2/p/(d+2)2 is reached with K2 a constant. Such results lead to dimension-free MSEs of the proposed estimators, which boil down to estimators of the traditional gradient when the variables are independent. Numerical comparisons show the efficiency of the proposed approach.

AxiomsVol. 15(1)
Université de Montpellier (FR), Institut de Recherche pour le Développement (FR)
Openalex Percentile: Top 4%
Stochastic Gradient Optimization Techniques
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.