MétaCan
Menu
Back to cohort
Record W4388288498 · doi:10.5206/mt.v3i3.16450

On the conditioning of some structured generalized eigenvalue problems

2023· article· en· W4388288498 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

VenueMaple Transactions · 2023
Typearticle
Languageen
FieldMathematics
TopicStatistical and numerical algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsEigenvalues and eigenvectorsMathematicsToeplitz matrixApplied mathematicsInterpolation (computer graphics)Exponential functionAlgebra over a fieldPure mathematicsMathematical analysisComputer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

This work continues the analysis of the conditioning of a Hankel structured generalized eigenvalue problem (GEP) started in [1]. The considered generalized eigenvalue problem appears in exponential analysis and sparse interpolation. We generalize the proof in [1] and add expressions for the relative condition numbers of two reformulations of the GEP, a reformulation as a Loewner GEP valid for general complex data, and a compression to a Hankel+Toeplitz GEP in the case of real data. Both reformulations are compared to the original Hankel GEP. The analysis is concluded with ample numerical illustrations.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.797
Threshold uncertainty score0.999

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.000
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.0020.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.065
GPT teacher head0.306
Teacher spread0.241 · 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