AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Stein Points

ICML 2018 · Learning theory and algorithms › Prediction and decision losses · approach: Distributionally robust optimization · 19 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Monte Carlo optimisation of the Stein Point objective instead of Nelder-Mead or grid searchStein Points (greedy/herding) · Gaussian mixture testWasserstein distance W_PHelped
Under a low computational budget, Monte Carlo-optimised Stein Points versus greedy Stein Points at larger budgetsStein Points · Gaussian mixture testWasserstein distance W_P vs log nevalMixed
Use Stein Points (greedy) instead of MED, SVGD for posterior approximation at fixed costStein Points · GP regression and IGARCHWasserstein distance W_PMixed
Use Monte Carlo or greedy Stein Points depending on budget vs MEDMED baseline · GP regression and IGARCHnumerical stabilityHurt
Replace the herding objective with the greedy objective that adds a k0(x,x)/2 regularizerStein Greedy · Theory (discrepancy bound)discrepancy rateHelped
Use inverse log kernel k2 or IMQ score kernel k3 instead of IMQKSD methods · Gaussian mixture testWasserstein distance W_PMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy