A Dai-Liao-like projection method for solving convex constrained nonlinear monotone equations and minimizing the $\ell_1$-regularized problem
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.
Bibliographic record
Abstract
In this paper, a three-term derivative-free method for solving a nonlinear system of equations with convex constraints is proposed. In addition, by reformulating an 1 -regularized problem into a nonlinear system of equations, the proposed method is applicable to solving signal recovery and image deblurring problems. Our method is based on the projection technique of Solodov and Svaiter (1998) by incorporating a quasi-Newton-like direction with the Dai-Liao conjugate gradient parameter. The proposed method is matrix-free and the search direction satisfies a certain descent condition. Under the assumption that the underlying function is monotone and Lipschitzian, the global convergence of the proposed method is established. Preliminary numerical experiments on some large-scale nonlinear system of equations with convex constraints show that the proposed method is efficient. Furthermore, we apply the proposed method to the 1 -regularization problem in compressive sensing.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it