English
Related papers

Related papers: Model-free bounds on Value-at-Risk using extreme v…

200 papers

This paper studies Pareto-optimal reinsurance design in a monopolistic market with multiple primary insurers and a single reinsurer, all with heterogeneous risk preferences. The risk preferences are characterized by a family of risk…

Risk Management · Quantitative Finance 2025-12-15 Tim J. Boonen , Xia Han , Peng Liu , Jiacong Wang

Variational inference (VI) has become a widely used approach for scalable Bayesian inference, but its performance strongly depends on the flexibility of the chosen variational family. In this work, we propose a novel variational family that…

Methodology · Statistics 2026-04-03 Giovanni Piccirilli , Aluísio Pinheiro

We consider the problem of learning models for risk-sensitive reinforcement learning. We theoretically demonstrate that proper value equivalence, a method of learning models which can be used to plan optimally in the risk-neutral setting,…

Machine Learning · Computer Science 2023-12-05 Tyler Kastner , Murat A. Erdogdu , Amir-massoud Farahmand

This paper provides a general technique for lower bounding the Bayes risk of statistical estimation, applicable to arbitrary loss functions and arbitrary prior distributions. A lower bound on the Bayes risk not only serves as a lower bound…

Statistics Theory · Mathematics 2016-12-26 Xi Chen , Adityanand Guntuboyina , Yuchen Zhang

Several well-established benchmark predictors exist for Value-at-Risk (VaR), a major instrument for financial risk management. Hybrid methods combining AR-GARCH filtering with skewed-$t$ residuals and the extreme value theory-based approach…

Risk Management · Quantitative Finance 2021-11-25 Shige Peng , Shuzhen Yang , Jianfeng Yao

We consider a two-stage stochastic decision problem where the decision-maker has the opportunity to obtain information about the distribution of the random variables $\xi$ that appear in the problem through a set of discrete actions that we…

Optimization and Control · Mathematics 2024-07-16 Zhichao Ma , Youngdae Kim , Jeff Linderoth , James R. Luedtke , Logan R. Matthews

A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…

Information Theory · Computer Science 2007-07-13 Joseph DeStefano , Erik Learned-Miller

We extend temporal-difference (TD) learning in order to obtain risk-sensitive, model-free reinforcement learning algorithms. This extension can be regarded as modification of the Rescorla-Wagner rule, where the (sigmoidal) stimulus is taken…

Machine Learning · Computer Science 2021-11-05 Grégoire Delétang , Jordi Grau-Moya , Markus Kunesch , Tim Genewein , Rob Brekelmans , Shane Legg , Pedro A. Ortega

Model-free reinforcement learning algorithms combined with value function approximation have recently achieved impressive performance in a variety of application domains. However, the theoretical understanding of such algorithms is limited,…

Machine Learning · Computer Science 2021-02-12 Botao Hao , Nevena Lazic , Yasin Abbasi-Yadkori , Pooria Joulani , Csaba Szepesvari

Bayesian inference offers benefits over maximum likelihood, but it also comes with computational costs. Computing the posterior is typically intractable, as is marginalizing that posterior to form the posterior predictive distribution. In…

Machine Learning · Computer Science 2023-07-18 Alexander A. Alemi , Ben Poole

The paper deals with a generalization of the risk model with stochastic premiums where dependence structures between claim sizes and inter-claim times as well as premium sizes and inter-premium times are modeled by…

Probability · Mathematics 2018-01-04 Olena Ragulina

We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…

Numerical Analysis · Mathematics 2021-02-09 Michael Gnewuch

The recent paper Cand\`es et al. (2018) introduced model-X knockoffs, a method for variable selection that provably and non-asymptotically controls the false discovery rate with no restrictions or assumptions on the dimensionality of the…

Methodology · Statistics 2020-06-16 Dongming Huang , Lucas Janson

We consider the pricing and hedging of exotic options in a model-independent set-up using \emph{shortfall risk and quantiles}. We assume that the marginal distributions at certain times are given. This is tantamount to calibrating the model…

Pricing of Securities · Quantitative Finance 2013-07-10 Erhan Bayraktar , Zhou Zhou

Generalized variational inference (GVI) provides an optimization-theoretic framework for statistical estimation that encapsulates many traditional estimation procedures. The typical GVI problem is to compute a distribution of parameters…

Optimization and Control · Mathematics 2023-10-27 Aurya S. Javeed , Drew P. Kouri , Thomas M. Surowiec

Gibbs-ERM learning is a natural idealized model of learning with stochastic optimization algorithms (such as Stochastic Gradient Langevin Dynamics and ---to some extent--- Stochastic Gradient Descent), while it also arises in other…

Machine Learning · Computer Science 2019-02-06 Ilja Kuzborskij , Nicolò Cesa-Bianchi , Csaba Szepesvári

The paper examines the Fractional Fourier Transform (FRFT) based technique as a tool for obtaining probability density function and its derivatives, and mainly for fitting stochastic model with the fundamental probabilistic relationships of…

Methodology · Statistics 2021-07-13 A. H. Nzokem

Recursive max-linear vectors model causal dependence between its components by expressing each node variable as a max-linear function of its parental nodes in a directed acyclic graph and some exogenous innovation. Motivated by extreme…

Methodology · Statistics 2019-12-10 Claudia Klüppelberg , Mario Krali

Variable-length compression without prefix-free constraints and with side-information available at both encoder and decoder is considered. Instead of requiring the code to be error-free, we allow for it to have a non-vanishing error…

Information Theory · Computer Science 2020-08-24 Yuta Sakai , Vincent Y. F. Tan

Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal…

Machine Learning · Computer Science 2012-07-19 Pradeep Ravikumar , John Lafferty