Skip to content

Commit 724984d

Browse files
committed
pep8
1 parent ed0d417 commit 724984d

File tree

2 files changed

+3
-5
lines changed

2 files changed

+3
-5
lines changed

examples/plot_OT_1D_smooth.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
# -*- coding: utf-8 -*-
22
"""
33
===========================
4-
1D smooth optimal transport
4+
1D smooth optimal transport
55
===========================
66
77
This example illustrates the computation of EMD, Sinkhorn and smooth OT plans

ot/smooth.py

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,6 @@
2222
#OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
2323
#THE POSSIBILITY OF SUCH DAMAGE.
2424

25-
2625
# Author: Mathieu Blondel
2726
# Remi Flamary <remi.flamary@unice.fr>
2827

@@ -33,8 +32,8 @@
3332
In Proc. of AISTATS 2018.
3433
https://arxiv.org/abs/1710.06276
3534
36-
[17] Blondel, M., Seguy, V., & Rolet, A. (2018). Smooth and Sparse Optimal
37-
Transport. Proceedings of the Twenty-First International Conference on
35+
[17] Blondel, M., Seguy, V., & Rolet, A. (2018). Smooth and Sparse Optimal
36+
Transport. Proceedings of the Twenty-First International Conference on
3837
Artificial Intelligence and Statistics (AISTATS).
3938
4039
Original code from https://github.com/mblondel/smooth-ot/
@@ -410,7 +409,6 @@ def get_plan_from_semi_dual(alpha, b, C, regul):
410409

411410
def smooth_ot_dual(a, b, M, reg, reg_type='l2', method="L-BFGS-B", stopThr=1e-9,
412411
numItermax=500, log=False):
413-
414412

415413
if reg_type.lower() in ['l2', 'squaredl2']:
416414
regul = SquaredL2(gamma=reg)

0 commit comments

Comments
 (0)