MétaCan
Menu
Back to cohort
Record W2128808131 · doi:10.1137/060675794

Primal-Dual Symmetric Intrinsic Methods for Finding Antiderivatives of Cyclically Monotone Operators

2007· article· en· W2128808131 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

VenueSIAM Journal on Control and Optimization · 2007
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsMathematicsMonotone polygonOperator (biology)SubderivativeDual (grammatical number)CombinatoricsGraphPure mathematicsDiscrete mathematicsRegular polygonConvex optimization

Abstract

fetched live from OpenAlex

A fundamental result due to Rockafellar states that every cyclically monotone operator A admits an antiderivative f in the sense that the graph of A is contained in the graph of the subdifferential operator $\partial f$. Given a method $\mathfrak{m}$ that assigns every finite cyclically monotone operator A some antiderivative $\mathfrak{m}_A$, we say that the method is primal-dual symmetric if $\mathfrak{m}$ applied to the inverse of A produces the Fenchel conjugate of $\mathfrak{m}_A$. Rockafellar's antiderivatives do not possess this property. Utilizing Fitzpatrick functions and the proximal average, we present novel primal-dual symmetric intrinsic methods. The antiderivatives produced by these methods provide a solution to a problem posed by Rockafellar in 2005. The results leading to this solution are illustrated by various examples.

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.001
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.335
Threshold uncertainty score0.439

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.015
GPT teacher head0.316
Teacher spread0.300 · 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