MétaCan
Menu
Back to cohort
Record W7107967301 · doi:10.5281/zenodo.17764937

Regularization Strategies for Neural Inverse Problems: A Comparative Study

2025· preprint· W7107967301 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

VenueZenodo (CERN European Organization for Nuclear Research) · 2025
Typepreprint
Language
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsTikhonov regularizationRegularization (linguistics)Inverse problemArtificial neural networkRegularization perspectives on support vector machinesBackus–Gilbert method

Abstract

fetched live from OpenAlex

This work explores preliminary approaches to regularization in neuralinverse problems, where extension to neural operator architecturespresents unique theoretical and computational challenges [1, 3]. Wepropose an exploratory framework for hierarchical regularization thatleverages multi-scale structure, building upon classical Tikhonov theorywhile addressing deep learning model requirements [5, 2]. Preliminaryexperiments on small-scale problems suggest potential advantagesin multi-scale synthetic datasets, though computational overhead remainssubstantial and comprehensive validation against state-of-theartmethods is essential [9, 4]. These ideas may motivate future researchin regularization approaches for neural inverse problems whileidentifying critical validation requirements for practical deployment.

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.004
metaresearch head score (Gemma)0.004
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Scholarly communication, Open science, Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.471
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0050.001
Scholarly communication0.0040.001
Open science0.0040.008
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0060.001

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.190
GPT teacher head0.371
Teacher spread0.181 · 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