Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper fundamentally distinguishes between sample-wise classification accuracy and dataset-level feature quality, proposing a redesigned binary cross-entropy loss to optimize the latter. By analyzing convergence in normalized spaces with varying scale factors, the authors demonstrate that balancing these objectives is critical for achieving robust intra-class compactness and inter-class separability. The findings offer practical insights for improving model generalization in long-tail and open-set recognition scenarios without relying on standard accuracy metrics.
Sources coveringarXiv, Quantum Zeitgeist, Epoch AI

Comparing Classification and Feature Learning by Analyzing Their Loss Functions in Normalized Spaces with Different Scale Factors

arXiv3 min read

arXiv:2611.07741v1 Announce Type: new Abstract: Classification and feature learning are two closely interrelated fundamental tasks. Feature learning in supervised settings is typically achieved by training classification models, under the common assumption that higher classification accuracy implies better feature quality. In this paper, we first point out that classification accuracy reflects the sample-wise local properties of a model on a dataset, whereas feature learning aims to learn features with good dataset-level global properties, such as intra-class compactness and inter-class separability. From the first principle of feature learning, we redesign the binary cross-entropy (BCE) loss, a counterpart of the cross-entropy (CE) loss used in classification. Then, in normalized feature space, we analyze the minima of the BCE and CE losses and show that both can lead to neural collapse, where sample features from different classes become maximally compact and maximally separated. More importantly, by investigating the convergence behaviors of the two losses as the scale factor $\gamma$ varies in the normalized space, we reveal how classification accuracy and feature quality change differently across spaces of different sizes. Under a fixed training strategy, a very large $\gamma$ achieves perfect classification accuracy but slows convergence toward the ideal feature geometry, whereas a very small $\gamma$ makes classification highly sensitive to small perturbations. A moderate $\gamma$ is therefore necessary for simultaneously achieving reliable classification and well-structured features. Extensive experiments validate these findings and demonstrate that BCE loss exhibits advantages in long-tail and open-set recognitions, as it better aligns with the global requirements of feature learning.

Abstract:Classification and feature learning are two closely interrelated fundamental tasks. Feature learning in supervised settings is typically achieved by training classification models, under the common assumption that higher classification accuracy implies better feature quality. In this paper, we first point out that classification accuracy reflects the sample-wise local properties of a model on a dataset, whereas feature learning aims to learn features with good dataset-level global properties, such as intra-class compactness and inter-class separability. From the first principle of feature learning, we redesign the binary cross-entropy (BCE) loss, a counterpart of the cross-entropy (CE) loss used in classification. Then, in normalized feature space, we analyze the minima of the BCE and CE losses and show that both can lead to neural collapse, where sample features from different classes become maximally compact and maximally separated. More importantly, by investigating the convergence behaviors of the two losses as the scale factor $\gamma$ varies in the normalized space, we reveal how classification accuracy and feature quality change differently across spaces of different sizes. Under a fixed training strategy, a very large $\gamma$ achieves perfect classification accuracy but slows convergence toward the ideal feature geometry, whereas a very small $\gamma$ makes classification highly sensitive to small perturbations. A moderate $\gamma$ is therefore necessary for simultaneously achieving reliable classification and well-structured features. Extensive experiments validate these findings and demonstrate that BCE loss exhibits advantages in long-tail and open-set recognitions, as it better aligns with the global requirements of feature learning.

Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)

arXiv:2611.07741 [cs.LG]

(or arXiv:2611.07741v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.07741 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 345 words

Related coverage