Fix DR baselines - #816
Conversation
|
Closes #803 |
lazappi
left a comment
There was a problem hiding this comment.
Code looks good to me. Do you mind quickly explaining the motivation for the spectral distances? I'm just not very familiar with diffusion maps and would be good to have some background in case it comes up later.
Codecov ReportBase: 95.61% // Head: 95.68% // Increases project coverage by
Additional details and impacted files@@ Coverage Diff @@
## main #816 +/- ##
==========================================
+ Coverage 95.61% 95.68% +0.07%
==========================================
Files 184 186 +2
Lines 4949 4984 +35
Branches 273 271 -2
==========================================
+ Hits 4732 4769 +37
Misses 138 138
+ Partials 79 77 -2
Flags with carried forward coverage won't be shown. Click here to find out more.
Help us with your feedback. Take ten seconds to tell us how you rate us. Have a feature suggestion? Share it here. ☔ View full report at Codecov. |
|
Sure! Tl;dr diffusion distances are graph distances that are robust to noise. Where a graph shortest path distance is sensitive to a single noisy point short-circuiting the path between two otherwise distant points on the manifold, diffusion distances use the probability of traversing the graph from one point to another via a random walk to integrate over all graph paths instead of simply the shortest one. |
mvinyard
left a comment
There was a problem hiding this comment.
Looks great, thank you @scottgigante-immunai !
This PR fixes various problems with the dimensionality reduction baselines.