Pith. sign in

REVIEW 1 cited by

Loss-calibrated expectation propagation for approximate Bayesian decision-making

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.03128 v1 pith:WXWLMKAS submitted 2022-01-10 stat.ML cs.LG

classification stat.MLcs.LG
keywords loss-calibratedposteriorapproximatebayesianexpectationpropagationutilityapplications
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Approximate Bayesian inference methods provide a powerful suite of tools for finding approximations to intractable posterior distributions. However, machine learning applications typically involve selecting actions, which -- in a Bayesian setting -- depend on the posterior distribution only via its contribution to expected utility. A growing body of work on loss-calibrated approximate inference methods has therefore sought to develop posterior approximations sensitive to the influence of the utility function. Here we introduce loss-calibrated expectation propagation (Loss-EP), a loss-calibrated variant of expectation propagation. This method resembles standard EP with an additional factor that "tilts" the posterior towards higher-utility decisions. We show applications to Gaussian process classification under binary utility functions with asymmetric penalties on False Negative and False Positive errors, and show how this asymmetry can have dramatic consequences on what information is "useful" to capture in an approximation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Making Reliable and Flexible Decisions in Long-tailed Classification

    cs.LG 2025-01 conditional novelty 5.0 of 10

    RF-DLC trains a particle ensemble with a utility-weighted, class-rebalanced Bayesian objective so long-tailed classifiers can optimize task-specific decision costs rather than plain accuracy.

Pith tools