Searcharxiv⌕ Search

arXiv subjects

Nicole Tianjiao Yang

Publications and source records attributed to Nicole Tianjiao Yang.

9 recordsLinked to original sources

Pathwise Learning of Stochastic Dynamical Systems with Partial Observations

The reconstruction and inference of stochastic dynamical systems from data is a fundamental task in inverse problems and statistical learning. While surrogate modeling advances computational methods to approximate these dynamics, standard approaches typically require high-fidelity training data. In many practical settings, however, the data are indirectly observed through noisy and nonlinear measurements. The challenge lies not only in approximating the coefficients of the SDEs, but in simultaneously inferring the posterior updates given the observations. In this work, we present an amortized path generation method to address these challenges and solve nonlinear stochastic filtering from noisy observations. We first derive a variational inference formulation that solves filtering distribution for a given noisy observation path. This leads to a controlled SDE representation in which the feedback control is identified through the score structure of a pathwise Zakai equation. Motivated by this representation, we construct a conditional generative model that learns, in an amortized manner over observation paths, to transport a prior latent path measure toward the corresponding posterior path measure. We demonstrate the method on nonlinear stochastic systems with multimodal posterior structure, chaotic dynamics, and sparse observations, showing that the learned conditional path generator enables uncertainty quantification for both filtering marginals and trajectory-dependent functionals.

math.OC↗

On the Convergence of Jacobian-Free Backpropagation for Optimal Control Problems with Implicit Hamiltonians

Optimal feedback control with implicit Hamiltonians poses a fundamental challenge for learning-based value function methods due to the absence of closed-form optimal control laws. Recent work~\cite{gelphman2025end} introduced an implicit deep learning approach using Jacobian-Free Backpropagation (JFB) to address this setting, but only established sample-wise descent guarantees. In this paper, we establish convergence guarantees for JFB in the stochastic minibatch setting, showing that the resulting updates converge to stationary points of the expected optimal control objective. We further demonstrate scalability on substantially higher-dimensional problems, including multi-agent optimal consumption and swarm-based quadrotor and bicycle control. Together, our results provide both theoretical justification and empirical evidence for using JFB in high-dimensional optimal control with implicit Hamiltonians.

math.OC↗

Relative Arbitrage Opportunities with Interactions among $N$ Investors

The relative arbitrage portfolio outperforms a benchmark portfolio over a given time-horizon with probability one. With market price of risk processes depending on the market portfolio and investors, this paper analyzes the multi-agent optimization of relative arbitrage opportunities in the coupled system of market and wealth dynamics. We construct a well-posed market dynamical system of McKean-Vlasov type under an empirical measure of investors, where each investor seeks for relative arbitrage with respect to a benchmark dependent on market and all the agents. We show the conditions to guaranty relative arbitrage opportunities among competitive investors through the Fichera drift. Under mild conditions, we derive the optimal strategies for investors and the unique Nash equilibrium that depends on the smallest nonnegative solution of a Cauchy problem.

q-fin.MF↗

Relative Arbitrage Opportunities in an Extended Mean Field System

This paper studies relative arbitrage opportunities in a market with competitive investors through stochastic differential games in the limit as the number of players tends to infinity. With common noises introduced by the stock capitalization processes, we establish a conditional McKean-Vlasov system to study the market dynamics coupled to the expected trading volume of investors. We show that optimal arbitrage can be characterized as a solution of a Cauchy PDE constructed by the volatility terms in the market model. The structure of the market dynamics can be relaxed, and we provide a theoretical framework to study a general mean-field system, where the interaction is characterized by a joint distribution of wealth and strategies. In this setting, the optimal relative arbitrage constitutes the strong equilibrium of an extended mean-field game. We provide conditions for the existence and uniqueness of the mean-field equilibrium. We further prove the propagation of chaos result for the finite-player game counterpart, and demonstrate that the Nash equilibrium converges to the mean field equilibrium when the population grows to infinity.

q-fin.MF↗

End-to-End Training of High-Dimensional Optimal Control with Implicit Hamiltonians via Jacobian-Free Backpropagation

Neural network approaches that parameterize value functions have succeeded in approximating high-dimensional optimal feedback controllers when the Hamiltonian admits explicit formulas. However, many practical problems, such as the space shuttle reentry problem and bicycle dynamics, among others, may involve implicit Hamiltonians that do not admit explicit formulas, limiting the applicability of existing methods. Rather than directly parameterizing controls, which does not leverage the Hamiltonian's underlying structure, we propose an end-to-end implicit deep learning approach that directly parameterizes the value function to learn optimal control laws. Our method enforces physical principles by ensuring trained networks adhere to the control laws by exploiting the fundamental relationship between the optimal control and the value function's gradient; this is a direct consequence of the connection between Pontryagin's Maximum Principle and dynamic programming. Using Jacobian-Free Backpropagation (JFB), we achieve efficient training despite temporal coupling in trajectory optimization. We show that JFB produces descent directions for the optimal control objective and experimentally demonstrate that our approach effectively learns high-dimensional feedback controllers across multiple scenarios involving implicit Hamiltonians, which existing methods cannot address.

math.OC↗

Finding the nonnegative minimal solutions of Cauchy PDEs in a volatility-stabilized market

The strong relative arbitrage problem in Stochastic Portfolio Theory seeks an investment strategy that almost surely outperforms a benchmark portfolio at the end of a given time horizon. The highest relative return in relative arbitrage opportunities is characterized by the smallest nonnegative continuous solution of a Cauchy problem for a partial differential equation (PDE). However, solving this type of PDE poses analytical and numerical challenges, due to the high dimensionality and its non-unique solutions. In this paper, we discuss numerical methods to address the relative arbitrage problem and the associated PDE in a volatility-stabilized market, using time-changed Bessel bridges. We present a practical algorithm and demonstrate numerical results through an example in volatility-stabilized markets.

q-fin.CP↗

Multilevel Diffusion: Infinite Dimensional Score-Based Diffusion Models for Image Generation

Score-based diffusion models (SBDM) have recently emerged as state-of-the-art approaches for image generation. Existing SBDMs are typically formulated in a finite-dimensional setting, where images are considered as tensors of finite size. This paper develops SBDMs in the infinite-dimensional setting, that is, we model the training data as functions supported on a rectangular domain. In addition to the quest for generating images at ever-higher resolutions, our primary motivation is to create a well-posed infinite-dimensional learning problem that we can discretize consistently on multiple resolution levels. We thereby intend to obtain diffusion models that generalize across different resolution levels and improve the efficiency of the training process. We demonstrate how to overcome two shortcomings of current SBDM approaches in the infinite-dimensional setting. First, we modify the forward process using trace class operators to ensure that the latent distribution is well-defined in the infinite-dimensional setting and derive the reverse processes for finite-dimensional approximations. Second, we illustrate that approximating the score function with an operator network is beneficial for multilevel training. After deriving the convergence of the discretization and the approximation of multilevel training, we demonstrate some practical benefits of our infinite-dimensional SBDM approach on a synthetic Gaussian mixture example, the MNIST dataset, and a dataset generated from a nonlinear 2D reaction-diffusion equation.

cs.LG↗

Reflected Schrödinger Bridge for Constrained Generative Modeling

Diffusion models have become the go-to method for large-scale generative models in real-world applications. These applications often involve data distributions confined within bounded domains, typically requiring ad-hoc thresholding techniques for boundary enforcement. Reflected diffusion models (Lou23) aim to enhance generalizability by generating the data distribution through a backward process governed by reflected Brownian motion. However, reflected diffusion models may not easily adapt to diverse domains without the derivation of proper diffeomorphic mappings and do not guarantee optimal transport properties. To overcome these limitations, we introduce the Reflected Schrodinger Bridge algorithm: an entropy-regularized optimal transport approach tailored for generating data within diverse bounded domains. We derive elegant reflected forward-backward stochastic differential equations with Neumann and Robin boundary conditions, extend divergence-based likelihood training to bounded domains, and explore natural connections to entropic optimal transport for the study of approximate linear convergence - a valuable insight for practical training. Our algorithm yields robust generative modeling in diverse domains, and its scalability is demonstrated in real-world constrained generative modeling through standard image benchmarks.

stat.ML↗

Provably Convergent Schrödinger Bridge with Applications to Probabilistic Time Series Imputation

The Schrödinger bridge problem (SBP) is gaining increasing attention in generative modeling and showing promising potential even in comparison with the score-based generative models (SGMs). SBP can be interpreted as an entropy-regularized optimal transport problem, which conducts projections onto every other marginal alternatingly. However, in practice, only approximated projections are accessible and their convergence is not well understood. To fill this gap, we present a first convergence analysis of the Schrödinger bridge algorithm based on approximated projections. As for its practical applications, we apply SBP to probabilistic time series imputation by generating missing values conditioned on observed data. We show that optimizing the transport cost improves the performance and the proposed algorithm achieves the state-of-the-art result in healthcare and environmental data while exhibiting the advantage of exploring both temporal and feature patterns in probabilistic time series imputation.

cs.LG↗