EDBT 2026 Demo / reviewers in the wild / expert
Yanhe Liu
dblp:159/7356
· DBLP profile ↗
5ranked-venue papers
1as first author
4since 2021 · last 2024
0000-0001-6276-7010ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Computer networks · 1Human-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 |
Information extraction and text analysis · 76% Trustworthy machine learning · 18% Representation and self-supervised learning · 6% | |
| Databases, data mining, and information retrieval
1 paper |
Knowledge graphs · 100% | |
| Computer networks
1 paper |
Cellular and mobile networks · 33% Edge and fog computing · 33% Software-defined and programmable networks · 33% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › named entity recognition
continual named entity recognition |
0.8 | 1 | 2024 | Unify Named Entity Recognition Scenarios via Contrastive Real-Time Updating Prototype · AAAI 2024 |
Natural language and speech › Information extraction and text analysis
named entity recognition |
0.8 | 1 | 2024 | Unify Named Entity Recognition Scenarios via Contrastive Real-Time Updating Prototype · AAAI 2024 |
Knowledge graphs › knowledge graph embedding
continual knowledge graph embedding |
0.8 | 1 | 2024 | Towards Continual Knowledge Graph Embedding via Incremental Distillation · AAAI 2024 |
Knowledge graphs
knowledge graph embedding |
0.8 | 1 | 2024 | Towards Continual Knowledge Graph Embedding via Incremental Distillation · AAAI 2024 |
Natural language and speech › Information extraction and text analysis › relation extraction
continual relation extraction |
0.7 | 1 | 2023 | Online Noisy Continual Relation Learning · AAAI 2023 |
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels |
0.7 | 1 | 2023 | Online Noisy Continual Relation Learning · AAAI 2023 |
Natural language and speech › Information extraction and text analysis
relation extraction |
0.7 | 1 | 2023 | Online Noisy Continual Relation Learning · AAAI 2023 |
Machine learning › Representation and self-supervised learning
prototype learning |
0.2 | 1 | 2024 | Unify Named Entity Recognition Scenarios via Contrastive Real-Time Updating Prototype · AAAI 2024 |
Knowledge graphs
link prediction |
0.2 | 1 | 2024 | Towards Continual Knowledge Graph Embedding via Incremental Distillation · AAAI 2024 |
Edge and fog computing › mobile edge computing › computation offloading
energy-efficient offloading |
0.2 | 1 | 2015 | Demo: An Open-source Software Defined Platform for Collaborative and Energy-aware WiFi Offloading · MobiCom 2015 |
Cellular and mobile networks › mobile data offloading
wifi offloading |
0.2 | 1 | 2015 | Demo: An Open-source Software Defined Platform for Collaborative and Energy-aware WiFi Offloading · MobiCom 2015 |
Energy-efficient computing
mobile device energy management |
0.1 | 1 | 2015 | Demo: An Open-source Software Defined Platform for Collaborative and Energy-aware WiFi Offloading · MobiCom 2015 |
Methods — techniques the papers use, named apart from their topics
prototype learning · 0.8knowledge distillation · 0.8incremental distillation · 0.8hierarchical learning · 0.8contrastive learning · 0.8semi-supervised learning · 0.7self-supervised learning · 0.7sample purification · 0.7energy-aware offloading algorithm · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Towards Continual Knowledge Graph Embedding via Incremental DistillationabstractTraditional knowledge graph embedding (KGE) methods typically require preserving the entire knowledge graph (KG) with significant training costs when new knowledge emerges. To address this issue, the continual knowledge graph embedding (CKGE) task has been proposed to train the KGE model by learning emerging knowledge efficiently while simultaneously preserving decent old knowledge. However, the explicit graph structure in KGs, which is critical for the above goal, has been heavily ignored by existing CKGE methods. On the one hand, existing methods usually learn new triples in a random order, destroying the inner structure of new KGs. On the other hand, old triples are preserved with equal priority, failing to alleviate catastrophic forgetting effectively. In this paper, we propose a competitive method for CKGE based on incremental distillation (IncDE), which considers the full use of the explicit graph structure in KGs. First, to optimize the learning order, we introduce a hierarchical strategy, ranking new triples for layer-by-layer learning. By employing the inter- and intra-hierarchical orders together, new triples are grouped into layers based on the graph structure features. Secondly, to preserve the old knowledge effectively, we devise a novel incremental distillation mechanism, which facilitates the seamless transfer of entity representations from the previous layer to the next one, promoting old knowledge preservation. Finally, we adopt a two-stage training paradigm to avoid the over-corruption of old knowledge influenced by under-trained new knowledge. Experimental results demonstrate the superiority of IncDE over state-of-the-art baselines. Notably, the incremental distillation mechanism contributes to improvements of 0.2%-6.5% in the mean reciprocal rank (MRR) score. More exploratory experiments validate the effectiveness of IncDE in proficiently learning new knowledge while preserving old knowledge across all time steps. Jiajun Liu 0005, Wenjun Ke 0002, Peng Wang 0004, Ziyu Shang, Jinhua Gao, Ke Ji, Yanhe Liu |
AAAI | 8 |
| 2024 | Unify Named Entity Recognition Scenarios via Contrastive Real-Time Updating PrototypeabstractSupervised named entity recognition (NER) aims to classify entity mentions into a fixed number of pre-defined types. However, in real-world scenarios, unknown entity types are continually involved. Naive fine-tuning will result in catastrophic forgetting on old entity types. Existing continual methods usually depend on knowledge distillation to alleviate forgetting, which are less effective on long task sequences. Moreover, most of them are specific to the class-incremental scenario and cannot adapt to the online scenario, which is more common in practice. In this paper, we propose a unified framework called Contrastive Real-time Updating Prototype (CRUP) that can handle different scenarios for NER. Specifically, we train a Gaussian projection model by a regularized contrastive objective. After training on each batch, we store the mean vectors of representations belong to new entity types as their prototypes. Meanwhile, we update existing prototypes belong to old types only based on representations of the current batch. The final prototypes will be used for the nearest class mean classification. In this way, CRUP can handle different scenarios through its batch-wise learning. Moreover, CRUP can alleviate forgetting in continual scenarios only with current data instead of old data. To comprehensively evaluate CRUP, we construct extensive benchmarks based on various datasets. Experimental results show that CRUP significantly outperforms baselines in continual scenarios and is also competitive in the supervised scenario. Yanhe Liu, Peng Wang 0004, Wenjun Ke 0002, Xiye Chen, Jiteng Zhao, Ziyu Shang |
AAAI | 1 |
| 2023 | Online Noisy Continual Relation LearningabstractRecent work for continual relation learning has achieved remarkable progress. However, most existing methods only focus on tackling catastrophic forgetting to improve performance in the existing setup, while continually learning relations in the real-world must overcome many other challenges. One is that the data possibly comes in an online streaming fashion with data distributions gradually changing and without distinct task boundaries. Another is that noisy labels are inevitable in real-world, as relation samples may be contaminated by label inconsistencies or labeled with distant supervision. In this work, therefore, we propose a novel continual relation learning framework that simultaneously addresses both online and noisy relation learning challenges. Our framework contains three key modules: (i) a sample separated online purifying module that divides the online data stream into clean and noisy samples, (ii) a self-supervised online learning module that circumvents inferior training signals caused by noisy data, and (iii) a semi-supervised offline finetuning module that ensures the participation of both clean and noisy samples. Experimental results on FewRel, TACRED and NYT-H with real-world noise demonstrate that our framework greatly outperforms the combinations of the state-of-the-art online continual learning and noisy label learning methods. Peng Wang 0004, Qiqing Luo, Yanhe Liu, Wenjun Ke 0002 |
AAAI | 4 |
| 2021 | Ethical Implementation of Artificial Intelligence to Select Embryos in In Vitro FertilizationabstractAI has the potential to revolutionize many areas of healthcare. Radiology, dermatology, and ophthalmology are some of the areas most likely to be impacted in the near future, and they have received significant attention from the broader research community. But AI techniques are now also starting to be used in in vitro fertilization (IVF), in particular for selecting which embryos to transfer to the woman. The contribution of AI to IVF is potentially significant, but must be done carefully and transparently, as the ethical issues are significant, in part because this field involves creating new people. We first give a brief introduction to IVF and review the use of AI for embryo selection. We discuss concerns with the interpretation of the reported results from scientific and practical perspectives. We then consider the broader ethical issues involved. We discuss in detail the problems that result from the use of black-box methods in this context and advocate strongly for the use of interpretable models. Importantly, there have been no published trials of clinical effectiveness, a problem in both the AI and IVF communities, and we therefore argue that clinical implementation at this point would be premature. Finally, we discuss ways for the broader AI community to become involved to ensure scientifically sound and ethically responsible development of AI in IVF. Michael Anis Mihdi Afnan, Cynthia Rudin, Vincent Conitzer, Julian Savulescu, Yanhe Liu, Masoud Afnan |
AIES | 6 |
| 2015 | Demo: An Open-source Software Defined Platform for Collaborative and Energy-aware WiFi OffloadingabstractThis demonstration presents a novel software defined platform for achieving collaborative and energy-aware WiFi offloading. The platform consists of an extensible central controller, programmable offloading agents, and offloading extensions on mobile devices. Driven by our extensive measurements of energy consumption on smartphones, we propose an effective energy-aware offloading algorithm and integrate it to our platform. By enabling collaboration between wireless networks and mobile users, our solution can make optimal offloading decisions that improve offloading efficiency for network operators and achieve energy saving for mobile users. To enhance deployability, we have released our platform under open-source licenses on GitHub. Aaron Yi Ding, Yanhe Liu, Sasu Tarkoma, Hannu Flinck, Jon Crowcroft |
MobiCom | 2 |