Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aijun Yang

dblp:60/9132 · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
7since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 5 since 2021Systems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Computer networks · 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
3 papers
Reinforcement learning · 29% Vision and language · 27% Deep learning architectures and training · 15%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › reward design
reinforcement learning with verifiable rewards
1.012026
Powering Verifiable Learning via Automated Evolutionary Data Synthesis · ACL (1) 2026
Machine learning › Deep learning architectures and training › data-centric deep learning
training data generation
1.012026
Powering Verifiable Learning via Automated Evolutionary Data Synthesis · ACL (1) 2026
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
Enhancing the Outcome Reward-based RL Training of MLLMs with Self-Consistency Sampling · NeurIPS 2025
Computer vision › Vision and language
multimodal reasoning
0.912025
Enhancing the Outcome Reward-based RL Training of MLLMs with Self-Consistency Sampling · NeurIPS 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.512021
Complementary Relation Contrastive Distillation · CVPR 2021
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.512021
Complementary Relation Contrastive Distillation · CVPR 2021
Computer vision › Video understanding and tracking
relation distillation
0.512021
Complementary Relation Contrastive Distillation · CVPR 2021
Machine learning › Trustworthy machine learning › interpretability
faithful reasoning
0.312025
Enhancing the Outcome Reward-based RL Training of MLLMs with Self-Consistency Sampling · NeurIPS 2025
Machine learning › Representation and self-supervised learning
mutual information maximization
0.112021
Complementary Relation Contrastive Distillation · CVPR 2021

Methods — techniques the papers use, named apart from their topics

knowledge distillation · 1.0evolutionary algorithm · 1.0self-consistency sampling · 0.9RLOO · 0.9REINFORCE++ · 0.9GRPO · 0.9mutual information estimation · 0.5contrastive loss · 0.5
YearPublicationVenuePosition
2026 Powering Verifiable Learning via Automated Evolutionary Data Synthesis
abstract
Reliable verifiable data has become a key driver of capability gains in modern language models, enabling stable reinforcement learning with verifiable rewards and effective distillation that transfers competence across math, coding, and agentic tasks.Yet constructing generalizable synthetic verifiable data remains difficult due to hallucination-prone generation, and weak or trivial verification artifacts that fail to separate strong from weak solutions.Existing approaches often rely on task-specific heuristics or post-hoc filters that do not transfer across domains and lack a principled, universal evaluator of verifiability.In this work, we introduce an evolutionary, task-agnostic, strategy-guided, executably-checkable data synthesis framework that, from minimal seed supervision, jointly synthesizes problems, diverse candidate solutions, and verification artifacts, and iteratively discovers strategies via a consistencybased evaluator that enforces agreement between human-annotated and strategy-induced checks.This pipeline upgrades filtering into principled synthesis: it reliably assembles coherent, verifiable training instances and generalizes without domain-specific rules.Our experiments demonstrate the effectiveness of the proposed approach under both RLVR and model distillation training paradigms.The results show that training with our synthesized data yields significant improvements on both the LiveCodeBench and AgentBench-OS tasks, highlighting the robust generalization of our framework 1 .
He Du, Bowen Li 0002, Aijun Yang, Siyang He, Qipeng Guo, Kai Chen 0026, Dacheng Tao
ACL (1)3
2025 Enhancing the Outcome Reward-based RL Training of MLLMs with Self-Consistency Sampling
abstract
Outcome‑reward reinforcement learning (RL) is a common—and increasingly significant—way to refine the step‑by‑step reasoning of multimodal large language models (MLLMs). In the multiple‑choice setting—a dominant format for multimodal reasoning benchmarks—the paradigm faces a significant yet often overlooked obstacle: unfaithful trajectories that guess the correct option after a faulty chain of thought receive the same reward as genuine reasoning, which is a flaw that cannot be ignored. We propose Self‑Consistency Sampling (SCS) to correct this issue. For each question, SCS (i) introduces small visual perturbations and (ii) performs repeated truncation‑and‑resampling of a reference trajectory; agreement among the resulting trajectories yields a differentiable consistency score that down‑weights unreliable traces during policy updates. Plugging SCS into RLOO, GRPO, REINFORCE++ series improves accuracy by up to 7.7 percentage points on six multimodal benchmarks with negligible extra computation, offering a simple, general remedy for outcome‑reward RL in MLLMs.
Jiahao Wang 0005, Weiye Xu 0003, Aijun Yang, Wengang Zhou 0001, Lewei Lu, Houqiang Li, Xiaohua Wang 0001, Jinguo Zhu
NeurIPS3
2024 Power-Llava: Large Language and Vision Assistant for Power Transmission Line Inspection
abstract
The inspection of power transmission line has achieved notable achievements in the past few years, primarily due to the integration of deep learning technology. However, current inspection approaches continue to encounter difficulties in generalization and intelligence, which restricts their further applicability. In this paper, we introduce Power-LLaVA, the first large language and vision assistant designed to offer professional and reliable inspection services for power transmission line by engaging in dialogues with humans. Moreover, we also construct a large-scale and high-quality dataset specialized for the inspection task. By employing a two-stage training strategy on the constructed dataset, Power-LLaVA demonstrates exceptional performance at a comparatively low training cost. Extensive experiments further prove the great capabilities of Power-LLaVA within the realm of power transmission line inspection. Code shall be released.
Jiahao Wang 0003, Haichen Luo, Jinguo Zhu, Aijun Yang, Mingzhe Rong, Xiaohua Wang 0003
ICIP5
2023 Temporal transaction information-aware Ponzi scheme detection for ethereum smart contracts
Lei Wang 0042, Zibin Zheng, Aijun Yang
Eng. Appl. Artif. Intell.4
2022 Virtual Alternating Current Measurements Advance Semiconductor Gas Sensors' Performance in the Internet of Things
abstract
Semiconductor gas sensors are important candidates with small size, low-power consumption, and low-cost characteristics for gas sensing in the Internet of Things (IoT), but the nonlinear response, unstable baseline, and the variability of the responses toward temperature and humidity fluctuation harm its performance. Here, we proposed a new technique called virtual alternating current (ac) measurements to enable semiconductor gas sensors to achieve high linear response ($R^{2}>0.99$), stable baseline, and easily calibrated temperature and humidity fluctuation. The most outstanding advantage of our technique is to achieve excellent performance simply by measuring resistance. The universality and feasibility of our technique were verified by a range of commercial and homemade sensing elements and a range of analyte. We also successfully generalized our technique to non-Debye relaxation systems, which further expands the scope of semiconductor gas sensor types available in our technique. We believe that our technique will enable gas sensing nodes built with semiconductor gas sensors in the IoT to achieve markedly superior performance.
Dawei Wang 0011, Jianbin Pan, Xianbo Huang, Jifeng Chu, Huan Yuan, Aijun Yang, Nikhil Koratkar, Xiaohua Wang 0001, Mingzhe Rong
IEEE Internet Things J.6
2021 Complementary Relation Contrastive Distillation
abstract
Knowledge distillation aims to transfer representation ability from a teacher model to a student model. Previous approaches focus on either individual representation distillation or inter-sample similarity preservation. While we argue that the inter-sample relation conveys abundant information and needs to be distilled in a more effective way. In this paper, we propose a novel knowledge distillation method, namely Complementary Relation Contrastive Distillation (CRCD), to transfer the structural knowledge from the teacher to the student. Specifically, we estimate the mutual relation in an anchor-based way and distill the anchor-student relation under the supervision of its corresponding anchor-teacher relation. To make it more robust, mutual relations are modeled by two complementary elements: the feature and its gradient. Furthermore, the low bound of mutual information between the anchor-teacher relation distribution and the anchor-student relation distribution is maximized via relation contrastive loss, which can distill both the sample representation and the inter-sample relations. Experiments on different benchmarks demonstrate the effectiveness of our proposed CRCD.
Jinguo Zhu, Shixiang Tang, Dapeng Chen, Shijie Yu, Yakun Liu, Mingzhe Rong, Aijun Yang, Xiaohua Wang 0001
CVPR7
2021 Ponzi scheme detection via oversampling-based Long Short-Term Memory for smart contracts
Lei Wang 0042, Zibin Zheng, Aijun Yang, Xiaohu Zhu
Knowl. Based Syst.4
2019 Quantitative Detection of Mixed Gases by Sensor Array Using C-Means Clustering and Artificial Neural Network
abstract
Due to the cross-sensitivity to kinds of gases, traditional single sensor is impossible to selectively detect gases, which limits its application. In this paper, a sensor array with supervised and unsupervised algorithms was employed to selectively detect NO2, CO and their mixtures. To improve the recognition accuracy, average resistance over a period of time was introduced to acquire features, including response value, response time and recovery time. Firstly, principal component analysis (PCA) was utilized to reduce the dimensionality of samples. With the help of unsupervised fuzzy C-means clustering algorithm, samples have exhibited obvious clustering. Furthermore, artificial neural network (ANN) has reached a high accuracy of quantitative identification on six different detected gases varying from 0 to 50 ppm.
Jifeng Chu, Mingzhe Rong, Weijuan Li, Dawei Wang 0011, Chengyu Fan, Aijun Yang, Yunjia Li, Xiaohua Wang 0001
IECON8
2019 A miniaturized electromagnetic energy harvester with off-axis magnet and stacked flexible coils
abstract
In this work, a miniaturized Electromagnetic Vibration Energy Harvester (EVEH) device based on stacked flexible coils and flexible springs is designed and characterized. The energy harvesting is realized by the combined piston and torsional movement of the magnet. At an acceleration of ±1g peak-to-peak amplitude (±9.8 m/s2), a maximum output peak-to-peak voltage of 704.28 mV and an output power of 20.75 μW are measured, at a frequency of 58 Hz.
Yunjia Li, Aijun Yang, Kai Tao, Dayong Qiao
IECON3