U
    •Ê¹j5  ã                   @   s(  d dl Z d dl mZ ddlmZmZmZmZmZmZm	Z	 d dl
mZmZ ddgZG dd„ deƒZd	d
e› de	› de› d� e_dee ee ee ee eee eeeeeedœdd„Zdd„ Zee ee ee ee eeeeeeedœdd„Zee ee ee ee eeeeeeedœdd„ZdS )é    N)ÚTensoré   )Ú	OptimizerÚ_use_grad_for_differentiableÚ
_get_valueÚ_default_to_fused_or_foreachÚ_differentiable_docÚ_foreach_docÚ_maximize_doc)ÚListÚOptionalÚAdagradÚadagradc                       s^   e Zd Zddddœee eedœ‡ fdd	„Z‡ fd
d„Zdd„ Zdd„ Ze	ddd„ƒZ
‡  ZS )r   ç{®Gáz„?r   ç»½×Ùß|Û=NF)ÚmaximizeÚdifferentiable)Úforeachr   r   c             
      sø   d|kst d|› �ƒ‚d|ks,t d|› �ƒ‚d|ksBt d|› �ƒ‚d|ksXt d|› �ƒ‚d|ksnt d|› �ƒ‚t||||||||	d�}
tƒ  ||
¡ | jD ]X}|d D ]J}| j| }t d¡|d	< t |¡rÖt	||ƒn|}tj
||tjd
�|d< q¦qšd S )Ng        zInvalid learning rate: zInvalid lr_decay value: zInvalid weight_decay value: z)Invalid initial_accumulator_value value: zInvalid epsilon value: )ÚlrÚlr_decayÚepsÚweight_decayÚinitial_accumulator_valuer   r   r   ÚparamsÚstep)Zmemory_formatÚsum)Ú
ValueErrorÚdictÚsuperÚ__init__Úparam_groupsÚstateÚtorchÚtensorÚ
is_complexÚcomplexZ	full_likeZpreserve_format)Úselfr   r   r   r   r   r   r   r   r   ÚdefaultsÚgroupÚpr!   Z
init_value©Ú	__class__© úR/var/www/html/bwave/python/venv/lib/python3.8/site-packages/torch/optim/adagrad.pyr      sH    ÿø


ÿý  ÿzAdagrad.__init__c                    s�   t ƒ  |¡ | jD ](}| dd ¡ | dd¡ | dd¡ qt| j ¡ ƒ}t|ƒdkoft 	|d d ¡}|sŒ|D ]}t 
t|d ƒ¡|d< qpd S )Nr   r   Fr   r   r   )r   Ú__setstate__r    Ú
setdefaultÚlistr!   ÚvaluesÚlenr"   Z	is_tensorr#   Úfloat)r&   r!   r(   Zstate_valuesZstep_is_tensorÚsr*   r,   r-   r.   ?   s    

ÿzAdagrad.__setstate__c                 C   s4   | j D ](}|d D ]}| j| }|d  ¡  qqd S )Nr   r   )r    r!   Zshare_memory_)r&   r(   r)   r!   r,   r,   r-   Úshare_memoryN   s    

zAdagrad.share_memoryc           	      C   sh   d}|d D ]V}|j d k	r|j jr&d}| |¡ | |j ¡ | j| }| |d ¡ | |d ¡ q|S )NFr   Tr   r   )ÚgradÚ	is_sparseÚappendr!   )	r&   r(   Úparams_with_gradÚgradsÚ
state_sumsÚstate_stepsÚhas_sparse_gradr)   r!   r,   r,   r-   Ú_init_groupT   s    


zAdagrad._init_groupc           	      C   s”   d}|dk	r&t  ¡ � |ƒ }W 5 Q R X | jD ]b}g }g }g }g }|  |||||¡}t|||||d |d |d |d ||d |d |d d	� q,|S )
z±Performs a single optimization step.

        Args:
            closure (Callable, optional): A closure that reevaluates the model
                and returns the loss.
        Nr   r   r   r   r   r   r   )r   r   r   r   r=   r   r   r   )r"   Zenable_gradr    r>   r   )	r&   ÚclosureZlossr(   r9   r:   r;   r<   r=   r,   r,   r-   r   b   s2    

ôzAdagrad.step)r   r   r   r   r   N)N)Ú__name__Ú
__module__Ú__qualname__r   Úboolr   r.   r5   r>   r   r   Ú__classcell__r,   r,   r*   r-   r      s&         ø
õõ3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)
        z	
        zŽ

    .. _Adaptive Subgradient Methods for Online Learning and Stochastic
        Optimization: http://jmlr.org/papers/v12/duchi11a.html

    F)r   r:   r;   r<   r=   r   r   r   r   r   r   r   c                C   s„   t dd„ |D ƒƒstdƒ‚|dkr4t| |dd�\}}|rJtj ¡ rJtdƒ‚|r^tj ¡ s^t}nt}|| ||||||	|
|||d� dS )	ztFunctional API that performs Adagrad algorithm computation.

    See :class:`~torch.optim.Adagrad` for details.
    c                 s   s   | ]}t |tjƒV  qd S ©N)Ú
isinstancer"   r   )Ú.0Útr,   r,   r-   Ú	<genexpr>Ì   s     zadagrad.<locals>.<genexpr>zPAPI has changed, `state_steps` argument must contain a list of singleton tensorsNF)Z	use_fusedz6torch.jit.script not supported with foreach optimizers©r   r   r   r   r=   r   r   )ÚallÚRuntimeErrorr   r"   ZjitZis_scriptingÚ_multi_tensor_adagradÚ_single_tensor_adagrad)r   r:   r;   r<   r=   r   r   r   r   r   r   r   Ú_Úfuncr,   r,   r-   r   ¶   s0    ÿõc                 C   s8   |   ¡ }| ¡ dks | ¡ dkr*t | ¡S t |||¡S )Nr   )ÚsizeZnumelr"   Z
empty_likeZsparse_coo_tensor)r6   Úgrad_indicesr1   rQ   r,   r,   r-   Ú_make_sparseë   s    
rS   )r   r:   r;   r<   r   r   r   r   r=   r   r   c             	   C   sr  t | |||ƒD �]\\}}}}|d7 }t|ƒ}|	s4|n| }|dkr^|jrPtdƒ‚|j||d�}|d|d |   }|jrâ| ¡ }| ¡ }| ¡ }| t	||| 
d¡ƒ¡ | |¡}| ¡  ¡  |¡}|jt	|||| ƒ| d� qt |¡}|�rt |¡}t |¡}t |¡}|j||dd� |
�r4| ¡ | }n| ¡  |¡}|j||| d� |rt |¡}t |¡}qd S )Nr   r   z;weight_decay option is not compatible with sparse gradients©Úalphaé   ©Úvalue)Úzipr   r7   rL   ÚaddZcoalesceZ_indicesZ_valuesZadd_rS   ÚpowZsparse_maskZsqrt_r"   r$   Úview_as_realZaddcmul_ÚsqrtZaddcdiv_Zview_as_complex)r   r:   r;   r<   r   r   r   r   r=   r   r   Úparamr6   Z	state_sumZstep_tr   ZclrrR   Zgrad_valuesÚstdZ
std_valuesr$   r,   r,   r-   rN   ò   sF    ÿ
 ÿ




rN   c                   sp  |
rt dƒ‚t| ƒdkrd S t | |||g¡}| ¡ D �]2\\}}}}}tdd„ |D ƒƒ}|r€t||||ˆ |ˆ|dd|
d�  S |	rŽt |¡}dd	„ |D ƒ}d
d	„ |D ƒ}dd	„ |D ƒ}t 	|d¡ |dkrò|	râtj	|||d� ntj
|||d�}‡ ‡fdd	„|D ƒ}tj|||dd� t |¡}t 	||¡ |dk�s>|	�rPt ||¡ |}nt ||¡}t |||¡ q6d S )Nz#_foreach ops don't support autogradr   c                 s   s   | ]}|j V  qd S rE   )r7   )rG   r6   r,   r,   r-   rI   D  s     z(_multi_tensor_adagrad.<locals>.<genexpr>TFrJ   c                 S   s$   g | ]}t  |¡rt  |¡n|‘qS r,   ©r"   r$   r\   ©rG   Úxr,   r,   r-   Ú
<listcomp>Y  s     z)_multi_tensor_adagrad.<locals>.<listcomp>c                 S   s$   g | ]}t  |¡rt  |¡n|‘qS r,   r`   ra   r,   r,   r-   rc   Z  s    c                 S   s$   g | ]}t  |¡rt  |¡n|‘qS r,   r`   ra   r,   r,   r-   rc   ]  s     r   rT   c                    s&   g | ]}ˆ  d t |ƒd  ˆ   ‘qS )r   )r   )rG   r   ©r   r   r,   r-   rc   i  s     rW   )ÚAssertionErrorr2   r   Z"_group_tensors_by_device_and_dtyper1   ÚanyrN   r"   Z_foreach_negZ_foreach_add_Z_foreach_addZ_foreach_addcmul_Z_foreach_sqrtZ_foreach_mul_Z_foreach_mulZ_foreach_addcdiv_)r   r:   r;   r<   r   r   r   r   r=   r   r   Zgrouped_tensorlistsZdevice_paramsZdevice_gradsZdevice_state_sumsZdevice_state_stepsrO   Zdevice_has_sparse_gradZ	minus_clrr_   Ú	numeratorr,   rd   r-   rM   ,  sR    õ

ÿ
rM   )NNF)r"   r   Z	optimizerr   r   r   r   r   r	   r
   Útypingr   r   Ú__all__r   Ú__doc__rC   r3   r   rS   rN   rM   r,   r,   r,   r-   Ú<module>   sp   $	÷
öõç3   ÷ñ5ô;ô