Author
Listed:
- Prudvi Saisaran Ponduru
- Pavani Priya Vyshnavi Nandanavanam
- Sai Kesav Kumar Ponduru
Abstract
Test-time adaptation (TTA) can improve predictions after deployment, but the update itself can become a new failure mode when unlabeled streams are transient, contaminated, imbalanced, or recurrent. We introduce TRUST-ADAPT, a risk-gated TTA algorithm that treats adaptation as a reversible intervention rather than a default response. A frozen source model converts confidence nonconformity into split-conformal p-values; a batch-level Hoeffding gate triggers learning only when the fraction of anomalous samples exceeds a finite-sample threshold. Triggered batches are further filtered by predictive uncertainty, adapted with pseudo-label and entropy objectives regularized by an immutable source anchor and selective class-balanced memory, and accepted only if an anchor-risk validation check passes; otherwise the parameters are rolled back. Under super-uniform conformal p-values and conditional within-batch independence, the gate controls the probability of a false adaptation trigger at a user-specified level. We implement the complete procedure in PyTorch and execute a locked five-seed controlled benchmark on streaming digit classification with abrupt, recurring, and 15% contaminated shifts. Across 15 seed-scenario pairs, TRUST-ADAPT improves mean streaming accuracy over the frozen source by 3.20 percentage points (Holm-adjusted Wilcoxon p=0.0039) while using 49.8 update batches on average versus 90.0 for TENT-style adaptation. The method is particularly competitive under contamination, but recurring shifts remain a limitation. All reported values are generated by the accompanying executable code; no unexecuted numerical result is claimed.
Suggested Citation
Prudvi Saisaran Ponduru & Pavani Priya Vyshnavi Nandanavanam & Sai Kesav Kumar Ponduru, 2025.
"TRUST-ADAPT: Risk-Gated Reversible Test-Time Learning with Conformal Shift Evidence and Selective Memory,"
International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 11(2), pages 4011-4028, March.
Handle:
RePEc:jbh:ijsrcs:v11:y2025:i2:id:2156
DOI: 10.32628/CSEIT25113445
Note: Article URL: https://ijsrcseit.com/home/article/view/CSEIT25113445
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v11:y2025:i2:id:2156. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (email available below). General contact details of provider: https://ijsrcseit.com/home .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.