论文标题

接下来的预测符合隐式互动时,接下来是什么?

What is Next when Sequential Prediction Meets Implicitly Hard Interaction?

论文作者

Hu, Kaixi, Li, Lin, Xie, Qing, Liu, Jianquan, Tao, Xiaohui

论文摘要

源序列及其下一个目标之间的硬互动学习具有挑战性,这存在于无数的顺序预测任务中。在培训过程中,大多数现有的方法都集中在错误的响应中引起的明确互动。但是,模型可以通过捕获可学习模式的子集来进行正确的响应,从而导致与某些未经学习的模式隐含地相互作用。因此,其概括性能削弱了。由于实质性相似候选目标的干扰,该问题在顺序预测中变得更加严重。 为此,我们提出了一个硬度意识到的交互学习框架(冰雹),该框架主要由两个基本的顺序学习网络和相互的排他性蒸馏(MED)组成。基本网络的初始化不同以学习独特的视图模式,从而获得了不同的培训经验。 MED彼此绘制了不可能的正确响应形式的经验,这提供了相互的排他性知识,以弄清隐式的硬相互作用。此外,我们推断出的不可能实质地引入了其他梯度来推动正确响应的模式学习。我们的框架很容易扩展到更多的同行基础网络。评估是在涵盖网络和物理空间的四个数据集上进行的。实验结果表明,我们的框架在基于TOP-K的指标方面优于几种最先进的方法。

Hard interaction learning between source sequences and their next targets is challenging, which exists in a myriad of sequential prediction tasks. During the training process, most existing methods focus on explicitly hard interactions caused by wrong responses. However, a model might conduct correct responses by capturing a subset of learnable patterns, which results in implicitly hard interactions with some unlearned patterns. As such, its generalization performance is weakened. The problem gets more serious in sequential prediction due to the interference of substantial similar candidate targets. To this end, we propose a Hardness Aware Interaction Learning framework (HAIL) that mainly consists of two base sequential learning networks and mutual exclusivity distillation (MED). The base networks are initialized differently to learn distinctive view patterns, thus gaining different training experiences. The experiences in the form of the unlikelihood of correct responses are drawn from each other by MED, which provides mutual exclusivity knowledge to figure out implicitly hard interactions. Moreover, we deduce that the unlikelihood essentially introduces additional gradients to push the pattern learning of correct responses. Our framework can be easily extended to more peer base networks. Evaluation is conducted on four datasets covering cyber and physical spaces. The experimental results demonstrate that our framework outperforms several state-of-the-art methods in terms of top-k based metrics.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源