MétaCan
Menu
Back to cohort
Record W4247716775 · doi:10.23952/jnva.3.2019.3.03

Expanding the applicability of an iterative regularization method for ill-posed problems

2019· article· en· W4247716775 on OpenAlexvenueno aff
Ioannis K. Argyros, Santhosh George

Bibliographic record

VenueJournal of Nonlinear and Variational Analysis · 2019
Typearticle
Languageen
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsnot available
Fundersnot available
KeywordsWell-posed problemRegularization (linguistics)Computer scienceMathematical optimizationMathematicsApplied mathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

An iteratively regularized projection method, which converges quadratically, is considered for stable approximate solutions to a nonlinear ill-posed operator equation F(x) = y, where F : D(F) ⊆ X → X is a nonlinear monotone operator defined on the real Hilbert space X.We assume that only a noisy data y δ with yy δ ≤ δ are available.Under the assumption that the Fréchet derivative F of F is Lipschitz continuous, a choice of the regularization parameter using an adaptive selection of the parameter and a stopping rule for the iteration index using a majorizing sequence are presented.We prove that, under a general source condition on x 0x, the error x h,δ n,αx between the regularized approximation x h,δ n,α , (x h,δ 0,α := P h x 0 , where P h is an orthogonal projection on to a finite dimensional subspace X h of X) and the solution x is of optimal order.

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.002
metaresearch head score (Gemma)0.005
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.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.002
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.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.046
GPT teacher head0.380
Teacher spread0.334 · 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
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Nonlinear and Variational AnalysisSame topicNumerical methods in inverse problemsFrench-language works237,207