MétaCan
Menu
Back to cohort
Record W2953839957 · doi:10.1142/s2010326321500386

Finite free convolutions via Weingarten calculus

2020· preprint· en· W2953839957 on OpenAlexaff
Jacob Campbell, Zhi Yin

Bibliographic record

VenueRandom Matrices Theory and Application · 2020
Typepreprint
Languageen
FieldMathematics
TopicRandom Matrices and Applications
Canadian institutionsUniversity of Waterloo
FundersNational Natural Science Foundation of China
KeywordsMathematicsUnitary statePermutation (music)Equivalence (formal languages)Convolution (computer science)Pure mathematicsOrthogonal polynomialsQuadrature (astronomy)Unitary matrixAlgebra over a fieldComputer science

Abstract

fetched live from OpenAlex

We consider the three finite free convolutions for polynomials studied in a recent paper by Marcus, Spielman and Srivastava. Each can be described either by direct explicit formulae or in terms of operations on randomly rotated matrices. We present an alternate approach to the equivalence between these descriptions, based on combinatorial Weingarten methods for integration over the unitary and orthogonal groups. A key aspect of our approach is to identify a certain quadrature property, which is satisfied by some important series of subgroups of the unitary groups (including the groups of unitary, orthogonal, and signed permutation matrices), and which yields the desired convolution formulae.

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.001
metaresearch head score (Gemma)0.003
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.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.020
GPT teacher head0.291
Teacher spread0.271 · 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
GenreEmpirical

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

Citations1
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueRandom Matrices Theory and ApplicationSame topicRandom Matrices and ApplicationsFrench-language works237,207