MétaCan
Menu
Back to cohort
Record W3217437752 · doi:10.1063/5.0075412

Computing vibrational energy levels by solving linear equations using a tensor method with an imposed rank

2021· article· en· W3217437752 on OpenAlexafffund
Sangeeth Das Kallullathil, Tucker Carrington

Bibliographic record

VenueThe Journal of Chemical Physics · 2021
Typearticle
Languageen
FieldMathematics
TopicTensor decomposition and applications
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRank (graph theory)Tensor (intrinsic definition)Basis (linear algebra)OrthogonalizationApplied mathematicsMathematicsBasis functionHamiltonian (control theory)Realization (probability)Tensor productAlgorithmMathematical analysisMathematical optimizationPure mathematicsCombinatoricsGeometry

Abstract

fetched live from OpenAlex

Present day computers do not have enough memory to store the high-dimensional tensors required when using a direct product basis to compute vibrational energy levels of a polyatomic molecule with more than about five atoms. One way to deal with this problem is to represent tensors using a tensor format. In this paper, we use the canonical polyadic (CP) format. Energy levels are computed by building a basis from vectors obtained by solving linear equations. The method can be thought of as a CP realization of a block inverse iteration method with multiple shifts. The CP rank of the tensors is fixed, and the linear equations are solved with an method. There is no need for rank reduction and no need for orthogonalization, and tensors with a rank larger than the fixed rank used to solve the linear equations are never generated. The ideas are tested by computing vibrational energy levels of a 64-D bilinearly coupled model Hamiltonian and of acetonitrile (12-D).

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.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
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.078
GPT teacher head0.360
Teacher spread0.282 · 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 designSimulation or modeling
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

Citations10
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueThe Journal of Chemical PhysicsSame topicTensor decomposition and applicationsFrench-language works237,207