蓝狮娱乐-蓝狮注册登录站

Adam

日期:2024-07-22 07:26 / 作者:佚名
class torch.optim.Adam(params, lr=0.001, betas=(0.9, 0.999), eps=1e-08, weight_decay=0, amsgrad=False, *, foreach=None, maximize=False, capturable=False, differentiable=False, fused=None)[source]?

Implements Adam algorithm.

input:γ?(lr),β1,β2?(betas),θ0?(params),f(θ)?(objective)λ?(weight?decay),?amsgrad,?maximizeinitialize:m00?(?first?moment),v00?(second?moment),?v0^max0for?t=1?to??doif?maximize:gt??θft(θt?1)elsegt?θft(θt?1)if?λ0gtgt+λθt?1mtβ1mt?1+(1?β1)gtvtβ2vt?1+(1?β2)gt2mt^mt/(1?β1t)vt^vt/(1?β2t)if?amsgradvt^maxmax(vt^max,vt^)θtθt?1?γmt^/(vt^max+?)elseθtθt?1?γmt^/(vt^+?)return?θt\begin{aligned} &\rule{110mm}{0.4pt} \\ & extbf{input} : \gamma ext{ (lr)}, \beta_1, \beta_2 ext{ (betas)}, heta_0 ext{ (params)},f( heta) ext{ (objective)} \\ &\hspace{13mm} \lambda ext{ (weight decay)}, \: extit{amsgrad}, \: extit{maximize} \\ & extbf{initialize} : m_0 \leftarrow 0 ext{ ( first moment)}, v_0\leftarrow 0 ext{ (second moment)},\: \widehat{v_0}^{max}\leftarrow 0\\[-1.ex] &\rule{110mm}{0.4pt} \\ & extbf{for} \: t=1 \: extbf{to} \: \ldots \: extbf{do} \\ &\hspace{5mm} extbf{if} \: extit{maximize}: \\ &\hspace{10mm}g_t \leftarrow - abla_{ heta} f_t ( heta_{t-1}) \\ &\hspace{5mm} extbf{else} \\ &\hspace{10mm}g_t \leftarrow abla_{ heta} f_t ( heta_{t-1}) \\ &\hspace{5mm} extbf{if} \: \lambda eq 0 \\ &\hspace{10mm} g_t \leftarrow g_t + \lambda heta_{t-1} \\ &\hspace{5mm}m_t \leftarrow \beta_1 m_{t-1} + (1 - \beta_1) g_t \\ &\hspace{5mm}v_t \leftarrow \beta_2 v_{t-1} + (1-\beta_2) g^2_t \\ &\hspace{5mm}\widehat{m_t} \leftarrow m_t/\big(1-\beta_1^t \big) \\ &\hspace{5mm}\widehat{v_t} \leftarrow v_t/\big(1-\beta_2^t \big) \\ &\hspace{5mm} extbf{if} \: amsgrad \\ &\hspace{10mm}\widehat{v_t}^{max} \leftarrow \mathrm{max}(\widehat{v_t}^{max}, \widehat{v_t}) \\ &\hspace{10mm} heta_t \leftarrow heta_{t-1} - \gamma \widehat{m_t}/ \big(\sqrt{\widehat{v_t}^{max}} + \epsilon \big) \\ &\hspace{5mm} extbf{else} \\ &\hspace{10mm} heta_t \leftarrow heta_{t-1} - \gamma \widehat{m_t}/ \big(\sqrt{\widehat{v_t}} + \epsilon \big) \\ &\rule{110mm}{0.4pt} \\[-1.ex] &\bf{return} \: heta_t \\[-1.ex] &\rule{110mm}{0.4pt} \\[-1.ex] \end{aligned}

For further details regarding the algorithm we refer to Adam: A Method for Stochastic Optimization.

Parameters
  • params (iterable) – iterable of parameters to optimize or dicts defining parameter groups

  • lr (float, Tensor, optional) – learning rate (default: 1e-3). A tensor LR is not yet supported for all our implementations. Please use a float LR if you are not also specifying fused=True or capturable=True.

  • betas (Tuple[float, float], optional) – coefficients used for computing running averages of gradient and its square (default: (0.9, 0.999))

  • eps (float, optional) – term added to the denominator to improve numerical stability (default: 1e-8)

  • weight_decay (float, optional) – weight decay (L2 penalty) (default: 0)

  • amsgrad (bool, optional) – whether to use the AMSGrad variant of this algorithm from the paper On the Convergence of Adam and Beyond (default: False)

  • foreach (bool, optional) – whether foreach implementation of optimizer is used. If unspecified by the user (so foreach is None), we will try to use foreach over the for-loop implementation on CUDA, since it is usually significantly more performant. Note that the foreach implementation uses ~ sizeof(params) more peak memory than the for-loop version due to the intermediates being a tensorlist vs just one tensor. If memory is prohibitive, batch fewer parameters through the optimizer at a time or switch this flag to False (default: None)

  • maximize (bool, optional) – maximize the objective with respect to the params, instead of minimizing (default: False)

  • capturable (bool, optional) – whether this instance is safe to capture in a CUDA graph. Passing True can impair ungraphed performance, so if you don’t intend to graph capture this instance, leave it False (default: False)

  • differentiable (bool, optional) – whether autograd should occur through the optimizer step in training. Otherwise, the step() function runs in a torch.no_grad() context. Setting to True can impair performance, so leave it False if you don’t intend to run autograd through this instance (default: False)

  • fused (bool, optional) – whether the fused implementation (CUDA only) is used. Currently, torch.float64, torch.float32, torch.float16, and torch.bfloat16 are supported. (default: None)

Note

The foreach and fused implementations are typically faster than the for-loop, single-tensor implementation. Thus, if the user has not specified BOTH flags (i.e., when foreach=fused=None), we will attempt defaulting to the foreach implementation when the tensors are all on CUDA. For example, if the user specifies True for fused but nothing for foreach, we will run the fused implementation. If the user specifies False for foreach but nothing for fused (or False for fused but nothing for foreach), we will run the for-loop implementation. If the user specifies True for both foreach and fused, we will prioritize fused over foreach, as it is typically faster. We attempt to use the fastest, so the hierarchy goes fused -> foreach -> for-loop. HOWEVER, since the fused implementation is relatively new, we want to give it sufficient bake-in time, so we default to foreach and NOT fused when the user has not specified either flag.

add_param_group(param_group)?

Add a param group to the s param_groups.

This can be useful when fine tuning a pre-trained network as frozen layers can be made trainable and added to the as training progresses.

Parameters

param_group (dict) – Specifies what Tensors should be optimized along with group specific optimization options.

load_state_dict(state_dict)?

Loads the optimizer state.

Parameters

state_dict (dict) – optimizer state. Should be an object returned from a call to .

register_load_state_dict_post_hook(hook, prepend=False)?

Register a load_state_dict post-hook which will be called after is called. It should have the following signature:

hook(optimizer) -> None

The argument is the optimizer instance being used.

The hook will be called with argument after calling on . The registered hook can be used to perform post-processing after has loaded the .

Parameters
  • hook (Callable) – The user defined hook to be registered.

  • prepend (bool) – If True, the provided post will be fired before all the already registered post-hooks on . Otherwise, the provided will be fired after all the already registered post-hooks. (default: False)

Returns

a handle that can be used to remove the added hook by calling

Return type

register_load_state_dict_pre_hook(hook, prepend=False)?

Register a load_state_dict pre-hook which will be called before is called. It should have the following signature:

hook(optimizer, state_dict) -> state_dict or None

The argument is the optimizer instance being used and the argument is a shallow copy of the the user passed in to . The hook may modify the state_dict inplace or optionally return a new one. If a state_dict is returned, it will be used to be loaded into the optimizer.

The hook will be called with argument and before calling on . The registered hook can be used to perform pre-processing before the call is made.

Parameters
  • hook (Callable) – The user defined hook to be registered.

  • prepend (bool) – If True, the provided pre will be fired before all the already registered pre-hooks on . Otherwise, the provided will be fired after all the already registered pre-hooks. (default: False)

Returns

a handle that can be used to remove the added hook by calling

Return type

register_state_dict_post_hook(hook, prepend=False)?

Register a state dict post-hook which will be called after is called. It should have the following signature:

hook(optimizer, state_dict) -> state_dict or None

The hook will be called with arguments and after generating a on . The hook may modify the state_dict inplace or optionally return a new one. The registered hook can be used to perform post-processing on the before it is returned.

Parameters
  • hook (Callable) – The user defined hook to be registered.

  • prepend (bool) – If True, the provided post will be fired before all the already registered post-hooks on . Otherwise, the provided will be fired after all the already registered post-hooks. (default: False)

Returns

a handle that can be used to remove the added hook by calling

Return type

register_state_dict_pre_hook(hook, prepend=False)?

Register a state dict pre-hook which will be called before is called. It should have the following signature:

hook(optimizer) -> None

The argument is the optimizer instance being used. The hook will be called with argument before calling on . The registered hook can be used to perform pre-processing before the call is made.

Parameters
  • hook (Callable) – The user defined hook to be registered.

  • prepend (bool) – If True, the provided pre will be fired before all the already registered pre-hooks on . Otherwise, the provided will be fired after all the already registered pre-hooks. (default: False)

Returns

a handle that can be used to remove the added hook by calling

Return type

register_step_post_hook(hook)?

Register an optimizer step post hook which will be called after optimizer step. It should have the following signature:

hook(optimizer, args, kwargs) -> None

The argument is the optimizer instance being used.

Parameters

hook (Callable) – The user defined hook to be registered.

Returns

a handle that can be used to remove the added hook by calling

Return type

register_step_pre_hook(hook)?

Register an optimizer step pre hook which will be called before optimizer step. It should have the following signature:

hook(optimizer, args, kwargs) -> None or modified args and kwargs

The argument is the optimizer instance being used. If args and kwargs are modified by the pre-hook, then the transformed values are returned as a tuple containing the new_args and new_kwargs.

Parameters

hook (Callable) – The user defined hook to be registered.

Returns

a handle that can be used to remove the added hook by calling

Return type

state_dict()?

Returns the state of the optimizer as a .

It contains two entries:

  • : a Dict holding current optimization state. Its content

    differs between optimizer classes, but some common characteristics hold. For example, state is saved per parameter, and the parameter itself is NOT saved. is a Dictionary mapping parameter ids to a Dict with state corresponding to each parameter.

  • : a List containing all parameter groups where each

    parameter group is a Dict. Each parameter group contains metadata specific to the optimizer, such as learning rate and weight decay, as well as a List of parameter IDs of the parameters in the group.

NOTE: The parameter IDs may look like indices but they are just IDs associating state with param_group. When loading from a state_dict, the optimizer will zip the param_group (int IDs) and the optimizer (actual s) in order to match state WITHOUT additional verification.

A returned state dict might look something like:

{
    'state': {
        0: {'momentum_buffer': tensor(...), ...},
        1: {'momentum_buffer': tensor(...), ...},
        2: {'momentum_buffer': tensor(...), ...},
        3: {'momentum_buffer': tensor(...), ...}
    },
    'param_groups': [
        {
            'lr': 0.01,
            'weight_decay': 0,
            ...
            'params': [0]
        },
        {
            'lr': 0.001,
            'weight_decay': 0.5,
            ...
            'params': [1, 2, 3]
        }
    ]
}
Return type

Dict[str, Any]

step(closure=None)[source]?

Perform a single optimization step.

Parameters

closure (Callable, optional) – A closure that reevaluates the model and returns the loss.

zero_grad(set_to_none=True)?

Resets the gradients of all optimized s.

Parameters

set_to_none (bool) – instead of setting to zero, set the grads to None. This will in general have lower memory footprint, and can modestly improve performance. However, it changes certain behaviors. For example: 1. When the user tries to access a gradient and perform manual ops on it, a None attribute or a Tensor full of 0s will behave differently. 2. If the user requests followed by a backward pass, s are guaranteed to be None for params that did not receive a gradient. 3. optimizers have a different behavior if the gradient is 0 or None (in one case it does the step with a gradient of 0 and in the other it skips the step altogether).

平台注册入口