2010
NeurIPS
NeurIPS 2010
t-logistic regression
Abstract
We extend logistic regression by using t-exponential families which were introduced recently in statistical physics. This gives rise to a regularized risk minimization problem with a non-convex loss function. An efficient block coordinate descent optimization scheme can be derived for estimating the parameters. Because of the nature of the loss function, our algorithm is tolerant to label noise. Furthermore, unlike other algorithms which employ non-convex loss functions, our algorithm is fairly robust to the choice of initial values. We verify both these observations empirically on a number of synthetic and real datasets.
🌱
Topic Pioneer
- Label Noise
🌉
Interdisciplinary Bridge
- Artificial Intelligence and Mathematics & Optimization
📈
Trend Setter
- Non-Convex Optimization
🐣
Hot Topic Early Bird
- label noise
Authors
Topics
Machine Learning > Core Methods > Classification
Machine Learning > Core Methods > Regression
Machine Learning > Optimization & Theory > Optimization
Mathematics & Optimization > Optimization > Convex Optimization
Mathematics & Optimization > Optimization > Non-Convex Optimization
Machine Learning > Learning Types > Label Noise