log in  |  register  |  feedback?  |  help  |  web accessibility
PhD Defense: Differentiable Systems for Efficient Optimization: From Kinematics to Geometry
Sanghyun Son
IRB-5105 or https://umd.zoom.us/j/6901467837?pwd=TOrh2XuywSgyNUnCm8BgX2Ax7UseJB.1&omn=97763577942&jst=2
Friday, November 21, 2025, 11:00 am-1:00 pm
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

Modern scientific and engineering challenges rooted in physics often require searching immense solution spaces. Sampling these high-dimensional spaces can be computationally prohibitive. I observe that many underlying dynamical processes are nearly everywhere differentiable: physical states evolve smoothly in time, and even brief discontinuities preserve overall continuity. When a system’s next state and its gradient with respect to the current state are available, those gradients act as beacons that steer optimization far more efficiently than gradient‑free exploration. Consequently, researchers are investing heavily in differentiable models of real‑world phenomena, especially within physical sciences and engineering, where the laws of motion and interaction naturally provide the required smoothness.

Building on this pervasive continuity in natural and engineered systems, this thesis demonstrates how exploiting differentiability can systematically accelerate problem-solving in both decision making and geometric reconstruction. I first develop gradient-aware reinforcement learning methods that use system-level derivatives to guide exploration: one that augments Proximal Policy Optimization (PPO) with analytic gradients to constrain policy updates and speed convergence, and another that trains a continuous-time world model by randomly sampling time steps, greatly improving sample efficiency. These algorithmic advances motivate two differentiable systems at the core of the thesis: (1) a GPU-accelerated traffic simulator with exact vehicle-kinematic Jacobians, enabling rapid optimization of autonomous-vehicle policies and traffic-signal timing; and (2) a family of differentiable mesh formulations that make traditionally discrete triangle and tetrahedral meshes amenable to gradient-based optimization, including a probabilistic triangular-mesh representation that relaxes edge existence into continuous variables and a differentiable tetrahedral-mesh extraction pipeline for 3D object/mesh reconstruction. By weaving these case studies together, this thesis charts a unified path for integrating physics and geometry into a common, scalable, gradient-based optimization framework.

Bio

Sanghyun Son is a Ph.D. student in the Department of Computer Science at the University of Maryland, College Park, advised by Ming Lin in the GAMMA Lab. His primary research interests lie at the intersection of physics, geometry, and reinforcement learning. Specifically, he focuses on developing differentiable physics‑and‑geometry frameworks to tackle physics‑related optimization problems. Sanghyun received his B.S. and M.S. from Seoul National University in Korea.

This talk is organized by Migo Gui