Baishuo Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Baishuo Lin has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- An Liu
Zhejiang University
3 shared publications - Hongrui Zhou
Huaweis Chengdu Research Center, Chengdu, China
1 shared publication - Kexuan Wang
College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China
1 shared publication Ming Lei
College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China
1 shared publication- Yufan Zhou
College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China
1 shared publication
Latest Publications
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3670-3674
Hybrid Beamforming Optimization for Robust Uplink Channel Tracking in Massive MIMO Systems
Hybrid beamforming (HBF) with partially connected antenna structure (PCAS) is crucial for enhancing the capacity and efficiency of massive MIMO with an affordable hardware cost and power consumption. However, the highly compressed measurements pose challenges for channel estimation, emphasizing the need to optimize the HBF for improved channel estimation performance. This letter introduces a novel optimization algorithm for HBF during channel estimation, incorporating the Cramér-Rao bound (CRB) and mutual information (MI) in the objective function to account for both established and emerging propagation paths. Simulations demonstrate that the proposed design significantly enhances channel tracking accuracy compared to various baseline schemes.
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3670-3674
Hybrid Beamforming Optimization for Robust Uplink Channel Tracking in Massive MIMO Systems
Hybrid beamforming (HBF) with partially connected antenna structure (PCAS) is crucial for enhancing the capacity and efficiency of massive MIMO with an affordable hardware cost and power consumption. However, the highly compressed measurements pose challenges for channel estimation, emphasizing the need to optimize the HBF for improved channel estimation performance. This letter introduces a novel optimization algorithm for HBF during channel estimation, incorporating the Cramér-Rao bound (CRB) and mutual information (MI) in the objective function to account for both established and emerging propagation paths. Simulations demonstrate that the proposed design significantly enhances channel tracking accuracy compared to various baseline schemes.
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 4871-4887
Single-Loop Deep Actor-Critic for Constrained Reinforcement Learning With Provable Convergence
Deep actor-critic (DAC) algorithms, which combine actor-critic with deep neural network (DNN), have been among the most prevalent reinforcement learning algorithms for decision-making problems in simulated environments. However, the existing DAC algorithms are still not mature to solve realistic problems with non-convex stochastic constraints and high cost to interact with the environment. In this paper, we propose a single-loop DAC (SLDAC) algorithmic framework for general constrained reinforcement learning problems. In the actor module, the constrained stochastic successive convex approximation (CSSCA) method is applied to better handle the non-convex stochastic objective and constraints. In the critic module, the critic DNNs are only updated once or a few finite times for each iteration, which simplifies the algorithm to a single-loop framework. Moreover, the variance of the policy gradient estimation is reduced by reusing observations from the old policy. The single-loop design and the observation reuse effectively reduce the agent-environment interaction cost and computational complexity. Despite the biased policy gradient estimation incurred by the single-loop design and observation reuse, we prove that the SLDAC with a feasible initial point can converge to a Karush-Kuhn-Tuker (KKT) point of the original problem almost surely. Simulations show that the SLDAC algorithm can achieve superior performance with much lower interaction cost.
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 4871-4887
Single-Loop Deep Actor-Critic for Constrained Reinforcement Learning With Provable Convergence
Deep actor-critic (DAC) algorithms, which combine actor-critic with deep neural network (DNN), have been among the most prevalent reinforcement learning algorithms for decision-making problems in simulated environments. However, the existing DAC algorithms are still not mature to solve realistic problems with non-convex stochastic constraints and high cost to interact with the environment. In this paper, we propose a single-loop DAC (SLDAC) algorithmic framework for general constrained reinforcement learning problems. In the actor module, the constrained stochastic successive convex approximation (CSSCA) method is applied to better handle the non-convex stochastic objective and constraints. In the critic module, the critic DNNs are only updated once or a few finite times for each iteration, which simplifies the algorithm to a single-loop framework. Moreover, the variance of the policy gradient estimation is reduced by reusing observations from the old policy. The single-loop design and the observation reuse effectively reduce the agent-environment interaction cost and computational complexity. Despite the biased policy gradient estimation incurred by the single-loop design and observation reuse, we prove that the SLDAC with a feasible initial point can converge to a Karush-Kuhn-Tuker (KKT) point of the original problem almost surely. Simulations show that the SLDAC algorithm can achieve superior performance with much lower interaction cost.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (7) , 7263-7277
Low-Complexity Two-Timescale Hybrid Precoding for mmWave Massive MIMO: A Group-and-Codebook Based Approach
In this paper, we present a novel hybrid precoding scheme, named group-and-codebook based two-timescale hybrid precoding (GC-THP), for reducing complexity in millimeter wave massive MIMO systems. The scheme clusters users into groups based on their statistical similarity and selects analog beams from a codebook with orthogonal beams. The base station time-shares among multiple analog precoders, each serving a subset of user groups, for fairness. At the slow timescale, the analog precoders, together with their corresponding group scheduling vectors and time-sharing factors, are jointly optimized, while at the fast timescale, short-term user scheduling and digital precoding are performed for a given analog precoder and its associated group scheduling vector. The proposed scheme employs beam-domain channel statistics with reduced dimension to optimize the proportional fairness utility. By applying user grouping and codebook based analog precoding, the proposed scheme significantly reduces complexity while retaining high performance levels. Moreover, the implementation complexity is tunable by adjusting the codebook size and the number of user groups, allowing for flexible performance-complexity tradeoffs. Simulation results confirm a superior performance-complexity tradeoff for the proposed GC-THP in comparison to the existing hybrid precoding schemes.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (7) , 7263-7277
Low-Complexity Two-Timescale Hybrid Precoding for mmWave Massive MIMO: A Group-and-Codebook Based Approach
In this paper, we present a novel hybrid precoding scheme, named group-and-codebook based two-timescale hybrid precoding (GC-THP), for reducing complexity in millimeter wave massive MIMO systems. The scheme clusters users into groups based on their statistical similarity and selects analog beams from a codebook with orthogonal beams. The base station time-shares among multiple analog precoders, each serving a subset of user groups, for fairness. At the slow timescale, the analog precoders, together with their corresponding group scheduling vectors and time-sharing factors, are jointly optimized, while at the fast timescale, short-term user scheduling and digital precoding are performed for a given analog precoder and its associated group scheduling vector. The proposed scheme employs beam-domain channel statistics with reduced dimension to optimize the proportional fairness utility. By applying user grouping and codebook based analog precoding, the proposed scheme significantly reduces complexity while retaining high performance levels. Moreover, the implementation complexity is tunable by adjusting the codebook size and the number of user groups, allowing for flexible performance-complexity tradeoffs. Simulation results confirm a superior performance-complexity tradeoff for the proposed GC-THP in comparison to the existing hybrid precoding schemes.