Feature/tree recombination

.cspell/custom_misc.txt

@@ -3,6 +3,7 @@ ANNchor
 approximator
 approximators
 archiveprefix
+binom
 cand
 coreax
 coreset
@@ -25,19 +26,24 @@ kernelised
 kernelized
 KSD
 linewidth
+mapsto
 Matern
 ml.p3.8xlarge
 ndmin
 parsable
 PCIMQ
+phdthesis
 PMLR
 primaryclass
 PRNG
+rcond
+recomb
 refs
 regulariser
 RKHS
 RPCHOLESKY
 sigmas
+subseteq
 supp
 TLDR
 typecheck

.cspell/library_terms.txt

@@ -22,6 +22,7 @@ brightgreen
 bysource
 cmap
 color
+Concretization
 dispname
 dollarmath
 dtype
@@ -30,8 +31,10 @@ dunder
 eigh
 emibcn
 eprint
+errstate
 figsize
 finfo
+flatnonzero
 fori_loop
 fracv
 furo
@@ -116,6 +119,7 @@ sklearn
 softplus
 sphinxcontrib
 sphobjinv
+tensordot
 texttt
 toctree
 tomli
@@ -130,6 +134,7 @@ unsrt
 vars
 viewcode
 vmap
+vmaps
 writebytes
 xlabel
 ylabel

.cspell/people.txt

@@ -1,4 +1,5 @@
 Benard
+Caratheodory
 Chatalic
 Duvenaud
 Epperly
@@ -7,15 +8,22 @@ Ferenc
 Frobenius
 Garg
 Garreau
+Goaoc
 Halko
+Helly
 Huszar
 Jaehoon
 Jiaxin
 Jitkrittum
 Kanagawa
+Litterer
+Loera
+Lyons
 Martinsson
 Matérn
+Meunier
 Motonobu
+Nabil
 Nystr
 Nystrom
 Qiang
@@ -26,8 +34,13 @@ Sahaj
 Schreuder
 Smirnov
 Smola
+Sperner
 Staber
+Tchakaloff
+Tchernychova
+Teichmann
 Tropp
+Tverberg
 Veiga
 Wittawat
 Yifan

CHANGELOG.md

@@ -9,6 +9,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ### Added
 - Added Kernelised Stein Discrepancy divergence in `coreax.metrics.KSD`.
+- Added the `coreax.solvers.recombination` module, which provides the following new solvers:
+  - `RecombinationSolver`: an abstract base class for recombination solvers.
+  - `CaratheodoryRecombination`: a simple deterministic approach to solving recombination problems.
+  - `TreeRecombination`: an advanced deterministic approach that utilises `CaratheodoryRecombination`,
+    but is faster for solving all but the smallest recombination problems.
 - Added supervised coreset construction algorithm in `coreax.solvers.GreedyKernelPoints`
 - Added `coreax.kernels.PowerKernel` to replace repeated calls of `coreax.kernels.ProductKernel`
 within the `**` magic method of `coreax.kernel.ScalarValuedKernel`

coreax/solvers/__init__.py

@@ -32,6 +32,11 @@
     RPCholeskyState,
     SteinThinning,
 )
+from coreax.solvers.recombination import (
+    CaratheodoryRecombination,
+    RecombinationSolver,
+    TreeRecombination,
+)
 
 __all__ = [
     "CompositeSolver",
@@ -49,4 +54,7 @@
     "PaddingInvariantSolver",
     "GreedyKernelPoints",
     "GreedyKernelPointsState",
+    "RecombinationSolver",
+    "CaratheodoryRecombination",
+    "TreeRecombination",
 ]

coreax/solvers/base.py

@@ -114,7 +114,7 @@ class PaddingInvariantSolver(Solver):
     A :class:`Solver` whose results are invariant to zero weighted data.
 
     In some cases, such as in :class:`coreax.solvers.MapReduce`, there is a need to pad
-    data to ensure shape stability. In some cases, we may assign zero weight to the
+    data to ensure shape stability. In these cases, we may assign zero weight to the
     padded data points, which allows certain 'padding invariant' solvers to return the
     same values on a call to :meth:`~coreax.solvers.Solver.reduce` as would have been
     returned if no padding were present.