mlsanityData to 14 Oct 2026

Improving Deep Regression with Tightness

arXiv 2502.09122 ↗First posted 13 Feb 2025cs.LG cs.AI cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

For deep regression, preserving the ordinality of the targets with respect to the feature representation improves performance across various tasks. However, a theoretical explanation for the benefits of ordinality is still lacking. This work reveals that preserving ordinality reduces the conditional entropy H(Z|Y) of representation Z conditional on the target Y. However, our findings reveal that typical regression losses do little to reduce H(Z|Y), even though it is vital for generalization performance. With this motivation, we introduce an optimal transport-based regularizer to preserve the similarity relationships of targets in the feature space to reduce H(Z|Y). Additionally, we introduce a simple yet efficient strategy of duplicating the regressor targets, also with the aim of reducing H(Z|Y). Experiments on three real-world regression tasks verify the effectiveness of our strategies to improve deep regression. Code: https://github.com/needylove/Regressiontightness.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 27 references that are in the map. First posted on arXiv 13 Feb 2025.

Builds on

20 of 27 references.

References · 20

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  3. 2015Deep Learning and the Information Bottleneck Principlecited by 802
  4. 2020AdaBins: Depth Estimation using Adaptive Binscited by 601
  5. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
  6. 2021Delving into Deep Imbalanced Regressioncited by 158
  7. 2024Stop Regressing: Training Value Functions via Classification for Scalable Deep RLcited by 144
  8. 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 132
  9. 2019Topological Autoencoderscited by 127
  10. 2020A unifying mutual information view of metric learning: cross-entropy vs. pairwise lossescited by 100
  11. 2023How Does Information Bottleneck Help Deep Learning?cited by 93
  12. 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networkscited by 70
8 more
  1. 2021SimCC: a Simple Coordinate Classification Perspective for Human Pose Estimationcited by 68
  2. 2022RankSim: Ranking Similarity Regularization for Deep Imbalanced Regressioncited by 52
  3. 2023Improving Deep Regression with Ordinal Entropycited by 45
  4. 2022Discrete-Constrained Regression for Local Counting Modelscited by 19
  5. 2023ConR: Contrastive Regularizer for Deep Imbalanced Regressioncited by 19
  6. 2020Doubly-Stochastic Normalization of the Gaussian Kernel is Robust to Heteroskedastic Noisecited by 16
  7. 2023A step towards understanding why classification helps regressioncited by 15
  8. 2024Deep Regression Representation Learning with Topologycited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.