Matthew Bennice

dblp:313/2258 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0009-3294-4659ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 71% Learning theory · 18% Transfer learning and domain adaptation · 11%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
0.712023
Jump-Start Reinforcement Learning · ICML 2023
Machine learning › Reinforcement learning
imitation learning
0.712023
Practical Visual Deep Imitation Learning via Task-Level Domain Consistency · ICRA 2023
Machine learning › Reinforcement learning
policy initialization
0.712023
Jump-Start Reinforcement Learning · ICML 2023
Machine learning › Learning theory
sample complexity
0.712023
Jump-Start Reinforcement Learning · ICML 2023
Machine learning › Reinforcement learning › imitation learning › learning from observation
visual imitation learning
0.712023
Practical Visual Deep Imitation Learning via Task-Level Domain Consistency · ICRA 2023
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.212023
Practical Visual Deep Imitation Learning via Task-Level Domain Consistency · ICRA 2023
Machine learning › Transfer learning and domain adaptation
sim-to-real transfer
0.212023
Practical Visual Deep Imitation Learning via Task-Level Domain Consistency · ICRA 2023

Methods — techniques the papers use, named apart from their topics

task consistency loss · 0.7self-supervised learning · 0.7offline data · 0.7imitation learning · 0.7guide policy · 0.7generative adversarial network · 0.7demonstration · 0.7
YearPublicationVenuePosition
2026 Interactive Multi-Robot Flocking with Gesture Responsiveness and Musical Accompaniment
abstract
For decades, robotics researchers have pursued various tasks for multi-robot systems, from cooperative manipulation to search and rescue. These tasks are multi-robot extensions of classical robotic tasks and often optimized on dimensions such as speed or efficiency. As robots transition from commercial and research settings into everyday environments, social task aims such as engagement or entertainment become increasingly relevant. This work presents a designerly contribution—building a multi-robot task in which the main aim is to enthrall and interest. In this task, the goal is for a human to be drawn to move alongside and participate in a dynamic, expressive robot flock. Towards this aim, the research team created algorithms for robot movements and engaging interaction modes such as gestures and sound. The contributions are as follows: (1) a novel group navigation algorithm involving human and robot agents, (2) a gesture responsive algorithm for real-time, human–robot flocking interaction, (3) a weight mode characterization system for modifying flocking behavior, and (4) a method of encoding a choreographer’s preferences inside a dynamic, adaptive, learned system. An experiment was performed to understand individual human behavior while interacting with the flock under three conditions: weight modes selected by a human choreographer, a learned model, or subset list. Results from the experiment indicated that the perception of the experience was not influenced by the weight mode selection. This work elucidates how differing task aims such as engagement manifest in multi-robot system design and execution, and broadens the domain of multi-robot tasks.
Catie Cuan, Kyle Jeffrey, Kim Kleiven, Adrian Li-Bell, Emre Fisher, Matt Harrison, Benjie Holson, Allison M. Okamura, Matthew Bennice
ACM Trans. Hum. Robot Interact.9
2023 Jump-Start Reinforcement Learning
abstract
Reinforcement learning (RL) provides a theoretical framework for continuously improving an agent’s behavior via trial and error. However, efficiently learning policies from scratch can be very difficult, particularly for tasks that present exploration challenges. In such settings, it might be desirable to initialize RL with an existing policy, offline data, or demonstrations. However, naively performing such initialization in RL often works poorly, especially for value-based methods. In this paper, we present a meta algorithm that can use offline data, demonstrations, or a pre-existing policy to initialize an RL policy, and is compatible with any RL approach. In particular, we propose Jump-Start Reinforcement Learning (JSRL), an algorithm that employs two policies to solve tasks: a guide-policy, and an exploration-policy. By using the guide-policy to form a curriculum of starting states for the exploration-policy, we are able to efficiently improve performance on a set of simulated robotic tasks. We show via experiments that it is able to significantly outperform existing imitation and reinforcement learning algorithms, particularly in the small-data regime. In addition, we provide an upper bound on the sample complexity of JSRL and show that with the help of a guide-policy, one can improve the sample complexity for non-optimism exploration methods from exponential in horizon to polynomial.
Ikechukwu Uchendu, Ted Xiao, Yao Lu 0006, Banghua Zhu, Mengyuan Yan, Joséphine Simon, Matthew Bennice, Chuyuan Fu, Cong Ma 0001, Jiantao Jiao, Sergey Levine, Karol Hausman
ICML7
2023 Practical Visual Deep Imitation Learning via Task-Level Domain Consistency
abstract
Recent work in visual end-to-end learning for robotics has shown the promise of imitation learning across a variety of tasks. Such approaches are however expensive both because they require large amounts of real world data and rely on time-consuming real-world evaluations to identify the best model for deployment. These challenges can be mitigated by using simulation evaluations to identify high performing policies. However, this introduces the well-known “reality gap” problem, where simulator inaccuracies decorrelate performance in simulation from that of reality. In this paper, we build on top of prior work in GAN-based domain adaptation and introduce the notion of a Task Consistency Loss (TCL), a self-supervised loss that encourages sim and real alignment both at the feature and action-prediction levels. We demonstrate the effectiveness of our approach by teaching a 9-DoF mobile manipulator to perform the challenging task of latched door opening purely from visual inputs such as RGB and depth images. We achieve 69% success across twenty seen and unseen meeting rooms using only ~ 16.2 hours of teleoperated demonstrations in sim and real. To the best of our knowledge, this is the first work to tackle latched door opening from a purely end-to-end learning approach, where the task of navigation and manipulation are jointly modeled by a single neural network.
Mohi Khansari, Daniel Ho, Armando Fuentes, Matthew Bennice, Nicolas Sievers, Sean Kirmani, Eric Jang
ICRA5