Gaussian Process Modeling and Supervised Dimensionality Reduction Algorithms via Stiefel Manifold Learning
Bibliographic record
Abstract
Much research has gone into scaling up classical machine learning algorithms such as\nGaussian Processes (GPs), but the curse of dimensionality still remains. While many\nsupervised dimensionality reduction algorithms have been proposed in the literature, few\nof them can scale up to large data-sets. Furthermore, the majority of dimensionality\nreduction techniques are tailored for classication problems, which leaves regression tasks\nunexplored. The contributions of this thesis are threefold. First, we extend classical active\nsubspace (AS) theory to a non-linear counterpart. Secondly, we introduce a scalable non\nlinear supervised principal component analysis (SPCA) algorithm. Thirdly, we propose a\nnovel class of supervised dimensionality reduction algorithms called smoothening analysis\n(SA). The SA algorithms consist of scalable linear and non-linear frequentist and Bayesian\nalgorithms tailored (but not limited) for regression tasks that learn low dimensional Stiefel\nmanifolds.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".