Yijie Zhi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yijie Zhi has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Ming Cai
College of Computer Science and Technology, Zhejiang University, Hangzhou, China
2 shared publications - Feiping Nie
Northwestern Polytechnical University
1 shared publication - Jianhua Dai
Zhejiang Institute of Administration, Hangzhou, Zhejiang, China
1 shared publication - Jingwen Pu
Zhejiang University, Hangzhou, Zhejiang, China
1 shared publication - Qinran Wu
Zhejiang University, Hangzhou, Zhejiang, China
1 shared publication - Renyi Qi
ZJU-UIUC Institute, Zhejiang University, Haining 314400, China
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
A Lightweight 1D-CNN-Transformer for Bearing Fault Diagnosis Under Limited Data and AWGN Interference
Intelligent bearing fault diagnosis is essential for maintaining the reliability of rotating machinery. However, deploying deep learning models in industrial environments is often constrained by a lack of labeled data, environmental noise, and strict hardware limits. To address these connected challenges, this paper proposes 1D-CNN-Trans, a flexible and resource-efficient hybrid framework. Designed for supervised diagnosis with restricted data, the configurable model combines a compact one-dimensional convolutional neural network (1D-CNN) for local feature extraction, a Transformer encoder for capturing long-range temporal dependencies, and an optional squeeze-and-excitation (SE) module for channel recalibration under favorable conditions. The method is evaluated on two standard mechanical benchmarks under limited sample conditions, controlled additive white Gaussian noise (AWGN), and dynamic non-stationary interference. Experimental results indicate that 1D-CNN-Trans shows improved robustness under interference compared to selected baselines, notably improving accuracy against a standard CNN backbone. Furthermore, findings indicate that while the Transformer ensures noise robustness, channel recalibration (via SE) introduces optimization instability under extreme sparsity and noise. Consequently, we reposition the architecture as a configurable framework where recalibration is conditionally activated. Finally, theoretical complexity analysis is provided to validate the model’s low computational burden, indicating its general feasibility for resource-constrained scenarios.
Top Cited PapersOpen AccessA Lightweight 1D-CNN-Transformer for Bearing Fault Diagnosis Under Limited Data and AWGN Interference
Intelligent bearing fault diagnosis is essential for maintaining the reliability of rotating machinery. However, deploying deep learning models in industrial environments is often constrained by a lack of labeled data, environmental noise, and strict hardware limits. To address these connected challenges, this paper proposes 1D-CNN-Trans, a flexible and resource-efficient hybrid framework. Designed for supervised diagnosis with restricted data, the configurable model combines a compact one-dimensional convolutional neural network (1D-CNN) for local feature extraction, a Transformer encoder for capturing long-range temporal dependencies, and an optional squeeze-and-excitation (SE) module for channel recalibration under favorable conditions. The method is evaluated on two standard mechanical benchmarks under limited sample conditions, controlled additive white Gaussian noise (AWGN), and dynamic non-stationary interference. Experimental results indicate that 1D-CNN-Trans shows improved robustness under interference compared to selected baselines, notably improving accuracy against a standard CNN backbone. Furthermore, findings indicate that while the Transformer ensures noise robustness, channel recalibration (via SE) introduces optimization instability under extreme sparsity and noise. Consequently, we reposition the architecture as a configurable framework where recalibration is conditionally activated. Finally, theoretical complexity analysis is provided to validate the model’s low computational burden, indicating its general feasibility for resource-constrained scenarios.
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1113-1135
LOOPRAG: Enhancing Loop Transformation Optimization with Retrieval-Augmented Large Language Models
Loop transformations are semantics-preserving optimization techniques applied at the source level, widely used in compilers to maximize objectives such as vectorization and parallelism. Despite decades of research, applying the optimal composition of loop transformations remains challenging due to inherent complexities, including dependency analysis and cost modeling for optimization objectives. Recent studies have explored the potential of Large Language Models (LLMs) for code optimization. However, our key observation is that LLMs often struggle with effective loop transformation optimization, frequently leading to errors or suboptimal optimization, thereby missing significant opportunities for performance improvements. To bridge this gap, we propose LOOPRAG, a novel retrieval-augmented generation framework designed to guide LLMs in performing effective loop optimization on Static Control Part (SCoP). We introduce a parameter-driven method to harness loop properties, which trigger various loop transformations, and generate diverse yet legal example codes serving as a demonstration source. To effectively obtain the most informative demonstrations, we propose a loop-aware algorithm based on loop features, which balances similarity and diversity for code retrieval. To enhance correct and efficient code generation, we introduce a feedback-based iterative mechanism that incorporates compilation, testing and performance results as feedback to guide LLMs. Each optimized code generated by LOOPRAG undergoes mutation, coverage and differential testing to perform equivalence checking. We evaluate LOOPRAG on PolyBench, TSVC and LORE benchmark suites, and compare it against compilers (GCC-Graphite, Clang-Polly, Perspective and ICX) and representative LLMs (DeepSeek and GPT-4). The results demonstrate average speedups over compilers of up to 11.20×, 14.34×, and 9.29× for PolyBench, TSVC, and LORE, respectively, and speedups over base LLMs of up to 11.97×, 5.61×, and 11.59×.
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1113-1135
Open AccessLOOPRAG: Enhancing Loop Transformation Optimization with Retrieval-Augmented Large Language Models
Loop transformations are semantics-preserving optimization techniques applied at the source level, widely used in compilers to maximize objectives such as vectorization and parallelism. Despite decades of research, applying the optimal composition of loop transformations remains challenging due to inherent complexities, including dependency analysis and cost modeling for optimization objectives. Recent studies have explored the potential of Large Language Models (LLMs) for code optimization. However, our key observation is that LLMs often struggle with effective loop transformation optimization, frequently leading to errors or suboptimal optimization, thereby missing significant opportunities for performance improvements. To bridge this gap, we propose LOOPRAG, a novel retrieval-augmented generation framework designed to guide LLMs in performing effective loop optimization on Static Control Part (SCoP). We introduce a parameter-driven method to harness loop properties, which trigger various loop transformations, and generate diverse yet legal example codes serving as a demonstration source. To effectively obtain the most informative demonstrations, we propose a loop-aware algorithm based on loop features, which balances similarity and diversity for code retrieval. To enhance correct and efficient code generation, we introduce a feedback-based iterative mechanism that incorporates compilation, testing and performance results as feedback to guide LLMs. Each optimized code generated by LOOPRAG undergoes mutation, coverage and differential testing to perform equivalence checking. We evaluate LOOPRAG on PolyBench, TSVC and LORE benchmark suites, and compare it against compilers (GCC-Graphite, Clang-Polly, Perspective and ICX) and representative LLMs (DeepSeek and GPT-4). The results demonstrate average speedups over compilers of up to 11.20×, 14.34×, and 9.29× for PolyBench, TSVC, and LORE, respectively, and speedups over base LLMs of up to 11.97×, 5.61×, and 11.59×.
- 16 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (9) , 6055-6068
Multitask Learning for Classification Problem via New Tight Relaxation of Rank Minimization
Multitask learning (MTL) is a joint learning paradigm, which fuses multiple related tasks together to achieve the better performance than single-task learning methods. It has been observed by many researchers that different tasks with certain similarities share a low-dimensional common yet latent subspace. In order to get the low-rank structure shared across tasks, trace norm has been used as a convex relaxation of the rank minimization problem. However, trace norm is not a tight approximation for the rank function. To address this important issue, we propose two novel regularization-based models to approximate the rank minimization problem by minimizing the k minimal singular values. For our new models, if the minimal singular values are suppressed to zeros, the rank would also be reduced. Compared with the standard trace norm, our new regularization-based models are the tighter approximations, which can help our models capture the low-dimensional subspace among multiple tasks better. Besides, it is an NP-hard problem to directly solve the exact rank minimization problem for our models. In this article, we proposed two simple but effective strategies to optimize our models, which tactically solves the exact rank minimization problem by setting a large penalizing parameter. Experimental results performed on synthetic and real-world benchmark datasets demonstrate that the proposed models have the ability of learning the low-rank structure shared across tasks and the better performance than other classical MTL methods.
- 16 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (9) , 6055-6068
Multitask Learning for Classification Problem via New Tight Relaxation of Rank Minimization
Multitask learning (MTL) is a joint learning paradigm, which fuses multiple related tasks together to achieve the better performance than single-task learning methods. It has been observed by many researchers that different tasks with certain similarities share a low-dimensional common yet latent subspace. In order to get the low-rank structure shared across tasks, trace norm has been used as a convex relaxation of the rank minimization problem. However, trace norm is not a tight approximation for the rank function. To address this important issue, we propose two novel regularization-based models to approximate the rank minimization problem by minimizing the k minimal singular values. For our new models, if the minimal singular values are suppressed to zeros, the rank would also be reduced. Compared with the standard trace norm, our new regularization-based models are the tighter approximations, which can help our models capture the low-dimensional subspace among multiple tasks better. Besides, it is an NP-hard problem to directly solve the exact rank minimization problem for our models. In this article, we proposed two simple but effective strategies to optimize our models, which tactically solves the exact rank minimization problem by setting a large penalizing parameter. Experimental results performed on synthetic and real-world benchmark datasets demonstrate that the proposed models have the ability of learning the low-rank structure shared across tasks and the better performance than other classical MTL methods.