mlsanityData to 7 Oct 2026

Controlling Directions Orthogonal to a Classifier

arXiv 2201.11259 ↗First posted 27 Jan 2022cs.LG cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

We propose to identify directions invariant to a given classifier so that these directions can be controlled in tasks such as style transfer. While orthogonal decomposition is directly identifiable when the given classifier is linear, we formally define a notion of orthogonality in the non-linear case. We also provide a surprisingly simple method for constructing the orthogonal classifier (a classifier utilizing directions other than those of the given classifier). Empirically, we present three use cases where controlling orthogonal variation is important: style transfer, domain adaptation, and fairness. The orthogonal classifier enables desired style transfer when domains vary in multiple aspects, improves domain adaptation with label shifts and mitigates the unfairness as a predictor. The code is available at http://github.com/Newbeeer/orthogonal_classifier

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 30 of its 44 references that are in the map. First posted on arXiv 27 Jan 2022.

Builds on

30 of 44 references.

References · 30

  1. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  2. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
  3. 2019Invariant Risk Minimizationcited by 1,832
  4. 2017Adversarial Discriminative Domain Adaptationcited by 1,309
  5. 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,079
  6. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
  7. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
  8. 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
  9. 2018Disentangling by Factorisingcited by 614
  10. 2018Learning Adversarially Fair and Transferable Representationscited by 353
  11. 2020The Pitfalls of Simplicity Bias in Neural Networkscited by 349
  12. 2018Towards a Definition of Disentangled Representationscited by 294
18 more
  1. 2017Right for the Right Reasons: Training Differentiable Models by Constraining their Explanationscited by 293
  2. 2021Gradient Matching for Domain Generalizationcited by 258
  3. 2018What is the Effect of Importance Weighting in Deep Learning?cited by 250
  4. 2018A DIRT-T Approach to Unsupervised Domain Adaptationcited by 215
  5. 2019Learning De-biased Representations with Biased Representationscited by 199
  6. 2020Learning from Failure: Training Debiased Classifier from Biased Classifiercited by 133
  7. 2020Domain Adaptation with Conditional Distribution Matching and Generalized Label Shiftcited by 124
  8. 2019Regularized Learning for Domain Adaptation under Label Shiftscited by 118
  9. 2018Learning Controllable Fair Representationscited by 83
  10. 2021Evading the Simplicity Bias: Training a Diverse Set of Models Discovers Solutions with Superior OOD Generalizationcited by 83
  11. 2019Weakly Supervised Disentanglement with Guaranteescited by 82
  12. 2020Shape-Texture Debiased Neural Network Trainingcited by 76
  13. 2019Bias Correction of Learned Generative Models using Likelihood-Free Importance Weightingcited by 70
  14. 2019Ensembles of Locally Independent Prediction Modelscited by 22
  15. 2021Learning Representations that Support Robust Transfer of Predictorscited by 17
  16. 2014Dropout Rademacher Complexity of Deep Neural Networkscited by 14
  17. 2018Learning Qualitatively Diverse and Interpretable Rules for Classificationcited by 10
  18. 2015The Multiverse Loss for Robust Transfer Learningcited by 2

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 6; 2024: 3; 2025: 1.

13 papers.

Sort:

By area: