arXiv:2608. 15084v1 Announce Type: cross Abstract: Test-time augmentation (TTA) has proven effective for improving model robustness and uncertainty estimation in computer vision, yet its application to graph-structured data remains largely unexplored.
arXiv:2608.28923v1 Announce Type: cross Abstract: Data augmentation is a cornerstone of deep learning pipelines, yet existing strategies treat it as a static, model-agnostic preprocessing step, eithe...
arXiv:2609.06154v1 Announce Type: new Abstract: One-shot federated graph learning generally aims to train Graph Neural Networks (GNNs) across clients with disconnected subgraphs in a single communica...
arXiv:2609.14045v1 Announce Type: new Abstract: Agentic learning systems are often required to adapt after deployment by observing new data and reusing prior knowledge under limited supervision or fe...
arXiv:2510. 12624v2 Announce Type: replace-cross Abstract: Active feature acquisition (AFA) is a sequential decision-making problem where the goal is to improve model performance for test instances by adaptively selecting which features to acquire.
arXiv:2606. 06943v1 Announce Type: cross Abstract: Vision-language models (VLMs) such as CLIP achieve strong zero-shot recognition but remain highly fragile under adversarial perturbations.
arXiv:2609.10311v1 Announce Type: cross Abstract: The lottery ticket hypothesis posits the existence of winning tickets: sparse subnetworks that, when trained in isolation from their original initial...
arXiv:2601. 07965v2 Announce Type: replace Abstract: When a model knows when it does not know, many possibilities emerge.
arXiv:2609.39673v1 Announce Type: new Abstract: Can a pretrained graph model replace training and tuning a separate predictor for each dataset? Answering this requires evaluating prediction quality a...
arXiv:2503. 22998v2 Announce Type: replace-cross Abstract: Despite advancements in Graph Neural Networks (GNNs), adaptive attacks continue to challenge their robustness.
arXiv:2605. 30188v2 Announce Type: replace-cross Abstract: Reliable probability estimates are critical in many machine learning applications, yet modern classifiers are often poorly calibrated.
arXiv:2606. 06397v1 Announce Type: new Abstract: Current evaluation practices in relational learning rely heavily on flat leaderboards that average performance across heterogeneous datasets, implicitly assuming a uniform underlying structure.
The paper introduces an uncertainty‑driven training framework for 3D CT lung nodule classification that uses validation‑based uncertainty estimates to reweight the loss, aiming to improve predictive performance and probability calibration. Two uncertainty quantification methods—Monte Carlo Dropout and Evidential Deep Learning—are evaluated across multiple backbone architectures (ResNet, DenseNet, EfficientNet, ViT, Swin) on the LIDC‑IDRI and NoduleMNIST3D datasets. The approach yields comparable classification accuracy to conventional training while substantially reducing expected calibration error, especially on convolutional backbones, and shows that simple temperature scaling can also achieve strong calibration.