Searcharxiv⌕ Search

arXiv subjects

Hee Jun Yang

Publications and source records attributed to Hee Jun Yang.

4 recordsLinked to original sources

Continuous-Time Wasserstein Distributionally Robust Control: Limits, Duality, and Stability

A sampled robust control problem averages future values over disturbance laws, while its continuous-time counterpart evolves with an averaged drift. We establish a fluid limit connecting these two models for Wasserstein ambiguity sets. Under a uniform disturbance moment bound and subcritical growth, sampled Bellman values converge locally uniformly to the upper and lower values of a discounted differential game. The argument accommodates unbounded disturbances without requiring square-integrable increments. We also derive an explicit bound on the change in either game value when both the radius and center of the ambiguity set vary. For Euclidean disturbance space, uniform Lipschitz continuity in the disturbance, common state and cost Lipschitz bounds, and a discount rate exceeding the drift's state Lipschitz constant, this estimate converts distributional confidence bounds into uniform value approximation bounds. Static Wasserstein duality reformulates pointwise distributional optimization; affine disturbance dependence permits an exact reduction to a ball of means. Experiments illustrate the common limit and decreasing value error with sample size. For a nonlinear disturbance model, uniform shifts overestimate worst-case recovery speed by about 36\%. In a two-product inventory model, increasing ambiguity raises production near balance while reducing the region of full production in deeper backlogs.

math.OC↗

Solving nonconvex Hamilton--Jacobi--Isaacs equations with PINN-based policy iteration

We propose a mesh-free policy iteration framework that combines classical dynamic programming with physics-informed neural networks (PINNs) to solve high-dimensional, nonconvex Hamilton--Jacobi--Isaacs (HJI) equations arising in stochastic differential games and robust control. The method alternates between solving linear second-order PDEs under fixed feedback policies and updating the controls via pointwise minimax optimization using automatic differentiation. Under standard Lipschitz and uniform ellipticity assumptions, we prove that the value function iterates converge locally uniformly to the unique viscosity solution of the HJI equation. The analysis establishes equi-Lipschitz regularity of the iterates, enabling provable stability and convergence without requiring convexity of the Hamiltonian. Numerical experiments demonstrate the accuracy and scalability of the method. In a two-dimensional stochastic path-planning game with a moving obstacle, our method matches finite-difference benchmarks with relative $L^2$-errors below %10^{-2}%. In five- and ten-dimensional publisher-subscriber differential games with anisotropic noise, the proposed approach consistently outperforms direct PINN solvers, yielding smoother value functions and lower residuals. Our results suggest that integrating PINNs with policy iteration is a practical and theoretically grounded method for solving high-dimensional, nonconvex HJI equations, with potential applications in robotics, finance, and multi-agent reinforcement learning.

math.NA↗

Numerical study on hyper parameter settings for neural network approximation to partial differential equations

Approximate solutions of partial differential equations (PDEs) obtained by neural networks are highly affected by hyper parameter settings. For instance, the model training strongly depends on loss function design, including the choice of weight factors for different terms in the loss function, and the sampling set related to numerical integration; other hyper parameters, like the network architecture and the optimizer settings, also impact the model performance. On the other hand, suitable hyper parameter settings are known to be different for different model problems and currently no universal rule for the choice of hyper parameters is known. In this paper, for second order elliptic model problems, various hyper parameter settings are tested numerically to provide a practical guide for efficient and accurate neural network approximation. While a full study of all possible hyper parameter settings is not possible, we focus on studying the formulation of the PDE loss as well as the incorporation of the boundary conditions, the choice of collocation points associated with numerical integration schemes, and various approaches for dealing with loss imbalances will be extensively studied on various model problems; in addition to various Poisson model problems, also a nonlinear and an eigenvalue problem are considered.

math.NA↗

Iterative algorithms for partitioned neural network approximation to partial differential equations

To enhance solution accuracy and training efficiency in neural network approximation to partial differential equations, partitioned neural networks can be used as a solution surrogate instead of a single large and deep neural network defined on the whole problem domain. In such a partitioned neural network approach, suitable interface conditions or subdomain boundary conditions are combined to obtain a convergent approximate solution. However, there has been no rigorous study on the convergence and parallel computing enhancement on the partitioned neural network approach. In this paper, iterative algorithms are proposed to address these issues. Our algorithms are based on classical additive Schwarz domain decomposition methods. Numerical results are included to show the performance of the proposed iterative algorithms.

math.NA↗