a d4@s,ddlZddlmZddlmZmZmZmZmZmZm Z ddl m Z ddl m Z mZddgZGd ddeZd d jee ed e_de ee ee ee eeeeeeeeeed ddZddZe ee ee ee eeeeeeeed ddZe ee ee ee eeeeeeeed ddZdS)N)Tensor) Optimizer_use_grad_for_differentiable _get_value_default_to_fused_or_foreach_differentiable_doc _foreach_doc _maximize_doc)"_group_tensors_by_device_and_dtype)ListOptionalAdagradadagradcs^eZdZddddeeeedfdd Zfd d Zd d ZddZe dddZ Z S)r{Gz?r绽|=NF)maximizedifferentiableforeachrrc sd|kstd|d|ks,td|d|ksBtd|d|ksXtd|d|ksntd|t|||||||| d} t|| |jD]X} | dD]J} |j| } td| d <t | rt ||n|}tj | |tj d | d <qqdS) NgzInvalid learning rate: {}zInvalid lr_decay value: {}zInvalid weight_decay value: {}z+Invalid initial_accumulator_value value: {}zInvalid epsilon value: {})lrlr_decayeps weight_decayinitial_accumulator_valuerrrparamsstep)Z memory_formatsum) ValueErrorformatdictsuper__init__ param_groupsstatetorchtensor is_complexcomplexZ full_likeZpreserve_format)selfrrrrrrrrrdefaultsgrouppr$Z init_value __class__\/var/www/html/stable-diffusion-webui/venv/lib/python3.9/site-packages/torch/optim/adagrad.pyr" sH      zAdagrad.__init__cst||jD](}|dd|dd|ddqt|j}t|dkoft |dd}|s|D]}t t |d|d<qpdS)NrrFrrr) r! __setstate__r# setdefaultlistr$valueslenr%Z is_tensorr&float)r)r$r+Z state_valuesZstep_is_tensorsr-r/r0r1Bs     zAdagrad.__setstate__cCs4|jD](}|dD]}|j|}|dqqdS)Nrr)r#r$Z share_memory_)r)r+r,r$r/r/r0 share_memoryQs   zAdagrad.share_memoryc Cshd}|dD]V}|jdur |jjr&d}||||j|j|}||d||dq |S)NFrTrr)grad is_sparseappendr$) r)r+params_with_gradgrads state_sums state_stepshas_sparse_gradr,r$r/r/r0 _init_groupWs     zAdagrad._init_groupc Csd}|dur:t|}Wdn1s00Y|jD]b}g}g}g}g}||||||}t|||||d|d|d|d||d|d|dd q@|S) zPerforms a single optimization step. Args: closure (Callable, optional): A closure that reevaluates the model and returns the loss. Nrrrrrrr)rrrrr@rrr)r%Z enable_gradr#rAr) r)closureZlossr+r<r=r>r?r@r/r/r0res2 $ z Adagrad.step)rrrrrN)N) __name__ __module__ __qualname__r boolr"r1r8rArr __classcell__r/r/r-r0r s& 5 a[Implements Adagrad algorithm. .. math:: \begin{aligned} &\rule{110mm}{0.4pt} \\ &\textbf{input} : \gamma \text{ (lr)}, \: \theta_0 \text{ (params)}, \: f(\theta) \text{ (objective)}, \: \lambda \text{ (weight decay)}, \\ &\hspace{12mm} \tau \text{ (initial accumulator value)}, \: \eta\text{ (lr decay)}\\ &\textbf{initialize} : state\_sum_0 \leftarrow 0 \\[-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} \tilde{\gamma} \leftarrow \gamma / (1 +(t-1) \eta) \\ &\hspace{5mm} \textbf{if} \: \lambda \neq 0 \\ &\hspace{10mm} g_t \leftarrow g_t + \lambda \theta_{t-1} \\ &\hspace{5mm}state\_sum_t \leftarrow state\_sum_{t-1} + g^2_t \\ &\hspace{5mm}\theta_t \leftarrow \theta_{t-1}- \tilde{\gamma} \frac{g_t}{\sqrt{state\_sum_t}+\epsilon} \\ &\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 `Adaptive Subgradient Methods for Online Learning and Stochastic Optimization`_. a Args: params (iterable): iterable of parameters to optimize or dicts defining parameter groups lr (float, optional): learning rate (default: 1e-2) lr_decay (float, optional): learning rate decay (default: 0) weight_decay (float, optional): weight decay (L2 penalty) (default: 0) eps (float, optional): term added to the denominator to improve numerical stability (default: 1e-10) {foreach} {maximize} {differentiable} .. _Adaptive Subgradient Methods for Online Learning and Stochastic Optimization: http://jmlr.org/papers/v12/duchi11a.html rF) rr=r>r?r@rrrrrrrc Cstdd|Dstd|dur4t||dd\} }|rJtjrJtd|r^tjs^t} nt} | ||||||| | || |d dS) ztFunctional API that performs Adagrad algorithm computation. See :class:`~torch.optim.Adagrad` for details. css|]}t|tjVqdSN) isinstancer%r).0tr/r/r0 zadagrad..zPAPI has changed, `state_steps` argument must contain a list of singleton tensorsNF)Z use_fusedz6torch.jit.script not supported with foreach optimizersrrrrr@rr)all RuntimeErrorrr%ZjitZ is_scripting_multi_tensor_adagrad_single_tensor_adagrad)rr=r>r?r@rrrrrrr_funcr/r/r0rs0cCs8|}|dks |dkr*t|St|||S)Nr)sizeZnumelr%Z empty_likeZsparse_coo_tensor)r9 grad_indicesr4rUr/r/r0 _make_sparses rW) rr=r>r?rrrrr@rrc Csrt||||D]\\} } } }|d7}t|}| s4| n| } |dkr^| jrPtd| j| |d} |d|d|}| jr| } | }| }| t | || d| | }| |}| jt | |||| dqt | }|rt | } t | } t | } | j| | dd| r4| |}n| |}| j| || d|rt | } t | } qdS)Nrrz;weight_decay option is not compatible with sparse gradientsalphavalue)ziprr:rPaddZcoalesceZ_indicesZ_valuesZadd_rWpowZ sparse_maskZsqrt_r%r' view_as_realZaddcmul_sqrtZaddcdiv_view_as_complex)rr=r>r?rrrrr@rrparamr9Z state_sumZstep_trZclrrVZ grad_valuesstdZ std_valuesr'r/r/r0rRsD      rRcsR| r Jdt|dkrdSt||||g} | D]\} } }| rPt| } tdd| D}|rt| | |||dd| d St|d|dkrtj| |d } fd d |D}d d | D} d d | D} tj | | | ddtt | |}t t | ||}fdd t |D}t|fdd t | D} q4dS)Nz#_foreach ops don't support autogradrcss|] }|jVqdSrH)r:)rJr9r/r/r0rLJrMz(_multi_tensor_adagrad..TFrNrrXcs"g|]} d|dqS)rr/)rJr)rrr/r0 arMz)_multi_tensor_adagrad..cSs$g|]}t|rt|n|qSr/r%r'r`rJxr/r/r0recrMcSs$g|]}t|rt|n|qSr/rfrgr/r/r0redsr[cs,g|]$\}}t|r$t|n|qSr/r%r'rbrJirh device_paramsr/r0rejscs,g|]$\}}t|r$t|n|qSr/rirjrlr/r0reos)r5r r4r%Z _foreach_neganyrRZ _foreach_add_Z _foreach_addZ_foreach_addcmul_Z _foreach_sqrtZ _foreach_divZ _foreach_mul enumerate)rr=r>r?rrrrr@rrZgrouped_tensorlistsZ device_gradsZdevice_state_sumsZdevice_state_stepsZdevice_has_sparse_gradZ minus_clrrdZtoAddr/)rmrrr0rQ/sP        rQ)NNF)r%rZ optimizerrrrrrr r Ztorch.utils._foreach_utilsr typingr r __all__rr__doc__rFr6rrWrRrQr/r/r/r0sl $ 3 5 ;