Robuta

https://openreview.net/forum?id=zxxSJAVQPc A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer | OpenReview Can we model Non-Euclidean graphs as pure language or even Euclidean vectors while retaining their inherent information? The Non-Euclidean property have posed... graph worth k https://research.nvidia.com/labs/srl/publication/rana-2020-euclideanizing/ Euclideanizing Flows: Diffeomorphic Reduction for Learning Stable Dynamical Systems | NVIDIA... for learning dynamical systems flows reduction stable