MétaCan
Menu
Back to cohort
Record W4389891535 · doi:10.32920/24625161

Financial Bandits - Development of Thompson Sampling for Financial Data

2023· preprint· en· W4389891535 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldDecision Sciences
TopicAdvanced Bandit Algorithms Research
Canadian institutionsToronto Metropolitan UniversityUniversity of Toronto
Fundersnot available
KeywordsReinforcement learningComputer scienceClass (philosophy)Artificial intelligenceFocus (optics)Bayesian probabilityMachine learningParametric statisticsFinancial marketBayesian inferenceMathematical financeFinanceEconomicsMathematics

Abstract

fetched live from OpenAlex

<p>Reinforcement learning is an emerging branch of machine learning that has typically been used for applications of autonomous vehicles. However, the framework provides a natural fit for financial applications due to the agent-environment interaction that is an investor and the market. In this paper, we develop a new class of bandit algorithms dubbed financial bandits which expand on standard bandit algorithms that are the foundation of reinforcement learning. Of particular focus are Bayesian bandits and Thompson sampling. We loosen assumptions about resources and adopting non-parametric models, we create a more appropriate class of bandit algorithms for applications to financial time series.</p>

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.037
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Meta-epidemiology (narrow), Open science
Consensus categoriesOpen science
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.857
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0080.037
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0060.010
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.743
GPT teacher head0.575
Teacher spread0.168 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Bandit Algorithms ResearchFrench-language works237,207