Demo Data from EDBT 2026 / reviewers in the wild / expert
Ying Tiffany He
dblp:369/2810
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging 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 |
Graph learning · 41% Trustworthy machine learning · 27% Efficient and distributed learning · 27% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Subgraph Invariant Learning Towards Large-Scale Graph Node Classification · AAAI 2025 |
Machine learning › Graph learning › graph neural network › node classification
graph node classification |
0.9 | 1 | 2025 | Subgraph Invariant Learning Towards Large-Scale Graph Node Classification · AAAI 2025 |
Machine learning › Trustworthy machine learning › out-of-distribution generalization
invariant learning |
0.9 | 1 | 2025 | Subgraph Invariant Learning Towards Large-Scale Graph Node Classification · AAAI 2025 |
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
low-rank adaptation |
0.9 | 1 | 2025 | Flexora: Flexible Low-Rank Adaptation for Large Language Models · ACL (1) 2025 |
Machine learning › Trustworthy machine learning
out-of-distribution generalization |
0.9 | 1 | 2025 | Subgraph Invariant Learning Towards Large-Scale Graph Node Classification · AAAI 2025 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.9 | 1 | 2025 | Flexora: Flexible Low-Rank Adaptation for Large Language Models · ACL (1) 2025 |
Machine learning › Graph learning › graph neural network
scalable graph neural network |
0.9 | 1 | 2025 | Subgraph Invariant Learning Towards Large-Scale Graph Node Classification · AAAI 2025 |
Natural language and speech › Language models and text generation
large language model fine-tuning |
0.3 | 1 | 2025 | Flexora: Flexible Low-Rank Adaptation for Large Language Models · ACL (1) 2025 |
Methods — techniques the papers use, named apart from their topics
unrolled differentiation · 0.9subgraph sampling · 0.9invariant learning · 0.9hyperparameter optimization · 0.9attention mechanism · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Subgraph Invariant Learning Towards Large-Scale Graph Node ClassificationabstractGraph Neural Networks (GNNs) have shown efficacy in graph node classification, but face computational challenges on large-scale graphs. Although existing graph reduction methods address these issues, they still require high computational resources and fail to prioritize robust performance on out-of-distribution data. To tackle these challenges, we introduce the subgraph invariant learning paradigm, inspired by the small-world phenomenon. This approach enables models trained on specific subgraphs to generalize across diverse subgraphs, reducing computational demands, and enhancing scalability. To promote generalization, we maximize the invariance log-likelihood by deriving a theoretical lower bound of it and formulating the InVar loss. This loss minimizes the discrepancy between node representations and their corresponding invariance representations while maximizing the entropy of the node representation. In response to InVar loss, we propose the Invariance Facilitation Model (IFM), comprising the Invariance Representation Encoder (IRE) and Node Representation Encoder (NRE). IRE, capturing the invariance representations, utilizes Invariance ATTention (InvarATT) to compress long-range dependencies, while NRE learns the node representation, by integrating invariance representations via Telematic ATTention (TeleATT) and exchanging local information within each subgraph through GNNs. Evaluations on four large-scale graph datasets demonstrate the effectiveness, computational efficiency, and interpretability of IFM for large-scale graph node classification. Leilei Wang, Fei Ma 0006, F. Richard Yu, Pengteng Li, Ying Tiffany He |
AAAI | 6 |
| 2025 | Flexora: Flexible Low-Rank Adaptation for Large Language ModelsabstractLarge language models (LLMs) have revolutionized artificial intelligence, but their performance on specific tasks is often limited by knowledge boundaries.While fine-tuning techniques like low-rank adaptation (LoRA) aim to address this, they can suffer from overfitting.We propose flexible low-rank adaptation (Flexora), a novel method that automatically selects the most critical layers for fine-tuning to optimize performance across diverse downstream tasks.Flexora formulates layer selection as a hyperparameter optimization problem, employs unrolled differentiation for efficient solving, and identifies the most impactful layers based on optimized hyperparameters.Extensive experiments across various pre-trained models and natural language tasks demonstrate that Flexora consistently outperforms existing baselines.We provide theoretical insights and comprehensive ablation studies to elucidate the effectiveness of Flexora.Therefore, Flexora offers a robust solution to enhance LoRA finetuning for LLMs, potentially advancing the field of adaptive language model optimization. Chenxing Wei, Yao Shu, Ying Tiffany He |
ACL (1) | 3 |
| 2025 | DictAvatar: Expressive Facial Avatar Reconstruction with Facial Feature Dictionary
Zuyin Wu, Ying Tiffany He, Fei Ma 0006, F. Richard Yu |
ICIC (6) | 4 |