Query-Adaptive Predictive Inference with Partial Labels
원문 초록
The cost and scarcity of fully supervised labels in statistical machine learning encourage using partially labeled data for model validation as a cheaper and more accessible alternative. Effectively collecting and leveraging weakly supervised data for large-space structured prediction tasks thus becomes an important part of an end-to-end learning system. We propose a new computationally-friendly methodology to construct predictive sets using only partially labeled data on top of black-box predictive models. To do so, we introduce "probe" functions as a way to describe weakly supervised instances and define a false discovery proportion-type loss, both of which seamlessly adapt to partial supervision and structured prediction -- ranking, matching, segmentation, multilabel or multiclass classification. Our experiments highlight the validity of our predictive set construction as well as the attractiveness of a more flexible user-dependent loss framework.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Identifiable Structures Helps Avoid Bias in DNN-based Supervised Causal Learning
Meaning Typed Prompting: A Technique for Efficient, Reliable Structured Output Generation
Conformal Structured Prediction
Deep Sketched Output Kernel Regression for Structured Prediction
To be Continuous, or to be Discrete, Those are Bits of Questions
CF-OPT: Counterfactual Explanations for Structured Prediction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.