Gaussian Filtering Using a Spherical-Radial Double Exponential Cubature
Bibliographic record
Abstract
Gaussian filters use quadrature rules or cubature rules to recursively solve Gaussian-weighted integrals. Classical and contemporary methods use stable rules with a minimal number of cubature points to achieve the highest accuracy. Gaussian quadrature is widely believed to be optimal due to its polynomial degree of exactness and higher degree cubature methods often require complex optimization to solve moment equations. In this paper, Gaussian-weighted integrals and Gaussian filtering are approached using a double exponential (DE) transformation and thetrapezoidal rule. The DE rule is principled in high rates of convergence for certain integrands and the DE transform ensures that the trapezoidal rule maximizes its performance. A novel spherical-radial cubature rule is derived for Gaussian-weighted integrals where it is shown to be perfectly stable and highly efficient. A new Gaussian filter is then built on top of this cubature rule. The filter is shown to be stable with bounded estimation error. The effect of varying the number of cubature points on filter stability and convergence is also examined. The advantages of the DE method over comparable Gaussian filters and their cubature methods are outlined. These advantages are realized in two numerical examples: a challenging non-polynomial integral and a benchmark filtering problem. The results show that simple and fundamental cubature methods can lead to great improvements in performance when applied correctly.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".