~/talk

Learning Uninformative Representations

links:none on file
slides:none on file

Claims an algorithm called EIEL that infers worst-case domains from a reference model that has learned shortcuts, then alternates environment assignment (Bernoulli Q, inner loop maximizing an IRM-style proxy) with invariant training (outer loop). Tools include adversarial objectives, MMD references and the IRM gradient proxy. Tests on ColorMNIST (ERM drops to ~10% when colors flip; invariant methods reach ~70%) and Waterbirds show improved worst-group accuracy, but success depends on the reference model finding spurious features.

AI-written summary · about

  1. 0:00Intro
  2. 0:38Removing Information from Representations Long-standing aim of representation learning: preserve information in data
  3. 1:46Info Removal: Remove spurious features Aim to learn predictor, factor out particular known spurious features Example: diabetes predictors, uncovering factors beyond BMI
  4. 2:52Info Removal: Information Bottleneck .
  5. 3:31Info Removal: Self-Supervised Learning
  6. 4:31Info Removal: Invariant learning
  7. 6:24Illustration of Invariant Learning
  8. 8:30Info Removal: Fair representation learning
  9. 10:21Info Removal Methods: Distribution Matching
  10. 12:39Info Removal Methods: Adversarial
  11. 15:03Invariant Learning with Unknown Environment
  12. 17:24Notation & Definitions
  13. 19:27Invariant Learning Fairness Mary parallels between Invariant learning and algorithmic fairness
  14. 30:55EIIL: Dependence on reference model
  15. 33:09Discussion & Open Questions
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.