FM / __pycache_

/usr/local/lib64/python3.6/site-packages/torch/distributions/__pycache__/

/usr/local/lib64/python3.6/site-packages/torch/distributions/__pycache__

Name	Size	Mode	Actions
bernoulli.cpython-36.pyc	4445	0644	edit dl rm
beta.cpython-36.pyc	3682	0644	edit dl rm
binomial.cpython-36.pyc	4761	0644	edit dl rm
categorical.cpython-36.pyc	5813	0644	edit dl rm
cauchy.cpython-36.pyc	3310	0644	edit dl rm
chi2.cpython-36.pyc	1419	0644	edit dl rm
constraints.cpython-36.pyc	22217	0644	edit dl rm
constraint_registry.cpython-36.pyc	9895	0644	edit dl rm
continuous_bernoulli.cpython-36.pyc	8077	0644	edit dl rm
dirichlet.cpython-36.pyc	4085	0644	edit dl rm
distribution.cpython-36.pyc	11822	0644	edit dl rm
exponential.cpython-36.pyc	3363	0644	edit dl rm
exp_family.cpython-36.pyc	2876	0644	edit dl rm
fishersnedecor.cpython-36.pyc	3212	0644	edit dl rm
gamma.cpython-36.pyc	3455	0644	edit dl rm
geometric.cpython-36.pyc	4183	0644	edit dl rm
gumbel.cpython-36.pyc	2864	0644	edit dl rm
half_cauchy.cpython-36.pyc	2930	0644	edit dl rm
half_normal.cpython-36.pyc	2821	0644	edit dl rm
independent.cpython-36.pyc	4506	0644	edit dl rm
kl.cpython-36.pyc	25844	0644	edit dl rm
kumaraswamy.cpython-36.pyc	3040	0644	edit dl rm
laplace.cpython-36.pyc	3442	0644	edit dl rm
lkj_cholesky.cpython-36.pyc	4575	0644	edit dl rm
logistic_normal.cpython-36.pyc	2320	0644	edit dl rm
log_normal.cpython-36.pyc	2438	0644	edit dl rm
lowrank_multivariate_normal.cpython-36.pyc	8074	0644	edit dl rm
mixture_same_family.cpython-36.pyc	7073	0644	edit dl rm
multinomial.cpython-36.pyc	5020	0644	edit dl rm
multivariate_normal.cpython-36.pyc	8534	0644	edit dl rm
negative_binomial.cpython-36.pyc	4149	0644	edit dl rm
normal.cpython-36.pyc	4138	0644	edit dl rm
one_hot_categorical.cpython-36.pyc	5173	0644	edit dl rm
pareto.cpython-36.pyc	2516	0644	edit dl rm
poisson.cpython-36.pyc	2682	0644	edit dl rm
relaxed_bernoulli.cpython-36.pyc	5595	0644	edit dl rm
relaxed_categorical.cpython-36.pyc	5563	0644	edit dl rm
studentT.cpython-36.pyc	3483	0644	edit dl rm
transformed_distribution.cpython-36.pyc	7335	0644	edit dl rm
transforms.cpython-36.pyc	42981	0644	edit dl rm
uniform.cpython-36.pyc	3580	0644	edit dl rm
utils.cpython-36.pyc	6802	0644	edit dl rm
von_mises.cpython-36.pyc	5079	0644	edit dl rm
weibull.cpython-36.pyc	2737	0644	edit dl rm
__init__.cpython-36.pyc	5981	0644	edit dl rm

Edit: /usr/local/lib64/python3.6/site-packages/torch/distributions/__pycache__/constraints.cpython-36.pyc (22217B)

3 Eg�C�@sXdZddlZddddddd d ddd dddddddddddddddgZGdd�de�ZGdd�de�Zd d�ZGd!d"�d"ee�ZGd#d$�d$e�Z Gd%d&�d&e�Z Gd'd(�d(e�ZGd)d*�d*e�ZGd+d,�d,e�Z Gd-d.�d.e�ZGd/d0�d0e�ZGd1d2�d2e�ZGd3d4�d4e�ZGd5d6�d6e�ZGd7d8�d8e�ZGd9d:�d:e�ZGd;d<�d�d>e�ZGd?d@�d@e�ZGdAdB�dBe�ZGdCdD�dDe�ZGdEdF�dFe�ZGdGdH�dHe�ZGdIdJ�dJe�Ze�ZeZe Ze �Z e�Z!ed�Z"edK�Z#eZ$e�Z%ee%dK�Z&edL�Z'edL�Z(eZ)eZ*eZ+eZ,edLdM�Z-eZ.eZ/e�Z0e�Z1e�Z2e�Z3e�Z4eZ5eZ6dS)Na_ The following constraints are implemented: - ``constraints.boolean`` - ``constraints.cat`` - ``constraints.corr_cholesky`` - ``constraints.dependent`` - ``constraints.greater_than(lower_bound)`` - ``constraints.greater_than_eq(lower_bound)`` - ``constraints.independent(constraint, reinterpreted_batch_ndims)`` - ``constraints.integer_interval(lower_bound, upper_bound)`` - ``constraints.interval(lower_bound, upper_bound)`` - ``constraints.less_than(upper_bound)`` - ``constraints.lower_cholesky`` - ``constraints.lower_triangular`` - ``constraints.multinomial`` - ``constraints.nonnegative_integer`` - ``constraints.one_hot`` - ``constraints.positive_definite`` - ``constraints.positive_integer`` - ``constraints.positive`` - ``constraints.real_vector`` - ``constraints.real`` - ``constraints.simplex`` - ``constraints.stack`` - ``constraints.unit_interval`` �N� Constraint�boolean�cat� corr_cholesky� dependent�dependent_property�greater_than�greater_than_eq�independent�integer_interval�interval�half_open_interval�is_dependent� less_than�lower_cholesky�lower_triangular�multinomial�nonnegative_integer�positive�positive_definite�positive_integer�real�real_vector�simplex�stack� unit_intervalc@s(eZdZdZdZdZdd�Zdd�ZdS) ra� Abstract base class for constraints. A constraint object represents a region over which a variable is valid, e.g. within which a variable can be optimized. Attributes: is_discrete (bool): Whether constrained space is discrete. Defaults to False. event_dim (int): Number of rightmost dimensions that together define an event. The :meth:`check` method will remove this many dimensions when computing validity. FrcCst�dS)z� Returns a byte tensor of ``sample_shape + batch_shape`` indicating whether each event in value satisfies this constraint. N)�NotImplementedError)�self�value�r�K/usr/local/lib64/python3.6/site-packages/torch/distributions/constraints.py�checkNszConstraint.checkcCs|jjdd�dS)N�z())� __class__�__name__)rrrr �__repr__UszConstraint.__repr__N)r$� __module__�__qualname__�__doc__�is_discrete� event_dimr!r%rrrr r=s csXeZdZdZeed��fdd� Zedd��Zedd��Zeed�d d �Z dd�Z �ZS) � _DependentaI Placeholder for variables whose support depends on other variables. These variables obey no simple coordinate-wise constraints. Args: is_discrete (bool): Optional value of ``.is_discrete`` in case this can be computed statically. If not provided, access to the ``.is_discrete`` attribute will raise a NotImplementedError. event_dim (int): Optional value of ``.event_dim`` in case this can be computed statically. If not provided, access to the ``.event_dim`` attribute will raise a NotImplementedError. )r)r*cs||_||_t�j�dS)N)�_is_discrete� _event_dim�super�__init__)rr)r*)r#rr r/fsz_Dependent.__init__cCs|jtkrtd��|jS)Nz,.is_discrete cannot be determined statically)r,�NotImplementedr)rrrr r)ks z_Dependent.is_discretecCs|jtkrtd��|jS)Nz*.event_dim cannot be determined statically)r-r0r)rrrr r*qs z_Dependent.event_dimcCs(|tkr|j}|tkr|j}t||d�S)z� Support for syntax to customize static attributes:: constraints.dependent(is_discrete=True, event_dim=1) )r)r*)r0r,r-r+)rr)r*rrr �__call__ws z_Dependent.__call__cCstd��dS)Nz1Cannot determine validity of dependent constraint)� ValueError)r�xrrr r!�sz_Dependent.check)r$r&r'r(r0r/�propertyr)r*r1r!� __classcell__rr)r#r r+Ysr+cCs t|t�S)N)� isinstancer+)� constraintrrr r�scs2eZdZdZdeed��fdd�Zdd�Z�ZS) �_DependentPropertya� Decorator that extends @property to act like a `Dependent` constraint when called on a class and act like a property when called on an object. Example:: class Uniform(Distribution): def __init__(self, low, high): self.low = low self.high = high @constraints.dependent_property(is_discrete=False, event_dim=0) def support(self): return constraints.interval(self.low, self.high) Args: fn (callable): The function to be decorated. is_discrete (bool): Optional value of ``.is_discrete`` in case this can be computed statically. If not provided, access to the ``.is_discrete`` attribute will raise a NotImplementedError. event_dim (int): Optional value of ``.event_dim`` in case this can be computed statically. If not provided, access to the ``.event_dim`` attribute will raise a NotImplementedError. N)r)r*cst�j|�||_||_dS)N)r.r/r,r-)r�fnr)r*)r#rr r/�sz_DependentProperty.__init__cCst||j|jd�S)z� Support for syntax to customize static attributes:: @constraints.dependent_property(is_discrete=True, event_dim=1) def support(self): ... )r)r*)r8r,r-)rr9rrr r1�sz_DependentProperty.__call__)N)r$r&r'r(r0r/r1r5rr)r#r r8�sr8csHeZdZdZ�fdd�Zedd��Zedd��Zdd �Zd d�Z �Z S)�_IndependentConstraintz� Wraps a constraint by aggregating over ``reinterpreted_batch_ndims``-many dims in :meth:`check`, so that an event is valid only if all its independent entries are valid. csBt|t�st�t|t�st�|dks(t�||_||_t�j�dS)Nr)r6r�AssertionError�int�base_constraint�reinterpreted_batch_ndimsr.r/)rr=r>)r#rr r/�sz_IndependentConstraint.__init__cCs|jjS)N)r=r))rrrr r)�sz"_IndependentConstraint.is_discretecCs|jj|jS)N)r=r*r>)rrrr r*�sz _IndependentConstraint.event_dimcCsp|jj|�}|j�|jkr@|jj|j}td|�d|j��|j|jd|j�|j�d�}|jd�}|S)NzExpected value.dim() >= z but got r"��)r?r?) r=r!�dimr>r*r2Zreshape�shape�all)rr�result�expectedrrr r!�s" z_IndependentConstraint.checkcCs"dj|jjdd�t|j�|j�S)Nz {}({}, {})r")�formatr#r$�reprr=r>)rrrr r%�sz_IndependentConstraint.__repr__)r$r&r'r(r/r4r)r*r!r%r5rr)r#r r:�s r:c@seZdZdZdZdd�ZdS)�_Booleanz/ Constrain to the two values `{0, 1}`. TcCs|dk|dkBS)Nrr"r)rrrrr r!�sz_Boolean.checkN)r$r&r'r(r)r!rrrr rG�srGc@s eZdZdZdZdZdd�ZdS)�_OneHotz' Constrain to one-hot vectors. Tr"cCs.|dk|dkB}|jd�jd�}|jd�|@S)Nrr"r?r?)�sum�eqrB)rrZ is_booleanZ is_normalizedrrr r!�sz _OneHot.checkN)r$r&r'r(r)r*r!rrrr rH�srHcs4eZdZdZdZ�fdd�Zdd�Zdd�Z�ZS) �_IntegerIntervalzH Constrain to an integer interval `[lower_bound, upper_bound]`. Tcs||_||_t�j�dS)N)�lower_bound�upper_boundr.r/)rrLrM)r#rr r/�sz_IntegerInterval.__init__cCs |ddk|j|k@||jk@S)Nr"r)rLrM)rrrrr r!�sz_IntegerInterval.checkcCs(|jjdd�}|dj|j|j�7}|S)Nr"z (lower_bound={}, upper_bound={}))r#r$rErLrM)r� fmt_stringrrr r%�sz_IntegerInterval.__repr__) r$r&r'r(r)r/r!r%r5rr)r#r rK�s rKcs4eZdZdZdZ�fdd�Zdd�Zdd�Z�ZS) �_IntegerLessThanzA Constrain to an integer interval `(-inf, upper_bound]`. Tcs||_t�j�dS)N)rMr.r/)rrM)r#rr r/sz_IntegerLessThan.__init__cCs|ddk||jk@S)Nr"r)rM)rrrrr r!sz_IntegerLessThan.checkcCs$|jjdd�}|dj|j�7}|S)Nr"z(upper_bound={}))r#r$rErM)rrNrrr r%sz_IntegerLessThan.__repr__) r$r&r'r(r)r/r!r%r5rr)r#r rOs rOcs4eZdZdZdZ�fdd�Zdd�Zdd�Z�ZS) �_IntegerGreaterThanz@ Constrain to an integer interval `[lower_bound, inf)`. Tcs||_t�j�dS)N)rLr.r/)rrL)r#rr r/sz_IntegerGreaterThan.__init__cCs|ddk||jk@S)Nr"r)rL)rrrrr r!sz_IntegerGreaterThan.checkcCs$|jjdd�}|dj|j�7}|S)Nr"z(lower_bound={}))r#r$rErL)rrNrrr r%"sz_IntegerGreaterThan.__repr__) r$r&r'r(r)r/r!r%r5rr)r#r rPs rPc@seZdZdZdd�ZdS)�_RealzF Trivially constrain to the extended real line `[-inf, inf]`. cCs||kS)Nr)rrrrr r!,sz_Real.checkN)r$r&r'r(r!rrrr rQ(srQcs0eZdZdZ�fdd�Zdd�Zdd�Z�ZS)�_GreaterThanz= Constrain to a real half line `(lower_bound, inf]`. cs||_t�j�dS)N)rLr.r/)rrL)r#rr r/4sz_GreaterThan.__init__cCs |j|kS)N)rL)rrrrr r!8sz_GreaterThan.checkcCs$|jjdd�}|dj|j�7}|S)Nr"z(lower_bound={}))r#r$rErL)rrNrrr r%;sz_GreaterThan.__repr__)r$r&r'r(r/r!r%r5rr)r#r rR0srRcs0eZdZdZ�fdd�Zdd�Zdd�Z�ZS)�_GreaterThanEqz= Constrain to a real half line `[lower_bound, inf)`. cs||_t�j�dS)N)rLr.r/)rrL)r#rr r/Esz_GreaterThanEq.__init__cCs |j|kS)N)rL)rrrrr r!Isz_GreaterThanEq.checkcCs$|jjdd�}|dj|j�7}|S)Nr"z(lower_bound={}))r#r$rErL)rrNrrr r%Lsz_GreaterThanEq.__repr__)r$r&r'r(r/r!r%r5rr)r#r rSAsrScs0eZdZdZ�fdd�Zdd�Zdd�Z�ZS)� _LessThanz> Constrain to a real half line `[-inf, upper_bound)`. cs||_t�j�dS)N)rMr.r/)rrM)r#rr r/Vsz_LessThan.__init__cCs ||jkS)N)rM)rrrrr r!Zsz_LessThan.checkcCs$|jjdd�}|dj|j�7}|S)Nr"z(upper_bound={}))r#r$rErM)rrNrrr r%]sz_LessThan.__repr__)r$r&r'r(r/r!r%r5rr)r#r rTRsrTcs0eZdZdZ�fdd�Zdd�Zdd�Z�ZS)� _IntervalzD Constrain to a real interval `[lower_bound, upper_bound]`. cs||_||_t�j�dS)N)rLrMr.r/)rrLrM)r#rr r/gsz_Interval.__init__cCs|j|k||jk@S)N)rLrM)rrrrr r!lsz_Interval.checkcCs(|jjdd�}|dj|j|j�7}|S)Nr"z (lower_bound={}, upper_bound={}))r#r$rErLrM)rrNrrr r%osz_Interval.__repr__)r$r&r'r(r/r!r%r5rr)r#r rUcsrUcs0eZdZdZ�fdd�Zdd�Zdd�Z�ZS)�_HalfOpenIntervalzD Constrain to a real interval `[lower_bound, upper_bound)`. cs||_||_t�j�dS)N)rLrMr.r/)rrLrM)r#rr r/ysz_HalfOpenInterval.__init__cCs|j|k||jk@S)N)rLrM)rrrrr r!~sz_HalfOpenInterval.checkcCs(|jjdd�}|dj|j|j�7}|S)Nr"z (lower_bound={}, upper_bound={}))r#r$rErLrM)rrNrrr r%�sz_HalfOpenInterval.__repr__)r$r&r'r(r/r!r%r5rr)r#r rVusrVc@seZdZdZdZdd�ZdS)�_Simplexz� Constrain to the unit simplex in the innermost (rightmost) dimension. Specifically: `x >= 0` and `x.sum(-1) == 1`. r"cCs(tj|dkdd�|jd�dj�dk@S)Nrr")r@g��ư>r?r?)�torchrBrI�abs)rrrrr r!�sz_Simplex.checkN)r$r&r'r(r*r!rrrr rW�srWc@s(eZdZdZdZdZdd�Zdd�ZdS) �_Multinomiala3 Constrain to nonnegative integer values summing to at most an upper bound. Note due to limitations of the Multinomial distribution, this currently checks the weaker condition ``value.sum(-1) <= upper_bound``. In the future this may be strengthened to ``value.sum(-1) == upper_bound``. Tr"cCs ||_dS)N)rM)rrMrrr r/�sz_Multinomial.__init__cCs"|dkjdd�|jdd�|jk@S)Nrr")r@r?r?)rBrIrM)rr3rrr r!�sz_Multinomial.checkN)r$r&r'r(r)r*r/r!rrrr rZ�s rZc@seZdZdZdZdd�ZdS)�_LowerTriangularz8 Constrain to lower-triangular square matrices. �cCs.|j�}||kj|jdd�d�jd�dS)Nr\r"r��r?)r?r?)�tril�viewrA�min)rr� value_trilrrr r!�sz_LowerTriangular.checkN)r$r&r'r(r*r!rrrr r[�sr[c@seZdZdZdZdd�ZdS)�_LowerCholeskyzP Constrain to lower-triangular square matrices with positive diagonals. r\cCsR|j�}||kj|jdd�d�jd�d}|jd d d�dkjd�d}||@S)Nr\r"r)Zdim1Zdim2r]r?)r?r?r]r?r?)r^r_rAr`Zdiagonal)rrrarZpositive_diagonalrrr r!�s&z_LowerCholesky.checkN)r$r&r'r(r*r!rrrr rb�srbc@seZdZdZdZdd�ZdS)� _CorrCholeskyz} Constrain to lower-triangular square matrices with positive diagonals and each row vector being of unit length. r\cCsZtj|j�j|jd�d}tjj|j�dd�}|dj�j |�j dd�}t�j|�|@S)Nr"� )r@g�?r?r?r?) rXZfinfoZdtypeZeps�size�linalgZnorm�detachrY�lerBrbr!)rrZtolZrow_normZ unit_row_normrrr r!�sz_CorrCholesky.checkN)r$r&r'r(r*r!rrrr rc�srcc@seZdZdZdZdd�ZdS)�_PositiveDefinitez2 Constrain to positive-definite matrices. r\cCstjj|�jjd�jd�S)Nr)rXrfZcholesky_ex�inforJZ unsqueeze)rrrrr r!�sz_PositiveDefinite.checkN)r$r&r'r(r*r!rrrr ri�sricsBeZdZdZd�fdd� Zedd��Zedd ��Zd d�Z�Z S) �_Catz� Constraint functor that applies a sequence of constraints `cseq` at the submatrices at dimension `dim`, each of size `lengths[dim]`, in a way compatible with :func:`torch.cat`. rNcsntdd�|D��st�t|�|_|dkr8dgt|j�}t|�|_t|j�t|j�ksZt�||_t�j�dS)Ncss|]}t|t�VqdS)N)r6r)�.0�crrr � �sz _Cat.__init__..r") rBr;�list�cseq�len�lengthsr@r.r/)rrpr@rr)r#rr r/�s z _Cat.__init__cCstdd�|jD��S)Ncss|]}|jVqdS)N)r))rlrmrrr rn�sz#_Cat.is_discrete..)�anyrp)rrrr r)�sz_Cat.is_discretecCstdd�|jD��S)Ncss|]}|jVqdS)N)r*)rlrmrrr rn�sz!_Cat.event_dim..)�maxrp)rrrr r*�sz_Cat.event_dimcCs�|j�|jko|j�kns(t�g}d}xBt|j|j�D]0\}}|j|j||�}|j|j|��||}q@Wtj ||j�S)Nr) r@r;�ziprprrZnarrow�appendr!rXr)rrZchecks�start�constr�length�vrrr r!�s(z _Cat.check)rN) r$r&r'r(r/r4r)r*r!r5rr)r#r rk�s rkcsBeZdZdZd�fdd� Zedd��Zedd��Zd d �Z�Z S)�_Stackz� Constraint functor that applies a sequence of constraints `cseq` at the submatrices at dimension `dim`, in a way compatible with :func:`torch.stack`. rcs4tdd�|D��st�t|�|_||_t�j�dS)Ncss|]}t|t�VqdS)N)r6r)rlrmrrr rnsz"_Stack.__init__..)rBr;rorpr@r.r/)rrpr@)r#rr r/s z_Stack.__init__cCstdd�|jD��S)Ncss|]}|jVqdS)N)r))rlrmrrr rnsz%_Stack.is_discrete..)rsrp)rrrr r)sz_Stack.is_discretecCs.tdd�|jD��}|j|dkr*|d7}|S)Ncss|]}|jVqdS)N)r*)rlrmrrr rnsz#_Stack.event_dim..rr")rtrpr@)rr@rrr r* sz_Stack.event_dimcsh�j��jko�j�kns(t��fdd�t�j�j��D�}tjdd�t|�j�D��j�S)Ncsg|]}�j�j|��qSr)�selectr@)rl�i)rrrr � sz _Stack.check..cSsg|]\}}|j|��qSr)r!)rlrzrxrrr r~s)r@r;�rangererXrrurp)rr�vsr)rrr r!s( z_Stack.check)r) r$r&r'r(r/r4r)r*r!r5rr)r#r r{�s r{r"gg�?)7r(rX�__all__�objectrr+rr4r8r:rGrHrKrOrPrQrRrSrTrUrVrWrZr[rbrcrirkr{rrr rZone_hotrrrrrrZnonnegativerr rrrrr rrrrrrrrrrr �s�.($ #