Importance sampling wouldn’t have you ignore Pascal’s Muggings, though. At its most basic, ‘sampling’ is just a way of probabilistically computing an integral.
Importance sampling wouldn’t have you ignore Pascal’s Muggings, though.
Well, they shouldn’t be ignored, as long as they have some finite probability. The idea is that by sampling (importance or otherwise), we almost never give in to it, we always spend our finite computing power on strictly more probable scenarios, even though the Mugging (by definition) would dominate our expected-utility calculation in the case of a completed infinity.
Importance sampling wouldn’t have you ignore Pascal’s Muggings, though. At its most basic, ‘sampling’ is just a way of probabilistically computing an integral.
Well, they shouldn’t be ignored, as long as they have some finite probability. The idea is that by sampling (importance or otherwise), we almost never give in to it, we always spend our finite computing power on strictly more probable scenarios, even though the Mugging (by definition) would dominate our expected-utility calculation in the case of a completed infinity.