Marco Cuturi
where else to find them
bluesky:marcocuturi.bsky.social
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Computational Optimal Transport | Geometric Methods in Optimization and Sampling Boot Camp | 2021-08-30 |
Computes that classic discrete OT is cubic (Hungarian / network‑flow), fragile (nonunique P with Jacobian zero or infinite) and statistically cursed in 5–50D… | ||
| nothing matches | ||