We lifted 3 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| flopska/mmdew-change-detector | canonical | 3 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| est_gamma | Ran | flopska/mmdew-change-detector/src/mmdew/fast_rbf_kernel.py code served (permissive licence) · get_code("ba1bcb16142a8940") |
| preprocess | Ran | flopska/mmdew-change-detector/src/base.py code served (permissive licence) · get_code("1f255c6bfe54e5c2") |
| sns_markers | Ran | flopska/mmdew-change-detector/src/base.py code served (permissive licence) · get_code("e8292963cfa0f4d5") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Detecting changes is of fundamental importance when analyzing data streams and has many applications, e.g., in predictive maintenance, fraud detection, or medicine. A principled approach to detect changes is to compare the distributions of observations within the stream to each other via hypothesis testing. Maximum mean discrepancy (MMD), a (semi-)metric on the space of probability distributions, provides powerful non-parametric two-sample tests on kernel-enriched domains. In particular, MMD is able to detect any disparity between distributions under mild conditions. However, classical MMD estimators suffer from a quadratic runtime complexity, which renders their direct use for change detection in data streams impractical. In this article, we propose a new change detection algorithm, called Maximum Mean Discrepancy on Exponential Windows (MMDEW), that combines the benefits of MMD with an efficient computation based on exponential windows. We prove that MMDEW enjoys polylogarithmic runtime and logarithmic memory complexity and show empirically that it outperforms the state of the art on benchmark data streams.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.12706")
get_code_for_paper("2205.12706")
have("2205.12706")
Connect an agent — have() is free.