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.

169,051 papers · 148 categories

Trend · papers per month

198396593791 · Jun 202019922001200920182026
48 results for stochastic estimated risk

New methods reduce bias in estimating optimality gaps for risk-averse stochastic programs.

problem Optimality gap estimation bias in risk-averse stochastic programs.
method Two independent samples, each estimating a different component of the optimality gap.
result Our method reduces bias in estimating optimality gaps for risk-averse problems.

Estimates and optimizes UBSR risk in recursive settings.

problem Estimating and optimizing UBSR risk in a recursive setting with one-at-a-time samples.
method Casts UBSR as a root finding problem, uses stochastic approximation and gradient descent.
result Derives non-asymptotic bounds on estimation and optimization errors.

The paper analyzes risk estimation methods and derives bounds for OCE risk.

problem Estimating the Optimized Certainty Equivalent (OCE) risk from samples.
method Derives mean-squared error and concentration bounds for SAA of OCE, and analyzes an efficient stochastic approximation-based estimator.
result Finite sample bounds and mis-identification probability bounds for the efficient estimator.

A new algorithm estimates VaR and ES for financial risks.

problem Estimating Value-at-Risk and Expected Shortfall for financial losses.
method Multilevel Stochastic Approximation (MLSA) scheme for nested stochastic approximation problems.
result Optimal complexities for VaR and ES estimation are derived.

New algorithms optimize spectral risk measures, improving interpolation between average and worst-case performance.

problem Optimizing spectral risk measures for learning systems.
method Developed stochastic algorithms to optimize spectral risk measures by characterizing their subdifferential and addressing challenges like biasedness of subgradient estimates and non-smoothness.
result Our approach outperforms out-of-the-box stochastic subgradient and dual averaging methods in optimizing spectral risk measures.

In risk management it is desirable to grasp the essential statistical features of a time series representing a risk factor. This tutorial aims to introduce a number of different stochastic processes that can help in grasping the essential features of risk factors describing different asset classes or behaviors. This pa…

2008-12-22abs ↗pdf ↗

Paper proposes ZO-SMD for MERO, achieving optimal convergence rates.

problem Minimizing excess risk across all test distributions.
method Zeroth-order stochastic mirror descent algorithm for both smooth and non-smooth MERO.
result Converges at optimal rates of O(1/t)\mathcal{O}(1/\sqrt{t}) for estimates and optimization errors.

A new method for efficient nested Monte Carlo simulations in financial modeling.

problem Computational challenges in nested stochastic modeling for financial risk assessment.
method Sample recycling approach to speed up inner loop estimations.
result Significantly more efficient than traditional techniques.

A new SGD framework reduces empirical risk by favoring higher loss observations.

problem Minimizing empirical risk in machine learning problems.
method Develops a biased gradient estimator for stochastic optimization.
result Minimizes an ordered modification of the empirical average loss.

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 ↗

New method estimates Schrödinger bridge potentials via empirical risk minimization.

problem Estimating Schrödinger bridge potentials from samples.
method Rewriting Schrödinger system as a fixed-point equation and estimating the potential via empirical risk minimization.
result Uniform concentration of empirical risk around population counterpart under sub-Gaussian assumptions.

We study the task of learning from non-i.i.d. data. In particular, we aim at learning predictors that minimize the conditional risk for a stochastic process, i.e. the expected loss of the predictor on the next point conditioned on the set of training samples observed so far. For non-i.i.d. data, the training set contai…

2015-10-09abs ↗pdf ↗

Paper estimates risks in MDPs using state lumping and SAT, showing its effectiveness.

problem Estimating risks in Markov decision processes with state augmentation.
method State augmentation transformation, isotopic states, and state lumping.
result SAT and state lumping effectively estimate mean-variance and exponential utility risks.

When simulating a complex stochastic system, the behavior of output response depends on input parameters estimated from finite real-world data, and the finiteness of data brings input uncertainty into the system. The quantification of the impact of input uncertainty on output response has been extensively studied. Most…

2015-07-21abs ↗pdf ↗

New oracles improve stochastic optimization with noisy or biased measurements.

problem Optimizing functions with noisy or biased measurements.
method Introduced biased gradient oracles for stochastic optimization, analyzed RSG and SGD algorithms with these oracles.
result Derived non-asymptotic bounds for convergence rates of algorithms with biased gradient oracles.

Quantum method improves CVaR evaluation under correlated fields.

problem Accurately evaluating CVaR in high-dimensional, correlated material uncertainty.
method Quantum-enhanced inference framework using stabilized IQAE.
result Quantum method achieves lower oracle complexity than classical methods.

Study shows how SGD's implicit regularization relates to ridge regression.

problem Least squares regression optimization with mini-batch SGD.
method Analyzes stochastic gradient flow as a continuous-time model of SGD.
result Bound on excess risk of SGD flow over ridge regression, revealing how parameters drive risk.

A new tamed stochastic gradient Hamiltonian Monte Carlo algorithm for superlinearly growing stochastic gradients.

problem Sampling and stochastic optimization problems with superlinearly growing stochastic gradients.
method Tamed Stochastic Gradient Hamiltonian Monte Carlo (tSGHMC) algorithm.
result Established a non-asymptotic error bound in Wasserstein-2 distance with a convergence rate of 1/41/4.

Study values and optimizes forestry leases under risk and uncertainty.

problem Valuing and optimizing forestry leases in the presence of catastrophe risk and parameter uncertainty.
method Stochastic bio-economic models, Kalman filter, maximum likelihood estimation, RBSDEs, Monte Carlo simulations.
result Conservative strategy is recommended due to parameter uncertainty.

A framework for estimating both epistemic and aleatoric uncertainties in reinforcement learning.

problem Estimating risk and uncertainty in deep reinforcement learning.
method Proposed a framework for disentangling and estimating epistemic and aleatoric uncertainties on learned Q-values, derived unbiased estimators, and introduced an uncertainty-aware DQN algorithm.
result The uncertainty-aware DQN algorithm exhibits safe learning behavior and outperforms other DQN variants on the MinAtar testbed.

Proposes a new stochastic method to calibrate climate risks in financial models.

problem Estimating climate-related financial risks in bank loan portfolios.
method Stochastic forward-looking methodology to calibrate climate macro-correlation evolution from scientific data.
result A new framework to evaluate climate risks without specific scenario assumptions.

SurvivalBoost improves prediction of event times in competing risks scenarios.

problem Predicting event times in scenarios with multiple possible outcomes.
method Developed a strictly proper censoring-adjusted scoring rule for stochastic optimization of competing risks.
result SurvivalBoost outperforms 12 state-of-the-art models across various metrics.

The paper connects higher order risk measures and stochastic dominance, showing their equivalence and integrating them with optimization.

problem Comparing and characterizing random outcomes in risk assessment.
method Exploring the equivalence between higher order risk measures and stochastic dominance, using stochastic optimization and expectiles as examples.
result Higher order risk measures and stochastic dominance are equivalent and can be used to characterize random outcomes.

New methods show sparse portfolios offer no advantage over mean-variance in diversification.

problem Investment diversification and risk management with sparse portfolios.
method Developed and implemented a new estimation procedure for sparse second-order stochastic spanning using a greedy algorithm and Linear Programming.
result No benefit from expanding a sparse opportunity set beyond 45 assets; optimal sparse portfolio reduces tail risk.

Paper proposes FONE for efficient distributed estimation and inference.

problem Efficient distributed estimation and inference for non-differentiable convex losses.
method Proposes a multi-round distributed estimation procedure using a First-Order Newton-type Estimator (FONE).
result FONE efficiently estimates Σ1wΣ^{-1} w for non-differentiable losses, facilitating inference.

We prove that a wide class of correlated stochastic volatility models exactly measure an empirical fact in which past returns are anticorrelated with future volatilities: the so-called ``leverage effect''. This quantitative measure allows us to fully estimate all parameters involved and it will entail a deeper study on…

2002-02-12abs ↗pdf ↗

A new algorithm reduces bias and variance in distributionally robust optimization.

problem Distributionally robust optimization with bias and variance issues.
method Prospect, a stochastic gradient-based algorithm that reduces hyperparameter tuning.
result Prospect achieves linear convergence and 2-3x faster convergence on various benchmarks.