Functional Regression Models via Regularized Radial Basis Function Networks
Bibliographic record
Abstract
Recently, functional data analysis (FDA) has received considerable attention in many fields including climatology, electromyography, and signal processing. A number of successful applications have been reported (see, e.g., Ramsay and Silverman, 1997, 2002). The basic idea behind FDA is to express observed data in the form of a function, and then draw information from a collection of functional data.In this paper, we consider the problem of constructing functional regression models, using radial basis function networks (RBFNs) along with the technique of regularization. RBFNs combine the ideas of basis expansion and kernel smoothing methods, and may be described as a linear combination of radially symmetric nonlinear basis functions. An advantage of our approach to FDA lies in more flexibility transforming observations on each individual into a functional form.In practice, individuals are measured at possibly differing sets of time points, so the amount of smoothness imposed on a set of discrete data could differ among subjects. Hence, in constructing functional regression models there remains the problem of how to determine the number of basis functions and an appropriate value of the regularization parameter. Cross-validation and generalized cross-validation are often referred as in the literature. However, computational effort can be enormous and there can be large variation with a tendency to undersmooth when applied to the analysis of functional data, because the selectors are repeatedly applied.We present an information-theoretic criterion for evaluating models estimated by the method of regularization in the context of functional regression analysis. The proposed criterion is applied to choosing smoothing parameters and the number of basis functions. We analyze a set of data on climate in Canada. Bootstrap simulations were conducted to examine the performance of our modeling technique compared to the classical cross-validation method.
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 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.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".