arXiv subjects

Jinniao Qiu

Publications and source records attributed to Jinniao Qiu.

At least 19 recordsLinked to original sources

arXiv2026

Optimal Resource Extraction under Distribution Learning and Infinite-Horizon Stochastic Hamilton--Jacobi Equations

We study an infinite-horizon stochastic control problem for the optimal exploitation of an exhaustible resource with unknown total reserves. Information is generated both endogenously through continued extraction without depletion and exogenously through an external information flow. This interaction makes the natural problem non-Markovian and time-inconsistent. We show that it nevertheless admits an equivalent time-consistent formulation with the same optimal controls. The associated value function is characterized as the unique viscosity solution of a stochastic Hamilton--Jacobi equation with random coefficients. We prove comparison on the infinite horizon through a Snell-envelope-based strict-contact argument and establish uniqueness by an independent Brownian regularization and a BSDE correction, avoiding piecewise Markovian approximations. Finally, we identify the deterministic benchmark and show that, under persistent reserve uncertainty, the rescaled stochastic value function converges to a pathwise deterministic control problem, with the long-run optimal extraction rate determined by the asymptotic hazard rate of the limiting reserve distribution.

math.OC↗

arXiv2026

SCMO: Stochastic Control for Optimization over Probability Measures on Infinite-Dimensional Spaces

We study objective-only optimization of possibly nonconvex and nonsmooth functionals over probability measures on a separable Hilbert space, allowing the optimizer to be intrinsically non-Dirac. We introduce SCMO (Stochastic Control Measure Optimizer), a gradient-free particle method derived from entropy regularized stochastic control. After finite-particle and Galerkin approximations, a Cole--Hopf transform represents the optimal feedback as a Gibbs-weighted terminal displacement. SCMO approximates this feedback by sampling context clouds, replacing one particle at a time with candidate draws, scoring the resulting empirical measures, and applying exponential reweighting. SCMO uses separate covariances for candidate proposals and particle updates, termed matched when equal and nonmatched otherwise; our analysis covers both settings. In the matched case, we establish PDE-free qualitative convergence and a projection-first quantitative bound separating particle, Galerkin-projection, and entropy-regularization errors. For the practical multi-context implementation with nonmatched covariance, we prove finite-candidate consistency and show that the signed, curvature-dependent effect of nonmatched covariance can reduce the resulting upper bound on the approximation error. Finally, experiments on function-space, trajectory-law, and contact-rich manipulation problems show that SCMO handles nonsmooth and nonconvex objectives, escapes suboptimal local basins, and recovers prescribed multimodal, non-Dirac law structure. Code for reproducing our experimental results is available at https://github.com/HenryCHEUNG7373/SCMO.

math.OC↗

arXiv2026

A Policy Iteration Scheme for Semilinear Stochastic Hamilton-Jacobi-Bellman Equations with Exponential Convergence

This paper is concerned with the non-Markovian stochastic optimal control problems in which the value function is a random field characterized by a stochastic Hamilton-Jacobi-Bellman (SHJB) equation. When the stochastic integration coefficients are not controlled, the SHJB equation takes a semilinear form, which is subject to computational challenges compared to the Markovian case due to the measurable randomness. We introduce a policy-iteration algorithm based on successive linearization that reduces the nonlinear SHJB equation to a sequence of linear ones. Furthermore, we prove that the resulting approximation sequence converges monotonically to the value function in the mean-square sense with an exponential rate.

math.OC↗

arXiv2026

Stochastic Control Methods for Optimization

In this work, we investigate a stochastic control framework for global optimization over both Euclidean spaces and the Wasserstein space of probability measures, where the objective function may be non-convex and/or non-differentiable. In the Euclidean setting, the original minimization problem is approximated by a family of regularized stochastic control problems; using dynamic programming, we analyze the associated Hamilton-Jacobi-Bellman equations and obtain tractable representations via the Cole-Hopf transformation and the Feynman-Kac formula. For optimization over probability measures, we formulate a regularized mean-field control problem characterized by a master equation, and further approximate it by controlled $N$-particle systems. We establish that, as the regularization parameter tends to zero (and as the particle number tends to infinity for the optimization over probability measures), the value of the control problem converges to the global minimum of the original objective. Building on the resulting probabilistic representations, we propose the Monte Carlo-based numerical schemes that are derivative-free due to the utilization of the Bismut-Elworthy-Li formula and numerical experiments are reported to illustrate the effectiveness of the methods and to support the theoretical convergence rates.

math.OC↗

arXiv2025

A Deep Learning-Based Method for Fully Coupled Non-Markovian FBSDEs with Applications

In this work, we extend deep learning-based numerical methods to fully coupled forward-backward stochastic differential equations (FBSDEs) within a non-Markovian framework. Error estimates and convergence are provided. In contrast to the existing literature, our approach not only analyzes the non-Markovian framework but also addresses fully coupled settings, in which both the drift and diffusion coefficients of the forward process may be random and depend on the backward components $Y$ and $Z$. Furthermore, we illustrate the practical applicability of our framework by addressing utility maximization problems under rough volatility, which are solved numerically with the proposed deep learning-based methods.

q-fin.MF↗

arXiv2025

Swarming models with specular boundary condition and environmental noise

We investigate a general class of models for swarming/self-collective behaviour in domains with boundaries. The model is expressed as a stochastic system of interacting particles subject to both reflecting boundary condition and common environmental noise. We rigorously derive its corresponding macroscopic mean-field equation, which is a new type of stochastic partial differential equation due to the presence of common noise. The approach relies on a compactness argument, in which we first establish the tightness of the empirical measures associated with the particle system and then demonstrate that the time marginal of the limit measure is a solution to the mean-field equation.

math.PR↗

arXiv2025

Stochastic Path-Dependent Volatility Models for Price-Storage Dynamics in Natural Gas Markets and Discrete-Time Swing Option Pricing

This paper is devoted to the price-storage dynamics in natural gas markets. A novel stochastic path-dependent volatility model is introduced with path-dependence in both price volatility and storage increments. Model calibrations are conducted for both the price and storage dynamics. Further, we discuss the pricing problem of discrete-time swing options using the dynamic programming principle, and a deep learning-based method is proposed for numerical approximations. A numerical algorithm is provided, followed by a convergence analysis result for the deep-learning approach.

q-fin.MF↗

arXiv2025

Feynman-Kac Formula for Time-Dependent Nonlinear Schrödinger Equations with Applications in Numerical Approximations

In this paper, we present a novel Feynman-Kac formula and investigate learning-based methods for approximating general nonlinear time-dependent Schrödinger equations which may be high-dimensional. Our formulation integrates both the Fisk-Stratonovich and Itô integrals within the framework of backward stochastic differential equations (BSDEs). Utilizing this Feynman-Kac representation, we propose learning-based approaches for numerical approximations. To demonstrate the accuracy and effectiveness of the proposed method, we conduct numerical experiments in both low- and high-dimensional settings, complemented by a convergence analysis. These results address the open problem concerning deep-BSDE methods for numerical approximations of high-dimensional time-dependent nonlinear Schrödinger equations (cf. [Proc. Natl. Acad. Sci. 15 (2018), pp. 8505-8510] and [Frontiers Sci. Awards Math. (2024), pp. 1-14] by Han, Jentzen, and E).

math.AP↗

arXiv2025

Viscosity Solutions of Fully second-order HJB Equations in the Wasserstein Space

In this paper, we show that the value functions of mean field control problems with common noise are the unique viscosity solutions to fully second-order Hamilton-Jacobi-Bellman equations, in a Crandall-Lions-like framework. We allow the second-order derivative in measure to be state-dependent and thus infinite-dimensional, rather than derived from a finite-dimensional operator, hence the term ''fully''. Our argument leverages the construction of smooth approximations from particle systems developed by Cosso, Gozzi, Kharroubi, Pham, and Rosestolato [Trans. Amer. Math. Soc., 2023], and the compactness argument via penalization of measure moments in Soner and Yan [Appl. Math. Optim., 2024]. Our work addresses unbounded dynamics and state-dependent common noise volatility, and to our knowledge, this is the first result of its kind in the literature.

math.OC↗

arXiv2024

Viscosity Solutions of a class of Second Order Hamilton-Jacobi-Bellman Equations in the Wasserstein Space

This paper is devoted to solving a class of second order Hamilton-Jacobi-Bellman (HJB) equations in the Wasserstein space, associated with mean field control problems involving common noise. The well-posedness of viscosity solutions to the HJB equation under a new notion is established under general assumptions on the coefficients. Our approach adopts the smooth metric developed by Bayraktar, Ekren, and Zhang [Proc. Amer. Math. Soc. (2023)] as our gauge function for the purpose of smooth variational principle used in the proof of comparison theorem. Further estimates and regularity of the metric, including a novel second order derivative estimate with respect to the measure variable, are derived in order to ensure the uniqueness and existence.

math.OC↗

arXiv2024

A consensus-based algorithm for non-convex multiplayer games

In this paper, we present a novel consensus-based zeroth-order algorithm tailored for non-convex multiplayer games. The proposed method leverages a metaheuristic approach using concepts from swarm intelligence to reliably identify global Nash equilibria. We utilize a group of interacting particles, each agreeing on a specific consensus point, asymptotically converging to the corresponding optimal strategy. This paradigm permits a passage to the mean-field limit, allowing us to establish convergence guarantees under appropriate assumptions regarding initialization and objective functions. Finally, we conduct a series of numerical experiments to unveil the dependency of the proposed method on its parameters and apply it to solve a nonlinear Cournot oligopoly game involving multiple goods.

math.DS↗

arXiv2024

A particle consensus approach to solving nonconvex-nonconcave min-max problems

We propose a zero-order optimization method for sequential min-max problems based on two populations of interacting particles. The systems are coupled so that one population aims to solve the inner maximization problem, while the other aims to solve the outer minimization problem. The dynamics are characterized by a consensus-type interaction with additional stochasticity to promote exploration of the objective landscape. Without relying on convexity or concavity assumptions, we establish theoretical convergence guarantees of the algorithm via a suitable mean-field approximation of the particle systems. Numerical experiments illustrate the validity of the proposed approach. In particular, the algorithm is able to identify a global min-max solution, in contrast to gradient-based methods, which typically converge to possibly suboptimal stationary points.

math.OC↗

arXiv2023

A Viscosity Solution Theory of Stochastic Hamilton-Jacobi-Bellman equations in the Wasserstein Space

This paper is devoted to a viscosity solution theory of the stochastic Hamilton-Jacobi-Bellman equation in the Wasserstein spaces for the mean-field type control problem which allows for random coefficients and may thus be non-Markovian. The value function of the control problem is proven to be the unique viscosity solution. The major challenge lies in the mixture of the lack of local compactness of the Wasserstein spaces and the non-Markovian setting with random coefficients and various techniques are used, including Ito processes parameterized by random measures, the conditional law invariance of the value function, a novel tailor-made compact subset of measure-valued processes, finite dimensional approximations via stochastic n-player differential games with common noises, and so on.

math.OC↗

arXiv2023

Consensus-Based Optimization for Saddle Point Problems

In this paper, we propose consensus-based optimization for saddle point problems (CBO-SP), a novel multi-particle metaheuristic derivative-free optimization method capable of provably finding global Nash equilibria. Following the idea of swarm intelligence, the method employs a group of interacting particles, which perform a minimization over one variable and a maximization over the other. This paradigm permits a passage to the mean-field limit, which makes the method amenable to theoretical analysis and allows to obtain rigorous convergence guarantees under reasonable assumptions about the initialization and the objective function, which most notably include nonconvex-nonconcave objectives.

math.OC↗

arXiv2023

Optimal control of infinite-dimensional differential systems with randomness and path-dependence and stochastic path-dependent Hamilton-Jacobi equations

This paper is devoted to the stochastic optimal control problem of infinite-dimensional differential systems allowing for both path-dependence and measurable randomness. As opposed to the deterministic path-dependent cases studied by Bayraktar and Keller [J. Funct. Anal. 275 (2018), 2096--2161], the value function turns out to be a random field on the path space and it is characterized by a stochastic path-dependent Hamilton-Jacobi (SPHJ) equation. A notion of viscosity solution is proposed and the value function is proved to be the unique viscosity solution to the associated SPHJ equation.

math.OC↗

arXiv2022

On the Global Convergence of Particle Swarm Optimization Methods

In this paper we provide a rigorous convergence analysis for the renowned particle swarm optimization method by using tools from stochastic calculus and the analysis of partial differential equations. Based on a time-continuous formulation of the particle dynamics as a system of stochastic differential equations, we establish convergence to a global minimizer of a possibly nonconvex and nonsmooth objective function in two steps. First, we prove consensus formation of an associated mean-field dynamics by analyzing the time-evolution of the variance of the particle distribution. We then show that this consensus is close to a global minimizer by employing the asymptotic Laplace principle and a tractability condition on the energy landscape of the objective function. These results allow for the usage of memory mechanisms, and hold for a rich class of objectives provided certain conditions of well-preparation of the hyperparameters and the initial datum. In a second step, at least for the case without memory effects, we provide a quantitative result about the mean-field approximation of particle swarm optimization, which specifies the convergence of the interacting particle system to the associated mean-field limit. Combining these two results allows for global convergence guarantees of the numerical particle swarm optimization method with provable polynomial complexity. To demonstrate the applicability of the method we propose an efficient and parallelizable implementation, which is tested in particular on a competitive and well-understood high-dimensional benchmark problem in machine learning.

math.NA↗

arXiv2022

Zero-Inertia Limit: from Particle Swarm Optimization to Consensus Based Optimization

Recently a continuous description of the particle swarm optimization (PSO) based on a system of stochastic differential equations was proposed by Grassi and Pareschi in arXiv:2012.05613 where the authors formally showed the link between PSO and the consensus based optimization (CBO) through zero-inertia limit. This paper is devoted to solving this theoretical open problem proposed in arXiv:2012.05613 by providing a rigorous derivation of CBO from PSO through the limit of zero inertia, and a quantified convergence rate is obtained as well. The proofs are based on a probabilistic approach by investigating the weak convergence of the corresponding stochastic differential equations (SDEs) of Mckean type in the continuous path space and the results are illustrated with some numerical examples.

math.DS↗

arXiv2021

Controlled Ordinary Differential Equations with Random Path-Dependent Coefficients and Stochastic Path-Dependent Hamilton-Jacobi Equations

This paper is devoted to the stochastic optimal control problem of ordinary differential equations allowing for both path-dependence and measurable randomness. As opposed to the deterministic path-dependent cases, the value function turns out to be a random field on the path spaces and it is characterized by a stochastic path-dependent Hamilton-Jacobi (SPHJ) equation. A notion of viscosity solution is proposed and the value function is proved to be the unique viscosity solution to the associated SPHJ equation.

math.OC↗