We propose an energy-efficient power allocation algorithm for the multi-user millimeter-wave (mmWave) rate-splitting multiple access (RSMA) downlink with hybrid precoding and quality of service (QoS) constraints. The proposed scheme is applicable to the physical layer design of future wireless networks, such as the 6G cellular downlink, in which a transmitter equipped with multiple antennas must communicate unicast messages to multiple receivers simultaneously. First, we use a low-complexity design to define the analog and digital precoders in closed form. Second, we define an energy efficiency (EE) maximization problem to jointly optimize the power allocation among streams and the common stream rate allocation among users. We then solve the problem using a combination of Dinkelbach’s algorithm and difference of convex functions (DC) programming methods. Simulation results show that the proposed RSMA scheme offers EE improvements over a comparable space division multiple access (SDMA) power allocation scheme in scenarios with perfect and imperfect channel state information at the transmitter. Lastly, we present extensive numerical experiments that suggest that the computational complexity of the proposed RSMA energy-efficient power allocation algorithm can be reduced using the interior-point method such that the computational efficiency of RSMA is comparable to that of SDMA.

Manifold regularization methods for matrix factorization rely on the cluster assumption, whereby the neighborhood structure of data in the input space is preserved in the factorization space. We argue that using the k-neighborhoods of all data points as regularization constraints can negatively affect the quality of the factorization, and propose an unsupervised and selective regularized matrix factorization algorithm to tackle this problem. Our approach jointly learns a sparse set of representatives and their neighbor affinities, and the data factorization. We further propose a fast approximation of our approach by relaxing the selectivity constraints on the data. Our proposed algorithms are competitive against baselines and state-of-the-art manifold regularization and clustering algorithms.

MOTIVATION: Next generation sequencing (NGS) has been increasingly applied to characterize viral evolution during HIV and SIV infections. In particular, NGS datasets sampled during the initial months of infection are characterized by relatively low levels of diversity as well as convergent evolution at multiple loci dispersed across the viral genome. Consequently, fully characterizing viral evolution from NGS datasets requires haplotype reconstruction across large regions of the viral genome. Existing haplotype reconstruction algorithms have not been developed with the particular characteristics of early HIV/SIV infection in mind, raising the possibility that better performance could be achieved through a specifically designed algorithm. RESULTS: Here, we introduce a haplotype reconstruction algorithm, RegressHaplo, specifically designed for low diversity and convergent evolution regimes. The algorithm uses a penalized regression that balances a data fitting term with a penalty term that encourages solutions with few haplotypes. The regression covariates are a large set of potential haplotypes and fitting the regression is made computationally feasible by the low diversity setting. Using simulated and in vivo datasets, we compare RegressHaplo to PredictHaplo and QuRe, two existing haplotype reconstruction algorithms. RegressHaplo performs better than these algorithms on simulated datasets with relatively low diversity levels. We suggest RegressHaplo as a novel tool for the investigation of early infection HIV/SIV datasets and, more generally, low diversity viral NGS datasets. CONTACT: [email protected]. AVAILABILITY AND IMPLEMENTATION: https://github.com/SLeviyang/RegressHaplo.

We present an exterior-point method (EPM) for training dual-soft margin support vector machines (SVMs). The EPM stems from nonlinear rescaling and augmented Lagrangian methods and allows iterates to approach the solution of a constrained nonlinear optimization problem from the exterior of the feasible set. Furthermore, the EPM produces and solves a well-conditioned system of linear equations at each iteration; thus, avoiding numerical inaccuracies that can occur when solving ill-conditioned systems. Therefore, the EPM may be an attractive alternative to existing quadratic programming solvers for training SVMs. We report numerical results for training the SVM with the EPM on data up to several thousand data points from the UC Irvine Machine Learning Repository.