pybop.optimisers._irprop_plus#
Classes#
The iRprop+ algorithm adjusts step sizes based on the sign of the gradient |
Module Contents#
- class pybop.optimisers._irprop_plus.IRPropPlusImpl(x0, sigma0=0.05, boundaries=None)[source]#
Bases:
pints.OptimiserThe iRprop+ algorithm adjusts step sizes based on the sign of the gradient in each dimension, increasing step sizes when the sign remains consistent and decreasing when the sign changes. This implementation includes weight (parameter) backtracking that reverts the previous step in the event of a gradient sign changing.
References: - [1] Igel and Hüsken (2003): Empirical Evaluation of Improved Rprop Algorithms. - [2] Riedmiller and Braun (1993): A Direct Adaptive Method for Faster Backpropagation. - [3] Igel and Husk (2003): Improving the Rprop Learning Algorithm.
- Parameters:
x0 (array-like) – Initial starting point for the optimisation.
sigma0 (float or array-like, optional) – Initial step size(s). If a scalar is provided, it is applied to all dimensions. Default is 0.05.
boundaries (pints.Boundaries, optional) – Boundary constraints for the optimisation. If None, no boundaries are applied.
- eta_min[source]#
Factor by which the step size is reduced when the gradient sign changes. Default is 0.5.
- Type:
float
- eta_max[source]#
Factor by which the step size is increased when the gradient sign remains consistent. Default is 1.2.
- Type:
float
- ask()[source]#
Proposes the next point for evaluation.
- Returns:
A list containing the proposed point.
- Return type:
list