o
    ôjüA  ã                   @   s´  d dl mZmZmZ 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mZmZmZ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_dee dee dee dee dee dedededededededefdd„Zdee dee dee dee dee dedededededededefdd„Ze
ed�					d"dee dee dee dee dee d ee dedededededededefd!d„ƒZdS )#é    )ÚListÚOptionalÚTupleN)ÚTensoré   )Ú_capturable_docÚ_default_to_fused_or_foreachÚ_differentiable_docÚ_disable_dynamo_if_unsupportedÚ_foreach_docÚ!_get_capturable_supported_devicesÚ_get_scalar_dtypeÚ_maximize_docÚ_use_grad_for_differentiableÚ_view_as_realÚ	OptimizerÚParamsTÚRpropÚrpropc                       sˆ   e Zd Z			ddddddœdeded	eeef d
eeef dedee dedef‡ fdd„Z‡ fdd„Z	dd„ Z
eddd„ƒZ‡  ZS )r   ç{®Gáz„?©g      à?g333333ó?©g�íµ ÷Æ°>é2   FN)Ú
capturableÚforeachÚmaximizeÚdifferentiableÚparamsÚlrÚetasÚ
step_sizesr   r   r   r   c          
   	      s‚   d|kst d|› �ƒ‚d|d   k rd  k r|d k s-n t d|d › d|d › �ƒ‚t|||||||d�}	tƒ  ||	¡ d S )	Ng        zInvalid learning rate: r   ç      ð?r   zInvalid eta values: z, )r   r   r    r   r   r   r   )Ú
ValueErrorÚdictÚsuperÚ__init__)
Úselfr   r   r   r    r   r   r   r   Údefaults©Ú	__class__© úb/var/www/html/academy/tools/voices/clone/sv-venv/lib/python3.10/site-packages/torch/optim/rprop.pyr%      s   (ù	zRprop.__init__c                    s¾   t ƒ  |¡ | jD ]S}| dd ¡ | dd¡ | dd¡ | dd¡ |d D ]4}| j |g ¡}t|ƒdkr[t |d ¡s[t	|d ƒ}|d rQtj
|tƒ |jd	�ntj
|tƒ d
�|d< q'q	d S )Nr   r   Fr   r   r   r   Ústep©ÚdtypeÚdevice©r.   )r$   Ú__setstate__Úparam_groupsÚ
setdefaultÚstateÚgetÚlenÚtorchÚ	is_tensorÚfloatÚtensorr   r/   )r&   r4   ÚgroupÚpÚp_stateÚstep_valr(   r*   r+   r1   5   s&   
ý
ÿû€üûzRprop.__setstate__c                 C   s  d}|d D ]ƒ}|j d u rq|t |¡O }| |¡ |j }	|	jr$tdƒ‚| |	¡ | j| }
t|
ƒdkrt|d rBtjdt	ƒ |j
d�ntjdt	ƒ d�|
d	< tj|tjd
�|
d< |jjrjt |	t|d |d ƒ¡|
d< n
t |	|d ¡|
d< | |
d ¡ | |
d ¡ | |
d	 ¡ q|S )NFr   z'Rprop does not support sparse gradientsr   r   r*   r-   r0   r,   ©Úmemory_formatÚprevr   Ú	step_size)Úgradr7   Ú
is_complexÚappendÚ	is_sparseÚRuntimeErrorr4   r6   Úzerosr   r/   Ú
zeros_likeÚpreserve_formatr.   Ú	full_likeÚcomplex)r&   r;   r   ÚgradsÚprevsr    Ústate_stepsÚhas_complexr<   rC   r4   r*   r*   r+   Ú_init_groupH   s4   



ÿý
ÿzRprop._init_groupc                 C   sÎ   |   ¡  d}|dur!t ¡ � |ƒ }W d  ƒ n1 sw   Y  | jD ]@}g }g }g }g }g }|d \}	}
|d \}}|d }|d }|  ||||||¡}t||||||||	|
|||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   )	Ústep_size_minÚstep_size_maxÚetaminusÚetaplusr   r   r   r   rP   )Ú _cuda_graph_capture_health_checkr7   Úenable_gradr2   rQ   r   )r&   ÚclosureÚlossr;   r   rM   rN   r    rO   rT   rU   rR   rS   r   r   rP   r*   r*   r+   r,   n   sH   
ÿ
ÿòz
Rprop.step)r   r   r   ©N)Ú__name__Ú
__module__Ú__qualname__r   r9   r   Úboolr   r%   r1   rQ   r   r,   Ú__classcell__r*   r*   r(   r+   r      s<    ûöþý
ü
ûùø	÷
ö&aÁ
  Implements the resilient backpropagation algorithm.

    .. math::
       \begin{aligned}
            &\rule{110mm}{0.4pt}                                                                 \\
            &\textbf{input}      : \theta_0 \in \mathbf{R}^d \text{ (params)},f(\theta)
                \text{ (objective)},                                                             \\
            &\hspace{13mm}      \eta_{+/-} \text{ (etaplus, etaminus)}, \Gamma_{max/min}
                \text{ (step sizes)}                                                             \\
            &\textbf{initialize} :   g^0_{prev} \leftarrow 0,
                \: \eta_0 \leftarrow \text{lr (learning rate)}                                   \\
            &\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} \textbf{for} \text{  } i = 0, 1, \ldots, d-1 \: \mathbf{do}            \\
            &\hspace{10mm}  \textbf{if} \:   g^i_{prev} g^i_t  > 0                               \\
            &\hspace{15mm}  \eta^i_t \leftarrow \mathrm{min}(\eta^i_{t-1} \eta_{+},
                \Gamma_{max})                                                                    \\
            &\hspace{10mm}  \textbf{else if}  \:  g^i_{prev} g^i_t < 0                           \\
            &\hspace{15mm}  \eta^i_t \leftarrow \mathrm{max}(\eta^i_{t-1} \eta_{-},
                \Gamma_{min})                                                                    \\
            &\hspace{15mm}  g^i_t \leftarrow 0                                                   \\
            &\hspace{10mm}  \textbf{else}  \:                                                    \\
            &\hspace{15mm}  \eta^i_t \leftarrow \eta^i_{t-1}                                     \\
            &\hspace{5mm}\theta_t \leftarrow \theta_{t-1}- \eta_t \mathrm{sign}(g_t)             \\
            &\hspace{5mm}g_{prev} \leftarrow  g_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 the paper
    `A Direct Adaptive Method for Faster Backpropagation Learning: The RPROP Algorithm
    <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.1417>`_.
    aò  
    Args:
        params (iterable): iterable of parameters to optimize or dicts defining
            parameter groups
        lr (float, optional): learning rate (default: 1e-2)
        etas (Tuple[float, float], optional): pair of (etaminus, etaplus), that
            are multiplicative increase and decrease factors
            (default: (0.5, 1.2))
        step_sizes (Tuple[float, float], optional): a pair of minimal and
            maximal allowed step sizes (default: (1e-6, 50))
        z	
        z

    r   rM   rN   r    rO   rR   rS   rT   rU   r   r   r   rP   c                C   sÎ  t | ƒD ]à\}}|| }|	s|n| }|| }|| }|| }tj ¡ s?|
r?tƒ }|jj|jjkr7|jj|v s?J d|› d�ƒ‚|d7 }t |¡r\t |¡}t |¡}t |¡}t |¡}|rh| 	| 
¡ ¡ ¡ }n| 	|¡ ¡ }|
r™| t | d¡||¡¡ | t | d¡||¡¡ | t | d¡d|¡¡ n||| d¡< ||| d¡< d|| d¡< | |¡ ||¡ |j
tjd�}|
rÎ| t | |¡d|¡¡ nd|| |¡< |j| ¡ |dd� | |¡ qd S )NúIIf capturable=True, params and state_steps must be on supported devices: Ú.r   r   r?   éÿÿÿÿ©Úvalue)Ú	enumerater7   Ú_utilsÚis_compilingr   r/   ÚtyperD   Úview_as_realÚmulÚcloneÚsignÚcopy_ÚwhereÚgtÚltÚeqÚmul_Úclamp_rJ   Úaddcmul_)r   rM   rN   r    rO   rR   rS   rT   rU   r   r   r   rP   ÚiÚparamrC   rA   rB   r,   Úcapturable_supported_devicesrl   r*   r*   r+   Ú_single_tensor_rpropØ   sH   
ÿ




Ïrx   c             
      s,  t | ƒdkrd S |rJ dƒ‚tj ¡ s.|
r.tƒ ‰ t‡ fdd„t| |ƒD ƒƒs.J dˆ › d�ƒ‚t | ||||g¡}| 	¡ D ]×\\}}}}}}|d j
rXtj|tjddd	�dd
� nt |d¡ |rgt||||ƒ t ||¡}|	rtt |¡ t ||¡ |	r�t |¡ |}t |¡ |
r·|D ])}| t | d¡||¡¡ | t | d¡||¡¡ | t | d¡d|¡¡ qŒn|D ]}||| d¡< ||| d¡< d|| d¡< q¹t ||¡ |D ]}| ||¡ qÙt|ƒ}tt |ƒƒD ]}||  t ||  |¡d|| ¡¡ qì~dd„ |D ƒ}tj|||dd� q<d S )Nr   z#_foreach ops don't support autogradc                 3   s0   � | ]\}}|j j|j jko|j jˆ v V  qd S rZ   )r/   rh   )Ú.0r<   r,   ©rw   r*   r+   Ú	<genexpr>4  s   € þ

þz&_multi_tensor_rprop.<locals>.<genexpr>r`   ra   r!   Úcpu)r/   )Úalphar   c                 S   s   g | ]}|  ¡ ‘qS r*   )rl   )ry   rC   r*   r*   r+   Ú
<listcomp>~  s    z'_multi_tensor_rprop.<locals>.<listcomp>rb   rc   )r6   r7   rf   rg   r   ÚallÚzipr   Ú"_group_tensors_by_device_and_dtypeÚvaluesÚis_cpuÚ_foreach_add_r:   r   Ú_foreach_mulÚ_foreach_neg_Ú_foreach_copy_Z_foreach_sign_rm   rn   ro   rp   rq   Ú_foreach_mul_rs   ÚlistÚrangeÚ_foreach_addcmul_)r   rM   rN   r    rO   rR   rS   rT   rU   r   r   r   rP   Úgrouped_tensorsÚgrouped_paramsÚgrouped_gradsZgrouped_prevsZgrouped_step_sizesÚgrouped_state_stepsÚ_Zsignsrl   rB   ru   Z
grad_signsr*   rz   r+   Ú_multi_tensor_rprop  s|   
ý
üÿ	ú
ÿÿ


ýÿÿ¾r‘   )Úsingle_tensor_fnFr   c
                C   s’   t j ¡ stdd„ |D ƒƒstdƒ‚|du rt| |dd�\}}|r*t j ¡ r*tdƒ‚|r4t j ¡ s4t}nt	}|| |||||
|||||||	d� dS )	zpFunctional API that performs rprop algorithm computation.

    See :class:`~torch.optim.Rprop` for details.
    c                 s   s   � | ]	}t |tjƒV  qd S rZ   )Ú
isinstancer7   r   )ry   Útr*   r*   r+   r{   ¢  s   € 
ÿzrprop.<locals>.<genexpr>zPAPI has changed, `state_steps` argument must contain a list of singleton tensorsNF)Ú	use_fusedz6torch.jit.script not supported with foreach optimizers)rR   rS   rT   rU   r   r   r   rP   )
r7   rf   rg   r   rG   r   ÚjitÚis_scriptingr‘   rx   )r   rM   rN   r    rO   r   r   r   r   rP   rR   rS   rT   rU   r�   Úfuncr*   r*   r+   r   ˆ  s<   ÿÿ
ÿ
ó)NFFFF)Útypingr   r   r   r7   r   Ú	optimizerr   r   r	   r
   r   r   r   r   r   r   r   r   Ú__all__r   Ú__doc__r9   r^   rx   r‘   r   r*   r*   r*   r+   Ú<module>   sØ   8 #
öõôóÝÿ7ÿþýüûùø	÷
öõôó
òDÿþýüûùø	÷
öõôó
òl	ôÿþýüûø	÷
öõôòñðï