pymc-extras 0.2.6__py3-none-any.whl → 0.2.7__py3-none-any.whl

{pymc_extras-0.2.6.dist-info → pymc_extras-0.2.7.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pymc-extras
-Version: 0.2.6
+Version: 0.2.7
 Summary: A home for new additions to PyMC, which may include unusual probability distribitions, advanced model fitting algorithms, or any code that may be inappropriate to include in the pymc repository, but may want to be made available to users.
 Project-URL: Documentation, https://pymc-extras.readthedocs.io/
 Project-URL: Repository, https://github.com/pymc-devs/pymc-extras.git
@@ -234,6 +234,8 @@ Classifier: Topic :: Scientific/Engineering
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: >=3.10
 Requires-Dist: better-optimize>=0.1.2
+Requires-Dist: preliz
+Requires-Dist: pydantic>=2.0.0
 Requires-Dist: pymc>=5.21.1
 Requires-Dist: scikit-learn
 Provides-Extra: complete
@@ -245,6 +247,7 @@ Requires-Dist: xhistogram; extra == 'dask-histogram'
 Provides-Extra: dev
 Requires-Dist: blackjax; extra == 'dev'
 Requires-Dist: dask[all]<2025.1.1; extra == 'dev'
+Requires-Dist: pytest-mock; extra == 'dev'
 Requires-Dist: pytest>=6.0; extra == 'dev'
 Requires-Dist: statsmodels; extra == 'dev'
 Provides-Extra: docs

{pymc_extras-0.2.6.dist-info → pymc_extras-0.2.7.dist-info}/RECORD

@@ -1,7 +1,9 @@
 pymc_extras/__init__.py,sha256=YsR6OG72aW73y6dGS7w3nGGMV-V-ImHkmUOXKMPfMRA,1230
+pymc_extras/deserialize.py,sha256=dktK5gsR96X3zAUoRF5udrTiconknH3uupiAWqkZi0M,5937
 pymc_extras/linearmodel.py,sha256=6eitl15Ec15mSZu7zoHZ7Wwy4U1DPwqfAgwEt6ILeIc,3920
 pymc_extras/model_builder.py,sha256=sAw77fxdiy046BvDPjocuMlbJ0Efj-CDAGtmcwYmoG0,26361
 pymc_extras/printing.py,sha256=G8mj9dRd6i0PcsbcEWZm56ek6V8mmil78RI4MUhywBs,6506
+pymc_extras/prior.py,sha256=dmw9Jz4DXRxT9jA-L3QSgMOODKqcim4NC5XguARSbxU,38718
 pymc_extras/distributions/__init__.py,sha256=fDbrBt9mxEVp2CDPwnyCW3oiutzZ0PduB8EUH3fUrjI,1377
 pymc_extras/distributions/continuous.py,sha256=530wvcO-QcYVdiVN-iQRveImWfyJzzmxiZLMVShP7w4,11251
 pymc_extras/distributions/discrete.py,sha256=HNi-K0_hnNWTcfyBkWGh26sc71FwBgukQ_EjGAaAOjY,13036
@@ -56,10 +58,9 @@ pymc_extras/statespace/utils/data_tools.py,sha256=01sz6XDtLYK9I5xghxYpD-PuDzGXv9
 pymc_extras/utils/__init__.py,sha256=yxI9cJ7fCtVQS0GFw0y6mDGZIQZiK53vm3UNKqIuGSk,758
 pymc_extras/utils/linear_cg.py,sha256=KkXhuimFsrKtNd_0By2ApxQQQNm5FdBtmDQJOVbLYkA,10056
 pymc_extras/utils/model_equivalence.py,sha256=8QIftID2HDxD659i0RXHazQ-l2Q5YegCRLcDqb2p9Pc,2187
-pymc_extras/utils/pivoted_cholesky.py,sha256=QtnjP0pAl9b77fLAu-semwT4_9dcoiqx3dz1xKGBjMk,1871
 pymc_extras/utils/prior.py,sha256=QlWVr7uKIK9VncBw7Fz3YgaASKGDfqpORZHc-vz_9gQ,6841
 pymc_extras/utils/spline.py,sha256=qGq0gcoMG5dpdazKFzG0RXkkCWP8ADPPXN-653-oFn4,4820
-pymc_extras-0.2.6.dist-info/METADATA,sha256=zzdhVkdzXhL7MQH3R0uiCsrcl5i5uh1JLVdRBG6jJyY,18813
-pymc_extras-0.2.6.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
-pymc_extras-0.2.6.dist-info/licenses/LICENSE,sha256=WjiLhUKEysJvy5e9jk6WwFv9tmAPtnov1uJ6gcH1kIs,11720
-pymc_extras-0.2.6.dist-info/RECORD,,
+pymc_extras-0.2.7.dist-info/METADATA,sha256=hJCZrC9jdx_GkpFhHSzWgdUGxx6TZGw6jwYXeNIJ8-c,18909
+pymc_extras-0.2.7.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
+pymc_extras-0.2.7.dist-info/licenses/LICENSE,sha256=WjiLhUKEysJvy5e9jk6WwFv9tmAPtnov1uJ6gcH1kIs,11720
+pymc_extras-0.2.7.dist-info/RECORD,,

pymc_extras/utils/pivoted_cholesky.py

@@ -1,69 +0,0 @@
-try:
-    import torch
-
-    from gpytorch.utils.permutation import apply_permutation
-except ImportError as e:
-    raise ImportError("PyTorch and GPyTorch not found.") from e
-
-import numpy as np
-
-
-def pp(x):
-    return np.array2string(x, precision=4, floatmode="fixed")
-
-
-def pivoted_cholesky(mat: np.matrix, error_tol=1e-6, max_iter=np.inf):
-    """
-    mat: numpy matrix of N x N
-
-    This is to replicate what is done in GPyTorch verbatim.
-    """
-    n = mat.shape[-1]
-    max_iter = min(int(max_iter), n)
-
-    d = np.array(np.diag(mat))
-    orig_error = np.max(d)
-    error = np.linalg.norm(d, 1) / orig_error
-    pi = np.arange(n)
-
-    L = np.zeros((max_iter, n))
-
-    m = 0
-    while m < max_iter and error > error_tol:
-        permuted_d = d[pi]
-        max_diag_idx = np.argmax(permuted_d[m:])
-        max_diag_idx = max_diag_idx + m
-        max_diag_val = permuted_d[max_diag_idx]
-        i = max_diag_idx
-
-        # swap pi_m and pi_i
-        pi[m], pi[i] = pi[i], pi[m]
-        pim = pi[m]
-
-        L[m, pim] = np.sqrt(max_diag_val)
-
-        if m + 1 < n:
-            row = apply_permutation(
-                torch.from_numpy(mat), torch.tensor(pim), right_permutation=None
-            )  # left permutation just swaps row
-            row = row.numpy().flatten()
-            pi_i = pi[m + 1 :]
-            L_m_new = row[pi_i]  # length = 9
-
-            if m > 0:
-                L_prev = L[:m, pi_i]
-                update = L[:m, pim]
-                prod = update @ L_prev
-                L_m_new = L_m_new - prod  # np.sum(prod, axis=-1)
-
-            L_m = L[m, :]
-            L_m_new = L_m_new / L_m[pim]
-            L_m[pi_i] = L_m_new
-
-            matrix_diag_current = d[pi_i]
-            d[pi_i] = matrix_diag_current - L_m_new**2
-
-            L[m, :] = L_m
-            error = np.linalg.norm(d[pi_i], 1) / orig_error
-        m = m + 1
-    return L, pi