On multiplicative \(\lambda\)-approximations and some geometric applications (Q2848204)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On multiplicative \(\lambda\)-approximations and some geometric applications |
scientific article; zbMATH DE number 6211590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On multiplicative \(\lambda\)-approximations and some geometric applications |
scientific article; zbMATH DE number 6211590 |
Statements
25 September 2013
0 references
weight function
0 references
dimension reduction
0 references
multiplicative approximation
0 references
core set
0 references
sparsification
0 references
0.88392663
0 references
0.8764956
0 references
0.87548935
0 references
0.8695135
0 references
0.8605614
0 references
0.8604189
0 references
0.8566927
0 references
0.8553724
0 references
On multiplicative \(\lambda\)-approximations and some geometric applications (English)
0 references
Consider a finite set \(X\), a measure \(\mu\) on \(\mathcal{P}(X)\) and a family~\(\mathcal{F}\); can one determine/approximate \(\mu\) by a measure~\(\mu^*\) that is supported on a small subset of~\(X\)? The authors prove that, given \(\epsilon\) between \(0\) and~\(1\), one can achieve \((1-\epsilon)\mu(F)\leq\mu^*(F)\leq(1+\epsilon)\mu(F)\) for all \(F\in\mathcal F\) with \(\mu^*\) supported on a set of size \(O(\text{trk}(\mathcal{F})\cdot\log|\mathcal{F}|/\epsilon^2)\), where \(\text{trk}(\mathcal{F})\)~denotes the maximum length of a sequence \(\langle F_i\rangle_i\) in~\(\mathcal F\) with the property that \(F_i\not\subseteq\bigcup_{j<i}F_j\) for all~\(i\). This is applied to problems with a sampling flavour, such as reducing the number of coordinates needed to describe a set in \(\mathbb{R}^n\) with the \(\ell_1\)-metric and estimating the average volume of a set of simplexes from a small sample.
0 references