paper-with-me

홈 › Papers

Cost-Sensitive Reference Pair Encoding for Multi-Label Learning

2016-11-29 · Yao-Yuan Yang, Kuan-Hao Huang, Chih-Wei Chang, Hsuan-Tien Lin

Label space expansion for multi-label classification (MLC) is a methodology that encodes the original label vectors to higher dimensional codes before training and decodes the predicted codes back to the label vectors during testing. The methodology has been demonstrated to improve the performance of MLC algorithms when coupled with off-the-shelf error-correcting codes for encoding and decoding. Nevertheless, such a coding scheme can be complicated to implement, and cannot easily satisfy a common application need of cost-sensitive MLC---adapting to different evaluation criteria of interest. In this work, we show that a simpler coding scheme based on the concept of a reference pair of label vectors achieves cost-sensitivity more naturally. In particular, our proposed cost-sensitive reference pair encoding (CSRPE) algorithm contains cluster-based encoding, weight-based training and voting-based decoding steps, all utilizing the cost information. Furthermore, we leverage the cost information embedded in the code space of CSRPE to propose a novel active learning algorithm for cost-sensitive MLC. Extensive experimental results verify that CSRPE performs better than state-of-the-art algorithms across different MLC criteria. The results also demonstrate that the CSRPE-backed active learning algorithm is superior to existing algorithms for active MLC, and further justify the usefulness of CSRPE.

📄 PDF Abstract BibTeX arXiv:1611.09461

Code (1)

yangarbiter/multilabel-learn 공식 구현

Tasks

Active LearningMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONMulti-Label Learning

Similar Papers 제목 키워드 기반

Correlation-Sensitive Next-Basket Recommendation

2019-08-10 · The Twenty-Eighth International Joint Conference on Artificial Intelligence Conference 2019 8 · Duc-Trong Le, Hady W. Lauw, Yuan Fang

Items adopted by a user over time are indicative of the underlying preferences. We are concerned with learning such preferences from observed sequences of adoptions for recommendation. As multiple items are commonly adop…

Next-basket recommendation

Ada-RS: Adaptive Rejection Sampling for Selective Thinking

2026-02-23 · Yirou Ge, Yixi Li, Alec Chiu, Shivani Shekhar 외 arxiv

Large language models (LLMs) are increasingly being deployed in cost and latency-sensitive settings. While chain-of-thought improves reasoning, it can waste tokens on simple requests. We study selective thinking for tool…

Data Driven Reward Initialization for Preference based Reinforcement Learning

2023-02-17 · Mudit Verma, Subbarao Kambhampati

Preference-based Reinforcement Learning (PbRL) methods utilize binary feedback from the human in the loop (HiL) over queried trajectory pairs to learn a reward model in an attempt to approximate the human's underlying re…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Identity-Consistent Video Generation under Large Facial-Angle Variations

2026-03-22 · Bin Hu, Zipeng Qi, Guoxi Huang, Zunnan Xu 외 arxiv

Single-view reference-to-video methods often struggle to preserve identity consistency under large facial-angle variations. This limitation naturally motivates the incorporation of multi-view facial references. However, …

Video Generation

Rethinking Disparity: A Depth Range Free Multi-View Stereo Based on Disparity

2022-11-30 · Qingsong Yan, Qiang Wang, Kaiyong Zhao, Bo Li 외

Existing learning-based multi-view stereo (MVS) methods rely on the depth range to build the 3D cost volume and may fail when the range is too large or unreliable. To address this problem, we propose a disparity-based MV…

GPU