Demo Data from EDBT 2026 / reviewers in the wild / expert
Yulin Luo
dblp:237/5579
· DBLP profile ↗
10ranked-venue papers
1as first author
9since 2021 · last 2026
0000-0002-8951-503XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 1 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 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 |
Vision and language · 28% Transfer learning and domain adaptation · 13% Efficient and distributed learning · 11% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 20 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.8 | 2 | 2026 | Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation · AAAI 2026 Efficient Deweahter Mixture-of-Experts with Uncertainty-Aware Feature-Wise Linear Modulation · AAAI 2024 |
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 › 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 |
Knowledge, reasoning and agents › Multi-agent systems › autonomous agents
embodied agent |
0.9 | 1 | 2025 | SEEA-R1: Tree-Structured Reinforcement Fine-Tuning for Self-Evolving Embodied Agents · NeurIPS 2025 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
monte carlo tree search |
0.9 | 1 | 2025 | SEEA-R1: Tree-Structured Reinforcement Fine-Tuning for Self-Evolving Embodied Agents · NeurIPS 2025 |
Computer vision › Vision and language › vision-language model › multimodal large language model
multimodal instruction following |
0.9 | 1 | 2025 | Draw-and-Understand: Leveraging Visual Prompts to Enable MLLMs to Comprehend What You Want · ICLR 2025 |
Computer vision › Vision and language › vision-language model
multimodal large language model |
0.9 | 1 | 2025 | Draw-and-Understand: Leveraging Visual Prompts to Enable MLLMs to Comprehend What You Want · ICLR 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 › Reinforcement learning › reinforcement learning for NLP
reinforcement fine-tuning |
0.9 | 1 | 2025 | SEEA-R1: Tree-Structured Reinforcement Fine-Tuning for Self-Evolving Embodied Agents · NeurIPS 2025 |
Machine learning › Reinforcement learning › reward learning
reward modeling |
0.9 | 1 | 2025 | SEEA-R1: Tree-Structured Reinforcement Fine-Tuning for Self-Evolving Embodied Agents · NeurIPS 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 › Vision and language
visual prompting |
0.9 | 1 | 2025 | Draw-and-Understand: Leveraging Visual Prompts to Enable MLLMs to Comprehend What You Want · ICLR 2025 |
Computer vision › Vision and language › multimodal understanding
visual prompt understanding |
0.9 | 1 | 2025 | Draw-and-Understand: Leveraging Visual Prompts to Enable MLLMs to Comprehend What You Want · ICLR 2025 |
Machine learning › Efficient and distributed learning › model compression
efficient architecture design |
0.8 | 1 | 2024 | Efficient Deweahter Mixture-of-Experts with Uncertainty-Aware Feature-Wise Linear Modulation · AAAI 2024 |
Natural language and speech › Language models and text generation
language model analysis |
0.8 | 1 | 2024 | LLM as Dataset Analyst: Subpopulation Structure Discovery with Large Language Model · ECCV (33) 2024 |
Image and video processing
image restoration |
0.8 | 1 | 2024 | Efficient Deweahter Mixture-of-Experts with Uncertainty-Aware Feature-Wise Linear Modulation · AAAI 2024 |
Image and video processing › image restoration › adverse weather image restoration
multi-weather image restoration |
0.8 | 1 | 2024 | Efficient Deweahter Mixture-of-Experts with Uncertainty-Aware Feature-Wise Linear Modulation · AAAI 2024 |
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 |
Methods — techniques the papers use, named apart from their topics
spatial differentiable dropout · 1.0mixture of experts · 1.0homeostatic-proximal loss · 1.0domain-aware router · 1.0unified concept tokens · 0.9progressive training · 0.9multimodal large language model · 0.9monte carlo tree search · 0.9instruction tuning · 0.9group relative policy optimization · 0.9weight sharing · 0.8uncertainty-aware routing · 0.8large language model · 0.8feature-wise linear modulation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 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 | 3 |
| 2025 | Draw-and-Understand: Leveraging Visual Prompts to Enable MLLMs to Comprehend What You WantabstractIn this paper, we present the Draw-and-Understand framework, exploring how to integrate visual prompting understanding capabilities into Multimodal Large Language Models (MLLMs). Visual prompts allow users to interact through multi-modal instructions, enhancing the models' interactivity and fine-grained image comprehension. In this framework, we propose a general architecture adaptable to different pre-trained MLLMs, enabling it to recognize various types of visual prompts (such as points, bounding boxes, and free-form shapes) alongside language understanding. Additionally, we introduce MDVP-Instruct-Data, a multi-domain dataset featuring 1.2 million image-visual prompt-text triplets, including natural images, document images, scene text images, mobile/web screenshots, and remote sensing images. Building on this dataset, we introduce MDVP-Bench, a challenging benchmark designed to evaluate a model's ability to understand visual prompting instructions. The experimental results demonstrate that our framework can be easily and effectively applied to various MLLMs, such as SPHINX-X and LLaVA. After training with MDVP-Instruct-Data and image-level instruction datasets, our models exhibit impressive multimodal interaction capabilities and pixel-level understanding, while maintaining their image-level visual perception performance. Weifeng Lin, Ruichuan An, Peng Gao 0007, Bocheng Zou, Yulin Luo, Siyuan Huang 0004, Shanghang Zhang, Hongsheng Li 0001 |
ICLR | 6 |
| 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 | 10 |
| 2025 | SEEA-R1: Tree-Structured Reinforcement Fine-Tuning for Self-Evolving Embodied AgentsabstractSelf-evolution, the ability of agents to autonomously improve their reasoning and behavior, is essential for the embodied domain with long-horizon, real-world tasks. Despite current advancements in reinforcement fine-tuning (RFT) showing strong performance in enhancing reasoning in LLMs, its potential to enable self-evolving embodied intelligence with multi-modal interactions remains largely unexplored. Specifically, reinforcement fine-tuning faces two fundamental obstacles in embodied settings: (i) the lack of accessible intermediate rewards in multi-step reasoning tasks limits effective learning signals, and (ii) reliance on hand-crafted reward functions restricts generalization to novel tasks and environments. To address these challenges, we present *Self-Evolving Embodied Agents-R1*, **SEEA-R1**, the first RFT framework designed for enabling the self-evolving capabilities of embodied agents. Specifically, to convert sparse delayed rewards into denser intermediate signals that improve multi-step reasoning, we propose Tree-based group relative policy optimization (**Tree-GRPO**) integrates Monte Carlo Tree Search into GRPO. To generalize reward estimation across tasks and scenes, supporting autonomous adaptation and reward-driven self-evolution, we further introduce Multi-modal Generative Reward Model (**MGRM**). To holistically evaluate the effectiveness of SEEA-R1, we evaluate on the ALFWorld benchmark, surpassing state-of-the-art methods with scores of 85.07\% (textual) and 46.27\% (multi-modal), outperforming prior models including GPT-4o. SEEA-R1 also achieves scores of 80.3\% (textual) and 44.03\% (multi-modal) without ground truth reward, surpassing all open-source baselines and highlighting its scalability as a self-evolving embodied agent. Additional experiments and qualitative analysis further support the potential of SEEA-R1 for future research in scalable embodied intelligence. Project page is at https://seea-r1.github.io/. Wanxin Tian, Xiaowei Chi, Chun-Kai Fan, Yulin Luo, Ning Liu 0007, Zhiyuan Qin, Xiaozhu Ju, Shanghang Zhang, Jian Tang 0008 |
NeurIPS | 7 |
| 2024 | Efficient Deweahter Mixture-of-Experts with Uncertainty-Aware Feature-Wise Linear ModulationabstractThe Mixture-of-Experts (MoE) approach has demonstrated outstanding scalability in multi-task learning including low-level upstream tasks such as concurrent removal of multiple adverse weather effects. However, the conventional MoE architecture with parallel Feed Forward Network (FFN) experts leads to significant parameter and computational overheads that hinder its efficient deployment. In addition, the naive MoE linear router is suboptimal in assigning task-specific features to multiple experts which limits its further scalability. In this work, we propose an efficient MoE architecture with weight sharing across the experts. Inspired by the idea of linear feature modulation (FM), our architecture implicitly instantiates multiple experts via learnable activation modulations on a single shared expert block. The proposed Feature Modulated Expert (FME) serves as a building block for the novel Mixture-of-Feature-Modulation-Experts (MoFME) architecture, which can scale up the number of experts with low overhead. We further propose an Uncertainty-aware Router (UaR) to assign task-specific features to different FM modules with well-calibrated weights. This enables MoFME to effectively learn diverse expert functions for multiple tasks. The conducted experiments on the multi-deweather task show that our MoFME outperforms the state-of-the-art in the image restoration quality by 0.1-0.2 dB while saving more than 74% of parameters and 20% inference time over the conventional MoE counterpart. Experiments on the downstream segmentation and classification tasks further demonstrate the generalizability of MoFME to real open-world applications. Rongyu Zhang, Yulin Luo, Jiaming Liu 0003, Huanrui Yang, Zhen Dong 0003, Denis A. Gudovskiy, Tomoyuki Okuno, Yohei Nakata, Kurt Keutzer, Yuan Du, Shanghang Zhang |
AAAI | 2 |
| 2024 | LLM as Dataset Analyst: Subpopulation Structure Discovery with Large Language Model
Yulin Luo, Ruichuan An, Bocheng Zou, Jiaming Liu 0003, Shanghang Zhang |
ECCV (33) | 1 |
| 2023 | A Federated Learning System for Histopathology Image Analysis With an Orchestral Stain-Normalization GANabstractCurrently, data-driven based machine learning is considered one of the best choices in clinical pathology analysis, and its success is subject to the sufficiency of digitized slides, particularly those with deep annotations. Although centralized training on a large data set may be more reliable and more generalized, the slides to the examination are more often than not collected from many distributed medical institutes. This brings its own challenges, and the most important is the assurance of privacy and security of incoming data samples. In the discipline of histopathology image, the universal stain-variation issue adds to the difficulty of an automatic system as different clinical institutions provide distinct stain styles. To address these two important challenges in AI-based histopathology diagnoses, this work proposes a novel conditional Generative Adversarial Network (GAN) with one orchestration generator and multiple distributed discriminators, to cope with multiple-client based stain-style normalization. Implemented within a Federated Learning (FL) paradigm, this framework well preserves data privacy and security. Additionally, the training consistency and stability of the distributed system are further enhanced by a novel temporal self-distillation regularization scheme. Empirically, on large cohorts of histopathology datasets as a benchmark, the proposed model matches the performance of conventional centralized learning very closely. It also outperforms state-of-the-art stain-style transfer methods on the downstream Federated Learning image classification task, with an accuracy increase of over 20.0% in comparison to the baseline classification model. Yiqing Shen 0003, Arcot Sowmya, Yulin Luo, Xiaoyao Liang, Dinggang Shen, Jing Ke |
IEEE Trans. Medical Imaging | 3 |
| 2022 | RandStainNA: Learning Stain-Agnostic Features from Histology Slides by Bridging Stain Augmentation and Normalization
Yiqing Shen 0003, Yulin Luo, Dinggang Shen, Jing Ke |
MICCAI (2) | 2 |
| 2021 | Cluster Image Patches with Multiple Mutual Information in Unlabelled Whole-Slide ImageabstractThe massive annotation workload has always hindered the progress towards an automatic analysis of gigapixel whole-slide images. Histologically, individual patches from a constrained spatial region may share rich phenotypic information, where the morphological correlations have the potential to be mined for a grouping or clustering task. In this paper, we propose a clustering technique to extract multiple mutual information from histology images without prior domain knowledge. Specifically, our framework automatically localizes morphologically homogeneous patches within an extended solution space. Our novelty is an expanse and the pattern with which invariant information can be learnt, in contrast to the current literature of feature generation or parametric transformation within an individual patch. Additionally, structure-independent, the model may be applicable to any backbone convolutional neural network architectures. The empirical validation on The Cancer Genome Atlas (TCGA) datasets illustrates an observable margin of patch-level classification accuracy in comparison with state-of-the-art unsupervised approaches. Yiqing Shen 0003, Yizhou Lu, Yulin Luo, Jing Ke |
BIBM | 3 |
| 2020 | Research on the Construction of the Dynamical Mechanism Model for the Military Civilian Integration Sharing of College Educational Resources of Hubei ProvinceabstractIn view of the problems existing in the sharing of college educational resources in the military civilian integration, this paper puts forward the requirements for the construction of college educational resources sharing information system in the military civilian integration. The system mainly includes four aspects: teacher information management, teaching point information management, open major and course information management and resource information management. It also analyzes the contents and functions of each management module, and the main functions and access rights of the main information management module and background management are analyzed and designed. The structure of the main modules in the database is designed. The application of Ajax technology in the combination query of teachers' information and the information access control based on users are discussed. Finally, through the operation of the system, the effectiveness of the system design is verified. Yulin Luo, Xiangjun Yu |
IWCMC | 2 |