Dynamic level set regularization for large distributed parameter estimation problems
Bibliographic record
Abstract
This paper considers inverse problems of shape recovery from noisy boundary data, where the forward problem involves the inversion of elliptic PDEs. The piecewise constant solution, a scaling and translation of a characteristic function, is described in terms of a smoother level set function. A fast and simple dynamic regularization method has been recently proposed that has a robust stopping criterion and typically terminates after very few iterations. Direct linear algebra methods have been used for the linear systems arising in both forward and inverse problems, which is suitable for problems of moderate size in 2D. For larger problems, especially in 3D, iterative methods are required. In this paper we extend our previous results to large-scale problems by proposing and investigating iterative linear system solvers in the present context. Perhaps contrary to one's initial intuition, the iterative methods are particularly useful for the inverse rather than the forward linear systems. Moreover, only very few preconditioned conjugate gradient iterations are applied towards the solution of the linear system for the inverse problem, allowing the regularizing effects of such iterations to take centre stage. The efficacy of the obtained method is demonstrated.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".