Gang Qiao — accepted AI-conference papers

2024

Subspace-Based Co-Array Processing For Nested Arrays without Eigendecomposition

Xinghao Qu, Zhigang Shang, Gang Qiao, Jixing Qin, Xuerui Liu

ICASSP 2024accepted

For the purpose of computational efficiency, we propose two subspace-based methods, but without eigendecomposition, to address the two typical problems in nested array processing, i.e., direction-of-arrival (DOA) estimation and noise elimination. In detail, to estimate DOA parameters, we judiciously…

Cited by 0 Source ↗Scholar ↗

2021

Oneshot Differentially Private Top-k Selection

Gang Qiao, Weijie Su, Li Zhang

ICML 2021spotlight

Being able to efficiently and accurately select the top-$k$ elements with differential privacy is an integral component of various private data analysis tasks. In this paper, we present the oneshot Laplace mechanism, which generalizes the well-known Report Noisy Max \cite{dwork2014algorithmic} mecha…

Cited by 43 Source ↗PDF ↗Scholar ↗