a hC@sxddlmZmZmZddlZddlmZddlmZmZm Z m Z m Z m Z m Z mZmZmZmZmZmZmZmZddgZGdddeZd d ed e d ed e d ed e_eeeeeeeeeeeeeeeeeeedddZeeeeeeeeeeeeeeeeeeedddZe eddeeeeeeeeeeeeeeeeeeeeedddZdS))castOptionalUnionN)Tensor)_capturable_doc_default_to_fused_or_foreach_differentiable_doc_disable_dynamo_if_unsupported _foreach_doc!_get_capturable_supported_devices_get_scalar_dtype _get_value _maximize_doc _params_doc _to_scalar_use_grad_for_differentiable _view_as_real OptimizerParamsTAdamaxadamaxc steZdZdddddeeeefeeefeeee e e e d fd d Z fd d Z d dZ e dddZZS)rMb`?g?g+?:0yE>rNF)maximizedifferentiable capturable) paramslrbetaseps weight_decayforeachrrrc st|tr|dkrtdd|ks4td|d|ksJtd|d|dkrbdksvntd|dd|dkrdksntd |dd|kstd |t|||||||| d } t|| dS) NrzTensor lr must be 1-elementzInvalid learning rate: zInvalid epsilon value: r?z#Invalid beta parameter at index 0: z#Invalid beta parameter at index 1: zInvalid weight_decay value: )rr r!r"r#rrr) isinstancerZnumel ValueErrordictsuper__init__) selfrrr r!r"r#rrrdefaults __class__@/var/www/auris/lib/python3.9/site-packages/torch/optim/adamax.pyr*s.  zAdamax.__init__cst||jD]}|dd|dd|dd|dd|dD]h}|j|g}t|dkrNt|dsNt |d}|drtj |t |j d ntj |t d |d<qNqdS) Nr#rFrrrrstepdtypedevicer3) r) __setstate__ param_groups setdefaultstategetlentorchZ is_tensorfloattensorr r4)r+r9grouppZp_stateZstep_valr-r/r0r6Ds          zAdamax.__setstate__c Csd}|dD]}|jdurq |t|O}|||jjrDtd||j|j|} t| dkr|drtjdt |j dntj dt d | d <tj |tj d | d <tj |tj d | d <|| d || d || d q |S)NFrz(Adamax does not support sparse gradientsrrr/r2r$r5r1)Z memory_formatexp_avgexp_inf)gradr< is_complexappendZ is_sparse RuntimeErrorr9r;zerosr r4r>Z zeros_likeZpreserve_format) r+r?params_with_gradgradsexp_avgsexp_infs state_steps has_complexr@r9r/r/r0 _init_groupWs2        zAdamax._init_groupcCs|d}|durBt|}Wdn1s80Y|jD]}g}g}g}g}g}|d\} } |d} |d} |d} |d}|d}|d}|d }|||||||}t|||||| | | | | |||||d qH|S) zPerforms a single optimization step. Args: closure (Callable, optional): A closure that reevaluates the model and returns the loss. Nr r!rr"r#rrr) r!beta1beta2rr"r#rrrrM)Z _cuda_graph_capture_health_checkr<Z enable_gradr7rNr)r+closureZlossr?rHrIrJrKrLrOrPr!rr"r#rrrrMr/r/r0r1zsP $   z Adamax.step)rrrrN)N)__name__ __module__ __qualname__rrr=rtuplerboolr*r6rNrr1 __classcell__r/r/r-r0rs0   & #aImplements Adamax algorithm (a variant of Adam based on infinity norm). .. math:: \begin{aligned} &\rule{110mm}{0.4pt} \\ &\textbf{input} : \gamma \text{ (lr)}, \beta_1, \beta_2 \text{ (betas)},\theta_0 \text{ (params)},f(\theta) \text{ (objective)}, \: \lambda \text{ (weight decay)}, \\ &\hspace{13mm} \epsilon \text{ (epsilon)} \\ &\textbf{initialize} : m_0 \leftarrow 0 \text{ ( first moment)}, u_0 \leftarrow 0 \text{ ( infinity norm)} \\[-1.ex] &\rule{110mm}{0.4pt} \\ &\textbf{for} \: t=1 \: \textbf{to} \: \ldots \: \textbf{do} \\ &\hspace{5mm}g_t \leftarrow \nabla_{\theta} f_t (\theta_{t-1}) \\ &\hspace{5mm}if \: \lambda \neq 0 \\ &\hspace{10mm} g_t \leftarrow g_t + \lambda \theta_{t-1} \\ &\hspace{5mm}m_t \leftarrow \beta_1 m_{t-1} + (1 - \beta_1) g_t \\ &\hspace{5mm}u_t \leftarrow \mathrm{max}(\beta_2 u_{t-1}, |g_{t}|+\epsilon) \\ &\hspace{5mm}\theta_t \leftarrow \theta_{t-1} - \frac{\gamma m_t}{(1-\beta^t_1) u_t} \\ &\rule{110mm}{0.4pt} \\[-1.ex] &\bf{return} \: \theta_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`_. z Args: a lr (float, Tensor, optional): learning rate (default: 2e-3) betas (Tuple[float, float], optional): coefficients used for computing running averages of gradient and its square 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) z zd .. _Adam\: A Method for Stochastic Optimization: https://arxiv.org/abs/1412.6980 )rrIrJrKrLr!rOrPrr"rrrrMc Cstjst|}t|D]\}}||}| s4|n| }||}||}||}tjs| rt}|jj |jj kr|jj |vsJd|d|d7}| dkr|j || d}t |rt |}t |}t |}t |}| |d|| stj|||||dnBt||d||dgd}|tj|ddd| r||d}||||}|||qd|t|}||}|j||| d qdS) NIIf capturable=True, params and state_steps must be on supported devices: .rralpha)outF)Zkeepdim)value)r<jit is_scriptingr enumeratecompiler is_compilingr r4typeaddrDZ view_as_realZlerp_maximumZmul_absZadd_catZ unsqueezeZ unsqueeze_Zcopy_ZamaxZdiv_Zaddcdiv_r)rrIrJrKrLr!rOrPrr"rrrrMiparamrCrArBZstep_tcapturable_supported_devicesZnorm_bufZneg_bias_correctiondenomZbias_correctionZclrr/r/r0_single_tensor_adamaxsX         "  rlc sL| r Jdt|dkrdStjs`| r`tddtfddt||Ds`Jddtt |||||g}| D]\\}}}}}}t t t |}t t t |}t t t |}t t t |}t t t |}| rt||||| rt|}tjs2|djr2tj|tjd d d d d n t|d | dkrp| r`tj||| d ntj||| d }t||d t||| s| dkrt|}n t|t||t||| rt|}t|d t|t||}t|||qfdd|D}fdd|D}t||||qdS)Nz#_foreach ops don't support autogradrF)Z supports_xlac3s.|]&\}}|jj|jjko$|jjvVqdSN)r4rc).0r@r1)rjr/r0 Lsz'_multi_tensor_adamax..rXrYr%cpu)r4rZrcsg|]}dt|qS)rr)rnr1)rOr/r0 sz(_multi_tensor_adamax..csg|]}t|dqS)rq)rnZbc)rr/r0rr)r;r<rarbr allziprrZ"_group_tensors_by_device_and_dtypevaluesrlistrrZ _foreach_negZis_cpuZ _foreach_add_r>Z _foreach_addZ_foreach_lerp_Z _foreach_mul_Z _foreach_absZ _foreach_abs_Z_foreach_maximum_Z _foreach_powZ _foreach_sub_Z _foreach_div_Z _foreach_mulZ_foreach_addcdiv_)rrIrJrKrLr!rOrPrr"rrrrMZgrouped_tensorsZgrouped_params_Zgrouped_grads_Zgrouped_exp_avgs_Zgrouped_exp_infs_Zgrouped_state_steps__Zgrouped_paramsZ grouped_gradsZgrouped_exp_avgsZgrouped_exp_infsZgrouped_state_stepsZbias_correctionsrkZ step_sizer/)rOrjrr0_multi_tensor_adamax1s                     rz)Zsingle_tensor_fnF)rrIrJrKrLr#rrrrMr!rOrPrr"c Cstjs$tdd|Ds$td|dur>t||dd\}}|rTtjrTtd|rhtjsht}nt }||||||| | | | |||| |ddS) zrFunctional API that performs adamax algorithm computation. See :class:`~torch.optim.Adamax` for details. css|]}t|tjVqdSrm)r&r<r)rntr/r/r0roszadamax..zPAPI has changed, `state_steps` argument must contain a list of singleton tensorsNF)Z use_fusedz6torch.jit.script not supported with foreach optimizers) r!rOrPrr"rrrMr) r<rarbrurFrr^r_rzrl)rrIrJrKrLr#rrrrMr!rOrPrr"ryfuncr/r/r0rs> )NFFFF)typingrrrr<rZ optimizerrrr r r r r rrrrrrrr__all__r__doc__rxr=rVrlrzrr/r/r/r0s D    1 P t