No label defined (Q5214265)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7164768

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

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

Simon Barthelmé

0 references

Nicolas Tremblay

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

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

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 profile type

MaRDI publication profile

0 references

0 references

0 references

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 <i>k</i> -means: beyond subspaces and the Johnson-Lindenstrauss lemma

0 references

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

0 references

Finite frames. Theory and applications.

0 references

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

Low-Rank Approximation and Regression in Input Sparsity Time

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

0 references

Matrix approximation and projective clustering via volume sampling

0 references

0 references

0 references

Orthogonal Polynomials of Several Variables

0 references

A unified framework for approximating and clustering data

0 references

0 references

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

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

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

0 references

Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5214265

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5214265&oldid=36559333"