You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: RELEASES.md
+7-6Lines changed: 7 additions & 6 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -10,6 +10,7 @@
10
10
+ The `convolutional_barycenter2d` and `convolutional_barycenter2d_debiased` functions now work with different devices.. (PR #533)
11
11
+ New API for Gromov-Wasserstein solvers with `ot.solve_gromov` function (PR #536)
12
12
+ New LP solvers from scipy used by default for LP barycenter (PR #537)
13
+
+ Upgraded unbalanced OT solvers for more flexibility (PR #539)
13
14
14
15
#### Closed issues
15
16
- Fix line search evaluating cost outside of the interpolation range (Issue #502, PR #504)
@@ -19,13 +20,13 @@
19
20
## 0.9.1
20
21
*August 2023*
21
22
22
-
This new release contains several new features and bug fixes.
23
+
This new release contains several new features and bug fixes.
23
24
24
25
New features include a new submodule `ot.gnn` that contains two new Graph neural network layers (compatible with [Pytorch Geometric](https://pytorch-geometric.readthedocs.io/)) for template-based pooling of graphs with an example on [graph classification](https://pythonot.github.io/master/auto_examples/gromov/plot_gnn_TFGW.html). Related to this, we also now provide FGW and semi relaxed FGW solvers for which the resulting loss is differentiable w.r.t. the parameter `alpha`. Other contributions on the (F)GW front include a new solver for the Proximal Point algorithm [that can be used to solve entropic GW problems](https://pythonot.github.io/master/auto_examples/gromov/plot_fgw_solvers.html) (using the parameter `solver="PPA"`), new solvers for entropic FGW barycenters, novels Sinkhorn-based solvers for entropic semi-relaxed (F)GW, the possibility to provide a warm-start to the solvers, and optional marginal weights of the samples (uniform weights ar used by default). Finally we added in the submodule `ot.gaussian` and `ot.da` new loss and mapping estimators for the Gaussian Gromov-Wasserstein that can be used as a fast alternative to GW and estimates linear mappings between unregistered spaces that can potentially have different size (See the update [linear mapping example](https://pythonot.github.io/master/auto_examples/domain-adaptation/plot_otda_linear_mapping.html) for an illustration).
25
26
26
27
We also provide a new solver for the [Entropic Wasserstein Component Analysis](https://pythonot.github.io/master/auto_examples/others/plot_EWCA.html) that is a generalization of the celebrated PCA taking into account the local neighborhood of the samples. We also now have a new solver in `ot.smooth` for the [sparsity-constrained OT (last plot)](https://pythonot.github.io/master/auto_examples/plot_OT_1D_smooth.html) that can be used to find regularized OT plans with sparsity constraints. Finally we have a first multi-marginal solver for regular 1D distributions with a Monge loss (see [here](https://pythonot.github.io/master/auto_examples/others/plot_dmmot.html)).
27
28
28
-
The documentation and testings have also been updated. We now have nearly 95% code coverage with the tests. The documentation has been updated and some examples have been streamlined to build more quickly and avoid timeout problems with CircleCI. We also added an optional CI on GPU for the master branch and approved PRs that can be used when a GPU runner is online.
29
+
The documentation and testings have also been updated. We now have nearly 95% code coverage with the tests. The documentation has been updated and some examples have been streamlined to build more quickly and avoid timeout problems with CircleCI. We also added an optional CI on GPU for the master branch and approved PRs that can be used when a GPU runner is online.
29
30
30
31
Many other bugs and issues have been fixed and we want to thank all the contributors, old and new, who made this release possible. More details below.
31
32
@@ -76,9 +77,9 @@ Many other bugs and issues have been fixed and we want to thank all the contribu
76
77
*April 2023*
77
78
78
79
This new release contains so many new features and bug fixes since 0.8.2 that we
79
-
decided to make it a new minor release at 0.9.0.
80
+
decided to make it a new minor release at 0.9.0.
80
81
81
-
The release contains many new features. First we did a major
82
+
The release contains many new features. First we did a major
82
83
update of all Gromov-Wasserstein solvers that brings up to 30% gain in
83
84
computation time (see PR #431) and allows the GW solvers to work on non symmetric
84
85
matrices. It also brings novel solvers for the very
has also been implemented. Finally we began working on OT between Gaussian distributions and
@@ -147,7 +148,7 @@ when implementing new solvers but we encourage users to play with it.
147
148
Finally, in addition to those many new this release fixes 20 issues (some long
148
149
standing) and we want to thank all the contributors who made this release so
149
150
big. More details below.
150
-
151
+
151
152
152
153
#### New features
153
154
- Added feature to (Fused) Gromov-Wasserstein solvers inherited from `ot.optim` to support relative and absolute loss variations as stopping criterions (PR #431)
0 commit comments