atlas

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

Binary Losses for Density Ratio Estimation

ICLR 2025 · Learning theory and algorithms › Prediction and decision losses · approach: Ranking-based loss optimization · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Characterizes all composite binary losses whose density-ratio estimators minimize a prescribed Bregman divergence, and derives convex losses (exponential weight, polynomial weights) that prioritize accurate estimation of large density ratios, improving importance-weighted parameter selection for deep domain adaptation.

Problem

Density ratio estimation via binary classification is implicitly tied to a Bregman divergence determined by the chosen loss; standard losses (logistic, boosting, square, KL-type) weight small density ratio values more, although large values often matter more in applications.

Approach

Starting from a prescribed Bregman generator phi and link g, it derives the unique form of strictly proper composite loss (and convex under a canonical choice g=(phi')^{-1}) that makes Algorithm 1 minimize that Bregman divergence; using increasing phi'' (e.g., exponential e^{2c}) yields losses emphasizing large density ratios.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use EW rather than KuLSIF for importance-weighted validationDeep domain adaptation parameter selection · AmazonReviewsaccuracy: 0.774($\pm$.013) -> 0.776($\pm$.012)Helped
Use EW rather than KuLSIF for importance-weighted aggregationDeep domain adaptation parameter selection · AmazonReviewsaccuracy: 0.781($\pm$.012) -> 0.789($\pm$.010)Helped
Use EW rather than LR for importance-weighted validationDeep domain adaptation parameter selection · HHARaccuracy: 0.745($\pm$.040) -> 0.745($\pm$.038)No clear effect
Use EW rather than KuLSIF for importance-weighted aggregationDeep domain adaptation parameter selection · HHARaccuracy: 0.717($\pm$.045) -> 0.722($\pm$.038)Helped
Use EW rather than KuLSIF for importance-weighted validationDeep domain adaptation parameter selection · MiniDomainNetaccuracy: 0.514($\pm$.020) -> 0.513($\pm$.018)No clear effect
Use EW rather than KuLSIF for importance-weighted aggregationDeep domain adaptation parameter selection · MiniDomainNetaccuracy: 0.521($\pm$.016) -> 0.522($\pm$.017)Helped

Limitations

Experimental setup

Datasets: AmazonReviews HHAR MiniDomainNet

Benchmarks: AmazonReviews HHAR MiniDomainNet

Metrics: accuracy

Baselines: KuLSIF LR (logistic loss) Boost (exponential loss) SO (source only) TB (target benchmark)

Builds on: KuLSIF logistic regression density ratio estimation Bregman divergence representation of density ratio estimation (Sugiyama et al.) importance weighted validation importance weighted aggregation

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