RUS  ENG
Full version
JOURNALS // Computer Research and Modeling // Archive

Computer Research and Modeling, 2023 Volume 15, Issue 2, Pages 259–280 (Mi crm1059)

MATHEMATICAL MODELING AND NUMERICAL SIMULATION

Influence of the mantissa finiteness on the accuracy of gradient-free optimization methods

D. D. Vostrikov, G. O. Konin, A. V. Lobanov, V. V. Matyukhin

Moscow Institute of Physics and Technology, 9 Institutskiy per., Dolgoprudny, Moscow region, 141701, Russia

Abstract: Gradient-free optimization methods or zeroth-order methods are widely used in training neural networks, reinforcement learning, as well as in industrial tasks where only the values of a function at a point are available (working with non-analytical functions). In particular, the method of error back propagation in PyTorch works exactly on this principle. There is a well-known fact that computer calculations use heuristics of floating-point numbers, and because of this, the problem of finiteness of the mantissa arises.
In this paper, firstly, we reviewed the most popular methods of gradient approximation: Finite forward/central difference (FFD/FCD), Forward/Central wise component (FWC/CWC), Forward/Central randomization on $l_2$ sphere (FSSG2/CFFG2); secondly, we described current theoretical representations of the noise introduced by the inaccuracy of calculating the function at a point: adversarial noise, random noise; thirdly, we conducted a series of experiments on frequently encountered classes of problems, such as quadratic problem, logistic regression, SVM, to try to determine whether the real nature of machine noise corresponds to the existing theory. It turned out that in reality (at least for those classes of problems that were considered in this paper), machine noise turned out to be something between adversarial noise and random, and therefore the current theory about the influence of the mantissa limb on the search for the optimum in gradient-free optimization problems requires some adjustment.

Keywords: mantissa finiteness, gradient-free optimization, gradient approximation, gradient descent, quadratic problem, logistic regression.

UDC: 519.8

Received: 19.02.2023
Accepted: 23.02.2023

DOI: 10.20537/2076-7633-2023-15-2-259-280



© Steklov Math. Inst. of RAS, 2024