Multi-Task Learning as a Bargaining Game. | 0 | 0.34 | 2022 |
StyleGAN-NADA: CLIP-guided domain adaptation of image generators | 0 | 0.34 | 2022 |
Optimizing Tensor Network Contraction Using Reinforcement Learning. | 0 | 0.34 | 2022 |
Self-Supervised Learning for Domain Adaptation on Point Clouds | 8 | 0.52 | 2021 |
On Learning Sets of Symmetric Elements (Extended Abstract). | 0 | 0.34 | 2021 |
On the Universality of Rotation Equivariant Point Cloud Networks | 0 | 0.34 | 2021 |
Controlling Graph Dynamics with Reinforcement Learning and Graph Neural Networks | 0 | 0.34 | 2021 |
From Local Structures to Size Generalization in Graph Neural Networks | 0 | 0.34 | 2021 |
Auxiliary Learning by Implicit Differentiation | 0 | 0.34 | 2021 |
Set2Graph: Learning Graphs From Sets | 0 | 0.34 | 2020 |
On Learning Sets of Symmetric Elements | 0 | 0.34 | 2020 |
Learning Algebraic Multigrid Using Graph Neural Networks | 0 | 0.34 | 2020 |
Surface Networks via General Covers | 1 | 0.34 | 2019 |
On the Universality of Invariant Networks. | 2 | 0.35 | 2019 |
Provably Powerful Graph Networks. | 4 | 0.40 | 2019 |
Controlling Neural Level Sets. | 2 | 0.36 | 2019 |
(Probably) Concave Graph Matching. | 1 | 0.34 | 2018 |
Invariant and Equivariant Graph Networks. | 4 | 0.39 | 2018 |
Multi-chart Generative Surface Modeling. | 9 | 0.46 | 2018 |
Point Convolutional Neural Networks by Extension Operators. | 43 | 1.50 | 2018 |
Convolutional neural networks on surfaces via seamless toric covers | 37 | 1.07 | 2017 |
DS++: A flexible, scalable and provably tight relaxation for matching problems. | 10 | 0.47 | 2017 |
Passive light and viewpoint sensitive display of 3D content | 2 | 0.37 | 2016 |
Point registration via efficient convex relaxation. | 18 | 0.64 | 2016 |