提出新方法筛选零样本学习中的关键语义属性,提升模型对未知类别的识别能力。
Semantic-Inductive Attribute Selection for Zero-Shot Learning
- 设计诱导式划分方案,在无未见类信息下评估属性相关性
- 两种策略协同:嵌入式选择高效,进化算法更全面,均降低冗余
- 在5个基准数据集上显著提升未见类别准确率,适合开放世界应用
零样本学习是通用人工智能系统在开放世界中动态适应新任务的重要范式。语义空间在连接已见与未见类别中起关键作用,但常包含噪声、冗余或无关属性,影响性能。为此,本文提出一种划分机制,模拟诱导设定下的未见条件,使属性相关性可在不依赖未见类语义信息的情况下评估。在此框架内,研究两种互补的特征选择策略:其一将嵌入式特征选择适配至ZSL需求,将模型驱动排序转化为有意义的语义剪枝;其二利用进化计算直接广泛探索属性子集空间。在五个基准数据集(AWA2, CUB, SUN, aPY, FLO)上的实验表明,两种方法均通过减少冗余一致提升了未见类准确率,且互补:RFS效率高、表现佳但依赖关键超参数,而GA代价更高但搜索更广、不受此类依赖影响。结果证实语义空间天然冗余,并验证了所提划分机制在诱导条件下有效精炼语义空间的能力。
原文摘要 · Abstract (English)
Zero-Shot Learning is an important paradigm within General-Purpose Artificial Intelligence Systems, particularly in those that operate in open-world scenarios where systems must adapt to new tasks dynamically. Semantic spaces play a pivotal role as they bridge seen and unseen classes, but whether human-annotated or generated by a machine learning model, they often contain noisy, redundant, or irrelevant attributes that hinder performance. To address this, we introduce a partitioning scheme that simulates unseen conditions in an inductive setting (which is the most challenging), allowing attribute relevance to be assessed without access to semantic information from unseen classes. Within this framework, we study two complementary feature-selection strategies and assess their generalisation. The first adapts embedded feature selection to the particular demands of ZSL, turning model-driven rankings into meaningful semantic pruning; the second leverages evolutionary computation to directly explore the space of attribute subsets more broadly. Experiments on five benchmark datasets (AWA2, CUB, SUN, aPY, FLO) show that both methods consistently improve accuracy on unseen classes by reducing redundancy, but in complementary ways: RFS is efficient and competitive though dependent on critical hyperparameters, whereas GA is more costly yet explores the search space more broadly and avoids such dependence. These results confirm that semantic spaces are inherently redundant and highlight the proposed partitioning scheme as an effective tool to refine them under inductive conditions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。