scm2cpp-lasso 0.5.0.1__tar.gz → 0.5.2__tar.gz

{scm2cpp_lasso-0.5.0.1 → scm2cpp_lasso-0.5.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: scm2cpp-lasso
-Version: 0.5.0.1
+Version: 0.5.2
 Summary: Lasso by covariance-update coordinate descent, translated from Scheme to C++ by scm2cpp; GPU batch solver included
 Author: Hirotaka Niitsuma
 License: MIT

{scm2cpp_lasso-0.5.0.1 → scm2cpp_lasso-0.5.2}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "scm2cpp-lasso"
-version = "0.5.0.1"
+version = "0.5.2"
 description = "Lasso by covariance-update coordinate descent, translated from Scheme to C++ by scm2cpp; GPU batch solver included"
 readme = "README.md"
 requires-python = ">=3.8"

{scm2cpp_lasso-0.5.0.1 → scm2cpp_lasso-0.5.2}/src/scm2cpp_lasso/__init__.py

@@ -31,7 +31,7 @@ from ._libfind import load_batch_lib
 
 __all__ = ["CovLasso", "CovRidge", "CovLogistic", "CovGroupLasso",
            "cuda_available", "kernel"]
-__version__ = "0.5.0.1"
+__version__ = "0.5.2"
 
 _BATCH = load_batch_lib()
 _DP = ctypes.POINTER(ctypes.c_double)
@@ -141,6 +141,17 @@ class CovLasso:
 
     # ---------------------------- fitting ----------------------------
 
+    def fit(self, lam, **kw):
+        """Coefficients at one lambda.
+
+        A single penalty is the one-element special case of the path:
+        the Gram matrix was built in the constructor, so this costs one
+        descent and nothing per row -- and a warm-started path over a
+        whole grid costs barely more, which is why fit_path is the
+        primary interface rather than this convenience.
+        """
+        return self.fit_path([lam], **kw)[0]
+
     def fit_path(self, lambdas, tol=1e-8, chunk=20, max_sweeps=100000,
                  l1_ratio=1.0):
         """Coefficients per lambda, each warm-started from the last.

{scm2cpp_lasso-0.5.0.1 → scm2cpp_lasso-0.5.2}/src/scm2cpp_lasso.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: scm2cpp-lasso
-Version: 0.5.0.1
+Version: 0.5.2
 Summary: Lasso by covariance-update coordinate descent, translated from Scheme to C++ by scm2cpp; GPU batch solver included
 Author: Hirotaka Niitsuma
 License: MIT