Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (Q2104022)
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: Performance analysis of greedy algorithms for minimising a maximum mean discrepancy |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance analysis of greedy algorithms for minimising a maximum mean discrepancy |
scientific article |
Statements
Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (English)
0 references
9 December 2022
0 references
maximum mean discrepancy
0 references
quantisation
0 references
greedy algorithm
0 references
sequential Bayesian quadrature
0 references
kernel herding
0 references
space-filling design
0 references
computer experiments
0 references
0 references
0 references
0 references
0 references
0 references
0.686410665512085
0 references
0.659753680229187
0 references
0.6584547758102417
0 references
0.6576831936836243
0 references
0.6517696380615234
0 references
