MétaCan
Menu
Back to cohort
Record W4246031020 · doi:10.32920/ryerson.14654985.v1

Adaptive vector greedy splitting algorithm

2021· preprint· en· W4246031020 on OpenAlexaff
Evgeny Klavir

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsOrthonormal basisHaar waveletComputer scienceGreedy algorithmAlgorithmGreedy randomized adaptive search procedureDigital signal processingMATLABWaveletSignal processingSIGNAL (programming language)Basis (linear algebra)Wavelet transformDiscrete wavelet transformMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

We introduce a new transform through a construction that we have called the Adaptive Vector Greedy Splitting algorithm. The main idea behind this algorithm is an optimization step based on the simple Bathtub Principle. We use the Vector Greedy Splitting algorithm to build orthonormal bases for a given vector of random variables (also called signals). A particular basis constructed in this way may be used for signal coompression, audio pattern recognition and other applications of signal processing. We compare performance of the Vector Greedy Splitting algorithm with the Haar wavelet transform applied to the same vector of input signals. The implementation of the algorithms and statistics accumulation are made using the ANSI C computer language and Matlab. The work uses advanced methods of Computer Engineering and Digital Signal Processing.

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 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 categoriesMeta-epidemiology (narrow), Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.968
Threshold uncertainty score1.000

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.001
Open science0.0030.014
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.030
GPT teacher head0.287
Teacher spread0.258 · 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 teacher head, not a consensus.

Study designOther design
Domainnot available
GenreMethods

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

Citations0
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207