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,657 papers · 148 categories

Trend · papers per month

59118176235 · May 202619922001200920172026
48 results for logarithmic risk

Proposes resilience metrics for large blackout costs with logarithmic resilience.

problem Large variations in blackout costs make estimating risk impractical.
method Uses mean of log of large blackout costs, tail slope index, and frequency.
result Solves problems of heavy tail and large variations in blackout costs.

The paper addresses portfolio allocation with uncertain covariance matrices, finding a logarithmic risk dependence.

problem Portfolio allocation with uncertain covariance matrices.
method Calculates the expected value of CARA utility function over a distribution of covariance matrices, considering uncertainty in future returns and covariances.
result Marginalization introduces a logarithmic dependence on risk, leading to lower allocation levels for higher uncertainties.

The Kelly Criterion is applied to prediction markets to analyze risk and return.

problem Mean beliefs in prediction markets often differ from actual prices.
method Logarithmic utility and Kullback-Leibler divergence are used to study risk and return adjustments.
result Misjudgment of bias and investment fraction affect portfolio growth rate.

Study identifies key ESG variables for assessing financial risk.

problem Assessing financial risk from ESG data with many variables.
method Proposed framework for hierarchical ESG data, selecting relevant variables.
result Selected ESG variables are more relevant to financial risk than aggregated scores.

The paper analyzes competition among fund managers using excess logarithmic returns and constructs games to find optimal allocations.

problem Optimal allocation strategies among fund managers considering excess logarithmic returns.
method Constructs both nn-player and mean field games to address the competition problem.
result The MFE of the MFG represents the limit of nn-player game's equilibrium as nn approaches infinity.

New approach avoids restrictive assumptions for optimal portfolio in default risk scenarios.

problem Optimal portfolio optimization under default risk when traditional techniques are not applicable.
method Alternative approach using forward integration to avoid Jacod density hypothesis.
result Weaker intensity hypothesis is the appropriate condition for optimality in logarithmic utility.

Paper analyzes risk bounds for in-context learning in multiclass classification.

problem Risk bounds for in-context learning in multiclass classification.
method Formalizes tasks as sequences of labeled examples and queries, estimates conditional class probabilities, establishes oracle inequality for KL divergence.
result ICL achieves minimax optimal rate for conditional probability estimation.

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.

A new method for estimating probabilities and risks using Markov processes.

problem Computational difficulties in classical importance sampling for latent Markov models.
method Proposes a new importance sampling framework that minimizes estimator variance.
result Shows logarithmic efficiency of the proposed estimator.

We show that our generalization of the Black-Scholes partial differential equation (pde) for nontrivial diffusion coefficients is equivalent to a Martingale in the risk neutral discounted stock price. Previously, this was proven for the case of the Gaussian logarithmic returns model by Harrison and Kreps, but we prove …

2006-06-01abs ↗pdf ↗

Most high-dimensional estimation and prediction methods propose to minimize a cost function (empirical risk) that is written as a sum of losses associated to each data point. In this paper we focus on the case of non-convex losses, which is practically important but still poorly understood. Classical empirical process …

2016-07-22abs ↗pdf ↗

Study shows Skorokhod insider outperforms forward insider in logarithmic utility maximization.

problem Maximizing logarithmic utility for an insider with different anticipating techniques.
method Comparison of Russo-Vallois forward and Skorokhod integrals.
result Skorokhod insider outperforms forward insider in logarithmic utility maximization.

Robo-advisors estimate clients' risk aversion using interactive questionnaires.

problem Estimating risk aversion of non-expert clients using adaptive questionnaires.
method Model risk aversion with cost functions and spectral risk measures. Use inverse reinforcement learning to design questions maximizing distinguishing power.
result Designing questions by maximizing distinguishing power achieves satisfactory accuracy in learning risk aversion with fewer than 50 questions.

New algorithm reduces online logistic regression regret without exponential constant.

problem Improper learning in online logistic regression with logarithmic regret.
method Regularized empirical risk minimization with surrogate losses.
result Regret scaling as O(B log(Bn)) with low computational complexity.

We maximize the expected utility from terminal wealth for an HARA investor when the market price of risk is an unobservable random variable. We compute the optimal portfolio explicitly and explore the effects of learning by comparing it with the corresponding myopic policy. In particular, we show that, for a market pri…

2015-02-10abs ↗pdf ↗

We consider the economic problem of optimal consumption and investment with power utility. We study the optimal strategy as the relative risk aversion tends to infinity or to one. The convergence of the optimal consumption is obtained for general semimartingale models while the convergence of the optimal trading strate…

2010-03-18abs ↗pdf ↗

We derive PAC-Bayesian learning guarantees for heavy-tailed losses, and obtain a novel optimal Gibbs posterior which enjoys finite-sample excess risk bounds at logarithmic confidence. Our core technique itself makes use of PAC-Bayesian inequalities in order to derive a robust risk estimator, which by design is easy to …

2019-05-20abs ↗pdf ↗

This work improves policy evaluation and selection using logarithmic smoothing for pessimistic off-policy estimation.

problem Offline evaluation and selection of policies from past data.
method Develops novel concentration bounds and a logarithmically smoothed estimator (LS) for improved policy selection and learning.
result The logarithmically smoothed estimator (LS) provides tighter bounds and better policy selection and learning.

Paper presents efficient IS for tail risk estimation with machine learning features.

problem Estimating Value at Risk and Conditional Value at Risk with black-box access.
method Efficient Importance Sampling algorithm with self-structuring transformation.
result Asymptotically optimal variance reduction in logarithmic scale.

We study a portfolio selection problem in a continuous-time Itô-Markov additive market with prices of financial assets described by Markov additive processes which combine Lévy processes and regime switching models. Thus the model takes into account two sources of risk: the jump diffusion risk and the regime switching …

2018-06-09abs ↗pdf ↗

The paper analyzes prediction error in nonstationary settings using weighted risk minimization.

problem Prediction under distribution drift and nonstationary conditions.
method General decomposition of excess risk into learning and drift terms, proving oracle inequalities under mixing conditions.
result Oracle inequalities for the learning error, providing bounds that hold uniformly over arbitrary weight classes.

Paper proposes an algorithm to optimize CVaR using retrospective approximation and importance sampling.

problem Optimizing risk-averse problems with large sample requirements for CVaR.
method Retrospective approximation combined with importance sampling, tailored for CVaR optimization.
result The proposed algorithm reduces variance efficiently and is computationally efficient.

Online learning has traditionally focused on the expected rewards. In this paper, a risk-averse online learning problem under the performance measure of the mean-variance of the rewards is studied. Both the bandit and full information settings are considered. The performance of several existing policies is analyzed, an…

2018-07-24abs ↗pdf ↗

The aim of this paper is to determine the Value at Risk (VaR) of the portfolio consisting of long positions in foreign currencies on an emerging market. Basing on empirical data we restrict ourselves to the case when the tail parts of distributions of logarithmic returns of these assets follow the power laws and the lo…

2006-08-18abs ↗pdf ↗

We estimate risk measures in Markov cost processes with lower and upper bounds.

problem Estimating risk measures in infinite-horizon discounted costs within Markov processes.
method Truncation scheme and lower/upper bounds for CVaR and variance estimation.
result Upper and lower bounds for CVaR and variance estimation match up to logarithmic factors.

This note will extend the research presented in Brown & Rogers (2009) to the case of CRRA agents. We consider the model outlined in that paper in which agents had diverse beliefs about the dividends produced by a risky asset. We now assume that the agents all have CRRA utility, with some integer coefficient of relative…

2009-07-28abs ↗pdf ↗

The overarching goal of this paper is to derive excess risk bounds for learning from exp-concave loss functions in passive and sequential learning settings. Exp-concave loss functions encompass several fundamental problems in machine learning such as squared loss in linear regression, logistic loss in classification, a…

2014-01-18abs ↗pdf ↗

A statistical decision problem is hidden in the core of option pricing. A simple form for the price C of a European call option is obtained via the minimum Bayes risk, R_B, of a 2-parameter estimation problem, thus justifying calling C Bayes (B-)price. The result provides new insight in option pricing, among others obt…

2013-04-18abs ↗pdf ↗

We study the market selection hypothesis in complete financial markets, populated by heterogeneous agents. We allow for a rich structure of heterogeneity: individuals may differ in their beliefs concerning the economy, information and learning mechanism, risk aversion, impatience and 'catching up with Joneses' preferen…

2011-06-15abs ↗pdf ↗

Lower bounds on Bayes risk for realizable models derived using information theory.

problem Deriving lower bounds on Bayes risk for realizable machine learning models.
method Information-theoretic analysis using rate-distortion theory and mutual information.
result Lower bounds on Bayes risk for realizable models, matching known bounds up to logarithmic factors.

Optimizes privacy-preserving optimization for heavy-tailed data.

problem Privacy-preserving optimization with heavy-tailed gradients.
method Pure ε-differential privacy framework for Lipschitz extensions.
result Minimax optimal excess-risk rate for pure ε-DP heavy-tailed SCO.

We extend the lifecycle model (LCM) of consumption over a random horizon (a.k.a. the Yaari model) to a world in which (i.) the force of mortality obeys a diffusion process as opposed to being deterministic, and (ii.) a consumer can adapt their consumption strategy to new information about their mortality rate (a.k.a. h…

2012-05-10abs ↗pdf ↗

Study on estimating invertible functions with minimax analysis.

problem Minimizing risk of estimating invertible functions on a plane.
method Introduce two types of L2L^2-risks, derive lower and upper rates for minimax values, develop an asymptotically almost everywhere invertible estimator.
result Invertibility does not reduce the complexity of the estimation problem in terms of the rate.

New algorithms achieve uniform stability for empirical risk minimization.

problem Designing uniformly stable optimization algorithms for empirical risk minimization.
method Black-box conversion of smooth optimization algorithms and development of Mirror Descent for smooth optimization.
result Optimal algorithms with uniform stability and convergence rates for smooth optimization.