MétaCan
Menu
Back to cohort
Record W4413802952 · doi:10.1007/s10957-025-02790-6

Generalized Robust Optimization using the Notion of Set-Valued Probability

2025· article· en· W4413802952 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Optimization Theory and Applications · 2025
Typearticle
Languageen
FieldMathematics
TopicFuzzy Systems and Optimization
Canadian institutionsAcadia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsTheory of computationRobust optimizationMathematical optimizationSet (abstract data type)Applied mathematicsMathematical economicsAlgorithmComputer science

Abstract

fetched live from OpenAlex

We propose a novel concept of robustness grounded in the framework of set-valued probabilities, offering a unified and versatile approach to tackling challenges associated with the statistical estimation of uncertain or unknown probabilities. By employing scalarization techniques for set-valued probabilities, we derive optimality conditions. Additionally, we establish generalized convexity properties and stability conditions, which further underpin the robustness of our approach. This comprehensive framework finds significant applications in areas such as financial portfolio management and risk measure theory, where it provides powerful tools for addressing uncertainty, optimizing decision-making, and ensuring resilience against variability in probabilistic models.

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.002
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.165
Threshold uncertainty score0.365

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
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.047
GPT teacher head0.315
Teacher spread0.268 · 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