Demo Data from EDBT 2026 / reviewers in the wild / expert
Shicheng Wen
dblp:146/0957
· DBLP profile ↗
6ranked-venue papers
3as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author
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
1 paper |
Vision and language · 77% Transfer learning and domain adaptation · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Web and social media mining · 100% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language
vision-language model |
1.0 | 1 | 2026 | MegaCoin: Enhancing Medium-Grained Color Perception for Vision-Language Models · AAAI 2026 |
Web and social media mining
information diffusion |
0.8 | 1 | 2024 | MIDDAG: Where Does Our News Go? Investigating Information Diffusion via Community-Level Information Pathways · AAAI 2024 |
Visualization and visual analytics › interactive visualization
interactive visualization system |
0.8 | 1 | 2024 | MIDDAG: Where Does Our News Go? Investigating Information Diffusion via Community-Level Information Pathways · AAAI 2024 |
Machine learning › Transfer learning and domain adaptation
domain generalization |
0.3 | 1 | 2026 | MegaCoin: Enhancing Medium-Grained Color Perception for Vision-Language Models · AAAI 2026 |
Computational social science and digital humanities
social media analysis |
0.2 | 1 | 2024 | MIDDAG: Where Does Our News Go? Investigating Information Diffusion via Community-Level Information Pathways · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
propagation forecasting · 2.3community detection · 2.3supervised fine-tuning · 1.0linear probing · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MegaCoin: Enhancing Medium-Grained Color Perception for Vision-Language ModelsabstractIn vision-language models (VLMs), the ability to perceive and interpret color and physical environment is crucial for achieving contextually accurate understanding and interaction. However, despite advances in multimodal modeling, there remains a significant lack of specialized datasets that rigorously evaluate a model's capacity to discern subtle color variations and spatial context---critical elements for situational comprehension and reliable deployment across real-world applications. Toward that goal, we curate MegaCoin, a high-quality, human-labeled dataset based on \emph{real} images with various contextual attributes. MegaCoin consists of two parts: MegaCoin-Instruct, which serves as a supervised fine-tuning (SFT) dataset for VLMs; and MegaCoin-Bench, an annotated test set that can be used as a stand-alone QA dataset. MegaCoin provides three annotated features for 220,000 real images: foreground color, background color, and description of an object's physical environment, constituting 660k human annotations. In addition, MegaCoin can be applied to benchmark domain generalization (DG) algorithms. We explore benchmarking DG methods in the linear probing setup for VLM and show some new insights. Last but not least, we show that VLMs, including GPT-4o, have subpar color recognition capabilities, and fine-tuning with MegaCoin can result in improved performance on visual evaluation tasks. In certain cases, MegaCoin fine-tuned small-scale open-source models such as LLaVA and Bunny can outperform closed-source GPT-4o. We hope the utilities of MegaCoin can shed light on the directions VLMs can improve and provide a more complex platform for domain generalization algorithms. Ming-Chang Chiu, Shicheng Wen, Xuezhe Ma |
AAAI | 2 |
| 2024 | MIDDAG: Where Does Our News Go? Investigating Information Diffusion via Community-Level Information PathwaysabstractWe present MIDDAG, an intuitive, interactive system that visualizes the information propagation paths on social media triggered by COVID-19-related news articles accompanied by comprehensive insights including user/community susceptibility level, as well as events and popular opinions raised by the crowd while propagating the information. Besides discovering information flow patterns among users, we construct communities among users and develop the propagation forecasting capability, enabling tracing and understanding of how information is disseminated at a higher level. A demo video and more are available at https://info-pathways.github.io. Mingyu Derek Ma, Alexander K. Taylor 0002, Nuan Wen, Po-Nien Kung, Wenna Qin, Shicheng Wen, Azure Zhou, Diyi Yang, Xuezhe Ma, Nanyun Peng 0001, Wei Wang 0010 |
AAAI | 7 |
| 2015 | PCGD: Principal components-based great deluge method for solving CNOPabstractConditional nonlinear optimal perturbation (CNOP) is an initial perturbation evolving into the largest nonlinear evolution at the prediction time. It has become a useful tool in meteorology and oceanography. The common method for solving the CNOP is the adjoint-based method which is always referred to as the benchmark. Unfortunately, many numerical models have no corresponding adjoint models, and developing a new one is usually a huge engineering, which consequently limits the application of the CNOP. In order to avoid adjoint models, we propose a principal components-based great deluge method to solve the CNOP. Through extracting principal components, the original problem is reduced into a low-dimensional space to hunt the coordinate of the optimal CNOP with the great deluge method. A regeneration strategy is also designed for the great deluge method to break away from local optimal positions. In addition, the proposed method can be parallelized to improve the computing efficiency. To demonstrate the validity, the proposed method has been studied in the Zebiak-Cane model to solve the CNOP. Experimental results show that the proposed method can efficiently obtain a satisfactory CNOP, approximate to the one computed with the adjoint-based method, and the parallelizing version can reach the speedup of 9.7 times with 12 cores. Shicheng Wen, Shijin Yuan, Bin Mu, Hongyu Li 0001, Juhui Ren |
CEC | 1 |
| 2015 | Robust PCA-Based Genetic Algorithm for Solving CNOP
Shicheng Wen, Shijin Yuan, Bin Mu, Hongyu Li 0001 |
ICIC (1) | 1 |
| 2014 | SAEP: Simulated Annealing Based Ensemble Projecting Method for Solving Conditional Nonlinear Optimal Perturbation
Shicheng Wen, Shijin Yuan, Bin Mu, Hongyu Li 0001 |
ICA3PP (1) | 1 |
| 2014 | Orthogonal Neighborhood Preservation Projection Based Method for Solving CNOP
Bin Mu, Shicheng Wen, Shijin Yuan, Hongyu Li 0001 |
ICIC (1) | 2 |