Junru Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Junru Luo has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Bo Zhang
SKLMS and Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China, and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, 100049, China
4 shared publications - Hong Qiao
Institute of Automation, Chinese Academy of Sciences
3 shared publications - Lin Shi
Changzhou University
3 shared publications - Kailai Hu
School of Alibaba Cloud Big Data, Changzhou University, Changzhou 213164, China
2 shared publications - Shoukun Xu
Changzhou University
2 shared publications - Chao Chi
No.7 Oil Production Plant, Daqing Oilfield Co., Ltd., Daqing 163514, China
1 shared publication
Latest Publications
- 13 July 2026
- Published by Springer Nature
- p. 265-278
TD3-SOBT: Offline Reinforcement Learning for Set-Point Tracking in Industrial CSTR Process
- 13 July 2026
- Published by Springer Nature
- p. 265-278
TD3-SOBT: Offline Reinforcement Learning for Set-Point Tracking in Industrial CSTR Process
- Open Access
- 26 June 2026
- Published by Elsevier in SSRN Electronic Journal
TriAtt-STNet: Channel–Temporal–Spatial Attention with Seasonality-Aware Embedding for Long-Horizon Ozone Forecasting
Long-horizon spatio-temporal forecasting under strong seasonal distribution drift, mixed temporal periodicity, and time-varying inter-node dependency remains a challenging problem, with ozone concentration prediction serv ing as a representative and demanding instance. We propose TriAtt-STNet, a channel–temporal–spatial tri-attention network with seasonality-aware em bedding that targets this general class of problems and is instantiated here for long-horizon ozone forecasting. The framework integrates hybrid-statistics reversible normalization to stabilize distribution drift by fusing instance-level and climatological priors, seasonality-aware embedding to preserve temporal context and spatial identity, and stacked spatio-temporal attention blocks to jointly capture dominant periodic structures and dynamic inter-node cou pling. Experiments on gridded ozone data over East China show that TriAtt STNet achieves the best overall performance among the compared baselines, while cross-horizon, ablation, and visualization analyses further demonstrate its robustness and interpretability. Beyond ozone, the design is broadly ap plicable to spatio-temporal forecasting tasks that exhibit seasonal drift and multi-scale periodicity, such as air-quality, traffic, hydrological, and energy demand prediction, providing both an effective data-driven basis for envi ronmental decision support and a general modeling perspective for the time series and spatio-temporal learning community.
- 26 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessTriAtt-STNet: Channel–Temporal–Spatial Attention with Seasonality-Aware Embedding for Long-Horizon Ozone Forecasting
Long-horizon spatio-temporal forecasting under strong seasonal distribution drift, mixed temporal periodicity, and time-varying inter-node dependency remains a challenging problem, with ozone concentration prediction serv ing as a representative and demanding instance. We propose TriAtt-STNet, a channel–temporal–spatial tri-attention network with seasonality-aware em bedding that targets this general class of problems and is instantiated here for long-horizon ozone forecasting. The framework integrates hybrid-statistics reversible normalization to stabilize distribution drift by fusing instance-level and climatological priors, seasonality-aware embedding to preserve temporal context and spatial identity, and stacked spatio-temporal attention blocks to jointly capture dominant periodic structures and dynamic inter-node cou pling. Experiments on gridded ozone data over East China show that TriAtt STNet achieves the best overall performance among the compared baselines, while cross-horizon, ablation, and visualization analyses further demonstrate its robustness and interpretability. Beyond ozone, the design is broadly ap plicable to spatio-temporal forecasting tasks that exhibit seasonal drift and multi-scale periodicity, such as air-quality, traffic, hydrological, and energy demand prediction, providing both an effective data-driven basis for envi ronmental decision support and a general modeling perspective for the time series and spatio-temporal learning community.
- Open Access
Oil Production-Energy Consumption Relationship Modeling Using Generalized Linear Model
This study investigates the relationship between energy consumption and oil production in petroleum extraction using a Generalized Linear Model (GLM). By analyzing actual production data from a Daqing Oilfield production plant (2021–2024), key energy consumption features such as electricity usage, mechanical extraction, water injection, and transportation were selected to construct a GLM predictive model. Comparisons with Generalized Least Squares (GLS) and linear regression models demonstrated the superior performance of GLM, achieving a coefficient of determination () of 0.884, with mean absolute error (MAE) and mean squared error (MSE) of 0.095 and 0.012, respectively. The study highlights the nonlinear impacts of energy consumption on oil production, offering theoretical insights for optimizing energy use and supporting low-carbon transitions in oilfield operations. Future research will explore interaction effects to enhance model generalizability.Open AccessOil Production-Energy Consumption Relationship Modeling Using Generalized Linear Model
This study investigates the relationship between energy consumption and oil production in petroleum extraction using a Generalized Linear Model (GLM). By analyzing actual production data from a Daqing Oilfield production plant (2021–2024), key energy consumption features such as electricity usage, mechanical extraction, water injection, and transportation were selected to construct a GLM predictive model. Comparisons with Generalized Least Squares (GLS) and linear regression models demonstrated the superior performance of GLM, achieving a coefficient of determination () of 0.884, with mean absolute error (MAE) and mean squared error (MSE) of 0.095 and 0.012, respectively. The study highlights the nonlinear impacts of energy consumption on oil production, offering theoretical insights for optimizing energy use and supporting low-carbon transitions in oilfield operations. Future research will explore interaction effects to enhance model generalizability. - 30 January 2026
- Published by Springer Nature
- p. 213-230
Robust Ensemble Learning via t-Tilted Loss: A Noise-Resistant Framework
- 30 January 2026
- Published by Springer Nature
- p. 213-230
Robust Ensemble Learning via t-Tilted Loss: A Noise-Resistant Framework
- Open Access
Online AUC Optimization Based on Second-order Surrogate Loss
The Area Under the Curve (AUC) is an important performance metric for classification tasks, particularly in class-imbalanced scenarios. However, minimizing the AUC presents significant challenges due to the non-convex and discontinuous nature of pairwise 0/1 losses, which are difficult to optimize, as well as the substantial memory cost of instance-wise storage, which creates bottlenecks in large-scale applications. To overcome these challenges, we propose a novel second-order surrogate loss based on the pairwise hinge loss, and develop an efficient online algorithm. Unlike conventional approaches that approximate each individual pairwise 0/1 loss term with an instance-wise surrogate function, our approach introduces a new paradigm that directly substitutes the entire aggregated pairwise loss with a surrogate loss function constructed from the first- and second-order statistics of the training data. Theoretically, while existing online AUC optimization algorithms typically achieve an $\mathcal{O}(\sqrt{T})$ regret bound, our method attains a tighter $\mathcal{O}(\ln T)$ bound. Furthermore, we extend the proposed framework to nonlinear settings through a kernel-based formulation. Extensive experiments on multiple benchmark datasets demonstrate the superior efficiency and effectiveness of the proposed second-order surrogate loss in optimizing online AUC performance.Open AccessOnline AUC Optimization Based on Second-order Surrogate Loss
The Area Under the Curve (AUC) is an important performance metric for classification tasks, particularly in class-imbalanced scenarios. However, minimizing the AUC presents significant challenges due to the non-convex and discontinuous nature of pairwise 0/1 losses, which are difficult to optimize, as well as the substantial memory cost of instance-wise storage, which creates bottlenecks in large-scale applications. To overcome these challenges, we propose a novel second-order surrogate loss based on the pairwise hinge loss, and develop an efficient online algorithm. Unlike conventional approaches that approximate each individual pairwise 0/1 loss term with an instance-wise surrogate function, our approach introduces a new paradigm that directly substitutes the entire aggregated pairwise loss with a surrogate loss function constructed from the first- and second-order statistics of the training data. Theoretically, while existing online AUC optimization algorithms typically achieve an $\mathcal{O}(\sqrt{T})$ regret bound, our method attains a tighter $\mathcal{O}(\ln T)$ bound. Furthermore, we extend the proposed framework to nonlinear settings through a kernel-based formulation. Extensive experiments on multiple benchmark datasets demonstrate the superior efficiency and effectiveness of the proposed second-order surrogate loss in optimizing online AUC performance. - Open Access
- 21 January 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (2) , 56
Adaptive Noise Exploration for Neural Contextual Multi-Armed Bandits
In contextual multi-armed bandits, the relationship between contextual information and rewards is typically unknown, complicating the trade-off between exploration and exploitation. A common approach to address this challenge is the Upper Confidence Bound (UCB) method, which constructs confidence intervals to guide exploration. However, the UCB method becomes computationally expensive in environments with numerous arms and dynamic contexts. This paper presents an adaptive noise exploration framework to reduce computational complexity and introduces two novel algorithms: EAD (Exploring Adaptive Noise in Decision-Making Processes) and EAP (Exploring Adaptive Noise in Parameter Spaces). EAD injects adaptive noise into the reward signals based on arm selection frequency, while EAP adds adaptive noise to the hidden layer of the neural network for more stable exploration. Experimental results on recommendation and classification tasks show that both algorithms significantly surpass traditional linear and neural methods in computational efficiency and overall performance.
- 21 January 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (2) , 56
Open AccessAdaptive Noise Exploration for Neural Contextual Multi-Armed Bandits
In contextual multi-armed bandits, the relationship between contextual information and rewards is typically unknown, complicating the trade-off between exploration and exploitation. A common approach to address this challenge is the Upper Confidence Bound (UCB) method, which constructs confidence intervals to guide exploration. However, the UCB method becomes computationally expensive in environments with numerous arms and dynamic contexts. This paper presents an adaptive noise exploration framework to reduce computational complexity and introduces two novel algorithms: EAD (Exploring Adaptive Noise in Decision-Making Processes) and EAP (Exploring Adaptive Noise in Parameter Spaces). EAD injects adaptive noise into the reward signals based on arm selection frequency, while EAP adds adaptive noise to the hidden layer of the neural network for more stable exploration. Experimental results on recommendation and classification tasks show that both algorithms significantly surpass traditional linear and neural methods in computational efficiency and overall performance.
- 28 December 2023
- Published by Elsevier in Neurocomputing
- Vol. 571
FAUC-S: Deep AUC maximization by focusing on hard samples
- 28 December 2023
- Published by Elsevier in Neurocomputing
- Vol. 571
FAUC-S: Deep AUC maximization by focusing on hard samples
- Open Access
- 1 January 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (1) , 789
Pump Feature Construction and Electrical Energy Consumption Prediction Based on Feature Engineering and LightGBM Algorithm
In recent years, research on improving the energy consumption ratio of pumping equipment through control algorithms has improved. However, the actual behavior of pump equipment and pump characteristic information do not always correspond, resulting in deviations between the calculated energy consumption operating point and the actual operating point. This eventually results in wasted power. To solve this problem, the data from circulating pumping equipment in a large pumping facility are analyzed, and the necessary characteristics of pumping equipment electrical energy consumption are analyzed through a subset of mechanism expansion feature engineering using the Pearson correlation coefficient algorithm. Based on this, a pump energy consumption prediction method based on LightGBM is constructed and compared with other algorithm models. To improve the generalization ability of the model, rules applicable to pump power energy consumption prediction are proposed, and the model features and processes are reduced. Based on the mechanistic model, 18 features related to electric energy consumption are selected, and 6 necessary features of pump electric energy consumption are screened by feature engineering. The experimental results show that the LightGBM regression algorithm has a significant prediction effect with . After the importance analysis, three features that are strongly related to pump energy consumption are finally screened out. According to the prediction results, the feature engineering dataset was selected and the pump electrical energy consumption was predicted based on the LightGBM algorithm, which can significantly reduce the problem of deviation in the prediction of the electrical energy consumption of pumping equipment.- 1 January 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (1) , 789
Open AccessPump Feature Construction and Electrical Energy Consumption Prediction Based on Feature Engineering and LightGBM Algorithm
In recent years, research on improving the energy consumption ratio of pumping equipment through control algorithms has improved. However, the actual behavior of pump equipment and pump characteristic information do not always correspond, resulting in deviations between the calculated energy consumption operating point and the actual operating point. This eventually results in wasted power. To solve this problem, the data from circulating pumping equipment in a large pumping facility are analyzed, and the necessary characteristics of pumping equipment electrical energy consumption are analyzed through a subset of mechanism expansion feature engineering using the Pearson correlation coefficient algorithm. Based on this, a pump energy consumption prediction method based on LightGBM is constructed and compared with other algorithm models. To improve the generalization ability of the model, rules applicable to pump power energy consumption prediction are proposed, and the model features and processes are reduced. Based on the mechanistic model, 18 features related to electric energy consumption are selected, and 6 necessary features of pump electric energy consumption are screened by feature engineering. The experimental results show that the LightGBM regression algorithm has a significant prediction effect with . After the importance analysis, three features that are strongly related to pump energy consumption are finally screened out. According to the prediction results, the feature engineering dataset was selected and the pump electrical energy consumption was predicted based on the LightGBM algorithm, which can significantly reduce the problem of deviation in the prediction of the electrical energy consumption of pumping equipment. - 3 April 2022
- Published by Taylor & Francis in Social Sciences in China
- Vol. 43 (2) , 144-160
Is the Renminbi a Global Currency? An Evaluation Based on Offshore Foreign Exchange Market Trading Patterns
This article provides a new framework to evaluate the status of Renminbi internationalization. It proposes that the trading patterns of a currency in the global foreign exchange market embody the currency's position in the international monetary system. Based on foreign exchange trading data provided by CLS Group, the article constructs a ranking of major international currencies including the Renminbi. It finds that the Renminbi shares more similarities in foreign exchange trading patterns with the established global currencies like the US dollar and the Euro than with those regional currencies. The article also explores the policy implications that the new evaluation approach provides.
- 3 April 2022
- Published by Taylor & Francis in Social Sciences in China
- Vol. 43 (2) , 144-160
Is the Renminbi a Global Currency? An Evaluation Based on Offshore Foreign Exchange Market Trading Patterns
This article provides a new framework to evaluate the status of Renminbi internationalization. It proposes that the trading patterns of a currency in the global foreign exchange market embody the currency's position in the international monetary system. Based on foreign exchange trading data provided by CLS Group, the article constructs a ranking of major international currencies including the Renminbi. It finds that the Renminbi shares more similarities in foreign exchange trading patterns with the established global currencies like the US dollar and the Euro than with those regional currencies. The article also explores the policy implications that the new evaluation approach provides.
- 2 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (5) , 2353-2365
A Minimax Probability Machine for Nondecomposable Performance Measures
Imbalanced classification tasks are widespread in many real-world applications. For such classification tasks, in comparison with the accuracy rate (AR), it is usually much more appropriate to use nondecomposable performance measures such as the area under the receiver operating characteristic curve (AUC) and the $F_β$ measure as the classification criterion since the label class is imbalanced. On the other hand, the minimax probability machine is a popular method for binary classification problems and aims at learning a linear classifier by maximizing the AR, which makes it unsuitable to deal with imbalanced classification tasks. The purpose of this article is to develop a new minimax probability machine for the $F_β$ measure, called minimax probability machine for the $F_β$ -measures (MPMF), which can be used to deal with imbalanced classification tasks. A brief discussion is also given on how to extend the MPMF model for several other nondecomposable performance measures listed in the article. To solve the MPMF model effectively, we derive its equivalent form which can then be solved by an alternating descent method to learn a linear classifier. Further, the kernel trick is employed to derive a nonlinear MPMF model to learn a nonlinear classifier. Several experiments on real-world benchmark datasets demonstrate the effectiveness of our new model.- 2 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (5) , 2353-2365
A Minimax Probability Machine for Nondecomposable Performance Measures
Imbalanced classification tasks are widespread in many real-world applications. For such classification tasks, in comparison with the accuracy rate (AR), it is usually much more appropriate to use nondecomposable performance measures such as the area under the receiver operating characteristic curve (AUC) and the $F_β$ measure as the classification criterion since the label class is imbalanced. On the other hand, the minimax probability machine is a popular method for binary classification problems and aims at learning a linear classifier by maximizing the AR, which makes it unsuitable to deal with imbalanced classification tasks. The purpose of this article is to develop a new minimax probability machine for the $F_β$ measure, called minimax probability machine for the $F_β$ -measures (MPMF), which can be used to deal with imbalanced classification tasks. A brief discussion is also given on how to extend the MPMF model for several other nondecomposable performance measures listed in the article. To solve the MPMF model effectively, we derive its equivalent form which can then be solved by an alternating descent method to learn a linear classifier. Further, the kernel trick is employed to derive a nonlinear MPMF model to learn a nonlinear classifier. Several experiments on real-world benchmark datasets demonstrate the effectiveness of our new model.