Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

1122 · Jun 202019922001200920172026
17 results for Risk-constrained

Study risk-constrained Kelly optimization for mutually exclusive outcomes, proving support invariance and developing a structured algorithm.

problem Risk-constrained Kelly optimization for mutually exclusive outcomes with explicit state prices.
method Analyzes the finite mutually exclusive outcome version of risk-constrained Kelly optimization with explicit state prices, proving support invariance and developing a structured algorithm.
result Support is invariant across CRRA parameter and drawdown-surrogate parameter in the overround regime.

This study optimizes energy storage scheduling under price uncertainty, balancing risk and reward.

problem Optimizing energy storage operation under price uncertainty and risk.
method Two-stage stochastic risk-constrained approach using conditional value-at-risk.
result Increasing risk aversion leads to substantial benefits in terms of risk reduction and expected reward.

We investigate the ergodic problem of growth-rate maximization under a class of risk constraints in the context of incomplete, Itô-process models of financial markets with random ergodic coefficients. Including {\em value-at-risk} (VaR), {\em tail-value-at-risk} (TVaR), and {\em limited expected loss} (LEL), these cons…

2007-06-04abs ↗pdf ↗

We propose an computational framework for real-time risk assessment and prioritizing for random outcomes without prior information on probability distributions. The basic model is built based on satisficing measure (SM) which yields a single index for risk comparison. Since SM is a dual representation for a family of r…

2018-07-01abs ↗pdf ↗

VaR-CPO optimizes VaR-constrained RL problems with conservative policy updates.

problem Optimizing VaR-constrained reinforcement learning problems.
method Combines Cantelli's inequality and trust-region framework for efficient and conservative optimization.
result Achieves zero constraint violations during training in feasible environments.

We consider the classic Kelly gambling problem with general distribution of outcomes, and an additional risk constraint that limits the probability of a drawdown of wealth to a given undesirable level. We develop a bound on the drawdown probability; using this bound instead of the original risk constraint yields a conv…

2016-03-20abs ↗pdf ↗

We propose an iterative gradient-based algorithm to efficiently solve the portfolio selection problem with multiple spectral risk constraints. Since the conditional value at risk (CVaR) is a special case of the spectral risk measure, our algorithm solves portfolio selection problems with multiple CVaR constraints. In e…

2014-10-20abs ↗pdf ↗

VA-LUCB identifies best arm with variance constraint, achieving optimal sample complexity.

problem Identifying the best arm with variance constraint under fixed confidence.
method Parameter-free algorithm VA-LUCB, analyzing sample complexity and proving lower bounds.
result Optimal sample complexity up to a logarithmic factor in HVAH_{VA}, demonstrated by experiments.

We study a risk-constrained version of the stochastic shortest path (SSP) problem, where the risk measure considered is Conditional Value-at-Risk (CVaR). We propose two algorithms that obtain a locally risk-optimal policy by employing four tools: stochastic approximation, mini batches, policy gradients and importance s…

2014-05-12abs ↗pdf ↗

Solves VaR-constrained portfolio optimization in markets with stochastic volatility.

problem Optimizing portfolio in markets with stochastic volatility under VaR constraints.
method Dynamic programming approach to Heston's stochastic volatility model.
result Optimal investment strategy linked to unconstrained problem via a vega-neutral derivative.

Algorithm minimizes regret in multi-criteria bandits with constraints.

problem Optimize primary attribute while respecting secondary constraints.
method Con-LCB algorithm that guarantees logarithmic regret and feasibility identification.
result Logarithmic regret and feasibility identification with high probability.

Algorithm optimizes a single attribute in multi-armed bandits with constraints.

problem Optimizing a single attribute under multiple constraints in multi-armed bandits.
method Successive Rejects framework, information theoretic lower bound.
result Upper bound on probability of error decays exponentially with budget, nearly optimal in certain cases.

The paper tackles dynamic collateral control for spot-perpetual basis trading in decentralized finance.

problem Dynamic control of collateral in spot-perpetual basis trading in decentralized finance.
method Solves a static control problem and derives an asymmetric dynamic extension, validated with live execution.
result The dynamic control approach provides a more robust operating benchmark and shows significant rebalancing effects.

Boosted Difference of Convex Functions Algorithm solves VaR constrained portfolio optimization.

problem Designing VaR optimal portfolios under financial regulations.
method Boosted Difference of Convex Functions Algorithm (BDCA) with a novel line search framework.
result BDCA linearly converges to a Karush-Kuhn-Tucker point for VaR constrained portfolio problems.