Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Risk-aware multi-armed bandit problem with application to portfolio selection.

ABSTRACT: Sequential portfolio selection has attracted increasing interest in the machine learning and quantitative finance communities in recent years. As a mathematical framework for reinforcement learning policies, the stochastic multi-armed bandit problem addresses the primary difficulty in sequential decision-making under uncertainty, namely the exploration versus exploitation dilemma, and therefore provides a natural connection to portfolio selection. In this paper, we incorporate risk awareness into the classic multi-armed bandit setting and introduce an algorithm to construct portfolio. Through filtering assets based on the topological structure of the financial market and combining the optimal multi-armed bandit policy with the minimization of a coherent risk measure, we achieve a balance between risk and return.

SUBMITTER: Huo X

PROVIDER: S-EPMC5717697 | biostudies-literature | 2017 Nov

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Risk-aware multi-armed bandit problem with application to portfolio selection.

Huo Xiaoguang X Fu Feng F

Royal Society open science 20171115 11

Sequential portfolio selection has attracted increasing interest in the machine learning and quantitative finance communities in recent years. As a mathematical framework for reinforcement learning policies, the stochastic multi-armed bandit problem addresses the primary difficulty in sequential decision-making under uncertainty, namely the <i>exploration</i> versus <i>exploitation</i> dilemma, and therefore provides a natural connection to portfolio selection. In this paper, we incorporate risk ...[more]

PMID: 29291122

Similar Datasets

Adversarial Autoencoder and Multi-Armed Bandit for Dynamic Difficulty Adjustment in Immersive Virtual Reality for Rehabilitation: Application to Hand Movement.

Project description:Motor rehabilitation is used to improve motor control skills to improve the patient's quality of life. Regular adjustments based on the effect of therapy are necessary, but this can be time-consuming for the clinician. This study proposes to use an efficient tool for high-dimensional data by considering a deep learning approach for dimensionality reduction of hand movement recorded using a wireless remote control embedded with the Oculus Rift S. This latent space is created as a visualization tool also for use in a reinforcement learning (RL) algorithm employed to provide a decision-making framework. The data collected consists of motions drawn with wireless remote control in an immersive VR environment for six different motions called "Cube", "Cylinder", "Heart", "Infinity", "Sphere", and "Triangle". From these collected data, different artificial databases were created to simulate variations of the data. A latent space representation is created using an adversarial autoencoder (AAE), taking into account unsupervised (UAAE) and semi-supervised (SSAAE) training. Then, each test point is represented by a distance metric and used as a reward for two classes of Multi-Armed Bandit (MAB) algorithms, namely Boltzmann and Sibling Kalman filters. The results showed that AAE models can represent high-dimensional data in a two-dimensional latent space and that MAB agents can efficiently and quickly learn the distance evolution in the latent space. The results show that Sibling Kalman filter exploration outperforms Boltzmann exploration with an average cumulative weighted probability error of 7.9 versus 19.9 using the UAAE latent space representation and 8.0 versus 20.0 using SSAAE. In conclusion, this approach provides an effective approach to visualize and track current motor control capabilities regarding a target in order to reflect the patient's abilities in VR games in the context of DDA.

| S-EPMC9228873 | biostudies-literature

Some performance considerations when using multi-armed bandit algorithms in the presence of missing data.

Project description:When comparing the performance of multi-armed bandit algorithms, the potential impact of missing data is often overlooked. In practice, it also affects their implementation where the simplest approach to overcome this is to continue to sample according to the original bandit algorithm, ignoring missing outcomes. We investigate the impact on performance of this approach to deal with missing data for several bandit algorithms through an extensive simulation study assuming the rewards are missing at random. We focus on two-armed bandit algorithms with binary outcomes in the context of patient allocation for clinical trials with relatively small sample sizes. However, our results apply to other applications of bandit algorithms where missing data is expected to occur. We assess the resulting operating characteristics, including the expected reward. Different probabilities of missingness in both arms are considered. The key finding of our work is that when using the simplest strategy of ignoring missing data, the impact on the expected performance of multi-armed bandit strategies varies according to the way these strategies balance the exploration-exploitation trade-off. Algorithms that are geared towards exploration continue to assign samples to the arm with more missing responses (which being perceived as the arm with less observed information is deemed more appealing by the algorithm than it would otherwise be). In contrast, algorithms that are geared towards exploitation would rapidly assign a high value to samples from the arms with a current high mean irrespective of the level observations per arm. Furthermore, for algorithms focusing more on exploration, we illustrate that the problem of missing responses can be alleviated using a simple mean imputation approach.

| S-EPMC9467360 | biostudies-literature

A portfolio selection model based on the knapsack problem under uncertainty.

Project description:One of the primary concerns in investment planning is to determine the number of shares for asset with relatively high net value of share such as Berkshire Hathaway on Stock market. Traditional asset allocation methods like Markowitz theorem gives the solution as a percentage and this ratio may suggest allocation of half of a share on the market, which is impractical. Thus, it is necessary to propose a method to determine the number of shares for each asset. This paper presents a knapsack based portfolio selection model where the expected returns, prices, and budget are characterized by interval values. The study determines the priority and importance of each share in the proposed model by extracting the interval weights from an interval comparison matrix. The resulted model is converted into a parametric linear programming model in which the decision maker is able to determine the optimism threshold. Finally, a discrete firefly algorithm is designed to find the near optional solutions in large dimensions. The proposed study is implemented for some data from the US stock exchange.

| S-EPMC6493714 | biostudies-literature

Optimal Query Selection Using Multi-Armed Bandits.

Project description:Query selection for latent variable estimation is conventionally performed by opting for observations with low noise or optimizing information theoretic objectives related to reducing the level of estimated uncertainty based on the current best estimate. In these approaches, typically the system makes a decision by leveraging the current available information about the state. However, trusting the current best estimate results in poor query selection when truth is far from the current estimate, and this negatively impacts the speed and accuracy of the latent variable estimation procedure. We introduce a novel sequential adaptive action value function for query selection using the multi-armed bandit (MAB) framework which allows us to find a tractable solution. For this adaptive-sequential query selection method, we analytically show: (i) performance improvement in the query selection for a dynamical system, (ii) the conditions where the model outperforms competitors. We also present favorable empirical assessments of the performance for this method, compared to alternative methods, both using Monte Carlo simulations and human-in-the-loop experiments with a brain computer interface (BCI) typing system where the language model provides the prior information.

| S-EPMC6777547 | biostudies-literature

Decision-making without a brain: how an amoeboid organism solves the two-armed bandit.

Project description:Several recent studies hint at shared patterns in decision-making between taxonomically distant organisms, yet few studies demonstrate and dissect mechanisms of decision-making in simpler organisms. We examine decision-making in the unicellular slime mould Physarum polycephalum using a classical decision problem adapted from human and animal decision-making studies: the two-armed bandit problem. This problem has previously only been used to study organisms with brains, yet here we demonstrate that a brainless unicellular organism compares the relative qualities of multiple options, integrates over repeated samplings to perform well in random environments, and combines information on reward frequency and magnitude in order to make correct and adaptive decisions. We extend our inquiry by using Bayesian model selection to determine the most likely algorithm used by the cell when making decisions. We deduce that this algorithm centres around a tendency to exploit environments in proportion to their reward experienced through past sampling. The algorithm is intermediate in computational complexity between simple, reactionary heuristics and calculation-intensive optimal performance algorithms, yet it has very good relative performance. Our study provides insight into ancestral mechanisms of decision-making and suggests that fundamental principles of decision-making, information processing and even cognition are shared among diverse biological systems.

| S-EPMC4938078 | biostudies-literature

Fuzzy Portfolio Selection Using Stochastic Correlation

Project description:Here we have proposed fuzzy portfolio selection model using stochastic correlation (FPSMSC) to overcome limitations both in fuzzy and stochastic world. The newly proposed model not only gets harmonious efficient frontier, but also considers the future movement of stock prices based on fuzzy expertise knowledge. The investment weights of the model have been optimized based on the monthly return data of 18 stocks listed in S&P500 from October 2011 to September 2015. The proposed model has provided higher returns in the whole regime of risk for the period from October 2014 to September 2015, whose monthly return data are used as training data than other available portfolio selection models, i.e., fuzzy portfolio selection models with credibility and possibility and statistic model. Also, the present model has shown the better smoothness of the variations of returns with respect to risk aversion parameter, λ, from the monthly data from October 2015 to September 2016, which is not included to training database. Especially, our model is superior to other models in the regime of 0–0.3 for the risk aversion level. It is demonstrating that the FPSMSC is efficient for the investors who tend to seek the high return in portfolio management. Supplementary Information The online version contains supplementary material available at 10.1007/s10614-023-10371-w.

| S-EPMC9983516 | biostudies-literature

Imputation-Aware Tag SNP Selection To Improve Power for Large-Scale, Multi-ethnic Association Studies.

Project description:The emergence of very large cohorts in genomic research has facilitated a focus on genotype-imputation strategies to power rare variant association. These strategies have benefited from improvements in imputation methods and association tests, however little attention has been paid to ways in which array design can increase rare variant association power. Therefore, we developed a novel framework to select tag SNPs using the reference panel of 26 populations from Phase 3 of the 1000 Genomes Project. We evaluate tag SNP performance via mean imputed r2 at untyped sites using leave-one-out internal validation and standard imputation methods, rather than pairwise linkage disequilibrium. Moving beyond pairwise metrics allows us to account for haplotype diversity across the genome for improve imputation accuracy and demonstrates population-specific biases from pairwise estimates. We also examine array design strategies that contrast multi-ethnic cohorts vs. single populations, and show a boost in performance for the former can be obtained by prioritizing tag SNPs that contribute information across multiple populations simultaneously. Using our framework, we demonstrate increased imputation accuracy for rare variants (frequency < 1%) by 0.5-3.1% for an array of one million sites and 0.7-7.1% for an array of 500,000 sites, depending on the population. Finally, we show how recent explosive growth in non-African populations means tag SNPs capture on average 30% fewer other variants than in African populations. The unified framework presented here will enable investigators to make informed decisions for the design of new arrays, and help empower the next phase of rare variant association for global health.

| S-EPMC6169386 | biostudies-other

Factoring attitudes towards armed conflict risk into selection of protected areas for conservation.

Project description:The high incidence of armed conflicts in biodiverse regions poses significant challenges in achieving international conservation targets. Because attitudes towards risk vary, we assessed different strategies for protected area planning that reflected alternative attitudes towards the risk of armed conflicts. We find that ignoring conflict risk will deliver the lowest return on investment. Opting to completely avoid conflict-prone areas offers limited improvements and could lead to species receiving no protection. Accounting for conflict by protecting additional areas to offset the impacts of armed conflicts would not only increase the return on investment (an effect that is enhanced when high-risk areas are excluded) but also increase upfront conservation costs. Our results also demonstrate that fine-scale estimations of conflict risk could enhance the cost-effectiveness of investments. We conclude that achieving biodiversity targets in volatile regions will require greater initial investment and benefit from fine-resolution estimates of conflict risk.

| S-EPMC4820849 | biostudies-other

Real-world datasets for portfolio selection and solutions of some stochastic dominance portfolio models.

Project description:A large number of portfolio selection models have appeared in the literature since the pioneering work of Markowitz. However, even when computational and empirical results are described, they are often hard to replicate and compare due to the unavailability of the datasets used in the experiments. We provide here several datasets for portfolio selection generated using real-world price values from several major stock markets. The datasets contain weekly return values, adjusted for dividends and for stock splits, which are cleaned from errors as much as possible. The datasets are available in different formats, and can be used as benchmarks for testing the performances of portfolio selection models and for comparing the efficiency of the algorithms used to solve them. We also provide, for these datasets, the portfolios obtained by several selection strategies based on Stochastic Dominance models (see "On Exact and Approximate Stochastic Dominance Strategies for Portfolio Selection" (Bruni et al. [2])). We believe that testing portfolio models on publicly available datasets greatly simplifies the comparison of the different portfolio selection strategies.

| S-EPMC4959918 | biostudies-literature

Learning zero-cost portfolio selection with pattern matching.

Project description:We replicate and extend the adversarial expert based learning approach of Györfi et al to the situation of zero-cost portfolio selection implemented with a quadratic approximation derived from the mutual fund separation theorems. The algorithm is applied to daily sampled sequential Open-High-Low-Close data and sequential intraday 5-minute bar-data from the Johannesburg Stock Exchange (JSE). Statistical tests of the algorithms are considered. The algorithms are directly compared to standard NYSE test cases from prior literature. The learning algorithm is used to select parameters for experts generated by pattern matching past dynamics using a simple nearest-neighbour search algorithm. It is shown that there is a speed advantage associated with using an analytic solution of the mutual fund separation theorems. We argue that the strategies are on the boundary of profitability when considered in the context of their application to intraday quantitative trading but demonstrate that patterns in financial time-series on the JSE could be systematically exploited in collective and that they are persistent in the data investigated. We do not suggest that the strategies can be profitably implemented but argue that these types of patterns may exists for either structural of implementation cost reasons.

| S-EPMC6155486 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data