Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tai Hoang

dblp:236/4719 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2025
0009-0008-9080-8105ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Motion planning and robot control · 29% Transfer learning and domain adaptation · 29% Robot manipulation · 14%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
deformable object manipulation
0.912025
Geometry-aware RL for Manipulation of Varying Shapes and Deformable Objects · ICLR 2025
Robotics › Motion planning and robot control › robot learning › robot policy learning
equivariant policy learning
0.912025
Geometry-aware RL for Manipulation of Varying Shapes and Deformable Objects · ICLR 2025
Machine learning › Transfer learning and domain adaptation › meta-learning
fast adaptation
0.912025
MaNGO - Adaptable Graph Network Simulators via Meta-Learning · NeurIPS 2025
Machine learning › Graph learning
graph network simulators
0.912025
MaNGO - Adaptable Graph Network Simulators via Meta-Learning · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation
meta-learning
0.912025
MaNGO - Adaptable Graph Network Simulators via Meta-Learning · NeurIPS 2025
Machine learning › Reinforcement learning
policy learning
0.912025
Geometry-aware RL for Manipulation of Varying Shapes and Deformable Objects · ICLR 2025
Robotics › Motion planning and robot control
robot learning
0.912025
Geometry-aware RL for Manipulation of Varying Shapes and Deformable Objects · ICLR 2025
Computational science and engineering › computational physics
physics simulation
0.312025
MaNGO - Adaptable Graph Network Simulators via Meta-Learning · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

neural operator · 1.7meta-learning · 1.7reinforcement learning · 0.9heterogeneous graph neural network · 0.9conditional neural processes · 0.9conditional neural process · 0.9SE(3) equivariant message passing · 0.9
YearPublicationVenuePosition
2025 Geometry-aware RL for Manipulation of Varying Shapes and Deformable Objects
abstract
Manipulating objects with varying geometries and deformable objects is a major challenge in robotics. Tasks such as insertion with different objects or cloth hanging require precise control and effective modelling of complex dynamics. In this work, we frame this problem through the lens of a heterogeneous graph that comprises smaller sub-graphs, such as actuators and objects, accompanied by different edge types describing their interactions. This graph representation serves as a unified structure for both rigid and deformable objects tasks, and can be extended further to tasks comprising multiple actuators. To evaluate this setup, we present a novel and challenging reinforcement learning benchmark, including rigid insertion of diverse objects, as well as rope and cloth manipulation with multiple end-effectors. These tasks present a large search space, as both the initial and target configurations are uniformly sampled in 3D space. To address this issue, we propose a novel graph-based policy model, dubbed Heterogeneous Equivariant Policy (HEPi), utilizing $SE(3)$ equivariant message passing networks as the main backbone to exploit the geometric symmetry. In addition, by modeling explicit heterogeneity, HEPi can outperform Transformer-based and non-heterogeneous equivariant policies in terms of average returns, sample efficiency, and generalization to unseen objects. Our project page is available at https://thobotics.github.io/hepi.
Tai Hoang, Philipp Becker, Ngo Anh Vien, Gerhard Neumann
ICLR1
2025 MaNGO - Adaptable Graph Network Simulators via Meta-Learning
abstract
Accurately simulating physics is crucial across scientific domains, with applications spanning from robotics to materials science. While traditional mesh-based simulations are precise, they are often computationally expensive and require knowledge of physical parameters, such as material properties. In contrast, data-driven approaches like Graph Network Simulators (GNSs) offer faster inference but suffer from two key limitations: Firstly, they must be retrained from scratch for even minor variations in physical parameters, and secondly they require labor-intensive data collection for each new parameter setting. This is inefficient, as simulations with varying parameters often share a common underlying latent structure. In this work, we address these challenges by learning this shared structure through meta-learning, enabling fast adaptation to new physical parameters without retraining. To this end, we propose a novel architecture that generates a latent representation by encoding graph trajectories using conditional neural processes (CNPs). To mitigate error accumulation over time, we combine CNPs with a novel neural operator architecture. We validate our approach, Meta Neural Graph Operator (MaNGO), on several dynamics prediction tasks with varying material properties, demonstrating superior performance over existing GNS methods. Notably, MaNGO achieves accuracy on unseen material properties close to that of an oracle model.
Philipp Dahlinger, Tai Hoang, Denis Blessing, Niklas Freymuth, Gerhard Neumann
NeurIPS2
2025 AMBER: Adaptive Mesh Generation by Iterative Mesh Resolution Prediction
abstract
The cost and accuracy of simulating complex physical systems using the Finite Element Method (FEM) scales with the resolution of the underlying mesh. Adaptive meshes improve computational efficiency by refining resolution in critical regions, but typically require task-specific heuristics or cumbersome manual design by a human expert. We propose Adaptive Meshing By Expert Reconstruction (AMBER), a supervised learning approach to mesh adaptation. Starting from a coarse mesh, AMBER iteratively predicts the sizing field, i.e., a function mapping from the geometry to the local element size of the target mesh, and uses this prediction to produce a new intermediate mesh using an out-of-the-box mesh generator. This process is enabled through a hierarchical graph neural network, and relies on data augmentation by automatically projecting expert labels onto AMBER-generated data during training. We evaluate AMBER on 2D and 3D datasets, including classical physics problems, mechanical components, and real-world industrial designs with human expert meshes. AMBER generalizes to unseen geometries and consistently outperforms multiple recent baselines, including ones using Graph and Convolutional Neural Networks, and Reinforcement Learning-based approaches.
Niklas Freymuth, Tobias Würth, Nicolas Schreiber, Balázs Gyenes, Andreas Boltres, Johannes Mitsch, Aleksandar Taranovic, Tai Hoang, Philipp Dahlinger, Philipp Becker, Luise Kärger, Gerhard Neumann
NeurIPS8
2022 Ball-and-Socket Joint Pose Estimation Using Magnetic Field
Tai Hoang, Alona Kharchenko, Simon Trendel, Rafael Hostettler
ISRR1
2020 Graph-Based Motion Planning Networks
Tai Hoang, Ngo Anh Vien
ECML/PKDD (2)1