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

89179268357 · Jun 202019922001200920172026
48 results for Value Variance

NP-PROV separates mean and variance spaces to improve function uncertainty.

problem Neural Processes fail on out-of-domain tasks due to shared latent space uncertainty.
method Separates mean and variance into function-value-related and position-related latent spaces.
result NP-PROV achieves state-of-the-art likelihood with bounded variance in drifts.

This paper addresses the problem of segmenting a time-series with respect to changes in the mean value or in the variance. The first case is when the time data is modeled as a sequence of independent and normal distributed random variables with unknown, possibly changing, mean value but fixed variance. The main assumpt…

2011-11-25abs ↗pdf ↗

A new method reduces data valuation variance for more trustworthy data trading.

problem Data valuation and trustworthy data trading in algorithmic prediction.
method Variance reduced Shapley value estimation using stratified sampling.
result VRDS method reduces estimation variance and improves data marketplace development.

The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.

problem Estimating excursion sets of vector-valued Gaussian processes.
method Clarifying the connection between continuous Gaussian processes and Gaussian measures in Banach spaces, extending concepts and properties from scalar-valued settings to vector-valued settings.
result Consistency results for sequential design strategies can be applied to vector-valued Gaussian processes.

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.

VA-OPE improves OPE by incorporating variance information, achieving tighter error bounds.

problem Estimating value function of a target policy from offline data collected by a behavior policy.
method Proposes VA-OPE, an algorithm that reweights Bellman residual using estimated variance of the value function.
result Achieves a tighter error bound than the best-known result.

Study tight offline learning bounds for linear MDPs using variance information.

problem Understanding statistical limits with linear function representations in offline reinforcement learning.
method Variance-aware pessimistic value iteration (VAPVI) that reweights Bellman residuals based on estimated variances.
result Improved offline learning bounds expressed in terms of system quantities.

New method quantifies uncertainty in reinforcement learning models.

problem Quantifying uncertainty over expected cumulative rewards in reinforcement learning.
method Proposes a new uncertainty Bellman equation to more accurately estimate value function variance.
result Our method converges to the true posterior variance over values and improves sample-efficiency.

This paper calculates worst-case target semi-variances for uncertain losses.

problem Managing risk when loss distribution is uncertain and only partial information is known.
method Derives worst-case target semi-variances for symmetric or non-negative losses under uncertainty sets representing investor's undesirable scenarios.
result Closed-form expressions for worst-case target semi-variances are derived.

We present a set of log-price integrated variance estimators, equal to the sum of open-high-low-close bridge estimators of spot variances within nn subsequent time-step intervals. The main characteristics of some of the introduced estimators is to take into account the information on the occurrence times of the high a…

2011-08-12abs ↗pdf ↗

Develops abstention procedure for nonparametric regression via variance testing.

problem Prediction with selective abstention in error-critical machine learning.
method Nonparametric heteroskedastic regression via testing hypothesis on conditional variance.
result Non-asymptotic risk bounds and convergence regimes for the estimator.

New estimator accurately estimates mean of real-valued distributions without variance knowledge.

problem Estimating the mean of real-valued distributions without prior variance knowledge.
method Introduces a novel estimator that converges sub-Gaussian and works across distributions with bounded variance.
result The estimator achieves accuracy of σ·(1+o(1))√(2log(1/δ)/n) with parameters n, δ, and σ².

A new estimator for evaluating policies in unknown environments.

problem Evaluating policies when both logging policy and value function are unknown.
method Doubly-Robust (DR) off-policy evaluation (OPE) estimator, DRUnknown, that estimates both the logging policy and value function.
result DRUnknown achieves the smallest asymptotic variance and is optimal when both models are correctly specified.

Paper tackles bias-variance trade-off in missing data, proposing a dynamic framework.

problem Missing data in practical applications deteriorates model performance.
method Develops a fine-grained dynamic learning framework to jointly optimize bias and variance.
result Theoretical and empirical validation of joint bias-variance optimization.

QFIL improves offline RL by filtering data to reduce bias and variance.

problem Improving offline reinforcement learning policies with limited data.
method QFIL uses a filtered dataset to improve policies, trading off bias and variance through quantile selection.
result QFIL provides a safe policy improvement step with function approximation and effectively balances bias and variance.

We compute the value of a variance swap when the underlying is modeled as a Markov process time changed by a Lévy subordinator. In this framework, the underlying may exhibit jumps with a state-dependent Lévy measure, local stochastic volatility and have a local stochastic default intensity. Moreover, the Lévy subordina…

2012-09-04abs ↗pdf ↗

This work tackles risk-sensitive deep RL by optimizing policies with variance constraints.

problem Risk and aleatoric uncertainty in deep reinforcement learning.
method Lagrangian and Fenchel dualities to transform the problem into an unconstrained saddle-point policy optimization problem, and an actor-critic algorithm to iteratively update policy, Lagrange multiplier, and Fenchel dual variable.
result The proposed actor-critic algorithm finds a globally optimal policy at a sublinear rate.

To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…

2019-09-28abs ↗pdf ↗

Optimizes option portfolios for skewed-t returns using VaR and variance measures.

problem Optimizing portfolios for skewed-t returns with heavy tails and skewness.
method Uses variance and VaR measures, departing from normal returns, and provides explicit portfolio weights.
result Optimal portfolio weights differ significantly from variance optimal weights due to skewness.

The paper proposes a new portfolio optimization model that includes VaR risk measure.

problem Computational hardness of portfolio optimization models with VaR as a risk measure.
method Formulated as a Mixed-Integer Quadratic Programming (MIQP) problem, the model minimizes variance with constraints on expected return and VaR.
result The proposed Mean-Variance-VaR portfolios outperform traditional Mean-Variance and Mean-VaR portfolios in out-of-sample performance.

New method optimizes portfolio weights as functions, outperforming traditional approaches.

problem Optimizing portfolio weights in mean-variance models.
method Functional optimization approach, treating weights as functions of past values.
result Gradient-ascent algorithms can solve functional optimization problems for mean-variance portfolio management.

New method estimates optimal Q-values with better accuracy for specific problems.

problem Estimating optimal Q-values in reinforcement learning is difficult and varies by problem instance.
method Local minimax framework and variance-reduced Q-learning.
result Sharp lower bounds on estimation accuracy for Q-learning.

Improved LLM pre-training performance through better weight and variance control.

problem Improper weight and variance control in LLM pre-training affects downstream task performance.
method Introduced Layer Index Rescaling (LIR) and Target Variance Rescaling (TVR) techniques.
result Substantial improvements in downstream task performance (up to 4.6%) and reduced extreme activation values.

Quadratic hedging of option payoffs generates the variance optimal martingale measure. When an option features an exercise policy and its cash flows are hedged according to this approach, it may be tempting to optimize such a policy under this measure. Because the variance optimal martingale measure may not be an equiv…

2020-01-16abs ↗pdf ↗

Improved KernelSHAP via linear regression for ML model interpretation.

problem Efficiently estimating Shapley values in model-agnostic settings.
method Revisiting KernelSHAP via linear regression, developing techniques for convergence and uncertainty.
result Original KernelSHAP incurs negligible bias for significant variance reduction.

This paper describes an empirical study of shortfall optimization with Barra Extreme Risk. We compare minimum shortfall to minimum variance portfolios in the US, UK, and Japanese equity markets using Barra Style Factors (Value, Growth, Momentum, etc.). We show that minimizing shortfall generally improves performance ov…

2011-02-04abs ↗pdf ↗

Study compares imputation methods' effects on IML confidence intervals.

problem Missing data impacts IML interpretation and confidence intervals.
method Compared single vs multiple imputation methods on IML confidence intervals.
result Multiple imputation provides closer coverage to nominal than single imputation.

Market-based asset price probability depends on trade volumes and values, improving forecasts and reliability.

problem Limited accuracy of frequency-based asset price statistical moments.
method Derive market-based variance and 3rd statistical moment from trade values and volumes, accounting for trade volume randomness.
result Market-based statistical moments improve price probability forecasts and reliability.

The paper analyzes optimal investment strategies for life insurance contracts using mean-variance optimization.

problem Optimal portfolio choice for equity holders in life insurance contracts.
method Mean-variance optimization, explicit formulas, Hamilton-Jacobi-Bellman equations, numerical analysis.
result Equity holders increase investment in risky assets during economic downturns.

Stochastic dividend discount models (Hurley and Johnson, 1994 and 1998, Yao, 1997) present expressions for the expected value of stock prices when future dividends evolve according to some random scheme. In this paper we try to offer a more precise view on this issue proposing a closed-form formula for the variance of …

2013-11-01abs ↗pdf ↗

The vast majority of works on option pricing operate on the assumption of risk neutral valuation, and consequently focus on the expected value of option returns, and do not consider risk parameters, such as variance. We show that it is possible to give explicit formulae for the variance of European option returns (vani…

2012-04-16abs ↗pdf ↗

This paper proposes swaps on two important new measures of generalized variance, namely the maximum eigen-value and trace of the covariance matrix of the assets involved. We price these generalized variance swaps for financial markets with Markov-modulated volatilities. We consider multiple assets in the portfolio for …

2019-08-11abs ↗pdf ↗

The breakthrough of deep Q-Learning on different types of environments revolutionized the algorithmic design of Reinforcement Learning to introduce more stable and robust algorithms, to that end many extensions to deep Q-Learning algorithm have been proposed to reduce the variance of the target values and the overestim…

2019-10-14abs ↗pdf ↗

We consider the mean-variance hedging problem under partial Information. The underlying asset price process follows a continuous semimartingale and strategies have to be constructed when only part of the information in the market is available. We show that the initial mean variance hedging problem is equivalent to a ne…

2007-03-14abs ↗pdf ↗

A large portfolio of independent returns is optimized under the variance risk measure with a ban on short positions. The no-short selling constraint acts as an asymmetric 1\ell_1 regularizer, setting some of the portfolio weights to zero and keeping the out of sample estimator for the variance bounded, avoiding the di…

2016-12-21abs ↗pdf ↗