No label defined (Q5214265)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7164768

Language	Label	Description	Also known as
default for all languages	No label defined
English	No label defined	scientific article; zbMATH DE number 7164768

Statements

0 references

0 references

0 references

Pierre-Olivier Amblard

0 references

publication date

7 February 2020

0 references

full work available at URL

https://arxiv.org/abs/1803.08700

0 references

http://jmlr.csail.mit.edu/papers/v20/18-167.html

0 references

zbMATH Keywords

coresets

0 references

determinantal point processes

0 references

sensitivity

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q5290249

0 references

Q2934696

0 references

Optimal core-sets for balls

0 references

A simple proof of the restricted isometry property for random matrices

0 references

A Bernstein-type inequality for suprema of random processes with applications to model selection in non-Gaussian regression

0 references

Monte Carlo with determinantal point processes

0 references

Asymptotic equivalence of fixed-size and varying-size determinantal point processes

0 references

Oblivious dimension reduction for $k$-means: beyond subspaces and the Johnson-Lindenstrauss lemma

0 references

Q5149239

0 references

Improved matrix algorithms via the subsampled randomized Hadamard transform

0 references

Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering

0 references

Q5875522

0 references

Finite frames. Theory and applications.

0 references

Q4039982

0 references

Influential observations, high leverage points, and outliers in linear regression

0 references

On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications

0 references

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

0 references

Dimensionality reduction for $k$-means clustering and low rank approximation

0 references

Diagram vectors and tight frame scaling in finite dimensions

0 references

Approximation schemes for clustering problems

0 references

Reverse iterative volume sampling for linear regression

0 references

Matrix approximation and projective clustering via volume sampling

0 references

Lectures on randomized numerical linear algebra

0 references

Fast approximation of matrix coherence and statistical leverage

0 references

Orthogonal polynomials of several variables

0 references

A unified framework for approximating and clustering data

0 references

Q3655724

0 references

Geometric approximation algorithms

0 references

Smaller coresets for $k$-median and $k$-means clustering

0 references

On coresets for k-means and k-median clustering

0 references

Modified log-Sobolev inequalities for strong-Rayleigh measures

0 references

The Hat Matrix in Regression and ANOVA

0 references

Determinantal processes and independence

0 references

Q3713407

0 references

Christoffel functions and universality in the bulk for multivariate orthogonal polynomials

0 references

Determinantal point processes for machine learning

0 references

Linear-time approximation schemes for clustering problems in any dimensions

0 references

Universal ${\epsilon}$-approximators for integrals

0 references

The empirical Christoffel function with applications in data analysis

0 references

Improved bounds on the sample complexity of learning

0 references

Least squares quantization in PCM

0 references

Randomized Algorithms for Matrices and Data

0 references

A bi-criteria approximation algorithm for $k$-means

0 references

Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures

0 references

High-performance sampling of generic determinantal point processes

0 references

Upper estimates of Christoffel function on convex domains

0 references

Approximating spectral clustering via sampling: a review

0 references

Q5214265

0 references

Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences

0 references

Identifiers

zbMATH Open document ID

1446.62351

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5214265