arXiv:1503.01811
Optimally Combining Classifiers Using Unlabeled Data
원문 초록
We develop a worst-case analysis of aggregation of classifier ensembles for binary classification. The task of predicting to minimize error is formulated as a game played over a given set of unlabeled data (a transductive setting), where prior label information is encoded as constraints on the game. The minimax solution of this game identifies cases where a weighted combination of the classifiers can perform significantly better than any single classifier.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLSF - Learning Label Specific Features for Multi-Label Classifcation
Inverse Scene Text Removal
EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements
PatchDEMUX: A Certifiably Robust Framework for Multi-label Classifiers Against Adversarial Patches
LGAR: Zero-Shot LLM-Guided Neural Ranking for Abstract Screening in Systematic Literature Reviews
Rhapsody: A Dataset for Highlight Detection in Podcasts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.