Demo Data from EDBT 2026 / reviewers in the wild / expert
Gaole Dai
dblp:169/7799
· DBLP profile ↗
11ranked-venue papers
4as first author
11since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 3 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 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
6 papers |
Efficient and distributed learning · 32% Transfer learning and domain adaptation · 26% Deep learning architectures and training · 14% | |
| Human-computer interaction and pervasive computing
1 paper |
Ubiquitous computing and smart environments · 100% |
Topics — the 19 heaviest of 22, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
mixture of experts |
1.3 | 2 | 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation · AAAI 2026 MoLe-VLA: Dynamic Layer-skipping Vision Language Action Model via Mixture-of-Layers for Efficient Robot Manipulation · AAAI 2026 |
Machine learning › Efficient and distributed learning › model compression › sparsity
activation sparsity |
1.0 | 1 | 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation · AAAI 2026 |
Machine learning › Transfer learning and domain adaptation › test-time adaptation
continual test-time adaptation |
1.0 | 1 | 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation · AAAI 2026 |
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
1.0 | 1 | 2026 | Learning Systems Expansion with Efficient Heterogeneity-aware Knowledge Transfer · AAAI 2026 |
Machine learning › Efficient and distributed learning › adaptive computation
layer skipping |
1.0 | 1 | 2026 | MoLe-VLA: Dynamic Layer-skipping Vision Language Action Model via Mixture-of-Layers for Efficient Robot Manipulation · AAAI 2026 |
Machine learning › Efficient and distributed learning
model compression |
1.0 | 1 | 2026 | MoLe-VLA: Dynamic Layer-skipping Vision Language Action Model via Mixture-of-Layers for Efficient Robot Manipulation · AAAI 2026 |
Machine learning › Transfer learning and domain adaptation
test-time adaptation |
1.0 | 1 | 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation · AAAI 2026 |
Robotics › Robot manipulation › embodied foundation models
vision-language-action model |
1.0 | 1 | 2026 | MoLe-VLA: Dynamic Layer-skipping Vision Language Action Model via Mixture-of-Layers for Efficient Robot Manipulation · AAAI 2026 |
Machine learning › Transfer learning and domain adaptation
domain adaptation |
0.9 | 1 | 2025 | SelfReplay: Adapting Self-Supervised Sensory Models via Adaptive Meta-Task Replay · SenSys 2025 |
Natural language and speech › Language models and text generation › large language model training
domain-adaptive pre-training |
0.9 | 1 | 2025 | SelfReplay: Adapting Self-Supervised Sensory Models via Adaptive Meta-Task Replay · SenSys 2025 |
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
low-rank adaptation |
0.9 | 1 | 2025 | SAN: Hypothesizing Long-Term Synaptic Development and Neural Engram Mechanism in Scalable Model's Parameter-Efficient Fine-Tuning · ICML 2025 |
Machine learning › Transfer learning and domain adaptation › meta-learning
meta-learning for adaptation |
0.9 | 1 | 2025 | SelfReplay: Adapting Self-Supervised Sensory Models via Adaptive Meta-Task Replay · SenSys 2025 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.9 | 1 | 2025 | SAN: Hypothesizing Long-Term Synaptic Development and Neural Engram Mechanism in Scalable Model's Parameter-Efficient Fine-Tuning · ICML 2025 |
Machine learning › Generative modeling › diffusion model
personalized image generation |
0.9 | 1 | 2025 | UniCTokens: Boosting Personalized Understanding and Generation via Unified Concept Tokens · NeurIPS 2025 |
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
self-supervised representation learning |
0.9 | 1 | 2025 | SelfReplay: Adapting Self-Supervised Sensory Models via Adaptive Meta-Task Replay · SenSys 2025 |
Computer vision › Vision and language
vision-language model |
0.9 | 1 | 2025 | UniCTokens: Boosting Personalized Understanding and Generation via Unified Concept Tokens · NeurIPS 2025 |
Computer vision › Image recognition and object detection
image classification |
0.3 | 1 | 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation · AAAI 2026 |
Computer vision › Segmentation and scene understanding
semantic segmentation |
0.3 | 1 | 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation · AAAI 2026 |
Ubiquitous computing and smart environments
mobile sensing |
0.3 | 1 | 2025 | SelfReplay: Adapting Self-Supervised Sensory Models via Adaptive Meta-Task Replay · SenSys 2025 |
Methods — techniques the papers use, named apart from their topics
mixture of experts · 2.0spatial differentiable dropout · 1.0sample-wise attention mixer · 1.0routing · 1.0knowledge distillation · 1.0knowledge dictionary · 1.0homeostatic-proximal loss · 1.0domain-aware router · 1.0self-supervised learning · 0.9replay · 0.9meta-learning · 0.9low-rank decomposition · 0.9long-term potentiation/depression · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Learning Systems Expansion with Efficient Heterogeneity-aware Knowledge TransferabstractModern AI services must continually adapt to newly joined domains, yet delivering high-quality customized models is hampered by label sparsity, domain shifts, and tight budgets. We formulate this challenge as the learning system expansion problem and introduce HaT, an efficient heterogeneity-aware knowledge-transfer framework. HaT first selects a small set of high-quality source models with minimal overhead, and then fuses their imperfect predictions through a sample-wise attention mixer. Later, it adaptively distills the fused knowledge into target models via a knowledge dictionary. Extensive experiments on different tasks and modalities show that HaT outperforms state-of-the-art baselines by up to 16.5% accuracy, and saves 31.1% training time and up to 93.0% traffic. Gaole Dai, Huatao Xu, Yifan Yang 0004, Rui Tan 0001, Mo Li 0001 |
AAAI | 1 |
| 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time AdaptationabstractContinual Test-Time Adaptation (CTTA), which aims to adapt the pre-trained model to ever-evolving target domains, emerges as an important task for vision models. As current vision models appear to be heavily biased towards texture, continuously adapting the model from one domain distribution to another can result in serious catastrophic forgetting. Drawing inspiration from the the encoding characteristics of neuron activation in neural networks, we propose the Mixture-of-Activation-Sparsity-Experts (MoASE) for the CTTA task. Given the distinct reaction of neurons with low and high activation to domain-specific and agnostic features, MoASE decomposes the neural activation into high-activation and low-activation components in each expert with a Spatial Differentiable Dropout (SDD). Based on the decomposition, we devise a Domain-Aware Router (DAR) that utilizes domain information to adaptively weight experts that process the post-SDD sparse activations, and the Activation Sparsity Gate (ASG) that adaptively assigns feature selection thresholds of the SDD for different experts for more precise feature decomposition. Finally, we introduce a Homeostatic-Proximal (HP) loss to maintain update consistency between the teacher and student experts to prevent error accumulation. Extensive experiments substantiate that MoASE achieves state-of-the-art performance in both classification and segmentation tasks. Rongyu Zhang, Aosong Cheng, Yulin Luo, Gaole Dai, Huanrui Yang, Jiaming Liu 0003, Ran Xu 0013, Dan Wang 0002, Yuan Du |
AAAI | 4 |
| 2026 | MoLe-VLA: Dynamic Layer-skipping Vision Language Action Model via Mixture-of-Layers for Efficient Robot ManipulationabstractVision-Language-Action (VLA) models enable robotic systems to perform embodied tasks but face deployment challenges due to the high computational demands of the dense Large Language Models (LLMs), with existing early-exit-based sparsification methods often overlooking the critical semantic role of final layers in downstream tasks. Aligning with the recent breakthrough of the Shallow Brain Hypothesis (SBH) in neuroscience and the mixture of experts in model sparsification, we conceptualize each LLM layer as an expert and propose a Mixture-of-LayEr Vision Language Action model (MoLe-VLA or simply MoLe) architecture for dynamic LLM layer activation. Specifically, we introduce a Spatial-Temporal Aware Router (STAR) for MoLe to selectively activate only parts of the layers based on the robot’s current state, mimicking the brain's distinct signal pathways specialized for cognition and causal reasoning. Additionally, to compensate for the cognition ability of LLM lost during the layer-skipping, we devise a Cognitive self-Knowledge Distillation (CogKD) to enhance the understanding of task demands and generate task-relevant action sequences by leveraging cognition features. Extensive experiments in RLBench simulations and real-world environments demonstrate the superiority of MoLe-VLA in both efficiency and performance, improving the mean success rate by 9.7% across ten simulation tasks while accelerating inference by 36.8% over OpenVLA. Rongyu Zhang, Menghang Dong, Yuan Zhang 0020, Liang Heng, Xiaowei Chi, Gaole Dai, Dan Wang 0002, Yuan Du, Shanghang Zhang |
AAAI | 6 |
| 2025 | Gaze-Driven Active Speaker Detection in Meetings
Long Rao, Gaole Dai |
ICIC (10) | 3 |
| 2025 | SAN: Hypothesizing Long-Term Synaptic Development and Neural Engram Mechanism in Scalable Model's Parameter-Efficient Fine-TuningabstractAdvances in Parameter-efficient Fine-tuning (PEFT) bridged the performance gap with Full Fine-Tuning (FFT) through sophisticated analysis of pre-trained parameter spaces. Starting from drawing insights from Neural Engrams (NE) in Biological Neural Networks (BNNs), we establish a connection between the low-rank property observed during PEFT’s parameter space shifting and neurobiological mechanisms. This observation leads to our proposed method, Synapse and Neuron (SAN), which decomposes and propagates the scaling component from anterior feature adjustment vectors towards posterior weight matrices. Our approach is theoretically grounded in Long-Term Potentiation/Depression (LTP/D) phenomena, which govern synapse development through neurotransmitter release modulation. Extensive experiments demonstrate its effectiveness: on vision tasks across VTAB, FGVC, and GIC (25 datasets) using ViT, Swin-T and ConvNeXt architectures, SAN outperforms FFT up to 8.7% and LoRA by 3.2%; on language tasks using Commonsense Reasoning (8 datasets) with LLaMA models (all generations), surpassing ChatGPT up to 8.5% and LoRA by 4.7%; on vision-language tasks using Visual Instruction Tuning (7 datasets) with LLaVA models, it exceeds FFT up to 2.4% and LoRA by 1.9%. Our code and W&B log will be released Gaole Dai, Chun-Kai Fan, Zhi Zhang 0009, Yuan Zhang 0020, Yulu Gan, Qizhe Zhang, Cheng-Ching Tseng, Shanghang Zhang, Tiejun Huang 0001 |
ICML | 1 |
| 2025 | UniCTokens: Boosting Personalized Understanding and Generation via Unified Concept TokensabstractPersonalized models have demonstrated remarkable success in understanding and generating concepts provided by users. However, existing methods use separate concept tokens for understanding and generation, treating these tasks in isolation. This may result in limitations for generating images with complex prompts. For example, given the concept $\langle bo\rangle$, generating "$\langle bo\rangle$ wearing its hat" without additional textual descriptions of its hat. We call this kind of generation \textit{\textbf{personalized attribute-reasoning generation}}. To address the limitation, we present UniCTokens, a novel framework that effectively integrates personalized information into a unified vision language model (VLM) for understanding and generation. UniCTokens trains a set of unified concept tokens to leverage complementary semantics, boosting two personalized tasks. Moreover, we propose a progressive training strategy with three stages: understanding warm-up, bootstrapping generation from understanding, and deepening understanding from generation to enhance mutual benefits between both tasks. To quantitatively evaluate the unified VLM personalization, we present UnifyBench, the first benchmark for assessing concept understanding, concept generation, and attribute-reasoning generation. Experimental results on UnifyBench indicate that UniCTokens shows competitive performance compared to leading methods in concept understanding, concept generation, and achieving state-of-the-art results in personalized attribute-reasoning generation. Our research demonstrates that enhanced understanding improves generation, and the generation process can yield valuable insights into understanding. Our code and dataset will be released at: \href{https://github.com/arctanxarc/UniCTokens}{https://github.com/arctanxarc/UniCTokens}. Ruichuan An, Renrui Zhang, Zijun Shen, Ming Lu 0002, Gaole Dai, Hao Liang 0017, Shilin Yan, Yulin Luo, Bocheng Zou, Wentao Zhang 0001 |
NeurIPS | 6 |
| 2025 | Orochi: Versatile Biomedical Image ProcessorabstractDeep learning has emerged as a pivotal tool for accelerating research in the life sciences, with the low-level processing of biomedical images (e.g., registration, fusion, restoration, super-resolution) being one of its most critical applications. Platforms such as ImageJ (Fiji) and napari have enabled the development of customized plugins for various models. However, these plugins are typically based on models that are limited to specific tasks and datasets, making them less practical for biologists. To address this challenge, we introduce **Orochi**, the first application-oriented, efficient, and versatile image processor designed to overcome these limitations. Orochi is pre-trained on patches/volumes extracted from the raw data of over 100 publicly available studies using our Random Multi-scale Sampling strategy. We further propose Task-related Joint-embedding Pre-Training (TJP), which employs biomedical task-related degradation for self-supervision rather than relying on Masked Image Modelling (MIM), which performs poorly in downstream tasks such as registration. To ensure computational efficiency, we leverage Mamba's linear computational complexity and construct Multi-head Hierarchy Mamba. Additionally, we provide a three-tier fine-tuning framework (Full, Normal, and Light) and demonstrate that Orochi achieves comparable or superior performance to current state-of-the-art specialist models, even with lightweight parameter-efficient options. We hope that our study contributes to the development of an all-in-one workflow, thereby relieving biologists from the overwhelming task of selecting among numerous models. Our pre-trained weights and code will be released. Gaole Dai, Chenghao Zhou, Rongyu Zhang, Yuan Zhang 0020, Chengkai Hou, Tiejun Huang 0001, Jianxu Chen 0001, Shanghang Zhang |
NeurIPS | 1 |
| 2025 | SelfReplay: Adapting Self-Supervised Sensory Models via Adaptive Meta-Task ReplayabstractSelf-supervised learning enables effective model pre-training on large-scale unlabeled data, which is crucial for user-specific fine-tuning in mobile sensing applications. However, pre-trained models often face significant domain shifts during fine-tuning due to user diversity, leading to performance degradation. To address this, we propose SelfReplay, an adaptive approach designed to align self-supervised models to different domains. SelfReplay consists of two stages: MetaSSL, which leverages meta-learning with self-supervised learning to pre-train domain-adaptive weights, and ReplaySSL, which further adapts the pre-trained model to each user's domain by replaying the meta-learned self-supervised task with a few user-specific samples. This produces a personalized model tailored to each user. Evaluations on mobile sensing benchmarks demonstrate that SelfReplay outperforms existing baselines, improving the F1-score by 9.4%p on average. On-device analyses on a commodity smartphone show the efficiency of SelfReplay's adaptation step, required just once after deployment, with SimCLR completing in only 10 seconds while using less than 100MB of memory. Hyungjun Yoon, Jae Hyun Kwak, Biniyam Aschalew Tolera, Gaole Dai, Mo Li 0001, Taesik Gong, Kimin Lee, Sung-Ju Lee 0001 |
SenSys | 4 |
| 2025 | A dual-branch deep interaction network for multi-channel speech enhancement
Xiaoyu Lian, Gaole Dai, Hongqin Yang |
Neurocomputing | 3 |
| 2023 | Collaboration Tiredness Aware Manufacturing Service Collaboration Incentive and OptimizationabstractManufacturing service collaboration (MSC) provides a low cost, high efficiency, and good quality collaboration diagram on Industrial Internet Platforms. However, some stakeholders areunwilling to participate in MSC continuously due to their short-term dissatisfaction outbursts or long-term dissatisfaction accumulation with MSC. To describe the aforementioned status of stakeholders, collaboration tiredness is first defined and its causes and impacts on MSC are analyzed. To avoid massive loss of stakeholders on the platform, it is urgent to study stimulus methods to improve their satisfaction. In this article, long-term dynamic utility models are established to depict changes in stakeholder satisfaction, including short-term utility models and long-term utility updating criteria. Then, an incentive strategy is proposed, which aims at stimulating the collaboration willingness of consumers with collaboration tiredness. Once consumers with collaboration tiredness are detected through Bayesian thresholds, utility references would be generated. Then, to reach the utility references, MSC optimization would be continuously provoked to generate new plans through the improved memetic algorithm. Finally, experiments verify the effectiveness of the proposed incentive strategy from a long-term perspective. Gaole Dai, Ying Cheng 0001, Fei Tao 0001 |
IEEE Trans. Ind. Informatics | 1 |
| 2022 | Image Encryption Algorithm based on Convolutional Neural Network and Four Square Matrix EncodingabstractTo balance the performance of chaos and the algorithm’s efficiency, a Henon-Modulated-Iterative (HMI) map is constructed in this paper. And the chaotic characteristics of the HMI map are analyzed from three aspects: bifurcation map, Lyapunov exponent and balance degree. On this basis, an image encryption algorithm based on a convolutional neural network (CNN) and four square matrix encoding is proposed. Then, the random sequence generation module is designed using CNN, and the generated random sequence is used to construct the scrambling coordinate matrix and modify the position of the pixel values. Finally, the scrambled image is diffused by four square matrix encoding so that the pixel values are evenly distributed, while non-sequential diffusion using hexadecimal addition and subtraction rules improves the security of the encryption algorithm. Experimental results show that the encryption algorithm proposed in this paper has a good encryption effect and can resist various attacks. Bin Ge 0001, Chenxing Xia, Gaole Dai |
TrustCom | 4 |