arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.00904cs.ROcs.AIcs.LG
收藏

弱监督对应学习

Weakly Supervised Correspondence Learning

Stanford University(斯坦福大学)

Zihan Wang, Zhangjie Cao, Yilun Hao, Dorsa Sadigh

摘要:

对应学习是机器人学中的一个基本问题,其目的是学习不同动力学或实施例的智能体的状态、动作对之间的映射。然而,目前的对应学习方法要么利用严格配对的数据(通常难以收集),要么使用正则化技术(如循环一致性)以无监督的方式从未配对的数据中学习,这会导致严重的错位问题。我们提出了一种弱监督的对应学习方法,在严格配对数据的强监督和非配对数据的正则化的无监督学习之间进行权衡。我们的想法是利用两种类型的弱监督:i)状态和动作的时间排序,以减少复合错误,ii)配对的抽象,而不是配对的数据,以减轻错位问题,并学习更准确的对应关系。这两种类型的弱监督在现实世界的应用中很容易访问,同时降低了注释严格配对数据的高成本,并提高了学习的对应关系的质量。

英文摘要:

Correspondence learning is a fundamental problem in robotics, which aims to learn a mapping between state, action pairs of agents of different dynamics or embodiments. However, current correspondence learning methods either leverage strictly paired data -- which are often difficult to collect -- or learn in an unsupervised fashion from unpaired data using regularization techniques such as cycle-consistency -- which suffer from severe misalignment issues. We propose a weakly supervised correspondence learning approach that trades off between strong supervision over strictly paired data and unsupervised learning with a regularizer over unpaired data. Our idea is to leverage two types of weak supervision: i) temporal ordering of states and actions to reduce the compounding error, and ii) paired abstractions, instead of paired data, to alleviate the misalignment problem and learn a more accurate correspondence. The two types of weak supervision are easy to access in real-world applications, which simultaneously reduces the high cost of annotating strictly paired data and improves the quality of the learned correspondence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑