MétaCan
Menu
Back to cohort
Record W4415009434 · doi:10.1515/dema-2025-0141

Norm constrained empirical portfolio optimization with stochastic dominance: Robust optimization non-asymptotics

2025· article· en· W4415009434 on OpenAlexaff
Stelios Arvanitis

Bibliographic record

VenueDemonstratio Mathematica · 2025
Typearticle
Languageen
FieldDecision Sciences
TopicRisk and Portfolio Optimization
Canadian institutionsQueen's University
Fundersnot available
KeywordsStochastic dominanceIndependent and identically distributed random variablesRobust optimizationDual (grammatical number)Stochastic optimizationOptimization problemNorm (philosophy)Random variablePortfolio

Abstract

fetched live from OpenAlex

Abstract This note provides an initial theoretical justification for how <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>ℓ</m:mi> </m:mrow> <m:mrow> <m:mi>p</m:mi> </m:mrow> </m:msub> </m:math> {\ell }_{p} -norm regularizations can control the non-asymptotic probability of false dominance (FD) classification in empirically optimal portfolios that satisfy empirical stochastic dominance constraints under an independent and identically distributed setting. The analysis employs a dual characterization of the norm-constrained problem as one of distributionally robust optimization, which enables the application of concentration inequalities involving the Wasserstein distance from the empirical distribution. This approach yields explicit upper bounds for the non-asymptotic FD probability, offering insights into the minimal sample size requirements necessary for maintaining this probability below a pre-specified significance level. The results provide a theoretical framework that outlines directions for future extensions to more general settings involving temporally dependent financial time series.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.013
metaresearch head score (Gemma)0.066
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.013
Threshold uncertainty score0.070

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0130.066
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0000.003
Scholarly communication0.0020.003
Open science0.0020.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0020.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.042
GPT teacher head0.339
Teacher spread0.297 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueDemonstratio MathematicaSame topicRisk and Portfolio OptimizationFrench-language works237,207