Reproducing Kernel-Based Semiparametric Functional Smoothed Score Estimation with Binary Responses
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.
Bibliographic record
Abstract
Functional data classification has gained increasing utility in the modern statistical learning era. In this article, we investigate the generalization ability and the Fisher consistency of the smoothed score (SS) classifier on the intrinsic infinite-dimensional functional data both theoretically and numerically. Formulating the empirical risk minimization based on a regularized smoothed non-convex loss function, we first establish a rigorous error bound on the misclassification rate. The theoretical results reveal a trade-off between the choice of a tuning parameter and the size of a candidate function class. Additionally, a nonregular convergence rate of the SS estimation is derived in L2 norm that aligns with hn−(1−ν)n−μ2(μ+1), as the bandwidth hn of the smoothed loss is shrunk to 0. By projecting the functional data onto one specific direction over a reproducing kernel Hilbert space where the estimated function is expected to deliver desirable performance, we address the problem of slope function estimation. Computationally, we tackle the nonconvex optimization by developing an efficient proximal gradient algorithm. Finally, the finite sample results in simulation studies as well as a real data analysis from the ADNI study demonstrate the favorable performance of the proposed method compared with some popular classifiers in terms of prediction and estimation.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it