中文
相关论文

相关论文: Value-at-Risk Optimization with Gaussian Processes

200 篇论文

This paper discusses a scenario approach to robust optimization of a blackbox function in a bandit setting. We assume that the blackbox function can be modeled as a Gaussian Process (GP) for every realization of the uncertain parameter. We…

最优化与控制 · 数学 2018-05-01 Shaunak D. Bopardikar , Vaibhav Srivastava

The Gaussian process bandit is a problem in which we want to find a maximizer of a black-box function with the minimum number of function evaluations. If the black-box function varies with time, then time-varying Bayesian optimization is a…

We propose a novel Bayesian Optimization approach for black-box functions with an environmental variable whose value determines the tradeoff between evaluation cost and the fidelity of the evaluations. Further, we use a novel approach to…

机器学习 · 统计学 2018-05-16 Mark McLeod , Michael A. Osborne , Stephen J. Roberts

Monte Carlo Approaches for calculating Value-at-Risk (VaR) are powerful tools widely used by financial risk managers across the globe. However, they are time consuming and sometimes inaccurate. In this paper, a fast and accurate Monte Carlo…

综合经济学 · 经济学 2020-11-17 Seyed Mohammad Sina Seyfi , Azin Sharifi , Hamidreza Arian

Designing dynamic portfolio insurance strategies under market conditions switching between two or more regimes is a challenging task in financial economics. Recently, a promising approach employing the value-at-risk (VaR) measure to assign…

计算金融 · 定量金融 2023-05-23 Peyman Alipour , Ali Foroush Bastani

In order to improve the performance of Bayesian optimisation, we develop a modified Gaussian process upper confidence bound (GP-UCB) acquisition function. This is done by sampling the exploration-exploitation trade-off parameter from a…

机器学习 · 计算机科学 2020-06-09 Julian Berk , Sunil Gupta , Santu Rana , Svetha Venkatesh

We study the problem of incorporating risk while making combinatorial decisions under uncertainty. We formulate a discrete submodular maximization problem for selecting a set using Conditional-Value-at-Risk (CVaR), a risk metric commonly…

人工智能 · 计算机科学 2018-10-30 Lifeng Zhou , Pratap Tokekar

In this paper, a new way to integrate volatility information for estimating value at risk (VaR) and conditional value at risk (CVaR) of a portfolio is suggested. The new method is developed from the perspective of Bayesian statistics and it…

风险管理 · 定量金融 2022-05-04 Taras Bodnar , Vilhelm Niklasson , Erik Thorsén

Conditional value-at-risk (CVaR) is a prominent risk measure in financial engineering, energy systems, and supply chain management. In these domains, Markov decision processes (MDPs) with a long-run CVaR criterion effectively mitigate cost…

最优化与控制 · 数学 2026-03-11 Qixin Wang , Hao Cao , Jian-Qiang Hu , Mingjie Hu , Li Xia

In this paper, we apply Value-at-Risk (VaR) approaches on the problem of yearly electric generation management. In a classical approach, the future is modelled as a markov chain and the goal is to minimize the average generation cost over…

最优化与控制 · 数学 2007-05-23 Vincent Guigues , Papa-Momar Ndiaye

In this paper we propose a novel Bayesian methodology for Value-at-Risk computation based on parametric Product Partition Models. Value-at-Risk is a standard tool to measure and control the market risk of an asset or a portfolio, and it is…

风险管理 · 定量金融 2009-05-15 Giacomo Bormetti , Maria Elena De Giuli , Danilo Delpini , Claudia Tarantola

Value-at-Risk is one of the most popular risk management tools in the financial industry. Over the past 20 years several attempts to include VaR in the portfolio selection process have been proposed. However, using VaR as a risk measure in…

投资组合管理 · 定量金融 2021-11-19 Francesco Cesarone , Manuel L Martino , Fabio Tardella

In real-world scenarios, risk-averse learning is valuable for mitigating potential adverse outcomes. However, the delayed feedback makes it challenging to assess and manage risk effectively. In this paper, we investigate risk-averse…

机器学习 · 计算机科学 2025-08-06 Siyi Wang , Zifan Wang , Karl Henrik Johansson , Sandra Hirche

Bayesian Optimization (BO) is a widely-used method for optimizing expensive-to-evaluate black-box functions. Traditional BO assumes that the learner has full control over all query variables without additional constraints. However, in many…

机器学习 · 计算机科学 2024-12-23 Vu Viet Hoang , Quoc Anh Hoang Nguyen , Hung Tran The

We introduce the Value-at-Risk Constrained Policy Optimization algorithm (VaR-CPO), a sample efficient and conservative method designed to optimize Value-at-Risk (VaR) constrained reinforcement learning (RL) problems. Empirically, we…

机器学习 · 计算机科学 2026-05-01 Rohan Tangri , Jan-Peter Calliess

Many applications require a learner to make sequential decisions given uncertainty regarding both the system's payoff function and safety constraints. In safety-critical systems, it is paramount that the learner's actions do not violate the…

机器学习 · 计算机科学 2020-05-06 Sanae Amani , Mahnoosh Alizadeh , Christos Thrampoulidis

Sharpe Ratio (SR) is a critical parameter in characterizing financial time series as it jointly considers the reward and the volatility of any stock/portfolio through its variance. Deriving online algorithms for optimizing the SR is…

投资组合管理 · 定量金融 2024-06-12 Sabrina Khurshid , Mohammed Shahid Abdulla , Gourab Ghatak

This paper is concerned with the process of risk allocation for a generic multivariate model when the risk measure is chosen as the Value-at-Risk (VaR). We recast the traditional Euler contributions from an expectation conditional on an…

计算金融 · 定量金融 2022-06-22 Takaaki Koike , Yuri F. Saporito , Rodrigo S. Targino

Gaussian process upper confidence bound (GP-UCB) is widely used for sequential optimization of expensive black-box functions. Although many upper bounds on its cumulative regret have been established in the literature, whether GP-UCB is…

机器学习 · 计算机科学 2026-05-21 Wenjia Wang , Xiaowei Zhang

In many scientific and engineering applications, we are tasked with the maximisation of an expensive to evaluate black box function $f$. Traditional settings for this problem assume just the availability of this single function. However, in…