Demo Data from SIGIR 2026 / reviewers in the wild / expert
Weiwei Gu
dblp:193/4401
· DBLP profile ↗
8ranked-venue papers
5as first author
8since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 4 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 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
3 papers |
Motion planning and robot control · 28% Transfer learning and domain adaptation · 28% Information extraction and text analysis · 21% | |
| Human-computer interaction and pervasive computing
2 papers |
Human-robot interaction · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation
few-shot learning |
1.5 | 2 | 2024 | Interactive Visual Task Learning for Robots · AAAI 2024 Interactive Visual Task Learning for Robots · AAAI 2024 |
Robotics › Motion planning and robot control
robot learning |
1.5 | 2 | 2024 | Interactive Visual Task Learning for Robots · AAAI 2024 Interactive Visual Task Learning for Robots · AAAI 2024 |
Human-robot interaction › robot learning
interactive robot learning |
1.5 | 2 | 2024 | Interactive Visual Task Learning for Robots · AAAI 2024 Interactive Visual Task Learning for Robots · AAAI 2024 |
Computer vision › Video understanding and tracking › temporal localization
boundary prediction |
0.6 | 1 | 2022 | An Empirical Study on Finding Spans · EMNLP 2022 |
Natural language and speech › Information extraction and text analysis
named entity recognition |
0.6 | 1 | 2022 | An Empirical Study on Finding Spans · EMNLP 2022 |
Natural language and speech › Information extraction and text analysis
span selection |
0.6 | 1 | 2022 | An Empirical Study on Finding Spans · EMNLP 2022 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › ontology learning
concept hierarchy learning |
0.5 | 2 | 2024 | Interactive Visual Task Learning for Robots · AAAI 2024 Interactive Visual Task Learning for Robots · AAAI 2024 |
Computer vision › Vision and language
visual question answering |
0.2 | 1 | 2024 | Interactive Visual Task Learning for Robots · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
scene graph representation · 3.0hierarchical visual concept learning · 3.0continual learning · 3.0tagging · 0.6span enumeration · 0.6boundary prediction · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MWTP: A heterogeneous multiplex representation learning framework for link prediction of weak ties
Weiwei Gu, Linbi Lv, Ruiqi Li 0003 |
Neural Networks | 1 |
| 2025 | Stable High-Frequency Components Recovery via Multichannel Absorption Compensation
Guofa Li, Weiwei Gu |
IEEE Trans. Geosci. Remote. Sens. | 4 |
| 2024 | Interactive Visual Task Learning for RobotsabstractWe present a framework for robots to learn novel visual concepts and tasks via in-situ linguistic interactions with human users. Previous approaches have either used large pre-trained visual models to infer novel objects zero-shot, or added novel concepts along with their attributes and representations to a concept hierarchy. We extend the approaches that focus on learning visual concept hierarchies by enabling them to learn novel concepts and solve unseen robotics tasks with them. To enable a visual concept learner to solve robotics tasks one-shot, we developed two distinct techniques. Firstly, we propose a novel approach, Hi-Viscont(HIerarchical VISual CONcept learner for Task), which augments information of a novel concept to its parent nodes within a concept hierarchy. This information propagation allows all concepts in a hierarchy to update as novel concepts are taught in a continual learning setting. Secondly, we represent a visual task as a scene graph with language annotations, allowing us to create novel permutations of a demonstrated task zero-shot in-situ. We present two sets of results. Firstly, we compare Hi-Viscont with the baseline model (FALCON) on visual question answering(VQA) in three domains. While being comparable to the baseline model on leaf level concepts, Hi-Viscont achieves an improvement of over 9% on non-leaf concepts on average. Secondly, we conduct a human-subjects experiment where users teach our robot visual tasks in-situ. We compare our model’s performance against the baseline FALCON model. Our framework achieves 33% improvements in success rate metric, and 19% improvements in the object level accuracy compared to the baseline model. With both of these results we demonstrate the ability of our model to learn tasks and concepts in a continual learning setting on the robot. Weiwei Gu, Anant Sah, Nakul Gopalan |
AAAI | 1 |
| 2024 | Interactive Visual Task Learning for RobotsabstractWe present a demonstrable framework for robots to learn novel visual concepts and visual tasks via in-situ linguistic interactions with human users. Previous approaches in computer vision have either used large pre-trained visual models to infer novel objects zero-shot, or added novel concepts along with their attributes and representations to a concept hierarchy. We extend the approaches that focus on learning visual concept hierarchies and take this ability one step further to demonstrate novel task solving on robots along with the learned visual concepts. To enable a visual concept learner to solve robotics tasks one-shot, we developed two distinct techniques. Firstly, we propose a novel approach, Hi-Viscont(HIerarchical VISual CONcept learner for Task), which augments information of a novel concept, that is being taught, to its parent nodes within a concept hierarchy. This information propagation allows all concepts in a hierarchy to update as novel concepts are taught in a continual learning setting. Secondly, we represent a visual task as a scene graph with language annotations, allowing us to create novel permutations of a demonstrated task zero-shot in-situ. Combining the two techniques, we present a demonstration on a real robot that learns visual task and concepts in one-shot from in-situ interactions with human users, and generalize to perform a novel visual task of the same type in zero-shot. As shown by the studies in the main conference paper, our system achieves a success rate of 50% on solving the whole task correctly with generalization where the baseline performs at 14% without any ability to generalize to novel tasks and concepts. We will demonstrate our working interactive learning pipeline at AAAI 2024 in person with our robot and other required hardware. Weiwei Gu, Anant Sah, Nakul Gopalan |
AAAI | 1 |
| 2024 | Learning Temporally Composable Task Segmentations with LanguageabstractIn this work, we present an approach to identify sub-tasks within a demonstrated robot trajectory with the supervision provided by language instructions. Learning longer horizon tasks is challenging with techniques such as reinforcement learning and behavior cloning. Previous approaches have split these long tasks into shorter tasks that are easier to learn by using statistical change point detection methods. However, classical changepoint detection methods function only with low dimensional robot trajectory data and not with high dimensional inputs such as vision. Our goal in this work is to split longer horizon tasks, represented by trajectories into shorter horizon tasks that can be learned using conventional behavior cloning approaches using guidance from language. In our approach we use techniques from the video moment retrieval problem on robot trajectory data to demonstrate a high-dimensional generalizable change-point detection approach. Our proposed moment retrieval-based approach shows a more than 30% improvement in mean average precision (mAP) for identifying trajectory sub-tasks with language guidance compared to that without language. We perform ablations to understand the effects of domain randomization, sample complexity, views, and sim-to-real transfer of our method. In our data ablation we find that just with a 100 labelled trajectories we can achieve a 61.41 mAP, demonstrating the sample efficiency of using such an approach. Further, behavior cloning models trained on our segmented trajectories outperform a single model trained on the whole trajectory by up to 20%. Divyanshu Raj, Omkar Patil, Weiwei Gu, Chitta Baral, Nakul Gopalan |
IROS | 3 |
| 2023 | Iterative Document-level Information Extraction via Imitation LearningabstractWe present a novel iterative extraction model, ITERX, for extracting complex relations, or templates, i.e., #-tuples representing a mapping from named slots to spans of text within a document.Documents may feature zero or more instances of a template of any given type, and the task of template extraction entails identifying the templates in a document and extracting each template's slot values.Our imitation learning approach casts the problem as a Markov decision process (MDP), and relieves the need to use predefined template orders to train an extractor.It leads to state-of-the-art results on two established benchmarks -4-ary relation extraction on SCIREX and template extraction on MUC-4 -as well as a strong baseline on the new BETTER Granular task. 1 Yunmo Chen, William Gantt, Weiwei Gu, Tongfei Chen, Aaron Steven White, Benjamin Van Durme |
EACL | 3 |
| 2022 | An Empirical Study on Finding SpansabstractWe present an empirical study on methods for span finding, the selection of consecutive tokens in text for some downstream tasks.We focus on approaches that can be employed in training end-to-end information extraction systems, and find there is no definitive solution without considering task properties, and provide our observations to help with future design choices: 1) a tagging approach often yields higher precision while span enumeration and boundary prediction provide higher recall; 2) span type information can benefit a boundary prediction approach; 3) additional contextualization does not help span finding in most cases. Weiwei Gu, Boyuan Zheng 0001, Yunmo Chen, Tongfei Chen, Benjamin Van Durme |
EMNLP | 1 |
| 2021 | A Concise Anisotropic Slope Tomography Based on 2-D Quasi-Acoustic Eikonal Equation for VTI MediaabstractSlope tomography is an appealing tomographic method for velocity and anisotropic model building. We present a concise anisotropic slope tomography based on the 2-D quasi-acoustic eikonal equation in transversely isotropic (TI) media with a vertical symmetry axis (VTI). First, we establish the Fréchet derivatives of the 2-D qP-wave in VTI stereotomography by applying the ray perturbation theory to the 2-D quasi-acoustic eikonal equation for VTI media. Second, we devise an anisotropic slope tomography instead of an anisotropic stereotomography based on the derived Fréchet derivatives because slope tomography is more concise, as well as stable for real applications. Besides, we adopt a similar strategy that is recently developed, parsimonious adjoint slope tomography, to calculate the scatterer coordinates after the parameters of the macro model are updated. With the help of a kinematic remigration of invariants observed at the surface, we outline a concise anisotropic slope tomography in VTI media. Compared with the recently developed anisotropic adjoint slope tomography, we still establish the linear system based on the ray perturbation theory and solve it using a conjugate gradient algorithm. The synthetic and real data examples show that the anisotropic parameters and the scatterer coordinates can be updated alternately and effectively by combining the kinematic remigration in VTI media with a 2-D qP-wave slope tomography. Weiwei Gu, Kai Yang 0021 |
IEEE Geosci. Remote. Sens. Lett. | 1 |