Online Partitioned Local Depth for semi-supervised applications
By: John D. Foley, Justin T. Lee
We introduce an extension of the partitioned local depth (PaLD) algorithm that is adapted to online applications such as semi-supervised prediction. The new algorithm we present, online PaLD, is well-suited to situations where it is a possible to pre-compute a cohesion network from a reference dataset. After $O(n^3)$ steps to construct a queryable data structure, online PaLD can extend the cohesion network to a new data point in $O(n^2)$ time. Our approach complements previous speed up approaches based on approximation and parallelism. For illustrations, we present applications to online anomaly detection and semi-supervised classification for health-care datasets.
Similar Papers
Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
Data Structures and Algorithms
Makes computer networks deliver data cheaper and faster.
OOCO: Latency-disaggregated Architecture for Online-Offline Co-locate LLM Serving
Distributed, Parallel, and Cluster Computing
Makes AI answer questions faster and cheaper.
Pseudo-Asynchronous Local SGD: Robust and Efficient Data-Parallel Training
Machine Learning (CS)
Trains smart computer programs much faster.