Demo Data from EDBT 2026 / reviewers in the wild / expert
Miaosen Zhang
dblp:297/3016
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · none
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 · 2 · 1 first-author · 2 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
4 papers |
Efficient and distributed learning · 44% Deep learning architectures and training · 29% Language models and text generation · 14% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 7 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | Linearly Decomposing and Recomposing Vision Transformers for Diverse-Scale Models · NeurIPS 2024 |
Machine learning › Efficient and distributed learning
model initialization |
0.8 | 1 | 2024 | Transformer as Linear Expansion of Learngene · AAAI 2024 |
Machine learning › Deep learning architectures and training
transformer |
0.8 | 1 | 2024 | Transformer as Linear Expansion of Learngene · AAAI 2024 |
Machine learning › Deep learning architectures and training › transformer
vision transformer |
0.8 | 1 | 2024 | Linearly Decomposing and Recomposing Vision Transformers for Diverse-Scale Models · NeurIPS 2024 |
Information retrieval
retrieval models |
0.8 | 1 | 2024 | Aligning Vision Models with Human Aesthetics in Retrieval: Benchmarks and Algorithms · NeurIPS 2024 |
Machine learning › Reinforcement learning › reinforcement learning from human feedback
preference-based reinforcement learning |
0.2 | 1 | 2024 | Aligning Vision Models with Human Aesthetics in Retrieval: Benchmarks and Algorithms · NeurIPS 2024 |
Computer vision › Vision and language
vision-language model |
0.2 | 1 | 2024 | Aligning Vision Models with Human Aesthetics in Retrieval: Benchmarks and Algorithms · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
preference-based RL · 1.5learngene · 1.5large language model reasoning · 1.5text embedding models · 0.8soft distillation · 0.8scaling laws · 0.8perplexity difference · 0.8linear expansion · 0.8linear decomposition · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MageBench: Bridging Large Multimodal Models to AgentsabstractRecent models like OpenAI’s O1 and DeepSeek’s R1, which utilize test-time scaling techniques, have demonstrated remarkable improvements in reasoning capabilities. We anticipate that in the near future, multimodal models will also experience significant breakthroughs in multimodal reasoning. This will require some highly challenging and specialized evaluations. As one of the most crucial real-world applications of multimodal models, visual agents require complex and comprehensive capabilities such as spatial planning and vision-in-the-chain type reasoning. These capabilities are currently lacking in existing multimodal benchmarks. In this paper, we introduce MageBench, a Multimodal reasoning benchmark built upon light-weight AGEnt environments that pose significant reasoning challenges and hold substantial practical value. The results show that only a few product-level models are better than random acting, and all of them are far inferior to human level. We analyze and summarize their errors and capability gaps in visual planning. Furthermore, we found that rule-based RL can significantly boost visual reasoning capabilities. This highlights that our benchmark could serve as a valuable testing ground for the emerging field of agentic RL research. Miaosen Zhang, Qi Dai 0001, Yifan Yang 0004, Jianmin Bao, Dongdong Chen 0001, Chong Luo 0001, Xin Geng 0001, Baining Guo |
WACV | 1 |
| 2024 | Transformer as Linear Expansion of LearngeneabstractWe propose expanding the shared Transformer module to produce and initialize Transformers of varying depths, enabling adaptation to diverse resource constraints. Drawing an analogy to genetic expansibility, we term such module as learngene. To identify the expansion mechanism, we delve into the relationship between the layer's position and its corresponding weight value, and find that linear function appropriately approximates this relationship. Building on this insight, we present Transformer as Linear Expansion of learnGene (TLEG), a novel approach for flexibly producing and initializing Transformers of diverse depths. Specifically, to learn learngene, we firstly construct an auxiliary Transformer linearly expanded from learngene, after which we train it through employing soft distillation. Subsequently, we can produce and initialize Transformers of varying depths via linearly expanding the well-trained learngene, thereby supporting diverse downstream scenarios. Extensive experiments on ImageNet-1K demonstrate that TLEG achieves comparable or better performance in contrast to many individual models trained from scratch, while reducing around 2× training cost. When transferring to several downstream classification datasets, TLEG surpasses existing initialization methods by a large margin (e.g., +6.87% on iNat 2019 and +7.66% on CIFAR-100). Under the situation where we need to produce models of varying depths adapting for different resource constraints, TLEG achieves comparable results while reducing around 19× parameters stored to initialize these models and around 5× pre-training costs, in contrast to the pre-training and fine-tuning approach. When transferring a fixed set of parameters to initialize different models, TLEG presents better flexibility and competitive performance while reducing around 2.9× parameters stored to initialize, compared to the pre-training approach. Shiyu Xia, Miaosen Zhang, Xu Yang 0021, Ruiming Chen, Xin Geng 0001 |
AAAI | 2 |
| 2024 | ScalingFilter: Assessing Data Quality through Inverse Utilization of Scaling LawsabstractHigh-quality data is crucial for the pre-training performance of large language models.Unfortunately, existing quality filtering methods rely on a known high-quality dataset as reference, which can introduce potential bias and compromise diversity.In this paper, we propose ScalingFilter, a novel approach that evaluates text quality based on the perplexity difference between two language models trained on the same data, thereby eliminating the influence of the reference dataset in the filtering process.An theoretical analysis shows that ScalingFilter is equivalent to an inverse utilization of scaling laws.Through training models with 1.3B parameters on the same data source processed by various quality filters, we find ScalingFilter can improve zero-shot performance of pre-trained models in downstream tasks.To assess the bias introduced by quality filtering, we introduce semantic diversity, a metric of utilizing text embedding models for semantic representations.Extensive experiments reveal that semantic diversity is a reliable indicator of dataset diversity, and ScalingFilter achieves an optimal balance between downstream performance and semantic diversity.1 Ruihang Li, Yixuan Wei, Miaosen Zhang, Nenghai Yu, Han Hu 0001, Houwen Peng |
EMNLP | 3 |
| 2024 | Linearly Decomposing and Recomposing Vision Transformers for Diverse-Scale ModelsabstractVision Transformers (ViTs) are widely used in a variety of applications, while they usually have a fixed architecture that may not match the varying computational resources of different deployment environments. Thus, it is necessary to adapt ViT architectures to devices with diverse computational overheads to achieve an accuracy-efficient trade-off. This concept is consistent with the motivation behind Learngene. To achieve this, inspired by polynomial decomposition in calculus, where a function can be approximated by linearly combining several basic components, we propose to linearly decompose the ViT model into a set of components called learngenes during element-wise training. These learngenes can then be recomposed into differently scaled, pre-initialized models to satisfy different computational resource constraints. Such a decomposition-recomposition strategy provides an economical and flexible approach to generating different scales of ViT models for different deployment scenarios. Compared to model compression or training from scratch, which require to repeatedly train on large datasets for diverse-scale models, such strategy reduces computational costs since it only requires to train on large datasets once. Extensive experiments are used to validate the effectiveness of our method: ViTs can be decomposed and the decomposed learngenes can be recomposed into diverse-scale ViTs, which can achieve comparable or better performance compared to traditional model compression and pre-training methods. The code for our experiments is available in the supplemental material. Shuxia Lin, Miaosen Zhang, Ruiming Chen, Xu Yang 0021, Qiufeng Wang 0002, Xin Geng 0001 |
NeurIPS | 2 |
| 2024 | Aligning Vision Models with Human Aesthetics in Retrieval: Benchmarks and AlgorithmsabstractModern vision models are trained on very large noisy datasets. While these models acquire strong capabilities, they may not follow the user's intent to output the desired results in certain aspects, e.g., visual aesthetic, preferred style, and responsibility. In this paper, we target the realm of visual aesthetics and aim to align vision models with human aesthetic standards in a retrieval system. Advanced retrieval systems usually adopt a cascade of aesthetic models as re-rankers or filters, which are limited to low-level features like saturation and perform poorly when stylistic, cultural or knowledge contexts are involved. We find that utilizing the reasoning ability of large language models (LLMs) to rephrase the search query and extend the aesthetic expectations can make up for this shortcoming. Based on the above findings, we propose a preference-based reinforcement learning method that fine-tunes the vision models to distill the knowledge from both LLMs reasoning and the aesthetic models to better align the vision models with human aesthetics. Meanwhile, with rare benchmarks designed for evaluating retrieval systems, we leverage large multi-modality model (LMM) to evaluate the aesthetic performance with their strong abilities. As aesthetic assessment is one of the most subjective tasks, to validate the robustness of LMM, we further propose a novel dataset named HPIR to benchmark the alignment with human aesthetics. Experiments demonstrate that our method significantly enhances the aesthetic behaviors of the vision models, under several metrics. We believe the proposed algorithm can be a general practice for aligning vision models with human values. Miaosen Zhang, Yixuan Wei, Zuxuan Wu, Ji Li 0006, Zheng Zhang 0022, Qi Dai 0001, Chong Luo 0001, Xin Geng 0001, Baining Guo |
NeurIPS | 1 |