检索结果-内蒙古大学图书馆

HPE Transformer: Learning to Optimize Multi-Group Multicast Beamforming Under Nonconvex QoS Constraints

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Yang Liu, Ya-Feng The Shenzhen Research Institute of Big Data Shenzhen518172 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

This paper studies the quality-of-service (QoS) constrained multi-group multicast beamforming design problem, where each multicast group is composed of a number of users requiring the same content. Due to the nonconvex QoS constraints, this problem is nonconvex and NP-hard. While existing optimization-based iterative algorithms can obtain a suboptimal solution, their iterative nature results in large computational complexity and delay. To facilitate real-time implementations, this paper proposes a deep learning-based approach, which consists of a beamforming structure assisted problem transformation and a customized neural network architecture named hierarchical permutation equivariance (HPE) transformer. The proposed HPE transformer is proved to be permutation equivariant with respect to the users within each multicast group, and also permutation equivariant with respect to different multicast groups. Simulation results demonstrate that the proposed HPE transformer outperforms state-of-the-art optimization-based and deep learning-based approaches for multi-group multicast beamforming design in terms of the total transmit power, the constraint violation, and the computational time. In addition, the proposed HPE transformer achieves pretty good generalization performance on different numbers of users, different numbers of multicast groups, and different signal-to-interference-plus-noise ratio targets. Copyright © 2024, The Authors. All rights reserved.

关键词： Beamforming

Low-rank optimization on Tucker tensor varieties

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Gao, Bin Peng, Renfeng Yuan, Ya-Xiang State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

In the realm of tensor optimization, the low-rank Tucker decomposition is crucial for reducing the number of parameters and for saving storage. We explore the geometry of Tucker tensor varieties—the set of tensors with bounded Tucker rank—which is notably more intricate than the well-explored matrix varieties. We give an explicit parametrization of the tangent cone of Tucker tensor varieties and leverage its geometry to develop provable gradient-related line-search methods for optimization on Tucker tensor varieties. To the best of our knowledge, this is the first work concerning geometry and optimization on Tucker tensor varieties. In practice, low-rank tensor optimization suffers from the difficulty of choosing a reliable rank parameter. To this end, we incorporate the established geometry and propose a Tucker rank-adaptive method that aims to identify an appropriate rank with guaranteed convergence. Numerical experiments on tensor completion reveal that the proposed methods are in favor of recovering performance over other state-of-the-art methods. The rank-adaptive method performs the best across various rank parameter selections and is indeed able to find an appropriate *** Codes 15A69, 65K05, 65F30, 90C30 Copyright © 2023, The Authors. All rights reserved.

关键词： Tensors

Statistical Multiplexing Gain Analysis of Centralized Open Radio Access Networks with Limited Cells and Heterogeneous Traffics

学校读者我要写书评

暂无评论

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Lu Zhou, Yiqing Liu, Ya-Feng Liu, Ling Shi, Ningzhe Tian, Lin Shi, Jinglin National Key Laboratory of Transient Impact Beijing102202 China 208 Research Institute of China Ordnance Industries Beijing102202 China Chinese Academy of Sciences State Key Lab of Processors Institute of Computing Technology Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Beijing Key Laboratory of Mobile Computing and Pervasive Device Beijing100190 China Chinese Academy of Sciences State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Beijing100190 China Chinese Academy of Sciences Institute of Computing Technology Beijing100190 China Nanjing Institute of InforSuperBahn Nanjing211100 China

Centralized open radio access networks (O-RANs) aggregate computing resources of multiple cells to improve resource utilization and achieve statistical multiplexing gain (SMG), i.e., the ratio of the number of deployed resources (DepR) for distributed radio access network (D-RAN) to that for O-RAN. SMG of O-RAN has been investigated with infinite number of cells with homogeneous bursty-temporal traffic features. However, in practice, the number of cells is limited, and in the era of Internet of Things (IoT), cells with heterogeneous bursty-temporal traffics (het-traffics), should be considered. This paper analyzes the SMG of O-RAN with limited het-traffic cells. First of all, given traffic models of het-traffic cells following different bursty lognormal distribution and periodic time-varying features, required resources (ReqR) for D-RAN can be derived. Then, to obtain the distribution of ReqR for O-RAN with limited het-traffic cells, a Gaussian mixture model (GMM) based resource distribution approximation (GMM-RDA) is proposed. Thus SMG can be obtained for any given service rate. In simulations, the effectiveness of GMM-RDA is verified by Kolmogorov-Smirnov (K-S) test, and the accuracy of achieved SMG can be up to 99.7%, which is about 33% higher than that obtained by the law of large numbers (LLN) for infinite cells. Moreover, het-traffic cells resulting from service diversification can enhance SMG in O-RAN by 34.7%. © 1967-2012 IEEE.

关键词： Radio access networks

A riemannian exponential augmented lagrangian method for computing the projection robust Wasserstein distance 23

学校读者我要写书评

暂无评论

A riemannian exponential augmented lagrangian method for com...

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Bo Jiang Ya-Feng Liu Ministry of Education Key Laboratory of NSLSCS School of Mathematical Sciences Nanjing Normal University Nanjing China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China

Projection robust Wasserstein (PRW) distance is recently proposed to efficiently mitigate the curse of dimensionality in the classical Wasserstein distance. In this paper, by equivalently reformulating the computation of the PRW distance as an optimization problem over the Cartesian product of the Stiefel manifold and the Euclidean space with additional nonlinear inequality constraints, we propose a Riemannian exponential augmented Lagrangian method (REALM) for solving this problem. Compared with the existing Riemannian exponential penalty-based approaches, REALM can potentially avoid too small penalty parameters and exhibit more stable numerical performance. To solve the subproblems in REALM efficiently, we design an inexact Riemannian Barzilai-Borwein method with Sinkhorn iteration (iRBBS), which selects the stepsizes adaptively rather than tuning the step-sizes in efforts as done in the existing methods. We show that iRBBS can return an ε-stationary point of the original PRW distance problem within O(ε-3) iterations, which matches the best known iteration complexity result. Extensive numerical results demonstrate that our proposed methods outperform the state-of-the-art solvers for computing the PRW distance.

关键词：

On the convergence of stochastic gradient descent with bandwidth-based step size

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine Learning Research 2023年第1期24卷 1990-2038页

作者： Xiaoyu Wang Ya-xiang Yuan Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China and University of Chinese Academy of Sciences Beijing China State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China

We first propose a general step-size framework for the stochastic gradient descent(SGD) method: bandwidth-based step sizes that are allowed to vary within a banded region. The framework provides efficient and flexible step size selection in optimization, including cyclical and non-monotonic step sizes (e.g., triangular policy and cosine with restart), for which theoretical guarantees are rare. We provide state-of-the-art convergence guarantees for SGD under mild conditions and allow a large constant step size at the beginning of training. Moreover, we investigate the error bounds of SGD under the bandwidth step size where the boundary functions are in the same order and different orders, respectively. Finally, we propose a 1/t up-down policy and design novel non-monotonic step sizes. Numerical experiments demonstrate these bandwidth-based step sizes' efficiency and significant potential in training regularized logistic regression and several large-scale neural network tasks.

关键词： stochastic gradient descent bandwidth-based step size non-asymptotic convergence non-monotonic step size machine learning

QoS-Based Beamforming and Compression Design for Cooperative Cellular Networks via Lagrangian Duality

学校读者我要写书评

暂无评论

IEEE Transactions on Signal Processing 2025年

作者： Fan, Xilai Liu, Ya-Feng Liu, Liang Chang, Tsung-Hui Chinese Academy of Sciences State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Beijing100190 China The Hong Kong Polytechnic University Department of Electronic and Information Engineering Hong Kong Hong Kong The Chinese University of HongKong School of Science and Engineering Shenzhen Shenzhen China Shenzhen Research Institute of Big Data China

This paper considers the quality-of-service (QoS)-based joint beamforming and compression design problem in the downlink cooperative cellular network, where multiple relay-like base stations (BSs), connected to the central processor via ratelimited fronthaul links, cooperatively transmit messages to the users. The problem of interest is formulated as the minimization of the total transmit power of the BSs, subject to all users' signal-to-interference-plus-noise ratio (SINR) constraints and all BSs' fronthaul rate constraints. In this paper, we first show that there is no duality gap between the considered joint optimization problem and its Lagrangian dual by showing the tightness of its semidefinite relaxation (SDR). Then, we propose an efficient algorithm based on the above duality result for solving the considered problem. The proposed algorithm judiciously exploits the special structure of an enhanced Karush-Kuhn-Tucker (KKT) conditions of the considered problem and approaches the solution that satisfies the enhanced KKT conditions via two fixed point iterations. Two key features of the proposed algorithm are: (1) it is able to detect whether the considered problem is feasible or not and find its globally optimal solution when it is feasible;(2) it is highly efficient because both of the fixed point iterations in the proposed algorithm are linearly convergent and function evaluations in the fixed point iterations are computationally cheap. Numerical results show the global optimality and efficiency of the proposed algorithm. © 1991-2012 IEEE.

关键词： Lagrange multipliers

Joint Design of Radar Receive Filter and Unimodular ISAC Waveform with Sidelobe Level Control

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Kecheng Liu, Ya-Feng Wang, Zhongbin Yuan, Weijie Keskin, Musa Furkan Wymeersch, Henk Xia, Shuqiang School of System Design and Intelligent Manufacturing The Shenzhen Key Laboratory of Robotics and Computer Vision Southern University of Science and Technology Shenzhen518055 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Electrical Engineering Chalmers University of Technology Gothenburg41296 Sweden ZTE Corporation The State Key Laboratory of Mobile Network and Mobile Multimedia Technology Shenzhen518055 China

Integrated sensing and communication (ISAC) has been considered a key feature of next-generation wireless networks. This paper investigates the joint design of the radar receive filter and dual-functional transmit waveform for the multiple-input multiple-output (MIMO) ISAC system. While optimizing the mean square error (MSE) of the radar receive spatial response and maximizing the achievable rate at the communication receiver, besides the constraints of full-power radar receiving filter and unimodular transmit sequence, we control the maximum range sidelobe level, which is often overlooked in existing ISAC waveform design literature, for better radar imaging performance. To solve the formulated optimization problem with convex and nonconvex constraints, we propose an inexact augmented Lagrangian method (ALM) algorithm. For each subproblem in the proposed inexact ALM algorithm, we custom-design a block successive upper-bound minimization (BSUM) scheme with closed-form solutions for all blocks of variable to enhance the computational efficiency. Convergence analysis shows that the proposed algorithm is guaranteed to provide a stationary and feasible solution. Extensive simulations are performed to investigate the impact of different system parameters on communication and radar imaging performance. Comparison with the existing works shows the superiority of the proposed algorithm. © 2025, CC BY-NC-SA.

关键词： Mean square error

Riemannian Optimization for Holevo Capacity

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhu, Chengkai Peng, Renfeng Gao, Bin Wang, Xin Guangzhou China State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

computing the classical capacity of a noisy quantum channel is crucial for understanding the limits of communication over quantum channels. However, its evaluation remains challenging due to the difficulty of computing the Holevo capacity and the even greater difficulty of regularization. In this work, we formulate the computation of the Holevo capacity as an optimization problem on a product manifold constructed from probability distributions and their corresponding pure input states for a quantum channel. A Riemannian gradient descent algorithm is proposed to solve the problem, providing lower bounds on the classical capacity of general quantum channels and outperforming existing methods in numerical experiments in both efficiency and scale. © 2025, CC BY.

关键词： Probability distributions

A Diffuse-Interface Lattice Boltzmann Method for the Dendritic Growth with Thermosolutal Convection

学校读者我要写书评

暂无评论

Communications in Computational Physics 2023年第4期33卷 1164-1188页

作者： Chengjie Zhan Zhenhua Chai Baochang Shi Ping Jiang Shaoning Geng Dongke Sun School of Mathematics and Statistics Huazhong University of Science and TechnologyWuhan430074P.R.China Institute of Interdisciplinary Research for Mathematics and Applied Science Huazhong University of Science and TechnologyWuhan 430074P.R.China Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and TechnologyWuhan430074P.R.China The State Key Laboratory of Digital Manufacturing Equipment and Technology School of Mechanical Science and EngineeringHuazhong University of Science and TechnologyWuhan 430074P.R.China School of Mechanical Engineering Southeast UniversityNanjing 211189P.R.China

In this work,we proposed a diffuse-interface model for the dendritic growth with thermosolutal *** this model,the sharp boundary between the fluid and solid dendrite is firstly replaced by a thin but nonzero thickness diffuse interface,which is described by the order parameter,and the diffuse-interface based governing equations for the dendritic growth are *** solve the model for the dendritic growth with thermosolutal convection,we also developed a diffuse-interface multirelaxation-time lattice Boltzmann(LB)*** this method,the order parameter in the phase-field equation is combined into the force caused by the fluid-solid interaction,and the treatment on the complex fluid-solid interface can be *** addition,four LB models are designed for the phase-field equation,concentration equation,temperature equation and the Navier-Stokes equations in a unified ***,we performed some simulations of the dendritic growth to test the present diffuse-interface LB method,and found that the numerical results are in good agreements with some previous works.

关键词： Dendritic growth diffuse interface lattice Boltzmann method phase-field method.