.png){kind=icon}
.png){kind=icon}
Return
Black-Box Test-Time Ensemble
.png){kind=icon}
PRE
AI
S
Z
C
D
DOI：10.1109/MCI.2025.3624194.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Privacy considerations have become increasingly critical in the deployment of modern machine learning models. To protect sensitive data and reduce storage or transmission costs, many service providers offer trained models via APIs, effectively creating privacy-preserving black-box models. However, evaluating the performance of such models remains to be a significant challenge, especially for downstream tasks lacking labeled data. This paper proposes an unsupervised combination method for black-box test-time ensemble. By utilizing only the models’ predictions on unlabeled test data, the proposed approach estimates the reliability of individual base classifiers and constructs a weighted ensemble that favors more accurate ones. Our approach is compatible with both traditional machine learning classifiers and modern large language models, and accommodates a wide range of scenarios, including binary and multi-class classification, hard and soft outputs, and both offline and online settings. Extensive experiments on 13 real-world text, image, and time series datasets verified the effectiveness and flexibility of the approach, consistently outperforming majority voting and other combination approaches. Notably, the proposed approach is hyperparameter-free and computationally efficient, rendering it well-suited for applications that require online real-time inference.
Keywords:
Time series analysis
Closed box
Semisupervised learning
Rendering (computer graphics)
Reliability engineering
Data models
Robustness
Real-time systems
Computational efficiency
Ensemble learning
Journal
IF:
11.2
Papers:
606
Citations:
3.1K
Organization
Cited Papers