Related papers: Part II: A Practical Approach for Successive Omnis…
We propose a novel decomposition framework for the distributed optimization of Difference Convex (DC)-type nonseparable sum-utility functions subject to coupling convex constraints. A major contribution of the paper is to develop for the…
We develop an encompassing framework for matching, covariate balancing, and doubly-robust methods for causal inference from observational data called generalized optimal matching (GOM). The framework is given by generalizing a new…
We consider the problem of high-dimensional channel estimation in fast time-varying millimeter-wave MIMO systems with a hybrid architecture. By exploiting the low-rank and sparsity properties of the channel matrix, we propose a two-phase…
The sheer scale of modern datasets has resulted in a dire need for summarization techniques that identify representative elements in a dataset. Fortunately, the vast majority of data summarization tasks satisfy an intuitive diminishing…
Bio-inspired optimization algorithms have been gaining more popularity recently. One of the most important of these algorithms is particle swarm optimization (PSO). PSO is based on the collective intelligence of a swam of particles. Each…
The theory of semiparametric estimation offers an elegant way of computing the Cram\'er-Rao bound for a parameter of interest in the midst of infinitely many nuisance parameters. Here I apply the theory to the problem of moment estimation…
We first investigate two-user nonasymmetric sum-rate Poisson capacity with non-perfect photoncounting receiver under certain condition and demonstrate three possible transmission strategy, including only one active user and both active…
We present a unified theoretical framework for parametric low-rank approximation, a research area devoted to the development of efficient algorithms that act as adaptive alternatives of traditional methods such as Singular Value…
Pedestrian attribute recognition (PAR) aims to predict the attributes of a target pedestrian in a surveillance system. Existing methods address the PAR problem by training a multi-label classifier with predefined attribute classes. However,…
The Sum-of-Squares (SOS) approximation method is a technique used in optimization problems to derive lower bounds on the optimal value of an objective function. By representing the objective function as a sum of squares in a feature space,…
Spectrum sensing is a fundamental component of cognitive radio. How to promptly sense the presence of primary users is a key issue to a cognitive radio network. The time requirement is critical in that violating it will cause harmful…
Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which…
In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…
Inference on the parametric part of a semiparametric model is no trivial task. If one approximates the infinite dimensional part of the semiparametric model by a parametric function, one obtains a parametric model that is in some sense…
In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…
Spectrum sensing (SS) in cognitive radio (CR) systems is of paramount importance to approach the capacity limits for the Secondary Users (SU), while ensuring the undisturbed transmission of Primary Users (PU). In this paper, we formulate a…
Extra-large scale MIMO (XL-MIMO) is a key technology for meeting sixth-generation (6G) requirements for high-rate connectivity and uniform quality of service (QoS); however, its deployment is challenged by the prohibitive complexity of…
Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in [1] which is an extension of the…
An $n$-dimensional source with memory is observed by $K$ isolated encoders via parallel channels, who compress their observations to transmit to the decoder via noiseless rate-constrained links while leveraging their memory of the past. At…
This paper proposes prediction-and-sensing based spectrum sharing, a new spectrum-sharing model for cognitive radio networks, with a time structure for each resource block divided into a spectrum prediction-and-sensing phase and a data…