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

144288432576 · May 202619922001200920172026
48 results for bounded relative risk

Proposes new rule for ranking investment prospects over long horizons.

problem Ranking investment prospects over long horizons considering bounded risk aversion.
method Introduces asymptotic fractional-order stochastic dominance with bounded relative risk aversion.
result Establishes equivalent conditions for the new rule under lognormal returns without mean non-negativity constraint.

Introduces relative information gain for improving Gaussian process regression rates.

problem Improving the sample complexity of estimating or maximizing unknown functions.
method Introduces relative information gain, interpolates between effective dimension and information gain, and proves PAC-Bayesian bounds.
result Obtains minimax-optimal rates of convergence through the relative information gain.

The study optimizes distribution estimation from samples with relative entropy error, adapting to sparse distributions.

problem Estimating discrete distributions with high-probability accuracy in relative entropy.
method Analysis of Laplace estimator and confidence-dependent smoothing techniques, including data-dependent smoothing.
result Optimal high-probability risk bounds for various estimators, including a new data-dependent smoothing method.

The risk premium is one of main concepts in mathematical finance. It is a measure of the trade-offs investors make between return and risk and is defined by the excess return relative to the risk-free interest rate that is earned from an asset per one unit of risk. The purpose of this article is to determine upper and …

2014-11-17abs ↗pdf ↗

This research improves PAC-Bayesian bounds for classification tasks using convexified loss.

problem Deriving generalization bounds for classification tasks with non-convex loss functions.
method Shift focus to misclassification excess risk bounds for PAC-Bayesian classification using convex surrogate loss and leveraging PAC-Bayesian relative bounds in expectation.
result Improved PAC-Bayesian bounds for classification tasks with convex surrogate loss.

The paper examines utility maximization in markets with hidden Gaussian drift, finding restrictions on model parameters.

problem Utility maximization problems in markets with hidden Gaussian drift mean-reverting processes.
method Derives sufficient conditions for bounded maximum expected utility of terminal wealth for models with full and partial information.
result Restrictions on model parameters for bounded maximum expected utility.

Estimating and assessing the risk of a large portfolio is an important topic in financial econometrics and risk management. The risk is often estimated by a substitution of a good estimator of the volatility matrix. However, the accuracy of such a risk estimator for large portfolios is largely unknown, and a simple ine…

2013-02-05abs ↗pdf ↗

Noise-ignorant empirical risk minimization achieves state-of-the-art performance on noisy data.

problem Learning with noisy labels in multi-class classification problems.
method Introducing relative signal strength (RSS) to quantify transferability and applying Noise Ignorant Empirical Risk Minimization (NI-ERM).
result NI-ERM achieves state-of-the-art performance on CIFAR-N data challenge.

New method targets relative risk heterogeneity in clinical trials.

problem Identifying treatment effects across subgroups with absolute risk differences.
method Modified causal forests using a novel node-splitting procedure based on relative risk.
result Relative risk causal forests can capture heterogeneity not detected by absolute risk methods.

AGCA approximates angular variation on the unit sphere, reducing extremal dependence problems to eigenanalysis.

problem Approximating angular variation in multivariate extremes.
method Anchored geodesic component analysis (AGCA) approximates angular variation by great subspheres constrained to pass through a chosen reference direction.
result AGCA finds concentrated tail directions in daily equity-portfolio losses, explaining about 91% of anchored variation.

The paper optimizes portfolios using relative tail risk measures.

problem Optimizing portfolios with respect to relative tail risk.
method Analytic forms of portfolio CoVaR and CoCVaR derived on a market model. Monte-Carlo simulation for CoCVaR and marginal contributions. Risk budgeting method applied.
result Derivation of analytic forms for CoVaR and CoCVaR, and their marginal contributions.

Unified framework for risk-aware policy learning in contextual bandits.

problem Optimizing decision rules in high-stakes domains with adverse outcomes.
method Distributional framework for Lipschitz-continuous risk functionals, with novel empirical concentration inequalities.
result Data-dependent suboptimality bounds with an ildeO(1/n) ilde{\mathcal{O}}(1/\sqrt{n}) rate, matching risk-neutral offline policy optimization.

New regularization method reduces support of empirical risk minimization solutions.

problem Regularization in empirical risk minimization with relative entropy.
method Introduces Type-II regularization, characterizes solutions, analyzes properties of relative entropy.
result Type-II regularization collapses solution support into reference measure's support.

Meta-learning bounds derived using PAC-Bayes theory for improved generalization.

problem Uncertainty in generalization performance for meta-learning with new tasks.
method PAC-Bayes relative entropy bounds and empirical risk minimization (ERM) method.
result Competitive generalization performance and rapid convergence with data-dependent prior.

Study optimal investment decisions for diverse risk-tolerant agents.

problem Optimizing investment choices for agents with varying risk preferences.
method Characterizes optimal behavior using certainty equivalents and lognormal risks.
result Derives optimal decision menus under known and uncertain preference distributions.

The paper introduces a measure to assess the relative value of a delta-Symmetric Strangle under the Black-Scholes model.

problem Measuring the relative value of a delta-Symmetric Strangle under the Black-Scholes model.
method Developed a new measure of relative value in terms of delta and volatility, bounded by a simple function of delta.
result The relative value of a delta-Symmetric Strangle is bounded by a simple function of delta and is independent of other factors.

Paper proposes a new framework to improve stability-based bounds in deep learning.

problem Explaining generalization in overparameterized neural networks.
method Decomposes excess risk dynamics into signal and noise components, applying stability-based bounds only to the noise.
result The decomposition framework improves stability-based bounds and explains generalization in neural networks.

Develops asymptotic theory for deep Cox models to enable valid inference.

problem Theoretical gaps in deep neural network estimators for Cox models.
method Asymptotic distribution theory linking in-sample optimization error to population risk.
result Pointwise and multivariate asymptotic normality for subsampled ensemble estimators.

New method uses asymmetric Tsallis relative entropy for better risk assessment in financial portfolios.

problem Improving risk assessment for financial portfolios using asymmetric data.
method Generalized Tsallis relative entropy (ATRE) for asymmetric distributions of returns.
result ATRE shows better risk-return profiles, especially during market crashes.

New stability bounds for GD in overparameterised shallow nets without NTK assumptions.

problem Generalisation and excess risk bounds for shallow neural networks.
method Oracle inequalities and stability analysis of GD without kernelisation.
result Oracle type bounds reveal GD's generalisation is controlled by an interpolating network with shortest GD path.

Study optimizes portfolio to minimize relative drawdown duration, penalizing unfavorable performance states.

problem Minimizing relative drawdown duration in portfolio optimization relative to a benchmark.
method Introduces a benchmark-relative drawdown-duration criterion penalizing unfavorable performance states. Uses a one-dimensional Markovian representation and Hamilton-Jacobi-Bellman equation.
result Derives explicit projection-based characterization of the optimal feedback control and identifies geometric settings for unique strong solutions.

This paper improves risk bounds and calibration for smart predict-then-optimize method.

problem Improving risk bounds and calibration for smart predict-then-optimize method.
method Develops risk bounds and uniform calibration results for the SPO+ loss relative to the SPO loss.
result Empirical minimizer of the SPO+ loss achieves low excess true risk with high probability.

Study dynamic risk measures with distributional uncertainty using optimal transport.

problem Risk robustification under distributional uncertainty in Markovian models.
method Characterize risk measures via convex monotone semigroups and optimal transport costs.
result Identify generator and correction terms for dynamic risk measures under different scaling regimes.

This paper compares two different frameworks recently introduced in the literature for measuring risk in a multi-period setting. The first corresponds to applying a single coherent risk measure to the cumulative future costs, while the second involves applying a composition of one-step coherent risk mappings. We summar…

2011-06-30abs ↗pdf ↗

Entropy asymmetry affects regularization in ERM, leading to biased solutions.

problem Analyzing the impact of relative entropy asymmetry in ERM regularization.
method Examined Type-I and Type-II ERM-RER, comparing their solutions and properties.
result Type-II ERM-RER regularization introduces a strong bias against training data.

The paper analyzes the generalization performance of spectral clustering algorithms and proposes new methods to improve their effectiveness.

problem Theoretical analysis of spectral clustering's generalization performance.
method Theoretical analysis and development of new spectral clustering algorithms.
result The excess risk bounds of spectral clustering algorithms have a O(1/n)\mathcal{O}(1/\sqrt{n}) convergence rate.

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.

The study examines Nash equilibria in utility maximization games with multiplicative performance criteria.

problem Existence and uniqueness of Nash equilibria in multiplicative performance criteria games.
method General characterization of Nash equilibria for a large class of utility functions.
result Existence and uniqueness of Nash equilibria for arbitrary initial wealth vectors.

We tackle imbalanced classification by weighting losses and derive robust risks.

problem Imbalanced classification where a label has low marginal probability.
method We examine convergence rates of weighted risks, define robust risks, and derive new robust risk problems.
result We show that particular weightings lead to conditional value at risk (CVaR) and derive new robust risk problems.

The paper analyzes portfolio credit risk using Archimedean copulas and introduces efficient simulation methods.

problem Analyzing large losses from credit portfolio defaults with Archimedean copulas.
method Derives asymptotic results and develops variance reduction algorithms for Monte Carlo simulations.
result Proposed algorithms significantly enhance classical Monte Carlo methods for estimating portfolio credit risk.

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 ↗

Study uses CSIE to estimate portfolio volatility relative to market.

problem Estimating relative volatility risk of stock portfolios.
method Cross-sectional intrinsic entropy (CSIE) model to estimate cross-sectional volatility.
result Discover sets of symbols that outperform market indices in terms of return with similar or lower risk.

A machine learning model improves relative valuation of municipal bonds.

problem Challenges in determining the value or relative value of municipal bonds.
method Proposes a supervised similarity framework using CatBoost algorithm to identify similar bonds based on risk profiles.
result The similarity-based method outperforms rule-based and heuristic-based methods in back-testing.

Paper introduces a new method for risk-sensitive investment management using RL.

problem Risk-sensitive portfolio management with unknown model parameters.
method Combines RL and risk-sensitive stochastic control with Gaussian perturbations for exploration.
result Endogenous relative-entropy regularization and optimal investment strategy derived.