A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Despite the simplicity and intuitive interpretation of Minimum Mean Squared Error (MMSE) estimators, their effectiveness in certain scenarios is questionable. Indeed, minimizing squared errors on average does not provide any form of stability, as the volatility of the estimation error is left unconstrained. When this v…
We solve non-Markovian optimal switching problems in discrete time on an infinite horizon, when the decision maker is risk aware and the filtration is general, and establish existence and uniqueness of solutions for the associated reflected backward stochastic difference equations. An example application to hydropower …
Active learning from demonstration allows a robot to query a human for specific types of input to achieve efficient learning. Existing work has explored a variety of active query strategies; however, to our knowledge, none of these strategies directly minimize the performance risk of the policy the robot is learning. U…
Sequential portfolio selection has attracted increasing interests in the machine learning and quantitative finance communities in recent years. As a mathematical framework for reinforcement learning policies, the stochastic multi-armed bandit problem addresses the primary difficulty in sequential decision making under …
WRAAC uses Wasserstein distance for robust reinforcement learning.
problem Lack of quantified robustness to system dynamics in existing reinforcement learning algorithms.
method Leverages Wasserstein distance to connect state disturbance to transition kernel disturbance, reducing infinite-dimensional optimization to a finite-dimensional problem.
result Designs a novel algorithm, WRAAC, that achieves robust reinforcement learning.
This paper tackles risk-aware energy scheduling for MEC networks with microgrids.
problem Risk in energy demand and supply for MEC networks powered by microgrids.
method Formulated an optimization problem with CVaR for energy consumption and generation, analyzed using a multi-agent stochastic game, derived solution with MADRL-based A3C algorithm.
result Significant performance gain by considering CVaR for high accuracy energy scheduling.
ClauseLens uses reinforcement learning to price reinsurance treaties transparently and auditably.
problem Opaque and difficult-to-audit reinsurance treaty pricing practices.
method ClauseLens models treaty pricing as a Risk-Aware Constrained Markov Decision Process (RA-CMDP), incorporating legal clauses and generating interpretable explanations.
result ClauseLens reduces solvency violations and improves tail-risk performance, achieving 88.2% accuracy in clause-grounded explanations.
We present Free-MESSAGEp, the first zeroth-order algorithm for (weakly-)convex mean-semideviation-based risk-aware learning, which is also the first three-level zeroth-order compositional stochastic optimization algorithm whatsoever. Using a non-trivial extension of Nesterov's classical results on Gaussia…
In the field of reinforcement learning there has been recent progress towards safety and high-confidence bounds on policy performance. However, to our knowledge, no practical methods exist for determining high-confidence policy performance bounds in the inverse reinforcement learning setting---where the true reward fun…
Supporting ultra-reliable low-latency communications (URLLC) is a major challenge of 5G wireless networks. Stringent delay and reliability requirements need to be satisfied for both scheduled and non-scheduled URLLC traffic to enable a diverse set of 5G applications. Although physical and media access control layer sol…
This paper improves parameter estimation for autonomous systems with unmodeled dynamics.
problem Accurate parameter estimation for risk-aware autonomous systems with unmodeled dynamics.
method Spectral lines-based approach for estimating parameters of dynamic models, allowing deterministic unmodeled dynamics.
result The proposed method leads to non-asymptotic bounds on parameter estimation error, robust to unmodeled dynamics, and matches existing literature in ideal conditions.
We consider a continuous time Principal-Agent model on a finite time horizon, where we look for the existence of an optimal contract both parties agreed on. Contrary to the main stream, where the principal is modelled as risk-neutral, we assume that both the principal and the agent have exponential utility, and are ris…
We propose a new definition for tameness within the model of security prices as Itô processes that is risk-aware. We give a new definition for arbitrage and characterize it. We then prove a theorem that can be seen as an extension of the second fundamental theorem of asset pricing, and a theorem for valuation of contin…