arXiv subjects

Chi Seng Pun

Publications and source records attributed to Chi Seng Pun.

12 recordsLinked to original sources

arXiv2026

End-to-End PDE-Based Quantum Algorithms for Multi-Asset Option Pricing under Local and Stochastic Volatility

Multi-asset option pricing under local- and stochastic-volatility models leads naturally to high-dimensional parabolic PDEs. We develop an end-to-end quantum PDE framework for European option pricing under local-volatility Black--Scholes and Heston models. The framework takes classical contract and model data as input and returns classical estimates of selected option values. We solve the pricing PDEs after finite-difference discretization on spatial grids. For $N=2^n$ grid points per spatial direction and $d$ assets, the end-to-end gate complexity for single-point recovery, counted in elementary CNOT gates and one-qubit Pauli-axis rotations, has leading grid-size dependence $\widetilde{O}(d^2 N^{2+d/2})$ for local-volatility Black--Scholes and $\widetilde{O}(d^2 N^{d+2})$ for Heston. Relative to grid-based finite-difference baselines, these scalings correspond to polynomial improvement factors $N^{d/2}$ and $N^d$, respectively. These estimates translate to Clifford+T resources via standard compilation. We complement the complexity analysis with numerical benchmarks against standard classical methods. In the Heston setting, the framework recovers option prices across strikes together with the associated implied-volatility smile/skew. Overall, this work provides a complete end-to-end quantum pricing pipeline with explicit resource accounting and theoretical performance guarantees.

quant-ph↗

arXiv2026

On the Well-posedness of Hamilton-Jacobi-Bellman Equations of the Equilibrium Type

This paper studies the well-posedness of a class of nonlocal parabolic partial differential equations (PDEs), or equivalently equilibrium Hamilton-Jacobi-Bellman equations, which has a strong tie with the characterization of the equilibrium strategies and the associated value functions for time-inconsistent stochastic control problems. Specifically, we consider nonlocality in both time and space, which allows for modelling of the stochastic control problems with initial-time-and-state dependent objective functionals. We leverage the method of continuity to show the global well-posedness within our proposed Banach space with our established Schauder prior estimate for the linearized nonlocal PDE. Then, we adopt a linearization method and Banach's fixed point arguments to show the local well-posedness of the nonlocal fully nonlinear case, while the global well-posedness is attainable provided that a very sharp a-priori estimate is available. On top of the well-posedness results, we also provide a probabilistic representation of the solutions to the nonlocal fully nonlinear PDEs and an estimate on the difference between the value functions of sophisticated and naïve controllers. Finally, we give a financial example of time inconsistency that is proven to be globally solvable.

math.AP↗

arXiv2025

Robust Time-inconsistent Linear-Quadratic Stochastic Controls: A Stochastic Differential Game Approach

This paper studies robust time-inconsistent (TIC) linear-quadratic stochastic control problems, formulated by stochastic differential games. By a spike variation approach, we derive sufficient conditions for achieving the Nash equilibrium, which corresponds to a time-consistent (TC) robust policy, under mild technical assumptions. To illustrate our framework, we consider two scenarios of robust mean-variance analysis, namely with state- and control-dependent ambiguity aversion. We find numerically that with time inconsistency haunting the dynamic optimal controls, the ambiguity aversion enhances the effective risk aversion faster than the linear, implying that the ambiguity in the TIC cases is more impactful than that under the TC counterparts, e.g., expected utility maximization problems.

math.OC↗

arXiv2025

Quantum Algorithms for the Pathwise Lasso

We present a novel quantum high-dimensional linear regression algorithm with an $\ell_1$-penalty based on the classical LARS (Least Angle Regression) pathwise algorithm. Similarly to available classical algorithms for Lasso, our quantum algorithm provides the full regularisation path as the penalty term varies, but quadratically faster per iteration under specific conditions. A quadratic speedup on the number of features $d$ is possible by using the simple quantum minimum-finding subroutine from Dürr and Hoyer (arXiv'96) in order to obtain the joining time at each iteration. We then improve upon this simple quantum algorithm and obtain a quadratic speedup both in the number of features $d$ and the number of observations $n$ by using the approximate quantum minimum-finding subroutine from Chen and de Wolf (ICALP'23). In order to do so, we approximately compute the joining times to be searched over by the approximate quantum minimum-finding subroutine. As another main contribution, we prove, via an approximate version of the KKT conditions and a duality gap, that the LARS algorithm (and therefore our quantum algorithm) is robust to errors. This means that it still outputs a path that minimises the Lasso cost function up to a small error if the joining times are only approximately computed. Furthermore, we show that, when the observations are sampled from a Gaussian distribution, our quantum algorithm's complexity only depends polylogarithmically on $n$, exponentially better than the classical LARS algorithm, while keeping the quadratic improvement on $d$. Moreover, we propose a dequantised version of our quantum algorithm that also retains the polylogarithmic dependence on $n$, albeit presenting the linear scaling on $d$ from the standard LARS algorithm. Finally, we prove query lower bounds for classical and quantum Lasso algorithms.

quant-ph↗

arXiv2025

A Malliavin Calculus Approach to Backward Stochastic Volterra Integral Equations

In this paper, we establish existence, uniqueness, and regularity properties of the solutions to multi-dimensional backward stochastic Volterra integral equations (BSVIEs), whose (possibly random) generator reflects nonlinear dependence on both the solution process and the martingale integrand component of the adapted solutions, as well as their diagonal processes. The well-posedness results are developed with the use of Malliavin calculus, which renders a novel perspective in tackling with the challenging diagonal processes while contrasts with the existing methods. We also provide a probabilistic interpretation of the classical solutions to the counterpart semi-linear partial differential equations through the explicit adapted solutions of BSVIEs. Moreover, we formulate with BSVIEs to explicitly characterize dynamically optimal mean-variance portfolios for various stochastic investment opportunities, with the myopic investment and intertemporal hedging demands being identified as two diagonal processes of BSVIE solutions.

math.PR↗

arXiv2024

Dynamic Mean-Variance Asset Allocation in General Incomplete Markets A Nonlocal BSDE-based Feedback Control Approach

This paper studies dynamic mean-variance (MV) asset allocation problems in general incomplete markets. Besides of the conventional MV objective on portfolio's terminal wealth, our framework can accommodate running MV objectives with general (non-exponential) discounting factors while in general, any time-dependent preferences. We attempt the problem with a game-theoretic framework while decompose the equilibrium control policies into two parts: the first part is a myopic strategy characterized by a linear Volterra integral equation of the second kind and the second part reveals the hedging demand governed by a system of nonlocal backward stochastic differential equations. We manage to establish the well-posedness of the solutions to the two aforementioned equations in tailored Bananch spaces by the fixed-point theorem. It allows us to devise a numerical scheme for solving for the equilibrium control policy with guarantee and to conclude that the dynamic (equilibrium) mean-variance policy in general settings is well-defined. Our probabilistic approach allows us to consider a board range of stochastic factor models, such as the Chan--Karolyi--Longstaff--Sanders (CKLS) model. For which, we verify all technical assumptions and provide a sound numerical scheme. Numerical examples are provided to illustrate our framework.

q-fin.MF↗

arXiv2023

Nonlocality, Nonlinearity, and Time Inconsistency in Stochastic Differential Games

This paper proves the existence and uniqueness results (in the sense of maximally defined regularity) as well as the stability analysis for the solutions to a class of nonlocal fully-nonlinear parabolic systems, where the nonlocality stems from the flow feature (controlled by an external temporal parameter) of the systems. The derived mathematical results generalize the theory of stochastic differential games to incorporate with behavioral factors such as time-inconsistent preferences, which facilitate developments of many studies in financial economics including robust stochastic controls and games under relative performance concerns. Moreover, with the well-posedness results, we establish a general multidimensional Feynman--Kac formula in the presence of nonlocality (time inconsistency).

math.AP↗

arXiv2022

Quasilinearization Methods for Nonlocal Fully-Nonlinear Parabolic Systems

In this paper, we propose quasilinearization methods that convert nonlocal fully-nonlinear parabolic systems into the nonlocal quasilinear parabolic systems. The nonlocal parabolic systems serve as important mathematical tools for modelling the subgame perfect equilibrium solutions to time-inconsistent dynamic choice problems, which are motivated by the study of behavioral economics. Different types of nonlocal parabolic systems were studied but left behind the fully-nonlinear case and the connections among them. This paper shows the equivalence in solvability between nonlocal fully-nonlinear and the associated quasilinear systems, given their solutions are regular enough. Moreover, we establish the well-posedness results for the nonlocal quasilinear parabolic systems, so do that for the nonlocal fully-nonlinear parabolic systems. The quasilinear case alone is interesting in its own right from mathematical and modelling perspectives.

math.AP↗

arXiv2021

A Subgame Perfect Equilibrium Reinforcement Learning Approach to Time-inconsistent Problems

In this paper, we establish a subgame perfect equilibrium reinforcement learning (SPERL) framework for time-inconsistent (TIC) problems. In the context of RL, TIC problems are known to face two main challenges: the non-existence of natural recursive relationships between value functions at different time points and the violation of Bellman's principle of optimality that raises questions on the applicability of standard policy iteration algorithms for unprovable policy improvement theorems. We adapt an extended dynamic programming theory and propose a new class of algorithms, called backward policy iteration (BPI), that solves SPERL and addresses both challenges. To demonstrate the practical usage of BPI as a training framework, we adapt standard RL simulation methods and derive two BPI-based training algorithms. We examine our derived training frameworks on a mean-variance portfolio selection problem and evaluate some performance metrics including convergence and model identifiability.

cs.LG↗

arXiv2021

Nonlocal Fully Nonlinear Parabolic Differential Equations Arising in Time-Inconsistent Problems

We prove the well-posedness results, i.e. existence, uniqueness, and stability, of the solutions to a class of nonlocal fully nonlinear parabolic partial differential equations (PDEs), where there is an external time parameter $t$ on top of the temporal and spatial variables $(s,y)$ and thus the problem could be considered as a flow of equations. The nonlocality comes from the dependence on the unknown function and its first- and second-order derivatives evaluated at not only the local point $(t,s,y)$ but also at the diagonal line of the time domain $(s,s,y)$. Such equations arise from time-inconsistent problems in game theory or behavioural economics, where the observations and preferences are (reference-)time-dependent. To address the open problem of the well-posedness of the corresponding nonlocal PDEs (or the time-inconsistent problems), we first study the linearized version of the nonlocal PDEs with an innovative construction of appropriate norms and Banach spaces and contraction mappings over which. With fixed-point arguments, we obtain the well-posedness of nonlocal linear PDEs and establish a Schauder-type prior estimate for the solutions. Then, by the linearization method, we analogously establish the well-posedness under the fully nonlinear case. Moreover, we reveal that the solution of a nonlocal fully nonlinear parabolic PDE is an adapted solution to a flow of second-order forward-backward stochastic differential equations.

math.AP↗

arXiv2020

Efficient Social Distancing for COVID-19: An Integration of Economic Health and Public Health

Social distancing has been the only effective way to contain the spread of an infectious disease prior to the availability of the pharmaceutical treatment. It can lower the infection rate of the disease at the economic cost. A pandemic crisis like COVID-19, however, has posed a dilemma to the policymakers since a long-term restrictive social distancing or even lockdown will keep economic cost rising. This paper investigates an efficient social distancing policy to manage the integrated risk from economic health and public health issues for COVID-19 using a stochastic epidemic modeling with mobility controls. The social distancing is to restrict the community mobility, which was recently accessible with big data analytics. This paper takes advantage of the community mobility data to model the COVID-19 processes and infer the COVID-19 driven economic values from major market index price, which allow us to formulate the search of the efficient social distancing policy as a stochastic control problem. We propose to solve the problem with a deep-learning approach. By applying our framework to the US data, we empirically examine the efficiency of the US social distancing policy and offer recommendations generated from the algorithm.

stat.AP↗

arXiv2018

Persistent-Homology-based Machine Learning and its Applications -- A Survey

A suitable feature representation that can both preserve the data intrinsic information and reduce data complexity and dimensionality is key to the performance of machine learning models. Deeply rooted in algebraic topology, persistent homology (PH) provides a delicate balance between data simplification and intrinsic structure characterization, and has been applied to various areas successfully. However, the combination of PH and machine learning has been hindered greatly by three challenges, namely topological representation of data, PH-based distance measurements or metrics, and PH-based feature representation. With the development of topological data analysis, progresses have been made on all these three problems, but widely scattered in different literatures. In this paper, we provide a systematical review of PH and PH-based supervised and unsupervised models from a computational perspective. Our emphasizes are the recent development of mathematical models and tools, including PH softwares and PH-based functions, feature representations, kernels, and similarity models. Essentially, this paper can work as a roadmap for the practical application of PH-based machine learning tools. Further, we consider different topological feature representations in different machine learning models, and investigate their impacts on the protein secondary structure classification.

math.AT↗