paper-with-me

홈 › Papers

Angular Gap: Reducing the Uncertainty of Image Difficulty through Model Calibration

2022-07-18 · Bohua Peng, Mobarakol Islam, Mei Tu

Curriculum learning needs example difficulty to proceed from easy to hard. However, the credibility of image difficulty is rarely investigated, which can seriously affect the effectiveness of curricula. In this work, we propose Angular Gap, a measure of difficulty based on the difference in angular distance between feature embeddings and class-weight embeddings built by hyperspherical learning. To ascertain difficulty estimation, we introduce class-wise model calibration, as a post-training technique, to the learnt hyperbolic space. This bridges the gap between probabilistic model calibration and angular distance estimation of hyperspherical learning. We show the superiority of our calibrated Angular Gap over recent difficulty metrics on CIFAR10-H and ImageNetV2. We further propose Angular Gap based curriculum learning for unsupervised domain adaptation that can translate from learning easy samples to mining hard samples. We combine this curriculum with a state-of-the-art self-training method, Cycle Self Training (CST). The proposed Curricular CST learns robust representations and outperforms recent baselines on Office31 and VisDA 2017.

📄 PDF Abstract BibTeX arXiv:2207.08525

Code (1)

pengbohua/angulargap 공식 구현 pytorch

Tasks

Domain AdaptationUnsupervised Domain Adaptation

Similar Papers 제목 키워드 기반

Policy-Conditioned Uncertainty Sets for Robust Markov Decision Processes

2018-12-01 · NeurIPS 2018 12 · Andrea Tirinzoni, Marek Petrik, Xiangli Chen, Brian Ziebart

What policy should be employed in a Markov decision process with uncertain parameters? Robust optimization answer to this question is to use rectangular uncertainty sets, which independently reflect available knowledge a…

Transfer Learning

Towards Theoretical Understandings of Robust Markov Decision Processes: Sample Complexity and Asymptotics

2021-05-09 · Wenhao Yang, Liangyu Zhang, Zhihua Zhang

In this paper, we study the non-asymptotic and asymptotic performances of the optimal robust policy and value function of robust Markov Decision Processes(MDPs), where the optimal robust policy and value function are sol…

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets

2023-05-30 · Mengmeng Li, Daniel Kuhn, Tobias Sutter

We propose policy gradient algorithms for robust infinite-horizon Markov decision processes (MDPs) with non-rectangular uncertainty sets, thereby addressing an open challenge in the robust MDP literature. Indeed, uncerta…

Towards the Application of Calibrated Transformers to the Unsupervised Estimation of Question Difficulty from Text

2021-09-01 · RANLP 2021 9 · Ekaterina Loginova, Luca Benedetto, Dries Benoit, Paolo Cremonesi

Being able to accurately perform Question Difficulty Estimation (QDE) can improve the accuracy of students’ assessment and better their learning experience. Traditional approaches to QDE are either subjective or introduc…

Question Answering

Roping in Uncertainty: Robustness and Regularization in Markov Games

2024-06-13 · Jeremy McMahan, Giovanni Artiglio, Qiaomin Xie

We study robust Markov games (RMG) with $s$-rectangular uncertainty. We show a general equivalence between computing a robust Nash equilibrium (RNE) of a $s$-rectangular RMG and computing a Nash equilibrium (NE) of an ap…