//
sign in
Profile
by @danabra.mov
Profile
by @dansshadow.bsky.social
Profile
by @jimpick.com
AviHandle
by @danabra.mov
AviHandle
by @dansshadow.bsky.social
AviHandle
by @katherine.computer
EventsList
by @katherine.computer
ProfileHeader
by @dansshadow.bsky.social
ProfileHeader
by @danabra.mov
ProfileMedia
by @danabra.mov
ProfilePlays
by @danabra.mov
ProfilePosts
by @danabra.mov
ProfilePosts
by @dansshadow.bsky.social
ProfileReplies
by @danabra.mov
Record
by @atsui.org
Skircle
by @danabra.mov
StreamPlacePlaylist
by @katherine.computer
+ new component
ProfilePosts





Loading...
The alpha version of my new book "Optimal Transport for Machine Learners" is out, with in particular an online version with interactive figures www.gpeyre.com/ot4ml/
I’m back
1d
While it is intuitively clear that straighter trajectories should reduce discretization error when integrating an ODE (for instance, in flow matching), I could not find a precise bound. I therefore rewrote the proof of Cauchy-Lipschitz to make this explicit. github.com/gpeyre/Discr...
2d
2mo
(ok this is not true but still 🥲)