paper-with-me

Papers

Generalized Entropy Regularization or: There's Nothing Special about Label Smoothing

2020-05-02 · ACL 2020 6 · Clara Meister, Elizabeth Salesky, Ryan Cotterell

Prior work has explored directly regularizing the output distributions of probabilistic models to alleviate peaky (i.e. over-confident) predictions, a common sign of overfitting. This class of techniques, of which label smoothing is one, has a connection to entropy regularization. Despite the consistent success of label smoothing across architectures and data sets in language generation tasks, two problems remain open: (1) there is little understanding of the underlying effects entropy regularizers have on models, and (2) the full space of entropy regularization techniques is largely unexplored. We introduce a parametric family of entropy regularizers, which includes label smoothing as a special case, and use it to gain a better understanding of the relationship between the entropy of a model and its performance on language generation tasks. We also find that variance in model performance can be explained largely by the resulting entropy of the model. Lastly, we find that label smoothing provably does not allow for sparsity in an output distribution, an undesirable property for language generation models, and therefore advise the use of other entropy regularization methods in its place.

📄 PDF Abstract BibTeX arXiv:2005.00820

Code (0)

등록된 구현이 없습니다.

Tasks

Text Generation

Methods 이 논문이 사용한 방법론

Entropy Regularization 설명 없음
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…

Similar Papers 제목 키워드 기반

Optimal Rates of Convergence for Entropy Regularization in Discounted Markov Decision Processes

2024-06-06 · Johannes Müller, Semih Cayci

We study the error introduced by entropy regularization in infinite-horizon, discrete, discounted Markov decision processes. We show that this error decreases exponentially in the inverse regularization strength both in …

Policy Gradient Methods

Maximum correntropy criterion for robust TOA-based localization in NLOS environments

2020-09-13 · Wenxin Xiong, Christian Schindelhauer, Hing Cheung So, Zhi Wang

We investigate the problem of time-of-arrival (TOA) based localization under possible non-line-of-sight (NLOS) propagation conditions. To robustify the squared-range-based location estimator, we follow the maximum corren…

Learning Classifiers with Fenchel-Young Losses: Generalized Entropies, Margins, and Algorithms

2018-05-24 · Mathieu Blondel, André F. T. Martins, Vlad Niculae

This paper studies Fenchel-Young losses, a generic way to construct convex loss functions from a regularization function. We analyze their properties in depth, showing that they unify many well-known loss functions and a…

Generalized Maximum Entropy Reinforcement Learning via Reward Shaping

2021-09-29 · Feng Tao, Yongcan Cao

Entropy regularization is a commonly used technique in reinforcement learning to improve exploration and cultivate a better pre-trained policy for later adaptation. Recent studies further show that the use of entropy reg…

MuJoCoreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Improving the Trainability of Deep Neural Networks through Layerwise Batch-Entropy Regularization

2022-08-01 · David Peer, Bart Keulen, Sebastian Stabinger, Justus Piater 외

Training deep neural networks is a very demanding task, especially challenging is how to adapt architectures to improve the performance of trained models. We can find that sometimes, shallow networks generalize better th…