Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kerry He

dblp:262/3480 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0003-4052-969XORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Information theory · 41% Mathematical optimization · 41% Quantum computing and quantum information · 12%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › channel capacity
blahut-arimoto algorithm
0.812024
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms · IEEE Trans. Inf. Theory 2024
Information theory
channel capacity
0.812024
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms · IEEE Trans. Inf. Theory 2024
Mathematical optimization › continuous optimization
convex optimization
0.812024
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms · IEEE Trans. Inf. Theory 2024
Mathematical optimization › continuous optimization › convex optimization › first-order methods
mirror descent
0.812024
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms · IEEE Trans. Inf. Theory 2024
Human-robot interaction › physical human-robot interaction › object handover
human-to-robot handover
0.712023
Crafting with a Robot Assistant: Use Social Cues to Inform Adaptive Handovers in Human-Robot Collaboration · HRI 2023
Quantum computing and quantum information
quantum information theory
0.212024
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms · IEEE Trans. Inf. Theory 2024
Coding theory › source coding
rate-distortion theory
0.212024
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms · IEEE Trans. Inf. Theory 2024
Quantum computing and quantum information › entanglement measures
relative entropy of entanglement
0.212024
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms · IEEE Trans. Inf. Theory 2024
Human-robot interaction
human-robot collaboration
0.212023
Crafting with a Robot Assistant: Use Social Cues to Inform Adaptive Handovers in Human-Robot Collaboration · HRI 2023

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

mirror descent · 0.8convex analysis · 0.8bregman proximal method · 0.8
YearPublicationVenuePosition
2025 Evaluating Human-Robot Collaboration through Online Video: Perspective Matters
abstract
Online evaluation is increasingly adopted in robotics research, providing an efficient approach to collect data from large and diverse populations. However, there have been ongoing debates about online studies as a proxy for in-person studies, especially where a participant passively observes video of robot behaviours or interaction. We conduct an online video comparison study (N=178) evaluating three robot handover policies in a collaborative assembly task, namely an adaptive autonomous policy, a non-adaptive scripted policy, and teleoperation. Participants watched three sets of videos in third-person view, each consisting of 9 sequential handovers executing one of the policies. Compared to in-person participants in two previous studies who evaluated handovers as users, online participants were observant of different robot behaviours and human-robot collaboration contexts, with 76.4% and 71.9% recognising the adaptive handovers exhibited by the teleoperated and autonomous robot, respectively. However, as observers, online participants showed more critical subjective perceptions compared to the in-person participants with a user’s perspective. They valued efficiency over adaptation with twice more autonomous handovers rated as being too late compared to scripted handovers. Our work highlights the need to consider user contexts when evaluating human-robot collaboration.
Leimin Tian, Kerry He, Rachel Love, Akansel Cosgun, Dana Kulic
IROS3
2024 A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms
abstract
The Blahut-Arimoto algorithm is a well-known method to compute classical channel capacities and rate-distortion functions. Recent works have extended this algorithm to compute various quantum analogs of these quantities. In this paper, we show how these Blahut-Arimoto algorithms are special instances of mirror descent, which is a type of Bregman proximal method, and a well-studied generalization of gradient descent for constrained convex optimization. Using recently developed convex analysis tools, we show how analysis based on relative smoothness and strong convexity recovers known sublinear and linear convergence rates for Blahut-Arimoto algorithms. This Bregman proximal viewpoint allows us to derive related algorithms with similar convergence guarantees to solve problems in information theory for which Blahut-Arimoto-type algorithms are not directly applicable. We apply this framework to compute energy-constrained classical and quantum channel capacities, classical and quantum rate-distortion functions, and approximations of the relative entropy of entanglement, all with provable convergence guarantees.
Kerry He, James Saunderson, Hamza Fawzi
IEEE Trans. Inf. Theory1
2023 Crafting with a Robot Assistant: Use Social Cues to Inform Adaptive Handovers in Human-Robot Collaboration
abstract
We study human-robot handovers in a naturalistic collaboration scenario, where a mobile manipulator robot assists a person during a crafting session by providing and retrieving objects used for wooden piece assembly (functional activities) and painting (creative activities). We collect quantitative and qualitative data from 20 participants in a Wizard-of-Oz study, generating the Functional And Creative Tasks Human-Robot Collaboration dataset (the FACT HRC dataset), available to the research community. This work illustrates how social cues and task context inform the temporal-spatial coordination in human-robot handovers, and how human-robot collaboration is shaped by and in turn influences people's functional and creative activities.
Leimin Tian, Kerry He, Akansel Cosgun, Dana Kulic
HRI2
2022 On-The-Go Robot-to-Human Handovers with a Mobile Manipulator
abstract
Existing approaches to direct robot-to-human handovers are typically implemented on fixed-base robot arms, or on mobile manipulators that come to a full stop before performing the handover. We propose "on-the-go" handovers which permit a moving mobile manipulator to hand over an object to a human without stopping. The on-the-go handover motion is generated with a reactive controller that allows simultaneous control of the base and the arm. In a user study, human receivers subjectively assessed on-the-go handovers to be more efficient, predictable, natural, better timed and safer than handovers that implemented a "stop-and-deliver" behavior.
Kerry He, Pradeepsundar Simini, Wesley P. Chan, Dana Kulic, Elizabeth A. Croft, Akansel Cosgun
RO-MAN1