What am I allowed to do here?: Online Learning of Context-Specific Norms by Pepper
Social norms support coordination and cooperation in society. With social robots becoming increasingly involved in our society, they also need to follow the social norms of the society. This paper presents a computational framework for learning contexts and the social norms present in a context in an online manner on a robot. The paper utilizes a recent state-of-the-art approach for incremental learning and adapts it for online learning of scenes (contexts). The paper further utilizes Dempster-Schafer theory to model context-specific norms. After learning the scenes (contexts), we use active learning to learn related norms. We test our approach on the Pepper robot by taking it through different scene locations. Our results show that Pepper can learn different scenes and related norms simply by communicating with a human partner in an online manner.
Code (0)
등록된 구현이 없습니다.
Tasks
Active LearningIncremental LearningSimilar Papers 제목 키워드 기반
Detecting Harmful Content On Online Platforms: What Platforms Need Vs. Where Research Efforts Go
The proliferation of harmful content on online platforms is a major societal problem, which comes in many different forms including hate speech, offensive language, bullying and harassment, misinformation, spam, violence…
Abusive LanguageMisinformationBilingual Sexism Classification: Fine-Tuned XLM-RoBERTa and GPT-3.5 Few-Shot Learning
Sexism in online content is a pervasive issue that necessitates effective classification techniques to mitigate its harmful impact. Online platforms often have sexist comments and posts that create a hostile environment,…
Few-Shot LearningTask 2SimOn: A Simple Framework for Online Temporal Action Localization
Online Temporal Action Localization (On-TAL) aims to immediately provide action instances from untrimmed streaming videos. The model is not allowed to utilize future frames and any processing techniques to modify past pr…
Action LocalizationTemporal Action LocalizationEfficient and Robust Algorithms for Adversarial Linear Contextual Bandits
We consider an adversarial variant of the classic $K$-armed linear contextual bandit problem where the sequence of loss functions associated with each arm are allowed to change without restriction over time. Under the as…
Multi-Armed BanditsTrading off Mistakes and Don't-Know Predictions
We discuss an online learning framework in which the agent is allowed to say ``I don't know'' as well as making incorrect predictions on given examples. We analyze the trade off between saying ``I don't know'' and making…