CUQIpy 1.0.0.post0.dev352__tar.gz → 1.0.0.post0.dev371__tar.gz

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/CUQIpy.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: CUQIpy
-Version: 1.0.0.post0.dev352
+Version: 1.0.0.post0.dev371
 Summary: Computational Uncertainty Quantification for Inverse problems in Python
 Maintainer-email: "Nicolai A. B. Riis" <nabr@dtu.dk>, "Jakob S. Jørgensen" <jakj@dtu.dk>, "Amal M. Alghamdi" <amaal@dtu.dk>, Chao Zhang <chaz@dtu.dk>
 License:                                  Apache License

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/CUQIpy.egg-info/SOURCES.txt

@@ -56,11 +56,13 @@ cuqi/experimental/mcmc/_mh.py
 cuqi/experimental/mcmc/_pcn.py
 cuqi/experimental/mcmc/_rto.py
 cuqi/experimental/mcmc/_sampler.py
+cuqi/experimental/mcmc/_utilities.py
 cuqi/geometry/__init__.py
 cuqi/geometry/_geometry.py
 cuqi/implicitprior/__init__.py
 cuqi/implicitprior/_regularizedGMRF.py
 cuqi/implicitprior/_regularizedGaussian.py
+cuqi/implicitprior/_regularizedUnboundedUniform.py
 cuqi/likelihood/__init__.py
 cuqi/likelihood/_likelihood.py
 cuqi/model/__init__.py

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: CUQIpy
-Version: 1.0.0.post0.dev352
+Version: 1.0.0.post0.dev371
 Summary: Computational Uncertainty Quantification for Inverse problems in Python
 Maintainer-email: "Nicolai A. B. Riis" <nabr@dtu.dk>, "Jakob S. Jørgensen" <jakj@dtu.dk>, "Amal M. Alghamdi" <amaal@dtu.dk>, Chao Zhang <chaz@dtu.dk>
 License:                                  Apache License

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/cuqi/_version.py

@@ -8,11 +8,11 @@ import json
 
 version_json = '''
 {
- "date": "2024-06-19T09:05:37+0200",
+ "date": "2024-07-05T10:04:17+0300",
  "dirty": false,
  "error": null,
- "full-revisionid": "1e1deddbe7925206fdaef6a2d9bf8ce9e33ad73d",
- "version": "1.0.0.post0.dev352"
+ "full-revisionid": "62f642d707e561a7c9deb0006625b11866043b81",
+ "version": "1.0.0.post0.dev371"
 }
 '''  # END VERSION_JSON
 

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/cuqi/experimental/mcmc/__init__.py

@@ -12,3 +12,4 @@ from ._gibbs import HybridGibbsNew
 from ._conjugate import ConjugateNew
 from ._conjugate_approx import ConjugateApproxNew
 from ._direct import DirectNew
+from ._utilities import find_valid_samplers

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/cuqi/experimental/mcmc/_cwmh.py

@@ -100,6 +100,9 @@ class CWMHNew(ProposalBasedSamplerNew):
             raise ValueError(
                 "Target should be an instance of "+\
                 f"{cuqi.density.Density.__class__.__name__}")
+        # Fail when there is no log density, which is currently assumed to be the case in case NaN is returned.
+        if np.isnan(self.target.logd(self._default_initial_point)):
+            raise ValueError("Target does not have valid logd")
         
     def validate_proposal(self):
         if not isinstance(self.proposal, cuqi.distribution.Distribution):

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/cuqi/experimental/mcmc/_mh.py

@@ -32,7 +32,9 @@ class MHNew(ProposalBasedSamplerNew):
         self._scale_temp = self.scale
 
     def validate_target(self):
-        pass # All targets are valid
+        # Fail only when there is no log density, which is currently assumed to be the case in case NaN is returned.
+        if np.isnan(self.target.logd(self._default_initial_point)):
+            raise ValueError("Target does not have valid logd")
 
     def validate_proposal(self):
         if not isinstance(self.proposal, cuqi.distribution.Distribution):

cuqipy-1.0.0.post0.dev371/cuqi/experimental/mcmc/_utilities.py

@@ -0,0 +1,17 @@
+import cuqi
+import inspect
+
+def find_valid_samplers(target):
+    """ Finds all samplers in the cuqi.experimental.mcmc module that accept the provided target. """
+
+    all_samplers = [(name, cls) for name, cls in inspect.getmembers(cuqi.experimental.mcmc, inspect.isclass) if issubclass(cls, cuqi.experimental.mcmc.SamplerNew)]
+    valid_samplers = []
+
+    for name, sampler in all_samplers:
+        try:
+            sampler(target)
+            valid_samplers += [name]
+        except:
+            pass
+
+    return valid_samplers

cuqipy-1.0.0.post0.dev371/cuqi/implicitprior/__init__.py

@@ -0,0 +1,3 @@
+from ._regularizedGaussian import RegularizedGaussian, ConstrainedGaussian, NonnegativeGaussian
+from ._regularizedGMRF import RegularizedGMRF, ConstrainedGMRF, NonnegativeGMRF
+from ._regularizedUnboundedUniform import RegularizedUnboundedUniform

cuqipy-1.0.0.post0.dev371/cuqi/implicitprior/_regularizedGMRF.py

@@ -0,0 +1,152 @@
+from cuqi.implicitprior import RegularizedGaussian
+from cuqi.distribution import Distribution, GMRF
+
+class RegularizedGMRF(RegularizedGaussian):
+    """ Implicit Regularized GMRF (Gaussian Markov Random Field). 
+
+    Defines a so-called implicit prior based on a GMRF distribution with implicit regularization.
+    The regularization can be defined in the form of a proximal operator or a projector.
+    Alternatively, preset constraints and regularization can be used.
+
+    Only one of proximal, projector, constraint or regularization can be provided. Otherwise, an error is raised.
+
+    Can be used as a prior in a posterior which can be sampled with the RegularizedLinearRTO sampler.
+
+
+    For more details on implicit regularized Gaussian see the following paper:
+
+    [1] Everink, Jasper M., Yiqiu Dong, and Martin S. Andersen. "Sparse Bayesian inference with regularized
+    Gaussian distributions." Inverse Problems 39.11 (2023): 115004.
+
+    Parameters
+    ----------
+    mean
+        See :class:`~cuqi.distribution.GMRF` for details.
+        
+    prec
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    bc_type
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    order
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    proximal : callable f(x, scale) or None
+        Euclidean proximal operator f of the regularization function g, that is, a solver for the optimization problem
+        min_z 0.5||x-z||_2^2+scale*g(x).
+
+    projector : callable f(x) or None
+        Euclidean projection onto the constraint C, that is, a solver for the optimization problem
+        min_(z in C) 0.5||x-z||_2^2.
+
+    constraint : string or None
+        Preset constraints. Can be set to "nonnegativity" and "box". Required for use in Gibbs.
+        For "box", the following additional parameters can be passed:
+            lower_bound : array_like or None
+                Lower bound of box, defaults to zero
+            upper_bound : array_like
+                Upper bound of box, defaults to one
+
+    regularization : string or None
+        Preset regularization. Can be set to "l1". Required for use in Gibbs in future update.
+        For "l1", the following additional parameters can be passed:
+            strength : scalar
+                Regularization parameter, i.e., strength*||x||_1 , defaults to one
+
+    """
+    def __init__(self, mean=None, prec=None, bc_type='zero', order=1, proximal = None, projector = None, constraint = None, regularization = None, **kwargs):
+            
+            args = {"lower_bound" : kwargs.pop("lower_bound", None),
+                    "upper_bound" : kwargs.pop("upper_bound", None),
+                    "strength" : kwargs.pop("strength", None)}
+            
+            # Underlying explicit GMRF
+            self._gaussian = GMRF(mean, prec, bc_type=bc_type, order=order, **kwargs)
+            
+            # Init from abstract distribution class
+            super(Distribution, self).__init__(**kwargs)
+
+            self._parse_regularization_input_arguments(proximal, projector, constraint, regularization, args)
+
+
+
+class ConstrainedGMRF(RegularizedGMRF):
+    """ Implicit Constrained GMRF (Gaussian Markov Random Field). 
+
+    Defines a so-called implicit prior based on a GMRF distribution with implicit constraints.
+    The constraint can be defined as a preset or in the form of a projector. 
+
+    Precisely one of projector or constraint needs to be provided. Otherwise, an error is raised.
+
+    Can be used as a prior in a posterior which can be sampled with the RegularizedLinearRTO sampler.
+
+    Alias for :class:`~cuqi.implicitprior.RegularizedGMRF` with only constraints available.
+
+    For more details on implicit regularized Gaussian see the following paper:
+
+    [1] Everink, Jasper M., Yiqiu Dong, and Martin S. Andersen. "Sparse Bayesian inference with regularized
+    Gaussian distributions." Inverse Problems 39.11 (2023): 115004.
+
+    Parameters
+    ----------
+    mean
+        See :class:`~cuqi.distribution.GMRF` for details.
+        
+    prec
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    bc_type
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    order
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    projector : callable f(x) or None
+        Euclidean projection onto the constraint C, that is, a solver for the optimization problem
+        min_(z in C) 0.5||x-z||_2^2.
+
+    constraint : string or None
+        Preset constraints. Can be set to "nonnegativity" and "box". Required for use in Gibbs.
+        For "box", the following additional parameters can be passed:
+            lower_bound : array_like or None
+                Lower bound of box, defaults to zero
+            upper_bound : array_like
+                Upper bound of box, defaults to one
+
+    """
+    def __init__(self, mean=None, prec=None, bc_type='zero', order=1, projector=None, constraint=None, **kwargs):
+        super().__init__(mean=mean, prec=prec, bc_type=bc_type, order=order, projector=projector, constraint=constraint, **kwargs)
+
+        
+class NonnegativeGMRF(RegularizedGMRF):
+    """ Implicit Nonnegative GMRF (Gaussian Markov Random Field). 
+
+    Defines a so-called implicit prior based on a GMRF distribution with implicit nonnegativity constraints.
+
+    Can be used as a prior in a posterior which can be sampled with the RegularizedLinearRTO sampler.
+
+    Alias for :class:`~cuqi.implicitprior.RegularizedGMRF` with only nonnegativity constraints.
+
+    For more details on implicit regularized Gaussian see the following paper:
+
+    [1] Everink, Jasper M., Yiqiu Dong, and Martin S. Andersen. "Sparse Bayesian inference with regularized
+    Gaussian distributions." Inverse Problems 39.11 (2023): 115004.
+
+    Parameters
+    ----------
+    mean
+        See :class:`~cuqi.distribution.GMRF` for details.
+        
+    prec
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    bc_type
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    order
+        See :class:`~cuqi.distribution.GMRF` for details.
+
+    """
+    def __init__(self, mean=None, prec=None, bc_type='zero', order=1, **kwargs):
+        super().__init__(mean=mean, prec=prec, bc_type=bc_type, order=order, constraint="nonnegativity", **kwargs)

{cuqipy-1.0.0.post0.dev352 → cuqipy-1.0.0.post0.dev371}/cuqi/implicitprior/_regularizedGaussian.py

@@ -234,3 +234,90 @@ class RegularizedGaussian(Distribution):
             new_density = new_density.to_likelihood(value)
 
         return new_density
+
+
+class ConstrainedGaussian(RegularizedGaussian):
+    """ Implicit Constrained Gaussian.
+
+    Defines a so-called implicit prior based on a Gaussian distribution with implicit constraints.
+    The constraint can be defined as a preset or in the form of a projector. 
+
+    Precisely one of projector or constraint needs to be provided. Otherwise, an error is raised.
+
+    Can be used as a prior in a posterior which can be sampled with the RegularizedLinearRTO sampler.
+
+    Alias for :class:`~cuqi.implicitprior.RegularizedGaussian` with only constraints available.
+
+    For more details on implicit regularized Gaussian see the following paper:
+
+    [1] Everink, Jasper M., Yiqiu Dong, and Martin S. Andersen. "Sparse Bayesian inference with regularized
+    Gaussian distributions." Inverse Problems 39.11 (2023): 115004.
+
+    Parameters
+    ----------
+    mean
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    cov
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    prec
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    sqrtcov
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    sqrtprec
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    projector : callable f(x) or None
+        Euclidean projection onto the constraint C, that is, a solver for the optimization problem
+        min_(z in C) 0.5||x-z||_2^2.
+
+    constraint : string or None
+        Preset constraints. Can be set to "nonnegativity" and "box". Required for use in Gibbs.
+        For "box", the following additional parameters can be passed:
+            lower_bound : array_like or None
+                Lower bound of box, defaults to zero
+            upper_bound : array_like
+                Upper bound of box, defaults to one
+
+    """
+    def __init__(self, mean=None, cov=None, prec=None, sqrtcov=None,sqrtprec=None, projector=None, constraint=None, **kwargs):
+        super().__init__(mean=mean, cov=cov, prec=prec, sqrtcov=sqrtcov, sqrtprec=sqrtprec, projector=projector, constraint=constraint, **kwargs)
+
+        
+class NonnegativeGaussian(RegularizedGaussian):
+    """ Implicit Nonnegative Gaussian.
+
+    Defines a so-called implicit prior based on a Gaussian distribution with implicit nonnegativity constraints.
+
+    Can be used as a prior in a posterior which can be sampled with the RegularizedLinearRTO sampler.
+
+    Alias for :class:`~cuqi.implicitprior.RegularizedGaussian` with only nonnegativity constraints.
+
+    For more details on implicit regularized Gaussian see the following paper:
+
+    [1] Everink, Jasper M., Yiqiu Dong, and Martin S. Andersen. "Sparse Bayesian inference with regularized
+    Gaussian distributions." Inverse Problems 39.11 (2023): 115004.
+
+    Parameters
+    ----------
+    mean
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    cov
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    prec
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    sqrtcov
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    sqrtprec
+        See :class:`~cuqi.distribution.Gaussian` for details.
+
+    """
+    def __init__(self, mean=None, cov=None, prec=None, sqrtcov=None,sqrtprec=None, **kwargs):
+        super().__init__(mean=mean, cov=cov, prec=prec, sqrtcov=sqrtcov, sqrtprec=sqrtprec, constraint="nonnegativity", **kwargs)

cuqipy-1.0.0.post0.dev371/cuqi/implicitprior/_regularizedUnboundedUniform.py

@@ -0,0 +1,66 @@
+from cuqi.implicitprior import RegularizedGaussian
+from cuqi.distribution import Distribution, Gaussian
+
+import numpy as np
+
+
+class RegularizedUnboundedUniform(RegularizedGaussian):
+        """ Implicit Regularized Unbounded Uniform. 
+
+        Defines a so-called implicit prior with implicit regularization on a Gaussian distribution with zero precision.
+        The regularization can be defined in the form of a proximal operator or a projector.
+        Alternatively, preset constraints and regularization can be used.
+
+        For regularization of the form f(x), provide a single proximal operator.
+
+        Can be used as a prior in a posterior which can be sampled with the RegularizedLinearRTO sampler.
+
+        Alias for :class:`~cuqi.implicitprior.RegularizedGaussian` with zero mean and zero sqrtprec.
+
+        For more details on implicit regularized Gaussian see the following paper:
+
+        [1] Everink, Jasper M., Yiqiu Dong, and Martin S. Andersen. "Sparse Bayesian inference with regularized
+        Gaussian distributions." Inverse Problems 39.11 (2023): 115004.
+
+        Parameters
+        ----------
+        geometry : :class:`~cuqi.geometry.Geometry` or integer
+                The geometry of the underlying variable. Defines the dimension of the distribution. 
+
+        proximal : callable f(x, scale) or None
+                Euclidean proximal operator f of the regularization function g, that is, a solver for the optimization problem
+                min_z 0.5||x-z||_2^2+scale*g(x).
+
+        projector : callable f(x) or None
+                Euclidean projection onto the constraint C, that is, a solver for the optimization problem
+                min_(z in C) 0.5||x-z||_2^2.
+
+        constraint : string or None
+                Preset constraints. Can be set to "nonnegativity" and "box". Required for use in Gibbs.
+                For "box", the following additional parameters can be passed:
+                lower_bound : array_like or None
+                        Lower bound of box, defaults to zero
+                upper_bound : array_like
+                        Upper bound of box, defaults to one
+
+        regularization : string or None
+                Preset regularization. Can be set to "l1". Required for use in Gibbs in future update.
+                For "l1", the following additional parameters can be passed:
+                strength : scalar
+                        Regularization parameter, i.e., strength*||x||_1 , defaults to one
+
+        """
+        def __init__(self, geometry, proximal = None, projector = None, constraint = None, regularization = None, **kwargs):
+                
+                args = {"lower_bound" : kwargs.pop("lower_bound", None),
+                        "upper_bound" : kwargs.pop("upper_bound", None),
+                        "strength" : kwargs.pop("strength", None)}
+
+                # Underlying explicit Gaussian
+                # This line throws a warning due trying to applying get_sqrtprec_from_sqrtprec to an all zero matrix  
+                self._gaussian = Gaussian(mean = np.zeros(geometry.par_dim), sqrtprec = np.zeros((geometry.par_dim,geometry.par_dim)), geometry = geometry, **kwargs) 
+
+                # Init from abstract distribution class
+                super(Distribution, self).__init__(**kwargs)
+
+                self._parse_regularization_input_arguments(proximal, projector, constraint, regularization, args)

cuqipy-1.0.0.post0.dev371/tests/test_implicit_priors.py

@@ -0,0 +1,70 @@
+import cuqi
+import numpy as np
+import pytest
+
+def test_RegularizedGaussian_default_init():
+    """ Test that the implicit regularized Gaussian requires at least 1 regularization argument """
+
+    with pytest.raises(ValueError, match="Precisely one of "):
+        x = cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1)
+
+def test_RegularizedGaussian_guarding_statements():
+    """ Test that we catch incorrect initialization of RegularizedGaussian """
+
+    # More than 1 argument
+    with pytest.raises(ValueError, match="Precisely one of "):
+        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, proximal=lambda s,z: s, constraint="nonnegativity")
+
+    # Proximal
+    with pytest.raises(ValueError, match="Proximal needs to be callable"):
+        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, proximal=1)
+
+    with pytest.raises(ValueError, match="Proximal should take 2 arguments"):
+        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, proximal=lambda s: s)
+
+    # Projector
+    with pytest.raises(ValueError, match="Projector needs to be callable"):
+        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, projector=1)
+
+    with pytest.raises(ValueError, match="Projector should take 1 argument"):
+        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, projector=lambda s,z: s)
+
+def test_ConstrainedGaussian_alias():
+    """ Test that the implicit constrained Gaussian is a correct allias for an implicit regularized Gaussian """
+
+    x = cuqi.implicitprior.ConstrainedGaussian(np.zeros(5), 1, constraint="nonnegativity")
+
+    assert isinstance(x, cuqi.implicitprior.RegularizedGaussian)
+    assert x.preset == "nonnegativity"
+
+def test_NonnegativeGaussian_alias():
+    """ Test that the implicit nonnegative Gaussian is a correct allias for an implicit regularized Gaussian """
+
+    x = cuqi.implicitprior.NonnegativeGaussian(np.zeros(5), 1)
+
+    assert isinstance(x, cuqi.implicitprior.RegularizedGaussian)
+    assert x.preset == "nonnegativity"
+
+def test_ConstrainedGMRF_alias():
+    """ Test that the implicit constrained GMRF is a correct allias for an implicit regularized GMRF """
+
+    x = cuqi.implicitprior.ConstrainedGMRF(np.zeros(5), 1, constraint="nonnegativity")
+
+    assert isinstance(x, cuqi.implicitprior.RegularizedGMRF)
+    assert x.preset == "nonnegativity"
+
+def test_NonnegativeGMRF_alias():
+    """ Test that the implicit nonnegative GMRF is a correct allias for an implicit regularized GMRF """
+
+    x = cuqi.implicitprior.NonnegativeGMRF(np.zeros(5), 1)
+
+    assert isinstance(x, cuqi.implicitprior.RegularizedGMRF)
+    assert x.preset == "nonnegativity"
+
+def test_RegularizedUnboundedUniform_is_RegularizedGaussian():
+    """ Test that the implicit regularized unbounded uniform create a Regularized Gaussian with zero sqrtprec """
+    # NOTE: Test is based on the current assumption that the regularized uniform is modeled as a Gaussian with zero precision. This might change in the future.
+
+    x = cuqi.implicitprior.RegularizedUnboundedUniform(cuqi.geometry.Continuous1D(5), regularization="l1", strength = 5.0)
+    
+    assert np.allclose(x.gaussian.sqrtprec, 0.0)

cuqipy-1.0.0.post0.dev352/cuqi/implicitprior/__init__.py

@@ -1,2 +0,0 @@
-from ._regularizedGaussian import RegularizedGaussian
-from ._regularizedGMRF import RegularizedGMRF

cuqipy-1.0.0.post0.dev352/cuqi/implicitprior/_regularizedGMRF.py

@@ -1,70 +0,0 @@
-from cuqi.implicitprior import RegularizedGaussian
-from cuqi.distribution import Distribution, GMRF
-
-class RegularizedGMRF(RegularizedGaussian):
-    """ Implicit Regularized GMRF (Gaussian Markov Random Field). 
-
-    Defines a so-called implicit prior based on a GMRF distribution with implicit regularization.
-    The regularization can be defined in the form of a proximal operator or a projector.
-    Alternatively, preset constraints and regularization can be used.
-
-    Only one of proximal, projector, constraint or regularization can be provided. Otherwise, an error is raised.
-
-    Can be used as a prior in a posterior which can be sampled with the RegularizedLinearRTO sampler.
-
-
-    For more details on implicit regularized Gaussian see the following paper:
-
-    [1] Everink, Jasper M., Yiqiu Dong, and Martin S. Andersen. "Sparse Bayesian inference with regularized
-    Gaussian distributions." Inverse Problems 39.11 (2023): 115004.
-
-    Parameters
-    ----------
-    mean
-        See :class:`~cuqi.distribution.GMRF` for details.
-        
-    prec
-        See :class:`~cuqi.distribution.GMRF` for details.
-
-    bc_type
-        See :class:`~cuqi.distribution.GMRF` for details.
-
-    order
-        See :class:`~cuqi.distribution.GMRF` for details.
-
-    proximal : callable f(x, scale) or None
-        Euclidean proximal operator f of the regularization function g, that is, a solver for the optimization problem
-        min_z 0.5||x-z||_2^2+scale*g(x).
-
-    projector : callable f(x) or None
-        Euclidean projection onto the constraint C, that is, a solver for the optimization problem
-        min_(z in C) 0.5||x-z||_2^2.
-
-    constraint : string or None
-        Preset constraints. Can be set to "nonnegativity" and "box". Required for use in Gibbs.
-        For "box", the following additional parameters can be passed:
-            lower_bound : array_like or None
-                Lower bound of box, defaults to zero
-            upper_bound : array_like
-                Upper bound of box, defaults to one
-
-    regularization : string or None
-        Preset regularization. Can be set to "l1". Required for use in Gibbs in future update.
-        For "l1", the following additional parameters can be passed:
-            strength : scalar
-                Regularization parameter, i.e., strength*||x||_1 , defaults to one
-
-    """
-    def __init__(self, mean=None, prec=None, bc_type='zero', order=1, proximal = None, projector = None, constraint = None, regularization = None, **kwargs):
-            
-            args = {"lower_bound" : kwargs.pop("lower_bound", None),
-                    "upper_bound" : kwargs.pop("upper_bound", None),
-                    "strength" : kwargs.pop("strength", None)}
-            
-            # Underlying explicit GMRF
-            self._gaussian = GMRF(mean, prec, bc_type=bc_type, order=order, **kwargs)
-            
-            # Init from abstract distribution class
-            super(Distribution, self).__init__(**kwargs)
-
-            self._parse_regularization_input_arguments(proximal, projector, constraint, regularization, args)

cuqipy-1.0.0.post0.dev352/tests/test_implicit_priors.py

@@ -1,30 +0,0 @@
-import cuqi
-import numpy as np
-import pytest
-
-def test_RegularizedGaussian_default_init():
-    """ Test that the implicit regularized Gaussian requires at least 1 regularization argument """
-
-    with pytest.raises(ValueError, match="Precisely one of "):
-        x = cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1)
-
-def test_RegularizedGaussian_guarding_statements():
-    """ Test that we catch incorrect initialization of RegularizedGaussian """
-
-    # More than 1 argument
-    with pytest.raises(ValueError, match="Precisely one of "):
-        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, proximal=lambda s,z: s, constraint="nonnegativity")
-
-    # Proximal
-    with pytest.raises(ValueError, match="Proximal needs to be callable"):
-        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, proximal=1)
-
-    with pytest.raises(ValueError, match="Proximal should take 2 arguments"):
-        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, proximal=lambda s: s)
-
-    # Projector
-    with pytest.raises(ValueError, match="Projector needs to be callable"):
-        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, projector=1)
-
-    with pytest.raises(ValueError, match="Projector should take 1 argument"):
-        cuqi.implicitprior.RegularizedGaussian(np.zeros(5), 1, projector=lambda s,z: s)