2022
DOI: 10.1007/s13042-022-01704-6
|View full text |Cite
|
Sign up to set email alerts
|

Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 52 publications
0
2
0
Order By: Relevance
“…Hence it was proposed in [ 19 , 45 , 46 ] to use biased gradient estimates which neglect the terms resorting to a REINFORCE gradient estimate. Unfortunately, as established by Corenflos et al [ 47 ], this can introduce some very substantial bias. To address this problem, differentiable resampling procedures have been introduced; e.g.…”
Section: Further Extensionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Hence it was proposed in [ 19 , 45 , 46 ] to use biased gradient estimates which neglect the terms resorting to a REINFORCE gradient estimate. Unfortunately, as established by Corenflos et al [ 47 ], this can introduce some very substantial bias. To address this problem, differentiable resampling procedures have been introduced; e.g.…”
Section: Further Extensionsmentioning
confidence: 99%
“…To address this problem, differentiable resampling procedures have been introduced; e.g. [ 47 , 48 ]. In these approaches, resampling is replaced by solving a regularized optimal transport problem.…”
Section: Further Extensionsmentioning
confidence: 99%