ia$ dZddlmZddlZddlmZddlmZmZmZm Z m Z m Z m Z m Z mZmZmZmZmZmZmZddgZGd deZd d ed e d ed ed ed ze_deedeedeedeedeedededededededededededdf dZdeedeedeedeedeedededededededededededdf d Ze e! d$deedeedeedeedeeded"edzdedededededededededdf"d#Zy)%z'Implementation for the RAdam algorithm.)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 OptimizerParamsTRAdamradamceZdZ dddddddedeezdeeefdeded ed edzd ed ed eddffdZfdZ dZ e ddZ xZ S)rFN)foreachmaximize capturabledifferentiableparamslrbetaseps weight_decaydecoupled_weight_decayrrrrreturnc t|tr|jdk7r tdd|kstd|d|kstd|d|dcxkrdksntd|dd|dcxkrdksntd |dd|kstd |||||||| || d } t ||| y) 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 rrrr!r) isinstancernumel ValueErrorsuper__init__) selfrrrrr r!rrrrdefaults __class__s f/Volumes/fast/ai/experiments/voice-extract-mac/.venv/lib/python3.12/site-packages/torch/optim/radam.pyr*zRAdam.__init__ s b& !bhhjAo:; ;by6rd;< <cz6se<= =eAh$$B58*MN NeAh$$B58*MN Nl";L>JK K( $&<,   *cXt|||jD] }|jdd|jdd|jdd|jdd|jdd|dD]}|jj |g}t |dk7s.tj|d rGt|d }|dr*tj|t|j ntj|t |d < y) NrrFrr!rrrstepdtypedevicer3) r) __setstate__ param_groups setdefaultstategetlentorch is_tensorfloattensorr r4)r+r9grouppp_statestep_valr-s r.r6zRAdam.__setstate__Hs U#&&E   Y -   Z /   -u 5   5u =   \5 18_**..B/w<1$U__WV_-M$WV_5H !. $,=,?#\\(:K:MN FO % 'r/cd}|dD]o}|j|tj|z}|j||jjr t d|j|j|j |} t| dk(r|dr*tjdt|jntjdt | d <tj|tj | d <tj|tj | d <|j| d |j| d |j| d r|S)NFrz'RAdam does not support sparse gradientsrrr2r$r5r1) memory_formatexp_avg exp_avg_sq)gradr< is_complexappend is_sparse RuntimeErrorr9r;zerosr r4r? zeros_likepreserve_format) r+r@params_with_gradgradsexp_avgs exp_avg_sqs state_steps has_complexrAr9s r. _init_groupzRAdam._init_group\sH xAvv!u//22  ''*66##&'PQQ QVV$ 1 u:?!. B.?.A!((S"\\#5F5HI&M (-'7'7)>)>(E)$+0*:*:)>)>+E,'i 01""5#67""5=17!:r/c|jd}|$tj5|}ddd|jD]x}g}g}g}g}g}t t t t f|d\} } |j||||||} t|||||| | |d|d|d|d|d|d|d |d | z|S#1swYxYw) zPerform a single optimization step. Args: closure (Callable, optional): A closure that reevaluates the model and returns the loss. Nrrr rrrrrr!) beta1beta2rr rrrrrr!rV) '_accelerator_graph_capture_health_checkr< enable_gradr7rtupler>rWr) r+closurelossr@rQrRrSrTrUrYrZrVs r.r1z RAdam.steps  446  ""$y%&&E-/ "$E%'H(*K(*KeUl 3U7^DLE5**'+{K  ;">2%Lz*i( .$%56',-E'F'! '> E%$s CC )gMbP?)g?g+?g:0yE>rFN)__name__ __module__ __qualname__rr>rr]boolr*r6rWrr1 __classcell__)r-s@r.rrs"%1',&+ $ $&+&+ FN&+UE\" &+  &+  &+!%&+&+&+&+&+ &+P(!F"-"-r/aImplements RAdam algorithm. .. 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{ (weightdecay)}, \:\textit{maximize} \\ &\hspace{13mm} \epsilon \text{ (epsilon)}, \textit{decoupled\_weight\_decay} \\ &\textbf{initialize} : m_0 \leftarrow 0 \text{ ( first moment)}, v_0 \leftarrow 0 \text{ ( second moment)}, \\ &\hspace{18mm} \rho_{\infty} \leftarrow 2/(1-\beta_2) -1 \\[-1.ex] &\rule{110mm}{0.4pt} \\ &\textbf{for} \: t=1 \: \textbf{to} \: \ldots \: \textbf{do} \\ &\hspace{6mm}\textbf{if} \: \textit{maximize}: \\ &\hspace{12mm}g_t \leftarrow -\nabla_{\theta} f_t (\theta_{t-1}) \\ &\hspace{6mm}\textbf{else} \\ &\hspace{12mm}g_t \leftarrow \nabla_{\theta} f_t (\theta_{t-1}) \\ &\hspace{6mm} \theta_t \leftarrow \theta_{t-1} \\ &\hspace{6mm} \textbf{if} \: \lambda \neq 0 \\ &\hspace{12mm}\textbf{if} \: \textit{decoupled\_weight\_decay} \\ &\hspace{18mm} \theta_t \leftarrow \theta_{t} - \gamma \lambda \theta_{t} \\ &\hspace{12mm}\textbf{else} \\ &\hspace{18mm} g_t \leftarrow g_t + \lambda \theta_{t} \\ &\hspace{6mm}m_t \leftarrow \beta_1 m_{t-1} + (1 - \beta_1) g_t \\ &\hspace{6mm}v_t \leftarrow \beta_2 v_{t-1} + (1-\beta_2) g^2_t \\ &\hspace{6mm}\widehat{m_t} \leftarrow m_t/\big(1-\beta_1^t \big) \\ &\hspace{6mm}\rho_t \leftarrow \rho_{\infty} - 2 t \beta^t_2 /\big(1-\beta_2^t \big) \\[0.1.ex] &\hspace{6mm}\textbf{if} \: \rho_t > 5 \\ &\hspace{12mm} l_t \leftarrow \frac{\sqrt{ (1-\beta^t_2) }}{ \sqrt{v_t} +\epsilon } \\ &\hspace{12mm} r_t \leftarrow \sqrt{\frac{(\rho_t-4)(\rho_t-2)\rho_{\infty}}{(\rho_{\infty}-4)(\rho_{\infty}-2) \rho_t}} \\ &\hspace{12mm}\theta_t \leftarrow \theta_t - \gamma \widehat{m_t} r_t l_t \\ &\hspace{6mm}\textbf{else} \\ &\hspace{12mm}\theta_t \leftarrow \theta_t - \gamma \widehat{m_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 `On the variance of the adaptive learning rate and beyond`_. This implementation provides an option to use either the original weight_decay implementation as in Adam (where the weight_decay is applied to the gradient) or the one from AdamW (where weight_decay is applied to the weight) through the decoupled_weight_decay option. When decoupled_weight_decay is set to False (default), it uses the original Adam style weight decay, otherwise, it uses the AdamW style which corresponds more closely to the `author's implementation`_ in the RAdam paper. Further information about decoupled weight decay can be found in `Decoupled Weight Decay Regularization`_. z Args: a lr (float, Tensor, optional): learning rate (default: 1e-3) 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) decoupled_weight_decay (bool, optional): whether to decouple the weight decay as in AdamW to obtain RAdamW. If True, the algorithm does not accumulate weight decay in the momentum nor variance. (default: False) z a .. _On the variance of the adaptive learning rate and beyond: https://arxiv.org/abs/1908.03265 .. _author's implementation: https://github.com/LiyuanLucasLiu/RAdam .. _Decoupled Weight Decay Regularization: https://arxiv.org/abs/1711.05101 rrRrSrTrUrYrZrr rr!rrrrVr"c   tjjs t|}t |D]P\}}| s||n|| }||}||||}tj j s`| r^t}|jj|jjk(r|jj|vstd|dtj|rTtj|}tj|}tj|}tj|dz }| r|n t|}|dk7r-| r|jd||zz n|j||}|j!|d|z j|j#||d|z d||zz }d||zz ||z }dd|z z dz d|z||zzz z fd} fd }| rBtj$d kD||zd }|j'||z|zd d kDr(|j'||z|z|zd ;|j'||zd Sy) NIIf capturable=True, params and state_steps must be on supported devices: .rralpha)valuecDdz dz zzdz dz zzz dzS)Nrl?rE)rho_infrho_tsr. _compute_rectz+_single_tensor_radam.._compute_rectEsK19aKGaK058:  r/c~j}r|j}n|j}dz|z S)Nro)sqrtaddadd_)exp_avg_sq_sqrtbias_correction2rrrHs r._compute_adaptive_lrz2_single_tensor_radam.._compute_adaptive_lrNsD(oo/O"1"5"5c":"1"6"6s";%c)_< |$dkD|#d!}%}#}$~ ~|%D%cgc]}%tj>|%dkDdd }&}%tj,|&|tj(||}tj*|tj |dtj.|&|tj*|&tj(||}tj*|tj |dtj<|tj,||tj,|%~%tj*|tj.||~n|D$cgc])}$|$dkDr |$dz |$dz z|z|dz |dz z|$zz dznd+}%}$|%D%cgc] }%|%dkDrdnd  }'}%|Dcgc]}d|t1|zz }}t|'|dD%(cgc]\}%}(||%z|(z dz}&}%}(t|%|dD%(cgc]&\}}%}(d|t1|zz dz||%z|(z zdz(}}%}}(tj@|})tj |)| tj.|)|tjB|)tj |)|&tj6|||)bycc}wcc}$}#wcc}%wcc}$wcc}%wcc}wcc}(}%wcc}(}%}w)Nrz#_foreach ops don't support autogradF) supports_xlac3K|]N\}}|jj|jjk(xr|jjvPywr`)r4r).0rAr1rs r. z&_multi_tensor_radam..sR A4 HHMMT[[-- - > !== >@sAAT)strictrgrhr%cpu)r4rirrlrnrzr$ro)"r;rr<r~rr allziprr"_group_tensors_by_device_and_dtypevaluesrlistris_cpu _foreach_add_r?r _foreach_neg _foreach_pow _foreach_neg_ _foreach_mul_ _foreach_div_r _foreach_add_foreach_lerp__foreach_addcmul_ _foreach_sub _foreach_mul_foreach_sqrt_r _foreach_sqrt_foreach_reciprocal_)+rrRrSrTrUrYrZrr rr!rrrrVgrouped_tensorsgrouped_params_grouped_grads_grouped_exp_avgs_grouped_exp_avg_sqs_grouped_state_steps__grouped_params grouped_gradsgrouped_exp_avgsgrouped_exp_avg_sqsgrouped_state_stepsrprrx rho_t_listr1numsub2denomnrqrectunrect_step_size unrectifiedbcbufferrs+ @r._multi_tensor_radamrks`$ 6{aBCC >> & & (Z'H( $ v{4@  ![\x[yyz{  BBBB +{;O  " " $   d6lO<T&\>: V .?@"4<1EF"4<1EF ~~**,1DQ1G1N1N   #U\\#e%DC     3Q 7   /?AT  !..}=Mq5y/A% $11%9LM     0 1    0! 4$11%9LM     02E F    0! 4    02B C    0 1    0' :)J0  0D T"#Jt,,.u 4 00022 0  1 %##NA\8I4IJ''%~\%*$6$6%~\%M -}a%iH /7   q5y  $$Z3C%%j!4D   T *   W -{w{3G&&z7;E   U +   % !$CD A AHAu ECKC0 A LPQDD D1Hc3 ?D Q    0" 5$11%9LM     0 1    0! 4    02B C    0 1$11%9LM     0 1    0! 4  !1 2    0" 5    0$ 7    0 1    02B C ( (E19 QYqy" ! ! 4u<>  (  ?CCddq1c1dKC;N :M$EZ---:M   !$K1A$ O  OHD"dR2% O   '*'/?' 'ND$ez$///C7BINKbP'  $$%89 FC( F$45 ""6* F$45 0@&Is %X^ R* D   s09\6$\#!\<.\"0\'\,1\1+\7 )single_tensor_fnrc Btd|Ds td|t||d\}}|r)tjj r td|r%tjj st }nt}||||||| | | ||| |||| y)zpFunctional API that performs RAdam algorithm computation. See :class:`~torch.optim.RAdam` for details. c3PK|]}t|tj ywr`)r&r<r)rts r.rzradam..Rs@Kqz!U\\*Ks$&zPAPI has changed, `state_steps` argument must contain a list of singleton tensorsNF) use_fusedz6torch.jit.script not supported with foreach optimizers) rYrZrr rrr!rrrV)rrMrr<r{r|rr)rrRrSrTrUr!rrrrVrrYrZrr rrfuncs r.rr8s4 @K@ @ ^  1 Ne 7599))+STTuyy--/"#  ! 5%r/)FNFFFF)__doc__typingrr<r optimizerrrrr r r r r rrrrrrr__all__rrr>rdrrrrEr/r.rs7. & G NINd2f        gK `hD LhD <hD6lhDf hD f hD hD hD hDhD hD!hDhDhDhD !hD" #hDVJJ LJJ <JJ6lJJf JJ f JJ JJ JJ JJJJ JJ!JJJJJJJJ !JJ" #JJZ 1EF$) ; L; <;6l;f ; f ;!;D[;;;;; ; !;" #;$%;& ';( );G;r/