The Comp-TSSs Scheme for Anomaly Detection in AI-Powered Autonomous Driving
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
Given the vulnerability of vehicular networks to security attacks and the criticality of secure AI-powered autonomous driving, this paper emphasizes the security issue concerning vehicular networks in AI-powered autonomous vehicles. The novel complementary tensor summary statistics named as Comp-TSSs, is proposed for the statistical depiction of discrepancy between normal and abnormal volume instances in vehicular networks. This suggested Comp-TSSs enhances vehicular network security by incorporating reconstruction and regularization statistic terms derived from TPCA, which is extended from PCA through a fresh perspective of fully diagonalizing the covariance tensor. Comp-TSSs effectively captures multi-dimensional correlations in vehicular network volume data, providing complementary measures for representation residuals and weighted distances of instances projected in the principal tensor subspace. Building upon Comp-TSSs, a non-parametric statistic framework is developed for real-time detection of diverse volume anomalies, ensuring the security of AI-powered autonomous driving. The theoretical analyses concerning its detection performance and parameter selection are provided as well. Extensive experiments on synthetic and real-world datasets validate our superior vehicular network security monitoring system for AI-powered autonomous vehicles. It demonstrates higher true positive rates, lower false alarm rates, and minimal detection delays, even when both of the energy and variance anomalies are present.
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.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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