Peter Yichen Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Peter Yichen Chen has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Eitan Grinspun
University of Toronto, Toronto, Canada
8 shared publications - Yue Chang
University of Toronto, Toronto, Canada
7 shared publications - Maurizio M. Chiaramonte
Meta Reality Labs Research, Redmond, USA
5 shared publications - Chenfanfu Jiang
University of California Los Angeles
4 shared publications - Wojciech Matusik
MIT CSAIL, Cambridge, USA
4 shared publications - Zhecheng Wang
University of Toronto, Toronto, Canada
4 shared publications
Latest Publications
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Beyond Rigid Bodies × Newton for Robotics: Open GPU Physics, Differentiable Simulation, and Multi-Solver Ecosystems for Physical AI and Embodied Robotics
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessBeyond Rigid Bodies × Newton for Robotics: Open GPU Physics, Differentiable Simulation, and Multi-Solver Ecosystems for Physical AI and Embodied Robotics
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Agentic Graphics
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessAgentic Graphics
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Unified Simulation of Lagrangian Particle Dynamics via Transformer
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessUnified Simulation of Lagrangian Particle Dynamics via Transformer
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-21
DiffPhD: A Unified Differentiable Solver for Projective Heterogeneous Materials in Elastodynamics with Contact-Rich GPU-Acceleration
Differentiable simulation of soft bodies is a foundation for system identification, trajectory optimization, and Real2Sim transfer. Yet, existing methods such as the differentiable Projective Dynamics (DiffPD) struggle when faced with heterogeneous materials with extreme stiffness contrasts, hyperelasticity under large deformations, and contact-rich interactions, which are common scenarios in the real world. We present DiffPhD, a unified GPU-accelerated differentiable Projective Dynamics framework for heterogeneous materials that tackles these intertwined challenges simultaneously. Our key insight is a careful integration of: (i) stiffness-aware projective weights to embed heterogeneity into the global system; (ii) trust-region eigenvalue filtering lifted to the backward pass for stable hyperelastic gradients and a type-II Anderson Acceleration scheme with dual-gate convergence to stabilize forward iteration under large stiffness contrasts; and (iii) a unified GPU pipeline that reuses a single sparse factor across forward, backward, and contact computations, with stiffness-amplified Rayleigh damping folded into the same factor for heterogeneity-aware dissipation at zero recurring cost. DiffPhD delivers analytic adjoints—machine-precision on the elastic path, bounded and quantified under contact—with up to an order-of-magnitude speedup over prior differentiable solvers. Crucially, this speedup does not come at the cost of stability: DiffPhD remains convergent on stiffness contrasts up to 100× where prior PD solvers degrade. This unlocks end-to-end gradient-based optimization on regimes previously bottlenecked by either solver fragility or per-iteration cost—shell-joint composite creatures, soft characters wielding stiff weapons, and soft-gripper robotic manipulation—all handled within a single forward-backward pass. Project/Code/Video: https://chabu-tseng.github.io/diffphd/.
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-21
Open AccessDiffPhD: A Unified Differentiable Solver for Projective Heterogeneous Materials in Elastodynamics with Contact-Rich GPU-Acceleration
Differentiable simulation of soft bodies is a foundation for system identification, trajectory optimization, and Real2Sim transfer. Yet, existing methods such as the differentiable Projective Dynamics (DiffPD) struggle when faced with heterogeneous materials with extreme stiffness contrasts, hyperelasticity under large deformations, and contact-rich interactions, which are common scenarios in the real world. We present DiffPhD, a unified GPU-accelerated differentiable Projective Dynamics framework for heterogeneous materials that tackles these intertwined challenges simultaneously. Our key insight is a careful integration of: (i) stiffness-aware projective weights to embed heterogeneity into the global system; (ii) trust-region eigenvalue filtering lifted to the backward pass for stable hyperelastic gradients and a type-II Anderson Acceleration scheme with dual-gate convergence to stabilize forward iteration under large stiffness contrasts; and (iii) a unified GPU pipeline that reuses a single sparse factor across forward, backward, and contact computations, with stiffness-amplified Rayleigh damping folded into the same factor for heterogeneity-aware dissipation at zero recurring cost. DiffPhD delivers analytic adjoints—machine-precision on the elastic path, bounded and quantified under contact—with up to an order-of-magnitude speedup over prior differentiable solvers. Crucially, this speedup does not come at the cost of stability: DiffPhD remains convergent on stiffness contrasts up to 100× where prior PD solvers degrade. This unlocks end-to-end gradient-based optimization on regimes previously bottlenecked by either solver fragility or per-iteration cost—shell-joint composite creatures, soft characters wielding stiff weapons, and soft-gripper robotic manipulation—all handled within a single forward-backward pass. Project/Code/Video: https://chabu-tseng.github.io/diffphd/.
- 11 September 2026
- Published by Springer Nature
- p. 390-409
MeGAS: Thermomechanical Dynamic Gaussian Splatting for Thermophysical Scene Editing
- 11 September 2026
- Published by Springer Nature
- p. 390-409
MeGAS: Thermomechanical Dynamic Gaussian Splatting for Thermophysical Scene Editing
- Open Access
- 12 August 2026
- Published by Wiley in Computer Graphics Forum
- p. e70566
Closing Trajectories: Equation‐Free Cyclic Animation via Koopman Surrogates
Cyclic animation is widely used in computer graphics and interactive content. It supports seamless playback in games, VR, and interactive simulation, where short clips must repeat smoothly over long durations. Converting an observed non‐cyclic trajectory into a seamless loop is challenging because the endpoint states of the observed sequence rarely match exactly, and the governing equations of the underlying system are often unavailable. We therefore propose an equation‐free framework that identifies a Koopman surrogate from the observed trajectory and computes a cyclic trajectory by applying a Fourier‐parameterized, time‐varying control input under a hard temporal periodicity constraint. The resulting formulation reduces cyclic synthesis to a linearly constrained quadratic program that can be solved efficiently through a structured KKT system. Our method is applicable to a diverse range of examples, including N‐body systems, cloth, deformable objects, shallow water, etc.
- 12 August 2026
- Published by Wiley in Computer Graphics Forum
- p. e70566
Open AccessClosing Trajectories: Equation‐Free Cyclic Animation via Koopman Surrogates
Cyclic animation is widely used in computer graphics and interactive content. It supports seamless playback in games, VR, and interactive simulation, where short clips must repeat smoothly over long durations. Converting an observed non‐cyclic trajectory into a seamless loop is challenging because the endpoint states of the observed sequence rarely match exactly, and the governing equations of the underlying system are often unavailable. We therefore propose an equation‐free framework that identifies a Koopman surrogate from the observed trajectory and computes a cyclic trajectory by applying a Fourier‐parameterized, time‐varying control input under a hard temporal periodicity constraint. The resulting formulation reduces cyclic synthesis to a linearly constrained quadratic program that can be solved efficiently through a structured KKT system. Our method is applicable to a diverse range of examples, including N‐body systems, cloth, deformable objects, shallow water, etc.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Graphics4Science 2026: Graphics for Cross-Scale Reliable Scientific Instruments
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessGraphics4Science 2026: Graphics for Cross-Scale Reliable Scientific Instruments
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-14
Low-Rank Koopman Deformables with Log-Linear Time Integration
We present a low-rank Koopman operator formulation for accelerating deformable subspace simulation. Using a Dynamic Mode Decomposition (DMD) parameterization of the Koopman operator, our method learns the temporal evolution of deformable dynamics and predicts future states through efficient matrix evaluations instead of sequential time integration. This yields log-linear scaling in the number of time steps and allows large portions of the trajectory to be skipped while retaining accuracy. The resulting temporal efficiency is especially advantageous for optimization tasks such as control and initial-state estimation, where the objective often depends largely on the final configuration. To broaden the scope of Koopman-based reduced-order models in graphics, we introduce a discretization-agnostic extension that learns shared dynamic behavior across multiple shapes and mesh resolutions. Prior DMD-based approaches have been restricted to a single shape and discretization, which limits their usefulness for tasks involving geometry variation. Our formulation generalizes across both shape and discretization, which enables fast shape optimization that was previously impractical for DMD models. This expanded capability highlights the potential of Koopman operator learning as a practical tool for efficient deformable simulation and design.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-14
Open AccessLow-Rank Koopman Deformables with Log-Linear Time Integration
We present a low-rank Koopman operator formulation for accelerating deformable subspace simulation. Using a Dynamic Mode Decomposition (DMD) parameterization of the Koopman operator, our method learns the temporal evolution of deformable dynamics and predicts future states through efficient matrix evaluations instead of sequential time integration. This yields log-linear scaling in the number of time steps and allows large portions of the trajectory to be skipped while retaining accuracy. The resulting temporal efficiency is especially advantageous for optimization tasks such as control and initial-state estimation, where the objective often depends largely on the final configuration. To broaden the scope of Koopman-based reduced-order models in graphics, we introduce a discretization-agnostic extension that learns shared dynamic behavior across multiple shapes and mesh resolutions. Prior DMD-based approaches have been restricted to a single shape and discretization, which limits their usefulness for tasks involving geometry variation. Our formulation generalizes across both shape and discretization, which enables fast shape optimization that was previously impractical for DMD models. This expanded capability highlights the potential of Koopman operator learning as a practical tool for efficient deformable simulation and design.
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-19
M-ABD: Scalable, Efficient, and Robust Multi-Affine-Body Dynamics
Simulating large-scale articulated assemblies poses a significant challenge due to the numerical stiffness and geometric complexity of jointed structures. Conventional rigid body solvers struggle with the high nonlinearity induced by rotation parameterization. This difficulty becomes more pronounced for multiple two-way-coupled bodies. This paper introduces a novel framework that leverages the linear kinematic mapping of Affine Body Dynamics (ABD). As ABD targets near-rigid objects, the constitutive variations of different materials become negligible, which justifies a co-rotational approach to isolate geometric nonlinearities of the system. This insight enables the use of constant system matrices that can be pre-factorized throughout the simulation, even with fully implicit integration schemes. To manage the high DOF counts of large-scale systems, we map primal body coordinates onto a compact dual space defined by minimal joint degrees of freedom. By solving the resulting KKT systems, our method ensures exact constraint enforcement and physically accurate motion propagation. We provide a suite of specialized solvers tailored for diverse joint topologies, including chains, trees, closed loops, and irregular networks. Experimental results show that our approach achieves interactive rates for systems with hundreds of thousands of bodies on a single CPU core, while maintaining excellent stability at large time steps.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-19
Open AccessM-ABD: Scalable, Efficient, and Robust Multi-Affine-Body Dynamics
Simulating large-scale articulated assemblies poses a significant challenge due to the numerical stiffness and geometric complexity of jointed structures. Conventional rigid body solvers struggle with the high nonlinearity induced by rotation parameterization. This difficulty becomes more pronounced for multiple two-way-coupled bodies. This paper introduces a novel framework that leverages the linear kinematic mapping of Affine Body Dynamics (ABD). As ABD targets near-rigid objects, the constitutive variations of different materials become negligible, which justifies a co-rotational approach to isolate geometric nonlinearities of the system. This insight enables the use of constant system matrices that can be pre-factorized throughout the simulation, even with fully implicit integration schemes. To manage the high DOF counts of large-scale systems, we map primal body coordinates onto a compact dual space defined by minimal joint degrees of freedom. By solving the resulting KKT systems, our method ensures exact constraint enforcement and physically accurate motion propagation. We provide a suite of specialized solvers tailored for diverse joint topologies, including chains, trees, closed loops, and irregular networks. Experimental results show that our approach achieves interactive rates for systems with hundreds of thousands of bodies on a single CPU core, while maintaining excellent stability at large time steps.
- Open Access
Low-Rank Koopman Deformables with Log-Linear Time Integration
We present a low-rank Koopman operator formulation for accelerating deformable subspace simulation. Using a Dynamic Mode Decomposition (DMD) parameterization of the Koopman operator, our method learns the temporal evolution of deformable dynamics and predicts future states through efficient matrix evaluations instead of sequential time integration. This yields log-linear scaling in the number of time steps and allows large portions of the trajectory to be skipped while retaining accuracy. The resulting temporal efficiency is especially advantageous for optimization tasks such as control and initial-state estimation, where the objective often depends largely on the final configuration. To broaden the scope of Koopman-based reduced-order models in graphics, we introduce a discretization-agnostic extension that learns shared dynamic behavior across multiple shapes and mesh resolutions. Prior DMD-based approaches have been restricted to a single shape and discretization, which limits their usefulness for tasks involving geometry variation. Our formulation generalizes across both shape and discretization, which enables fast shape optimization that was previously impractical for DMD models. This expanded capability highlights the potential of Koopman operator learning as a practical tool for efficient deformable simulation and design.
Open AccessLow-Rank Koopman Deformables with Log-Linear Time Integration
We present a low-rank Koopman operator formulation for accelerating deformable subspace simulation. Using a Dynamic Mode Decomposition (DMD) parameterization of the Koopman operator, our method learns the temporal evolution of deformable dynamics and predicts future states through efficient matrix evaluations instead of sequential time integration. This yields log-linear scaling in the number of time steps and allows large portions of the trajectory to be skipped while retaining accuracy. The resulting temporal efficiency is especially advantageous for optimization tasks such as control and initial-state estimation, where the objective often depends largely on the final configuration. To broaden the scope of Koopman-based reduced-order models in graphics, we introduce a discretization-agnostic extension that learns shared dynamic behavior across multiple shapes and mesh resolutions. Prior DMD-based approaches have been restricted to a single shape and discretization, which limits their usefulness for tasks involving geometry variation. Our formulation generalizes across both shape and discretization, which enables fast shape optimization that was previously impractical for DMD models. This expanded capability highlights the potential of Koopman operator learning as a practical tool for efficient deformable simulation and design.