New quantum states capture more information, enabling advanced processing tasks.
problem Quantum information processing challenges with limited statistical information.
method Introducing Random-Coefficient Pure States (RCPS) and exploiting their higher-order statistics.
result RCPS provide richer information than density operators, enabling new quantum tasks.
Study optimal investment and reinsurance strategy for insurers under random coefficients.
problem Optimal mean-variance investment-reinsurance problem for insurers under Cramér-Lundberg model with random coefficients.
method Reduced to a constrained stochastic linear-quadratic control problem with jumps, solved using BSDE techniques and SREs.
result Explicit efficient investment-reinsurance strategy and mean-variance frontier.
The paper solves a complex control problem with stochastic elements and switching conditions.
problem Non-homogeneous stochastic LQ control with regime switching and random coefficients.
method Explicit optimal control and value obtained through two systems of backward stochastic differential equations (BSDEs). Existence and uniqueness of solutions proved using BMO martingales and contraction mapping method.
result Explicit optimal state feedback control and optimal value derived for the problem.
The paper solves MMV and MV problems with random coefficients and finds shared optimal strategies.
problem Optimal trading strategies with random market coefficients.
method Backward stochastic differential equations (BSDEs) to find optimal strategies.
result MMV and MV problems share the same optimal portfolio and value under random coefficients.
Study optimal consumption and investment strategies with constraints in a market with random coefficients.
problem Optimal consumption and investment strategies with constraints in a regime switching market with random coefficients.
method Explicit optimal strategies provided via solutions to new BSDE systems.
result Solving new BSDEs to find optimal values and strategies.
Study optimal portfolios for many players in a market model with random coefficients.
problem Optimal portfolio selection for many players under relative performance criteria in a market model with random coefficients.
method Game theory and stochastic optimal control, focusing on CARA and CRRA risk preferences, and extending to continuum of players.
result Existence of forward Nash equilibrium and mean field equilibrium for the n-agent game and corresponding mean field stochastic optimal control problem.
Paper proposes methods for transfer learning with random coefficient ridge regression.
problem Estimation and prediction in high-dimensional settings with related models.
method Two estimators using weighted sums of ridge estimates from target and source models.
result Explicit expression of estimation and prediction risks derived using random matrix theory.
A new method solves complex control problems with random coefficients.
problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.
Proposes a new consumption strategy based on martingale principles.
problem Optimizing consumption based on investment strategies without risk preferences.
method Introduces martingale consumption as a consumption pattern that adjusts to expected future consumption.
result Identifies explicit solutions in deterministic models and establishes uniqueness in general cases.
This paper introduces a new data-driven methodology for estimating sparse covariance matrices of the random coefficients in logit mixture models. Researchers typically specify covariance matrices in logit mixture models under one of two extreme assumptions: either an unrestricted full covariance matrix (allowing correl…
Study optimal investment-reinsurance strategy for insurers under random coefficients and jumps.
problem Optimal investment-reinsurance strategy for insurers with random coefficients and jumps.
method Solves backward stochastic differential equations with jumps under a convex cone constraint.
result Optimal strategy and value remain the same even with random coefficients and jumps.
Characterizes optimal-speed quantum state evolution Hamiltonians.
problem Optimal-speed unitary time evolution of pure and quasi-pure quantum states.
method Construction of the manifold of pure states and isometry with flag manifold, characterization of equigeodesic vectors.
result Hamiltonians generating optimal-speed time evolution are fully characterized by equigeodesic vectors of the flag manifold.
We propose a data-driven approach to solve multiscale elliptic PDEs with random coefficients based on the intrinsic low dimension structure of the underlying elliptic differential operators. Our method consists of offline and online stages. At the offline stage, a low dimension space and its basis are extracted from th…
New algorithm solves utility maximization with deep learning for constrained problems.
problem Maximizing utility under convex constraints with random coefficients.
method Developed a new algorithm using stochastic maximum principle and deep learning.
result The new algorithm outperforms existing methods in accuracy and applicability.
Protocol learns pure quantum states with minimal disturbance.
problem Efficiently learn quantum states with minimal disturbance.
method Sequential measurements with minimal disturbance.
result Achieves maximal precision with polylogarithmic regret.
Proposes a new model for time series that considers smooth transitions between states.
problem Models assume instantaneous transitions between discrete states, ignoring gradual changes.
method Dynamical Wasserstein Barycentric (DWB) model that estimates system state and pure state distributions over time.
result Accurately learns pure state distributions and improves state estimation for transition periods.
Automatically differentiable estimation for BLP model reduces bias in demand estimation.
problem Estimating the BLP model with reduced bias and improved performance.
method Phrasing BLP as an automatically differentiable moment function, using CUE for estimation, and incorporating MCMC credible intervals.
result CUE estimation shows lower bias but higher MAE compared to 2S-GMM, with MCMC providing closest empirical coverage.
We prove that a large class of discrete-time insurance surplus processes converge weakly to a generalized Ornstein-Uhlenbeck process, under a suitable re-normalization and when the time-step goes to 0. Motivated by ruin theory, we use this result to obtain approximations for the moments, the ultimate ruin probability a…
The paper revisits classical competition theory to explain speculative asset price dynamics.
problem Understanding the dynamics of speculative asset prices and their volatility.
method Specialized classical model of competition with reservation prices, incorporating speculation.
result The model explains excess, fat-tailed, and clustered volatility in speculative asset prices.
SSDMs generate quantum states directly, outperforming classical methods.
problem Generating pure-state quantum representations efficiently.
method Score-based generative model on complex projective manifold.
result SSDMs match target pure-state ensembles by orders of magnitude.
Proposes a flexible framework for implied volatility surfaces with random parameters.
problem Inconsistent calibration of parametric implied volatility models when market volatility deviates from the model's regime.
method Introduces random coefficients for parametric implied volatility formulas, preserving analytic flexibility and efficiency.
result Demonstrates improved modeling of implied volatility curves, especially for short-term options and earnings announcements.
We consider a multi-stock continuous time incomplete market model with random coefficients. We study the investment problem in the class of strategies which do not use direct observations of the appreciation rates of the stocks, but rather use historical stock prices and an a priory given distribution of the appreciati…
New spatiotemporal Besov process improves CT image reconstruction and other inverse problems.
problem Handling abrupt changes and sharp contrasts in spatiotemporal data.
method Generalized Besov process (STBP) with Q-exponential process for temporal correlation.
result STBP outperforms traditional methods in dynamic reconstruction and inverse problems.
We study singular stochastic control of a two dimensional stochastic differential equation, where the first component is linear with random and unbounded coefficients. We derive existence of an optimal relaxed control and necessary conditions for optimality in the form of a mixed relaxed-singular maximum principle in a…
We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is why we describe them as geometric presentaitons. Motivated by a presentation fo…
Study on quantum state entanglement using Kaehler manifolds.
problem Quantum state entanglement on Kaehler manifolds.
method Semiclassical asymptotics and pure states on spheres.
result Entropy analysis of quantum states on spheres.
We study optimal investment strategies that maximize expected utility from consumption and terminal wealth in a pure-jump asset price model with Markov-modulated (regime switching) jump-size distributions. We give sufficient conditions for existence of optimal policies and find closed-form expressions for the optimal v…
Adversarial learning is one of the most successful approaches to modelling high-dimensional probability distributions from data. The quantum computing community has recently begun to generalize this idea and to look for potential applications. In this work, we derive an adversarial algorithm for the problem of approxim…
PureTS uses simple linear models to improve long-term time series forecasting.
problem Improving long-term time series forecasting with complex models.
method Developed PureTS with three pure linear layers.
result PureTS achieves state-of-the-art performance in long sequence prediction tasks.
We study the optimal investment problem for a continuous time incomplete market model such that the risk-free rate, the appreciation rates and the volatility of the stocks are all random; they are assumed to be independent from the driving Brownian motion, and they are supposed to be currently observable. It is shown t…
New findings on flatness for specific driftless systems.
problem Determining flatness for driftless systems with m inputs and 2m or 2m-1 states.
method Using pure prolongation, the paper presents new sufficient conditions for flatness.
result The conditions proposed broaden the class of recognized flat systems.
Paper develops SINNOs for approximating stochastic processes.
problem Approximating stochastic processes with neural networks.
method Developed stochastic interpolation neural network operators (SINNOs) with random coefficients.
result Established boundedness, interpolation accuracy, and approximation capabilities of SINNOs.
Newly characterizes the Standard Model gauge group using spinors and geometry.
problem Characterize the Standard Model gauge group GSM within Spin(10).
method Characterizes GSM as a subgroup of Spin(10) using the geometry of pure spinors and Clifford algebras.
result GSM is the intersection of Georgi-Glashow SU(5) and Pati-Salam Spin(6) x Spin(4).
Paper solves a control problem with robust methods.
problem Monotone mean-variance problems with stochastic coefficients.
method Finding saddle point through BSDEs with unbounded coefficients.
result Optimal control and value match mean-variance problems.
In this paper, we consider the challenge of maximizing an unknown function f for which evaluations are noisy and are acquired with high cost. An iterative procedure uses the previous measures to actively select the next estimation of f which is predicted to be the most useful. We focus on the case where the function ca…
We consider the optimal control problem for a linear conditional McKean-Vlasov equation with quadratic cost functional. The coefficients of the system and the weigh-ting matrices in the cost functional are allowed to be adapted processes with respect to the common noise filtration. Semi closed-loop strategies are intro…
Optimal transport theory applied to quantum states on Grassmannians.
problem Developing optimal transport for quantum states.
method Metric geometry of Grassmannians and spectral theorem for density matrices.
result Wasserstein distance for normal states of von Neumann algebras.
We propose a new systematic fibre bundle formulation of nonrelativistic quantum mechanics. The new form of the theory is equivalent to the usual one but it is in harmony with the modern trends in theoretical physics and potentially admits new generalizations in different directions. In it a pure state of some quantum s…
State-space systems generate probabilistic dependencies between inputs and outputs.
problem Understanding probabilistic dependencies in state-space systems.
method Introducing a probabilistic framework and proving sufficient conditions for output existence and uniqueness.
result State-space systems can generate probabilistic dependencies, even without functional relations.
New exploration bonuses improve reinforcement learning efficiency.
problem Efficient exploration in unknown environments with limited feedback.
method Improved exploration bonuses scaling with 1/n and improved stopping time analysis.
result Faster learning rates and improved sample complexity in pure-exploration settings.
We count the supersymmetric bound states of many distinct BPS monopoles in N=4 Yang-Mills theories and in pure N=2 Yang-Mills theories. The novelty here is that we work in generic Coulombic vacua where more than one adjoint Higgs fields are turned on. The number of purely magnetic bound states is again found to be cons…
In this contribution we review results on the kinematics of a quantum system localized on a connected configuration manifold and compatible dynamics for the quantum system including external fields and leading to non-linear Schrödinger equations for pure states.
evo-RL combines evolutionary computation with reinforcement learning for better adaptability.
problem Improving reinforcement learning algorithms' adaptability and performance in environments with rewardless states.
method Embedding reinforcement learning in an evolutionary cycle, distinguishing instinctive from learnable behavior.
result evo-RL leads to state-of-the-art performance on OpenAI Gym control problems with rewardless states.
This paper studies a continuous-time market {under stochastic environment} where an agent, having specified an investment horizon and a target terminal mean return, seeks to minimize the variance of the return with multiple stocks and a bond. In the considered model firstly proposed by [3], the mean returns of individu…
Develops a new geometric framework for quantum metrics.
problem Quantum metric generalization for pure two-qubit states.
method Support-projected Petz monotone geometry for pure two-qubit families.
result Strictly generalizes SLD/Bures case and includes other metrics.
We show that for any positive integer n, the maps x∈Cn↦{∣⟨x,zi⟩∣2}i=14n∈R4n, where zi are the columns of four n×n unitary matrices, are generically injective modulo multiplication by a global phase factor, yielding a family of emb…
We consider an optimal investment and consumption problem for a Black-Scholes financial market with stochastic coefficients driven by a diffusion process. We assume that an agent makes consumption and investment decisions based on CRRA utility functions. The dynamical programming approach leads to an investigation of t…
Pure exploration (aka active testing) is the fundamental task of sequentially gathering information to answer a query about a stochastic environment. Good algorithms make few mistakes and take few samples. Lower bounds (for multi-armed bandit models with arms in an exponential family) reveal that the sample complexity …