Demo Data from EDBT 2026 / reviewers in the wild / expert
Mengxi Li
dblp:209/9814
· DBLP profile ↗
5ranked-venue papers
3as first author
3since 2021 · last 2023
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 2 since 2021Systems, architecture and hardware · 3 · 3 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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
3 papers |
Reinforcement learning · 37% Learning paradigms · 21% Language models and text generation · 21% | |
| Human-computer interaction and pervasive computing
1 paper |
Human-robot interaction · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot manipulation
contact-rich manipulation |
0.7 | 1 | 2023 | Learning Tool Morphology for Contact-Rich Manipulation Tasks with Differentiable Simulation · ICRA 2023 |
Machine learning › Reinforcement learning
differentiable simulation |
0.7 | 1 | 2023 | Learning Tool Morphology for Contact-Rich Manipulation Tasks with Differentiable Simulation · ICRA 2023 |
Natural language and speech › Language models and text generation › LLM agents
tool use |
0.7 | 1 | 2023 | Learning Tool Morphology for Contact-Rich Manipulation Tasks with Differentiable Simulation · ICRA 2023 |
Machine learning › Reinforcement learning
reward learning |
0.5 | 1 | 2021 | Learning Human Objectives from Sequences of Physical Corrections · ICRA 2021 |
Machine learning › Learning paradigms › semi-supervised learning
consistency regularization |
0.3 | 1 | 2018 | Smooth Neighbors on Teacher Graphs for Semi-Supervised Learning · CVPR 2018 |
Machine learning › Learning paradigms
semi-supervised learning |
0.3 | 1 | 2018 | Smooth Neighbors on Teacher Graphs for Semi-Supervised Learning · CVPR 2018 |
Human-robot interaction
assistive robotics |
0.1 | 1 | 2021 | Learning Human Objectives from Sequences of Physical Corrections · ICRA 2021 |
Methods — techniques the papers use, named apart from their topics
online learning · 1.0auxiliary reward modeling · 1.0morphology optimization · 0.7differentiable physics simulation · 0.7continual learning · 0.7teacher graph · 0.3self-ensembling · 0.3manifold smoothness · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Learning Tool Morphology for Contact-Rich Manipulation Tasks with Differentiable SimulationabstractWhen humans perform contact-rich manipulation tasks, customized tools are often necessary to simplify the task. For instance, we use various utensils for handling food, such as knives, forks and spoons. Similarly, robots may benefit from specialized tools that enable them to more easily complete a variety of tasks. We present an end-to-end framework to automatically learn tool morphology for contact-rich manipulation tasks by leveraging differentiable physics simulators. Previous work relied on manually constructed priors requiring detailed specification of a 3D object model, grasp pose and task description to facilitate the search or optimization process. Our approach only requires defining the objective with respect to task performance and enables learning a robust morphology through randomizing variations of the task. We make this optimization tractable by casting it as a continual learning problem. We demonstrate the effectiveness of our method for designing new tools in several scenarios, such as winding ropes, flipping a box and pushing peas onto a scoop in simulation. Additionally, experiments with real robots show that the tool shapes discovered by our method help them succeed in these scenarios. Mengxi Li, Rika Antonova, Dorsa Sadigh, Jeannette Bohg |
ICRA | 1 |
| 2021 | Learning Human Objectives from Sequences of Physical CorrectionsabstractWhen personal, assistive, and interactive robots make mistakes, humans naturally and intuitively correct those mistakes through physical interaction. In simple situations, one correction is sufficient to convey what the human wants. But when humans are working with multiple robots or the robot is performing an intricate task often the human must make several corrections to fix the robot’s behavior. Prior research assumes each of these physical corrections are independent events, and learns from them one-at-a-time. However, this misses out on crucial information: each of these interactions are interconnected, and may only make sense if viewed together. Alternatively, other work reasons over the final trajectory produced by all of the human’s corrections. But this method must wait until the end of the task to learn from corrections, as opposed to inferring from the corrections in an online fashion. In this paper we formalize an approach for learning from sequences of physical corrections during the current task. To do this we introduce an auxiliary reward that captures the human’s trade-off between making corrections which improve the robot’s immediate reward and long-term performance. We evaluate the resulting algorithm in remote and in-person human-robot experiments, and compare to both independent and final baselines. Our results indicate that users are best able to convey their objective when the robot reasons over their sequence of corrections. Mengxi Li, Alper Canberk, Dylan P. Losey, Dorsa Sadigh |
ICRA | 1 |
| 2021 | Word and graph attention networks for semi-supervised classification
Jing Zhang 0015, Mengxi Li, Kaisheng Gao, Shunmei Meng, Cangqi Zhou |
Knowl. Inf. Syst. | 2 |
| 2020 | Learning User-Preferred Mappings for Intuitive Robot ControlabstractWhen humans control drones, cars, and robots, we often have some preconceived notion of how our inputs should make the system behave. Existing approaches to teleoperation typically assume a one-size-fits-all approach, where the designers pre-define a mapping between human inputs and robot actions, and every user must adapt to this mapping over repeated interactions. Instead, we propose a personalized method for learning the human's preferred or preconceived mapping from a few robot queries. Given a robot controller, we identify an alignment model that transforms the human's inputs so that the controller's output matches their expectations. We make this approach data-efficient by recognizing that human mappings have strong priors: we expect the input space to be proportional, reversable, and consistent. Incorporating these priors ensures that the robot learns an intuitive mapping from few examples. We test our learning approach in robot manipulation tasks inspired by assistive settings, where each user has different personal preferences and physical capabilities for teleoperating the robot arm. Our simulated and experimental results suggest that learning the mapping between inputs and robot actions improves objective and subjective performance when compared to manually defined alignments or learned alignments without intuitive priors. The supplementary video showing these user studies can be found at: https://youtu.be/rKHka0_48-Q. Mengxi Li, Dylan P. Losey, Jeannette Bohg, Dorsa Sadigh |
IROS | 1 |
| 2018 | Smooth Neighbors on Teacher Graphs for Semi-Supervised LearningabstractThe recently proposed self-ensembling methods have achieved promising results in deep semi-supervised learning, which penalize inconsistent predictions of unlabeled data under different perturbations. However, they only consider adding perturbations to each single data point, while ignoring the connections between data samples. In this paper, we propose a novel method, called Smooth Neighbors on Teacher Graphs (SNTG). In SNTG, a graph is constructed based on the predictions of the teacher model, i.e., the implicit self-ensemble of models. Then the graph serves as a similarity measure with respect to which the representations of "similar" neighboring points are learned to be smooth on the low-dimensional manifold. We achieve state-of-the-art results on semi-supervised learning benchmarks. The error rates are 9.89%, 3.99% for CIFAR-10 with 4000 labels, SVHN with 500 labels, respectively. In particular, the improvements are significant when the labels are fewer. For the non-augmented MNIST with only 20 labels, the error rate is reduced from previous 4.81% to 1.36%. Our method also shows robustness to noisy labels. Yucen Luo, Jun Zhu 0001, Mengxi Li, Bo Zhang 0010 |
CVPR | 3 |