MétaCan
Menu
Back to cohort
Record W2127838665 · doi:10.1145/2726935.2726936

Computing at the speed of trading (keynote)

2015· article· en· W2127838665 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
Typearticle
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsIBM (Canada)
Fundersnot available
KeywordsComputer scienceParallel computing

Abstract

fetched live from OpenAlex

When the word trading comes up in conversation, most people think first of the stock markets and frantic traders of movie and television. In reality many of the largest deals are done over-the-counter and so expose the parties to the contract to each other’s financial circumstances. This raises the question: what is my potential future exposure (PFE) if “the other guy” – the counterparty – defaults? Sophisticated measures like PFE and the related CVA allow firms to monitor their exposure to others, to limit it, and to ensure their capital will support the deals it makes. This analysis involves forecasting deal values far into the future, examining legal agreements between the two firms, and evaluating the deal itself. Algorithms in this domain use thousands of scenarios as well as complex aggregation and pricing techniques, all across hundreds of future time points to produce actionable risk metrics. In this talk I’ll discuss some of the complexities of the problem, how it can be broken down into efficient computational chunks and delve into our recent experiments with parallelizing the aggregation across scenarios and time points using OpenMP to enhance real-time performance.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.947
Threshold uncertainty score0.335

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
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.063
GPT teacher head0.276
Teacher spread0.213 · 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
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicComputability, Logic, AI AlgorithmsFrench-language works237,207