summaryrefslogtreecommitdiff
path: root/ot
AgeCommit message (Collapse)Author
2017-06-09add doc and correct encodingRémi Flamary
2017-06-09add doc ot.gpu.bregmanRémi Flamary
2017-04-24Remove unnecessary parameterLeo gautheron
2017-04-24add GPU implementation sinkhorn lpl1Leo gautheron
2017-04-21performance improvement sinkhorn lpl1Leo gautheron
- instead of updating individually for each target examples, update for all target examples at once using numpy functions. This allows for a faster computation (for me, divided by 4 on 3000*100 random matricies and random labels in [0,1]). - if I understoud correctly, a value of -1 in the array labels_a meant that we didn't have a label for this example. But in machine learning, we often encounter the binary case where we say we have the positive class (+1) and negative class (-1); thus with a dataset like this, the algorithm wouldn't work as expected. I replaced the default value for 'no label' to '-99' instead of '-1', and I added a parameter to modify it.
2017-04-21small normalization bugRémi Flamary
2017-04-20more changes from feebackLeo gautheron
in addition add the posibility to normalize the cost matrix through the function fit
2017-04-20missing argument function sinkhornLeo gautheron
2017-04-20changes from feedbackLeo gautheron
2017-04-20sinkhorn GPU implementationLeo gautheron
2017-04-18little cleanup sinkhornLeo gautheron
2017-04-18Performance improvement sinkhornLeo gautheron
Doing the computation this way is equivalent and allows to reduce the space complexity required from O(max(a, b)^2) to O(a*b) (especially usefull to transport a small number of sources example to a lot of target) This also allows to decrease the computation time.
2017-04-13update bregman fileLeo gautheron
- change commented prints to python3 compatible syntax - Correct issue that could cause the sinkhorn algo to stop with u and v containing nan/infinite numbers: - Assign uprev and vprev before changing u and v. - Then update u and v. - Then check if u and v contain nan, but ALSO infinite values. - if there are issues, then display error (with 2 r, not 3 :p) along with the iteration number (there may have errors at iteration 0)
2017-04-07doc updateRémi Flamary
2017-04-07V0.2Rémi Flamary
2017-04-07doc wdaRémi Flamary
2017-04-07better dicumentationRémi Flamary
2017-04-07add WDARémi Flamary
2017-04-07avoid filename conclict in windowsRémi Flamary
2017-03-21cleanupt cpp wrapper nameRémi Flamary
2017-03-14add emd2+ multiprocRémi Flamary
2017-03-10runs but not quickerRémi Flamary
2017-03-10first tryRémi Flamary
2017-02-07log return for sinkhornRémi Flamary
2017-01-05version 0.1.12Rémi Flamary
2017-01-05add tic() and toc() functions for easy coarse timingRémi Flamary
2017-01-05more efficient sinkhornRémi Flamary
2016-12-02small updateRémi Flamary
2016-12-02cleanup pyflakes issue #23Rémi Flamary
2016-12-01update barycenter demoRémi Flamary
2016-11-09da with GLNicolas Courty
2016-11-08da with GLNicolas Courty
2016-11-08travis CIRémi Flamary
2016-11-07gcgNicolas Courty
2016-11-07v0.1.11Rémi Flamary
2016-11-07v0.1.11Rémi Flamary
2016-11-07v0.1.10Rémi Flamary
2016-11-07add log and epsilon scaling stabilizationsRémi Flamary
2016-11-04workingRémi Flamary
2016-11-04etter doc for classesRémi Flamary
2016-11-04doc nonlinear mapping estimationRémi Flamary
2016-11-04doc linear mapping estimationRémi Flamary
2016-11-04V0.1.9Rémi Flamary
2016-11-04V0.1.8Rémi Flamary
2016-11-04add demo mappingRémi Flamary
2016-11-04add mapping estimation with kernels works!Rémi Flamary
2016-11-03add mapping estimation with kernels (smaller bugs)Rémi Flamary
2016-11-03add mapping estimation with kernels (still debugging)Rémi Flamary
2016-11-03add mapping estimation with kernels (still debugging)Rémi Flamary
2016-11-03add mapping estimation (still debugging)Rémi Flamary