mlsanityData to 7 Oct 2026

Robust Learning with the Hilbert-Schmidt Independence Criterion

arXiv 1910.00270 ↗First posted 1 Oct 2019cs.LG stat.MLcited by 36

Not on the map. Why?

Abstract (arXiv)

We investigate the use of a non-parametric independence measure, the Hilbert-Schmidt Independence Criterion (HSIC), as a loss-function for learning robust regression and classification models. This loss-function encourages learning models where the distribution of the residuals between the label and the model prediction is statistically independent of the distribution of the instances themselves. This loss-function was first proposed by Mooij et al. (2009) in the context of learning causal graphs. We adapt it to the task of learning for unsupervised covariate shift: learning on a source domain without access to any instances or labels from the unknown target domain, but with the assumption that p(y|x) (the conditional probability of labels given instances) remains the same in the target domain. We show that the proposed loss is expected to give rise to models that generalize well on a class of target domains characterised by the complexity of their description within a reproducing kernel Hilbert space. Experiments on unsupervised covariate shift tasks demonstrate that models learned with the proposed loss-function outperform models learned with standard loss functions, achieving state-of-the-art results on a challenging cell-microscopy unsupervised covariate shift task.

Key facts. Cited by 36 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Oct 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 8; 2022: 4; 2023: 6; 2024: 10; 2025: 5; 2026: 3.

36 papers.

Sort:

By area:

  1. 2021Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalizationcited by 220
  2. 2021Independent mechanism analysis, a new concept?cited by 96
  3. 2021Improving Conditional Coverage via Orthogonal Quantile Regressioncited by 48
  4. 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Expertscited by 36
  5. 2023Quality-Agnostic Deepfake Detection with Intra-model Collaborative Learningcited by 32
  6. 2021Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustnesscited by 20
  7. 2021Measuring Dependence with Matrix-based Entropy Functionalcited by 19
  8. 2022Exploiting Independent Instruments: Identification and Distribution Generalizationcited by 18
  9. 2023Uncovering Meanings of Embeddings via Partial Orthogonalitycited by 15
  10. 2022Variance Covariance Regularization Enforces Pairwise Independence in Self-Supervised Representationscited by 9
  11. 2024Cauchy-Schwarz Divergence Information Bottleneck for Regressioncited by 9
  12. 2022Functional Generalized Empirical Likelihood Estimation for Conditional Moment Restrictionscited by 8
24 more
  1. 2024Relaxed Quantile Regression: Prediction Intervals for Asymmetric Noisecited by 8
  2. 2021Model Compression for Domain Adaptation through Causal Effect Estimationcited by 6
  3. 2024Domain Adaptation with Cauchy-Schwarz Divergencecited by 6
  4. 2023Mining Stable Preferences: Adaptive Modality Decorrelation for Multimedia Recommendationcited by 5
  5. 2023Coping with Change: Learning Invariant and Minimum Sufficient Representations for Fine-Grained Visual Categorizationcited by 4
  6. 2024Triple Disentangled Representation Learning for Multimodal Affective Analysiscited by 4
  7. 2022Deep Stable Representation Learning on Electronic Health Recordscited by 3
  8. 2025Nonlinear Causal Discovery for Grouped Datacited by 3
  9. 2023A statistical approach to detect sensitive features in a group fairness settingcited by 2
  10. 2024Benchmarking Spiking Neural Network Learning Methods with Varying Localitycited by 2
  11. 2025MSSDF: Modality-Shared Self-supervised Distillation for High-Resolution Multi-modal Remote Sensing Image Learningcited by 2
  12. 2025Deconfounding Causal Inference through Two-Branch Framework with Early-Forking for Sensor-Based Cross-Domain Activity Recognitioncited by 2
  13. 2025H-SPLID: HSIC-based Saliency Preserving Latent Information Decompositioncited by 2
  14. 2021Learning to Transfer with von Neumann Conditional Divergencecited by 1
  15. 2023Revisiting the Robustness of the Minimum Error Entropy Criterion: A Transfer Learning Case Studycited by 1
  16. 2024Bipartite Graph Variational Auto-Encoder with Fair Latent Representation to Account for Sampling Bias in Ecological Networkscited by 1
  17. 2024Understanding Token-level Topological Structures in Transformer-based Time Series Forecastingcited by 1
  18. 2021A Knowledge Enhanced Learning and Semantic Composition Model for Multi-Claim Fact Checkingcited by 0
  19. 2024Recovering Latent Confounders from High-dimensional Proxy Variablescited by 0
  20. 2024Learning to Project for Cross-Task Knowledge Distillationcited by 0
  21. 2025RI-Loss: A Learnable Residual-Informed Loss for Time Series Forecastingcited by 0
  22. 2026MO-RiskVAE: A Multi-Omics Variational Autoencoder for Survival Risk Modeling in Multiple MyelomaMO-RiskVAEcited by 0
  23. 2026DRG-Font: Dynamic Reference-Guided Few-shot Font Generation via Contrastive Style-Content Disentanglementcited by 0
  24. 2026scCBGM: Interpretable Single-Cell Counterfactual Editingcited by 0