SearcharxivSearch

arXiv subjects

Linxi Liu

Publications and source records attributed to Linxi Liu.

4 recordsLinked to original sources

Sparse Bayesian Learning-Based Direction Finding Method With Unknown Mutual Coupling Effect

The imperfect array degrades the direction finding performance. In this paper, we investigate the direction finding problem in uniform linear array (ULA) system with unknown mutual coupling effect between antennas. By exploiting the target sparsity in the spatial domain, sparse Bayesian learning (SBL)-based model is proposed and converts the direction finding problem into a sparse reconstruction problem. In the sparse-based model, the \emph{off-grid} errors are introduced by discretizing the direction area into grids. Therefore, an off-grid SBL model with mutual coupling vector is proposed to overcome both the mutual coupling and the off-grid effect. With the distribution assumptions of unknown parameters including the noise variance, the off-grid vector, the received signals and the mutual coupling vector, a novel direction finding method based on SBL with unknown mutual coupling effect named DFSMC is proposed, where an expectation-maximum (EM)-based step is adopted by deriving the estimation expressions for all the unknown parameters theoretically. Simulation results show that the proposed DFSMC method can outperform state-of-the-art direction finding methods significantly in the array system with unknown mutual coupling effect.

eess.SP

Multivariate Density Estimation via Adaptive Partitioning (II): Posterior Concentration

In this paper, we study a class of non-parametric density estimators under Bayesian settings. The estimators are piecewise constant functions on binary partitions. We analyze the concentration rate of the posterior distribution under a suitable prior, and demonstrate that the rate does not directly depend on the dimension of the problem. This paper can be viewed as an extension of a parallel work where the convergence rate of a related sieve MLE was established. Compared to the sieve MLE, the main advantage of the Bayesian method is that it can adapt to the unknown complexity of the true density function, thus achieving the optimal convergence rate without artificial conditions on the density.

math.ST

Communication-Efficient False Discovery Rate Control via Knockoff Aggregation

The false discovery rate (FDR)---the expected fraction of spurious discoveries among all the discoveries---provides a popular statistical assessment of the reproducibility of scientific studies in various disciplines. In this work, we introduce a new method for controlling the FDR in meta-analysis of many decentralized linear models. Our method targets the scenario where many research groups---possibly the number of which is random---are independently testing a common set of hypotheses and then sending summary statistics to a coordinating center in an online manner. Built on the knockoffs framework introduced by Barber and Candes (2015), our procedure starts by applying the knockoff filter to each linear model and then aggregates the summary statistics via one-shot communication in a novel way. This method gives exact FDR control non-asymptotically without any knowledge of the noise variances or making any assumption about sparsity of the signal. In certain settings, it has a communication complexity that is optimal up to a logarithmic factor.

stat.ML

Multivariate Density Estimation via Adaptive Partitioning (I): Sieve MLE

We study a non-parametric approach to multivariate density estimation. The estimators are piecewise constant density functions supported by binary partitions. The partition of the sample space is learned by maximizing the likelihood of the corresponding histogram on that partition. We analyze the convergence rate of the sieve maximum likelihood estimator, and reach a conclusion that for a relatively rich class of density functions the rate does not directly depend on the dimension. This suggests that, under certain conditions, this method is immune to the curse of dimensionality, in the sense that it is possible to get close to the parametric rate even in high dimensions. We also apply this method to several special cases, and calculate the explicit convergence rates respectively.

math.ST