Transductive Learning with Multi-class Volume Approximation
원문 초록
Given a hypothesis space, the large volume principle by Vladimir Vapnik prioritizes equivalence classes according to their volume in the hypothesis space. The volume approximation has hitherto been successfully applied to binary learning problems. In this paper, we extend it naturally to a more general definition which can be applied to several transductive problem settings, such as multi-class, multi-label and serendipitous learning. Even though the resultant learning method involves a non-convex optimization problem, the globally optimal solution is almost surely unique and can be obtained in O(n^3) time. We theoretically provide stability and error analyses for the proposed method, and then experimentally show that it is promising.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Few-shot Novel Category Discovery
Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement
Accurate and Scalable Graph Neural Networks via Message Invariance
Single-View Graph Contrastive Learning with Soft Neighborhood Awareness
Predictive Insights into LGBTQ+ Minority Stress: A Transductive Exploration of Social Media Discourse
UMFC: Unsupervised Multi-Domain Feature Calibration for Vision-Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.