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

Xiaozhe Li

dblp:291/5221 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 since 2021Computer networks · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
3 papers
Image recognition and object detection · 34% Language models and text generation · 30% Vision and language · 26%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
agentic language model
1.012026
Timely Machine: Awareness of Time Makes Test-Time Scaling Agentic · ACL (1) 2026
Natural language and speech › Language models and text generation
test-time scaling
1.012026
Timely Machine: Awareness of Time Makes Test-Time Scaling Agentic · ACL (1) 2026
Computer vision › Vision and language
multimodal benchmark
0.912025
Information Density Principle for MLLM Benchmarks · ICCV 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
Information Density Principle for MLLM Benchmarks · ICCV 2025
Computer vision › Image recognition and object detection › object detection
feature pyramid network
0.812024
YOLOH: You Only Look One Hourglass for Real-Time Object Detection · IEEE Trans. Image Process. 2024
Machine learning › Deep learning architectures and training
multi-scale feature fusion
0.812024
YOLOH: You Only Look One Hourglass for Real-Time Object Detection · IEEE Trans. Image Process. 2024
Computer vision › Image recognition and object detection
object detection
0.812024
YOLOH: You Only Look One Hourglass for Real-Time Object Detection · IEEE Trans. Image Process. 2024
Computer vision › Image recognition and object detection › object detection › efficient object detection
real-time object detection
0.812024
YOLOH: You Only Look One Hourglass for Real-Time Object Detection · IEEE Trans. Image Process. 2024

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

time-aware agentic scaling · 1.0hourglass network · 0.8dilated residual blocks · 0.8dense connections · 0.8
YearPublicationVenuePosition
2026 Timely Machine: Awareness of Time Makes Test-Time Scaling Agentic
abstract
Yichuan Ma, Linyang Li, Yongkang Chen, Peiji Li, Xiaozhe Li, Qipeng Guo, Dahua Lin, Kai Chen. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Yichuan Ma, Linyang Li, Peiji Li, Xiaozhe Li, Qipeng Guo, Dahua Lin, Kai Chen 0026
ACL (1)5
2025 Information Density Principle for MLLM Benchmarks
abstract
With the emergence of Multimodal Large Language Models (MLLMs), hundreds of benchmarks have been developed to ensure the reliability of MLLMs in downstream tasks. However, the evaluation mechanism itself may not be reliable. For developers of MLLMs, questions remain about which benchmark to use and whether the test results meet their requirements. Therefore, we propose a critical principle of Information Density, which examines how much insight a benchmark can provide for the development of MLLMs. We characterize it from four key dimensions: (1) Fallacy, (2) Difficulty, (3) Redundancy, (4) Diversity. Through a comprehensive analysis of more than 10,000 samples, we measured the information density of 19 MLLM benchmarks. Experiments show that using the latest benchmarks in testing can provide more insight compared to previous ones, but there is still room for improvement in their information density. We hope this principle can promote the development and application of future MLLM benchmarks. Project page: https://github.com/lcysyzxdxc/bench4bench
Chunyi Li 0001, Xiaozhe Li, Yuan Tian 0017, Ziheng Jia, Xiaohong Liu 0001, Xiongkuo Min, Jia Wang 0004, Haodong Duan, Kai Chen 0026, Guangtao Zhai
ICCV2
2024 Auto-Protection for Resonant Beam SWIPT in Portable Applications
abstract
Simultaneous wireless information and power transfer (SWIPT) is regarded as the enabling technology for IoT, 5G and beyond, or even 6G. Resonant beam system (RBS) is a promising candidate to provide high-power, long-range, and intrinsically safe SWIPT. Yet ensuring human safety under high-power application scenarios is still challenging. In this paper, we propose a portable auto-protection (AP) scheme to enhance the safety of RBS. Leveraging self-mixing interference, the high-power resonant beam is automatically cut off as the low-power protective beam is obstructed by foreign objects, resulting in less radiation exposure to invading objects. The paper proposes a phase compensation scheme that resolves the contradiction between portability and interference-induced mode variation, allowing the receiver to be placed anywhere within the field of view. Moreover, by approximating the cavity to Fabry-Pérot interferometer, analytical models are established to reveal the safety-enhancement mechanism and evaluate the system performance. Numerical results demonstrate that the AP scheme will not significantly compromise the portability and SWIPT performance of RBS, as the average spectral efficiency and electric power are 13.55bps/Hz and 5.42W respectively, within 6m transmission distance.
Shuaifan Xia, Qingwen Liu 0001, Mingqing Liu 0002, Wen Fang 0001, Mingliang Xiong, Xiaozhe Li
IEEE Internet Things J.7
2024 YOLOH: You Only Look One Hourglass for Real-Time Object Detection
abstract
Multi-scale detection based on Feature Pyramid Networks (FPN) has been a popular approach in object detection to improve accuracy. However, using multi-layer features in the decoder of FPN methods entails performing many convolution operations on high-resolution feature maps, which consumes significant computational resources. In this paper, we propose a novel perspective for FPN in which we directly use fused single-layer features for regression and classification. Our proposed model, You Only Look One Hourglass (YOLOH), fuses multiple feature maps into one feature map in the encoder. We then use dense connections and dilated residual blocks to expand the receptive field of the fused feature map. This output not only contains information from all the feature maps, but also has a multi-scale receptive field for detection. The experimental results on the COCO dataset demonstrate that YOLOH achieves higher accuracy and better run-time performance than established detector baselines, for instance, it achieves an average precision (AP) of 50.2 on a standard 3× training schedule and achieves 40.3 AP at a speed of 32 FPS on the ResNet-50 model. We anticipate that YOLOH can serve as a reference for researchers to design real-time detection in future studies. Our code is available at https://github.com/wsb853529465/YOLOH-main.
Shaobo Wang 0003, Renhai Chen, Hongyue Wu, Xiaozhe Li, Zhiyong Feng 0002
IEEE Trans. Image Process.4
2022 Scheduling Schemes for Age Optimization in IoT Systems With Limited Retransmission Times
abstract
Age of Information (AoI) is a recently introduced metric to capture data freshness. In this article, we consider a multiuser single-destination Internet of Things (IoT) system with periodic state updating, and investigate the scheduling methods of minimizing the long-term average AoI with limited retransmission times. In view of the retransmission mode, the AoI optimization problems for retransmission with and without feedback are analyzed. For the retransmission without feedback, we formulate the expected decision loss (EDL) function of the AoI optimization problem with the finite retransmission times and propose a loss-greedy policy by minimizing the EDL at each step. For the retransmission with feedback, a potential optimal solution is to construct the AoI optimization problem as an infinite-horizon Markov decision process (MDP) and solve the corresponding Bellman optimal equations. However, this optimal solution is prone to suffer from the curse of dimensionality and is hard to implement. To address this issue, we decouple the infinite-horizon MDP into the finite-state MDP in each single frame, and then propose a low-complexity slot-based max-weight (SBMW) policy to minimize the long-term average AoI. Numerical results show that, compared with an ALOHA-like baseline policy, the proposed Loss-Greedy policy can achieve up to 48% reduction of the average AoI for the retransmission without feedback, while the SBMW policy can reduce the average AoI by 57% in the retransmission with feedback. The average performance gain of the proposed policies over the state-of-the-art policies is at least 10%.
Heng Wang 0003, Xin Xie 0004, Xiaozhe Li, Jingqi Yang
IEEE Internet Things J.3