REVIEW 5 cited by
Introduction to Core-sets: an Updated Survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering problems, the input is a set of points in some metric space, and a common goal is to compute a set of centers in some other space (points, lines) that will minimize the sum of distances to these points. In database queries, we may need to compute such a some for a specific query set of $k$ centers. However, traditional algorithms cannot handle modern systems that require parallel real-time computations of infinite distributed streams from sensors such as GPS, audio or video that arrive to a cloud, or networks of weaker devices such as smartphones or robots. Core-set is a "small data" summarization of the input "big data", where every possible query has approximately the same answer on both data sets. Generic techniques enable efficient coreset \changed{maintenance} of streaming, distributed and dynamic data. Traditional algorithms can then be applied on these coresets to maintain the approximated optimal solutions. The challenge is to design coresets with provable tradeoff between their size and approximation error. This survey summarizes such constructions in a retrospective way, that aims to unified and simplify the state-of-the-art.
Forward citations
Cited by 5 Pith papers
-
Understanding Imbalanced Forgetting in Rehearsal-Based Class-Incremental Learning
Three last-layer coefficients derived from gradient interference sources predict the forgetting rank order of past classes in rehearsal-based CIL, with self-induced interference as the strongest predictor.
-
Understanding Context Sampling in TabPFN on Small Tabular Datasets
For TabPFN on small tabular data, context diversity—not matching the training distribution—drives accuracy, so large random contexts are a strong, cheap default.
-
SafeBuild-Bench: A Temporal-Robust Construction Safety Benchmark with Graph-Enhanced Data Mining
A temporal-aware construction-safety benchmark built from real inspection archives shows current multimodal models remain far from reliable, with best overall scores near 60.
-
GRACE: A Dynamic Coreset Selection Framework for Large Language Model Optimization
GRACE dynamically constructs and updates coresets for LLM training using representation diversity, gradient-based importance, and k-NN graph propagation to improve efficiency and performance.
-
The Adversarial Robustness of Sketching and Streaming Algorithms
A survey monograph unifying the field of adversarially robust streaming: near-optimal robustness for insertion-only streams, poly(n)-space impossibility for turnstile linear sketches, and crypto-based white-box algorithms.
Discussion (0). Sign in to comment.