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 |
|---|---|---|
| lightonai/newma | canonical | 3 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| compute_adapt_threshold | Ran | lightonai/newma/onlinecp/algos.py pointer only (licence: NONE) · get_code("34cea23e94895c4a") |
| convert_parameters | Ran | lightonai/newma/onlinecp/algos.py pointer only (licence: NONE) · get_code("67438f96ae93d420") |
| select_optimal_parameters | Ran | lightonai/newma/onlinecp/algos.py pointer only (licence: NONE) · get_code("94b2f3697cce4519") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We consider the problem of detecting abrupt changes in the distribution of a multi-dimensional time series, with limited computing power and memory. In this paper, we propose a new, simple method for model-free online change-point detection that relies only on fast and light recursive statistics, inspired by the classical Exponential Weighted Moving Average algorithm (EWMA). The proposed idea is to compute two EWMA statistics on the stream of data with different forgetting factors, and to compare them. By doing so, we show that we implicitly compare recent samples with older ones, without the need to explicitly store them. Additionally, we leverage Random Features (RFs) to efficiently use the Maximum Mean Discrepancy as a distance between distributions, furthermore exploiting recent optical hardware to compute high-dimensional RFs in near constant time. We show that our method is significantly faster than usual non-parametric methods for a given accuracy.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1805.08061")
get_code_for_paper("1805.08061")
have("1805.08061")
Connect an agent — have() is free.