Pith. sign in

REVIEW 3 cited by

Learning to Pivot with Adversarial Networks

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 1611.01046 v3 pith:2JK62YYP submitted 2016-11-03 stat.ML cs.LGcs.NEphysics.data-anstat.ME

classification stat.MLcs.LGcs.NEphysics.data-anstat.ME
keywords dataadversarialcontinuousdistributiondomainfamilygenerationnetworks
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Several techniques for domain adaptation have been proposed to account for differences in the distribution of the data used for training and testing. The majority of this work focuses on a binary domain label. Similar problems occur in a scientific context where there may be a continuous family of plausible data generation processes associated to the presence of systematic uncertainties. Robust inference is possible if it is based on a pivot -- a quantity whose distribution does not depend on the unknown values of the nuisance parameters that parametrize this family of data generation processes. In this work, we introduce and derive theoretical results for a training procedure based on adversarial networks for enforcing the pivotal property (or, equivalently, fairness with respect to continuous attributes) on a predictive model. The method includes a hyperparameter to control the trade-off between accuracy and robustness. We demonstrate the effectiveness of this approach with a toy example and examples from particle physics.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Mass Agnostic Jet Taggers

    hep-ph 2019-08 conditional novelty 6.0 of 10

    A systematic comparison shows that data-augmentation jet taggers (planing and PCA scaling) achieve background-preserving performance similar to adversarial networks and uBoost, with much lower training cost.

  2. Robust Quantum Machine Learning for Collider Event Selection under Detector Variability

    quant-ph 2026-08 conditional novelty 5.0 of 10

    Quantum autoencoders and data-reuploading classifiers show smaller output-score shifts and better retention of discrimination than standard classical baselines under feature-level detector smearing in two collider benchmarks.

  3. Contrastive Normalizing Flows for Uncertainty-Aware Parameter Estimation

    physics.data-an 2025-05 conditional novelty 5.0 of 10

    A hybrid of contrastive normalizing flows and a deep classifier yields signal-strength estimates with narrower confidence intervals than a likelihood-based method on the HiggsML Uncertainty Challenge dataset.

Pith tools