MétaCan
Menu
Back to cohort
Record W4239187294 · doi:10.23952/asvao.2.2020.2.03

From progressive decoupling of linkages in variational inequalities to fixed-point problems

2020· article· en· W4239187294 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueApplied Set-Valued Analysis and Optimization · 2020
Typearticle
Languageen
FieldEngineering
TopicRobotic Mechanisms and Dynamics
Canadian institutionsnot available
Fundersnot available
KeywordsDecoupling (probability)Fixed pointInequalityMathematicsVariational inequalityFixed-point theoremApplied mathematicsMathematical economicsMathematical analysisEngineeringControl engineering

Abstract

fetched live from OpenAlex

Based on a very recent work by R. T. Rockafellar and the Yosida approximation, we propose a regularization approach of the idea and the associated notions presented in Next, we develop a similar analysis for fixed-point problems. In this setting, we introduce various elicitation notions that permit us to go beyond the limitation of the usual assumptions of the pseudo-contraction or the firm non-expansiveness, and we present the related progressive decoupling algorithms. Their convergence properties are investigated under global elicitability assumptions and an application to decomposition and splitting problems is also briefly mentioned.

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.000
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: none
Teacher disagreement score0.580
Threshold uncertainty score0.495

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.013
GPT teacher head0.219
Teacher spread0.206 · 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