Evidence map›Paper›PMID 34641008›Full record

ArticleSensors (Basel, Switzerland)2021

Coresets for the Average Case Error for Finite Query Sets.

Alaa Maalouf, Ibrahim Jubran, Murad Tukan, Dan Feldman

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Alaa MaaloufRobotics & Big Data Labs, University of Haifa, Haifa 3498838, Israel.
Ibrahim JubranRobotics & Big Data Labs, University of Haifa, Haifa 3498838, Israel.
Murad TukanRobotics & Big Data Labs, University of Haifa, Haifa 3498838, Israel.
Dan FeldmanRobotics & Big Data Labs, University of Haifa, Haifa 3498838, Israel.ORCID 0000-0002-7700-9711

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded. To obtain smaller coresets, we suggest a natural relaxation: coresets whose average error over the given set of queries is bounded. We provide both deterministic and randomized (generic) algorithms for computing such a coreset for any finite set of queries. Unlike most corresponding coresets for the worst-case error, the size of the coreset in this work is independent of both the input size and its Vapnik-Chervonenkis (VC) dimension. The main technique is to reduce the average-case coreset into the vector summarization problem, where the goal is to compute a weighted subset of the

Indexed as

approximation algorithmsaverage case analysisbig datacoresetdimensionality reductionsparsification

Identifiers

PMID34641008
PMCPMC8512382

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.