o iHD"@sddlmZddlZddlmZddlmZmZmZmZm Z m Z m Z m Z m Z mZmZmZmZmZmZddgZGdddeZd d ed e d e d ed ed e_deedeedeedeedeededededededededededdfddZdeedeedeedeedeededededededededededdfdd Zeed!  " " " "d%deedeedeedeedeed#edBdedededededededededdf d$dZdS)&)castN)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 OptimizerParamsTAdamaxadamaxcseZdZ     dddddded eeBd eeefd ed ed edBdedededdffddZfddZ ddZ e dddZ Z S)rMb`?g?g+?:0yE>rNF)maximizedifferentiable capturableparamslrbetaseps weight_decayforeachrrrreturnc st|tr|dkrtdd|kstd|d|ks%td|d|dkr1dks;ntd|dd|dkrGdksQntd |dd|ks\td ||||||||| 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: )rrrr r!rrr) isinstancernumel ValueErrorsuper__init__) selfrrrrr r!rrrdefaults __class__T/sda-disk/www/egybert/egybert_env/lib/python3.10/site-packages/torch/optim/adamax.pyr)s,  zAdamax.__init__cst||jD]S}|dd|dd|dd|dd|dD]4}|j|g}t|dkr[t|ds[t |d}|drQtj |t |j d ntj |t d |d<q'q dS) Nr!rFrrrrstepdtypedevicer2) r( __setstate__ param_groups setdefaultstategetlentorch is_tensorfloattensorr r3)r*r8grouppp_statestep_valr,r.r/r5Ds&         zAdamax.__setstate__c Csd}|dD]n}|jdurq|t|O}|||jjr"td||j|j|} t| dkr_|drAtjdt |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.r1r#r4r0) memory_formatexp_avgexp_inf)gradr; is_complexappend is_sparse RuntimeErrorr8r:zerosr r3r> zeros_likepreserve_format) r*r?params_with_gradgradsexp_avgsexp_infs state_steps has_complexr@r8r.r.r/ _init_groupWs2        zAdamax._init_groupcCs|d}|dur!t |}Wdn1swY|jD]K}g}g}g}g}g}|d\} } |d} |d} |d} |d}|d}|d}|d }|||||||}t|||||| | | | | |||||d q$|S) zPerforms a single optimization step. Args: closure (Callable, optional): A closure that reevaluates the model and returns the loss. Nrrrr r!rrr) rbeta1beta2rr r!rrrrS) _cuda_graph_capture_health_checkr; enable_gradr6rTr)r*closurelossr?rNrOrPrQrRrUrVrrr r!rrrrSr.r.r/r0zsR    z Adamax.step)rrrrNN)__name__ __module__ __qualname__rr=rtupleboolr)r5rTrr0 __classcell__r.r.r,r/rsF       &#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 rrOrPrQrRrrUrVrr rrrrSr"c Cstjs t|}t|D]\}}||}| s|n| }||}||}||}tjsH| rHt}|jj |jj kr@|jj |vsHt d|d|d7}| dkrW|j || d}t |rpt |}t |}t |}t |}||d|| stj|||||dn!t||d||dgd}|tj|ddd| r||d}||||}|||q d|t|}||}|j||| d q dS) NIIf capturable=True, params and state_steps must be on supported devices: .rralpha)outF)keepdim)value)r;jit is_scriptingr enumeratecompiler is_compilingr r3typeAssertionErroraddrG view_as_reallerp_maximummul_absadd_cat unsqueeze unsqueeze_copy_amaxdiv_addcdiv_r )rrOrPrQrRrrUrVrr rrrrSiparamrFrDrEstep_tcapturable_supported_devicesnorm_bufneg_bias_correctiondenombias_correctionclrr.r.r/_single_tensor_adamaxsX         "  rc sB| rtdt|dkrdStjs2| r2tddtfddt||ddDs2td d tt |||||g}| D]\\}}}}}}t t t|}t t t|}t t t|}t t t|}t t t|}| ryt||||| rt|}tjs|djrtj|tjd d d d dnt|d| dkr| rtj||| dntj||| d}t||dt||| s| dkrt|}nt|t||t||| rt|}t|dt|t||}t|||qDfdd|D}fdd|D}t||||qDdS)Nz#_foreach ops don't support autogradrF) supports_xlac3s0|]\}}|jj|jjko|jjvVqdSr[)r3rn).0r@r0)rr.r/ Ns   z'_multi_tensor_adamax..T)strictrbrcr$cpu)r3rdrcsg|] }dt|qS)rr )rr0)rUr.r/ sz(_multi_tensor_adamax..csg|] }t|dqS)r)rbc)rr.r/rs)ror:r;rlrmr allziprr"_group_tensors_by_device_and_dtypevaluesrlistrr _foreach_negis_cpu _foreach_add_r> _foreach_add_foreach_lerp_ _foreach_mul_ _foreach_abs _foreach_abs__foreach_maximum_ _foreach_pow _foreach_sub_ _foreach_div_ _foreach_mul_foreach_addcdiv_)rrOrPrQrRrrUrVrr rrrrSgrouped_tensorsgrouped_params_grouped_grads_grouped_exp_avgs_grouped_exp_infs_grouped_state_steps__grouped_params grouped_gradsgrouped_exp_avgsgrouped_exp_infsgrouped_state_stepsbias_correctionsr step_sizer.)rUrrr/_multi_tensor_adamax2s                   r)single_tensor_fnFr!c Cstjstdd|Dstd|durt||dd\}}|r*tjr*td|r4tjs4t}nt }||||||| | | | |||| |ddS) zrFunctional API that performs adamax algorithm computation. See :class:`~torch.optim.Adamax` for details. css|] }t|tjVqdSr[)r%r;r)rtr.r.r/rs  zadamax..zPAPI has changed, `state_steps` argument must contain a list of singleton tensorsNF) use_fusedz6torch.jit.script not supported with foreach optimizers) rrUrVrr rrrSr) r;rlrmrrJrrirjrr)rrOrPrQrRr!rrrrSrrUrVrr rfuncr.r.r/rs>  )NFFFF)typingrr;r optimizerrrrrr r r r r rrrrrr__all__r__doc__rr=r`rrrr.r.r.r/s  D    0      P      v