Nonparametric Detection of Geometric Structures over Networks
Shaofeng Zou, Yingbin Liang, H. Vincent Poor

TL;DR
This paper introduces kernel-based nonparametric tests for detecting anomalous structures in networks, achieving order-level optimality and demonstrating effectiveness through theoretical analysis and numerical experiments.
Contribution
It proposes a novel kernel-based testing method for network anomaly detection that is order-level optimal and extends to various network structures.
Findings
Proposed tests are order-level optimal for line networks.
Necessary conditions for universal consistency are established.
Numerical results confirm the effectiveness of the tests.
Abstract
Nonparametric detection of existence of an anomalous structure over a network is investigated. Nodes corresponding to the anomalous structure (if one exists) receive samples generated by a distribution q, which is different from a distribution p generating samples for other nodes. If an anomalous structure does not exist, all nodes receive samples generated by p. It is assumed that the distributions p and q are arbitrary and unknown. The goal is to design statistically consistent tests with probability of errors converging to zero as the network size becomes asymptotically large. Kernel-based tests are proposed based on maximum mean discrepancy that measures the distance between mean embeddings of distributions into a reproducing kernel Hilbert space. Detection of an anomalous interval over a line network is first studied. Sufficient conditions on minimum and maximum sizes of candidate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
