Self-Paced Deep Regression Forests with Consideration on Underrepresented Examples
Deep discriminative models (e.g. deep regression forests, deep neural decision forests) have achieved remarkable success recently to solve problems such as facial age estimation and head pose estimation. Most existing methods pursue robust and unbiased solutions either through learning discriminative features, or reweighting samples. We argue what is more desirable is learning gradually to discriminate like our human beings, and hence we resort to self-paced learning (SPL). Then, a natural question arises: can self-paced regime lead deep discriminative models to achieve more robust and less biased solutions? To this end, this paper proposes a new deep discriminative model--self-paced deep regression forests with consideration on underrepresented examples (SPUDRFs). It tackles the fundamental ranking and selecting problem in SPL from a new perspective: fairness. This paradigm is fundamental and could be easily combined with a variety of deep discriminative models (DDMs). Extensive experiments on two computer vision tasks, i.e., facial age estimation and head pose estimation, demonstrate the efficacy of SPUDRFs, where state-of-the-art performances are achieved.
Code (0)
등록된 구현이 없습니다.
Tasks
Age EstimationFairnessHead Pose EstimationPose EstimationregressionSimilar Papers 제목 키워드 기반
Self-Paced Deep Regression Forests with Consideration of Ranking Fairness
Deep discriminative models (DDMs), e.g. deep regression forests and deep decision forests, have been extensively studied recently to solve problems such as facial age estimation, head pose estimation, etc.. Due to a shor…
Age EstimationFairnessGaze EstimationHead Pose Estimation+2Self-Paced Deep Regression Forests for Facial Age Estimation
Facial age estimation is an important and challenging problem in computer vision. Existing approaches usually employ deep neural networks (DNNs) to fit the mapping from facial features to age, even though there exist som…
Age EstimationMORPHregressionConsistency of Online Random Forests
As a testament to their success, the theory of random forests has long been outpaced by their application in practice. In this paper, we take a step towards narrowing this gap by providing a consistency result for online…
Cyber Security Data Science: Machine Learning Methods and their Performance on Imbalanced Datasets
Cybersecurity has become essential worldwide and at all levels, concerning individuals, institutions, and governments. A basic principle in cybersecurity is to be always alert. Therefore, automation is imperative in proc…
Anomaly DetectionBinary ClassificationFraud DetectionIntrusion Detection+2A Self-paced Regularization Framework for Partial-Label Learning
Partial label learning (PLL) aims to solve the problem where each training instance is associated with a set of candidate labels, one of which is the correct label. Most PLL algorithms try to disambiguate the candidate l…
Partial Label Learning