Transductive Optimization of Top k Precision
Consider a binary classification problem in which the learner is given a labeled training set, an unlabeled test set, and is restricted to choosing exactly $k$ test points to output as positive predictions. Problems of this kind---{\it transductive precision@$k$}---arise in information retrieval, digital advertising, and reserve design for endangered species. Previous methods separate the training of the model from its use in scoring the test points. This paper introduces a new approach, Transductive Top K (TTK), that seeks to minimize the hinge loss over all training instances under the constraint that exactly $k$ test instances are predicted as positive. The paper presents two optimization methods for this challenging problem. Experiments and analysis confirm the importance of incorporating the knowledge of $k$ into the learning process. Experimental evaluations of the TTK approach show that the performance of TTK matches or exceeds existing state-of-the-art methods on 7 UCI datasets and 3 reserve design problem instances.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationInformation RetrievalRetrievalSimilar Papers 제목 키워드 기반
Towards Adversarial Robustness via Transductive Learning
There has been emerging interest to use transductive learning for adversarial robustness (Goldwasser et al., NeurIPS 2020; Wu et al., ICML 2020). Compared to traditional "test-time" defenses, these defense mechanisms "dy…
Adversarial RobustnessBilevel OptimizationTransductive LearningInformation-Theoretic Generalization Bounds for Transductive Learning and its Applications
In this paper, we establish generalization bounds for transductive learning algorithms in the context of information theory and PAC-Bayes, covering both the random sampling and the random splitting setting. First, we sho…
Generalization BoundsGraph LearningInductive LearningTransductive LearningTransductive Spiking Graph Neural Networks for Loihi
Graph neural networks have emerged as a specialized branch of deep learning, designed to address problems where pairwise relations between objects are crucial. Recent advancements utilize graph convolutional neural netwo…
Bayesian OptimizationGraph ClassificationHyperparameter OptimizationTowards Evaluating the Robustness of Neural Networks Learned by Transduction
There has been emerging interest in using transductive learning for adversarial robustness (Goldwasser et al., NeurIPS 2020; Wu et al., ICML 2020; Wang et al., ArXiv 2021). Compared to traditional defenses, these defense…
Adversarial RobustnessBilevel OptimizationTransductive LearningEfficient Data Subset Selection to Generalize Training Across Models: Transductive and Inductive Networks
Existing subset selection methods for efficient learning predominantly employ discrete combinatorial and model-specific approaches which lack generalizability. For an unseen architecture, one cannot use the subset chosen…