Ding Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ding Lin has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Jianhui Wang
Southern Methodist University
4 shared publications - Meng Yue
Brookhaven National Laboratory, Upton, NY, USA
3 shared publications - Tianqiao Zhao
Department of Electrical Engineering, The University of Texas at Arlington, Arlington, TX, USA
3 shared publications - Huan-Hsin Tseng
Computer Science Department, Brookhaven National Laboratory, Upton, NY, USA
2 shared publications - Shinjae Yoo
Brookhaven National Laboratory, Upton, NY, USA
2 shared publications Han Guo
1 shared publication
Latest Publications
- Open Access
- 12 June 2026
- Published by Elsevier in Applied Energy
- Vol. 421
Conditional diffusion models for probabilistic day-ahead load forecasting in modern power systems
- 12 June 2026
- Published by Elsevier in Applied Energy
- Vol. 421
Open AccessConditional diffusion models for probabilistic day-ahead load forecasting in modern power systems
- Open Access
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-23
Grover Adaptive Search-Based Hybrid Benders Decomposition for Mixed-Integer Linear Programs
Mixed-integer linear programs are widely used to model optimization problems involving both discrete and continuous variables, but remain computationally challenging due to the combinatorial complexity. To exploit the potential advantages of quantum computing in tackling the combinatorial optimization part, recent efforts have explored hybrid quantum-classical Benders decomposition frameworks, which delegate the discrete master problem to quantum solvers like annealers while solving the continuous subproblem classically. However, these approaches typically rely on penalty-based formulations that are heuristic in nature, offer no guarantee of recovering the exact master optimum, require delicate penalty tuning, and introduce slack-register overhead that inflates circuit size and distorts the problem's native structure. In this work, we propose a Grover Adaptive Search based Benders Decomposition (GAS-BD) algorithm that circumvents penalty terms by directly encoding Benders cuts into a novel quantum oracle. The designed oracle-based quantum solver searches for constraint-satisfying master solutions by leveraging Grover's potential quadratic speedup, while the subproblem loop is handled by a classical solver. Simulation results shows that GAS-BD matches the convergence of classical Benders and exhibits greater stability than penalty-based hybrid baselines, while remaining executable on current NISQ hardware. These results demonstrate a practical and penalty-free path for embedding exact Benders logic into Grover-style quantum search.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-23
Open AccessGrover Adaptive Search-Based Hybrid Benders Decomposition for Mixed-Integer Linear Programs
Mixed-integer linear programs are widely used to model optimization problems involving both discrete and continuous variables, but remain computationally challenging due to the combinatorial complexity. To exploit the potential advantages of quantum computing in tackling the combinatorial optimization part, recent efforts have explored hybrid quantum-classical Benders decomposition frameworks, which delegate the discrete master problem to quantum solvers like annealers while solving the continuous subproblem classically. However, these approaches typically rely on penalty-based formulations that are heuristic in nature, offer no guarantee of recovering the exact master optimum, require delicate penalty tuning, and introduce slack-register overhead that inflates circuit size and distorts the problem's native structure. In this work, we propose a Grover Adaptive Search based Benders Decomposition (GAS-BD) algorithm that circumvents penalty terms by directly encoding Benders cuts into a novel quantum oracle. The designed oracle-based quantum solver searches for constraint-satisfying master solutions by leveraging Grover's potential quadratic speedup, while the subproblem loop is handled by a classical solver. Simulation results shows that GAS-BD matches the convergence of classical Benders and exhibits greater stability than penalty-based hybrid baselines, while remaining executable on current NISQ hardware. These results demonstrate a practical and penalty-free path for embedding exact Benders logic into Grover-style quantum search.
- Open Access
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Access Journal of Power and Energy
- Vol. 13, 250-261
Reinforcement Learning-Based Symbolic Regression for Load Modeling
With the growing demand variability and evolving grid control strategies, accurate and efficient load modeling has become a critical yet challenging task. Traditional methods, such as fixed-form parametric models and data-driven approaches, often struggle to balance accuracy, computational efficiency, and interpretability. This paper introduces a novel symbolic regression algorithm based on the Actor-Critic reinforcement learning framework, specifically tailored for dynamic load modeling. The algorithm employs a trainable expression tree with controlled depth and a predefined set of operators to generate compact and interpretable mathematical expressions. The Actor network probabilistically selects operators for the symbolic expression, while the Critic evaluates the resulting expression tree through a loss function. To further enhance performance, a candidate pool mechanism is implemented to store high-performing expressions, which are subsequently fine-tuned using gradient descent. By focusing on simplicity and precision, the proposed method significantly reduces computational complexity while preserving interpretability. Experimental results validate its superior performance compared to existing benchmarks, which offers a robust and scalable solution for dynamic load modeling and system analysis in modern power systems.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Access Journal of Power and Energy
- Vol. 13, 250-261
Open AccessReinforcement Learning-Based Symbolic Regression for Load Modeling
With the growing demand variability and evolving grid control strategies, accurate and efficient load modeling has become a critical yet challenging task. Traditional methods, such as fixed-form parametric models and data-driven approaches, often struggle to balance accuracy, computational efficiency, and interpretability. This paper introduces a novel symbolic regression algorithm based on the Actor-Critic reinforcement learning framework, specifically tailored for dynamic load modeling. The algorithm employs a trainable expression tree with controlled depth and a predefined set of operators to generate compact and interpretable mathematical expressions. The Actor network probabilistically selects operators for the symbolic expression, while the Critic evaluates the resulting expression tree through a loss function. To further enhance performance, a candidate pool mechanism is implemented to store high-performing expressions, which are subsequently fine-tuned using gradient descent. By focusing on simplicity and precision, the proposed method significantly reduces computational complexity while preserving interpretability. Experimental results validate its superior performance compared to existing benchmarks, which offers a robust and scalable solution for dynamic load modeling and system analysis in modern power systems.
- 16 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (3) , 2174-2186
A Two-Stage Quantum Reinforcement Learning Method for Multi-Objective Transmission Switching
Multi-objective transmission switching (MO-TS) problems involve the strategic reconfiguration of network topology to simultaneously optimize multiple objectives. As the system scale increases, finding feasible solutions becomes increasingly challenging due to the problem's nonlinearity and high computational complexity. To address these challenges, this paper proposes a two-stage quantum reinforcement learning method that leverages potential quantum advantages for MO-TS. In the first stage, candidate switching lines are identified using a graph-theoretical approach to reduce the problem's dimensionality. The second stage introduces a quantum-classical reinforcement learning framework, where a learnable measurement-based CNN-ResVQC architecture is developed to effectively reduce the input dimension for quantum processing, mitigate vanishing gradients, and enhance trainability while improving the quantum circuit's flexibility in modeling complex decision policies for MO-TS. Numerical studies on IEEE 14-bus, 57-bus, and 118-bus systems demonstrate that the proposed algorithm achieves superior training stability and faster convergence with approximately 1% of the network parameters required by classical algorithms, highlighting its effectiveness, efficiency, and scalability. Furthermore, the practicality is validated through its stable convergence under three common quantum noise channels.
- 16 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (3) , 2174-2186
A Two-Stage Quantum Reinforcement Learning Method for Multi-Objective Transmission Switching
Multi-objective transmission switching (MO-TS) problems involve the strategic reconfiguration of network topology to simultaneously optimize multiple objectives. As the system scale increases, finding feasible solutions becomes increasingly challenging due to the problem's nonlinearity and high computational complexity. To address these challenges, this paper proposes a two-stage quantum reinforcement learning method that leverages potential quantum advantages for MO-TS. In the first stage, candidate switching lines are identified using a graph-theoretical approach to reduce the problem's dimensionality. The second stage introduces a quantum-classical reinforcement learning framework, where a learnable measurement-based CNN-ResVQC architecture is developed to effectively reduce the input dimension for quantum processing, mitigate vanishing gradients, and enhance trainability while improving the quantum circuit's flexibility in modeling complex decision policies for MO-TS. Numerical studies on IEEE 14-bus, 57-bus, and 118-bus systems demonstrate that the proposed algorithm achieves superior training stability and faster convergence with approximately 1% of the network parameters required by classical algorithms, highlighting its effectiveness, efficiency, and scalability. Furthermore, the practicality is validated through its stable convergence under three common quantum noise channels.
- Open Access
- 19 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Access Journal of Power and Energy
- Vol. 12, 833-844
Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems
Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs, specifically tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.
- 19 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Access Journal of Power and Energy
- Vol. 12, 833-844
Open AccessQuantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems
Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs, specifically tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.