TY - JOUR
T1 - Information geometry of modal linear regression
AU - Sando, Keishi
AU - Akaho, Shotaro
AU - Murata, Noboru
AU - Hino, Hideitsu
N1 - Funding Information:
Part of this work is supported by JST KAKENHI 16K16108, 16H02842, 17H01793 and JST CREST JPMJCR1761.
Publisher Copyright:
© 2019, The Author(s).
PY - 2019/6/1
Y1 - 2019/6/1
N2 - Modal linear regression (MLR) is used for modeling the conditional mode of a response as a linear predictor of explanatory variables. It is an effective approach to dealing with response variables having a multimodal distribution or those contaminated by outliers. Because of the semiparametric nature of MLR, constructing a statistical model manifold is difficult with the conventional approach. To overcome this difficulty, we first consider the information geometric perspective of the modal expectation–maximization (EM) algorithm. Based on this perspective, model manifolds for MLR are constructed according to observations, and a data manifold is constructed based on the empirical distribution. In this paper, the em algorithm, which is a geometric formulation of the EM algorithm, of MLR is shown to be equivalent to the conventional EM algorithm of MLR. The robustness of the MLR model is also discussed in terms of the influence function and information geometry.
AB - Modal linear regression (MLR) is used for modeling the conditional mode of a response as a linear predictor of explanatory variables. It is an effective approach to dealing with response variables having a multimodal distribution or those contaminated by outliers. Because of the semiparametric nature of MLR, constructing a statistical model manifold is difficult with the conventional approach. To overcome this difficulty, we first consider the information geometric perspective of the modal expectation–maximization (EM) algorithm. Based on this perspective, model manifolds for MLR are constructed according to observations, and a data manifold is constructed based on the empirical distribution. In this paper, the em algorithm, which is a geometric formulation of the EM algorithm, of MLR is shown to be equivalent to the conventional EM algorithm of MLR. The robustness of the MLR model is also discussed in terms of the influence function and information geometry.
KW - Information geometry
KW - Kernel density estimation
KW - Modal linear regression
UR - http://www.scopus.com/inward/record.url?scp=85080128738&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85080128738&partnerID=8YFLogxK
U2 - 10.1007/s41884-019-00017-y
DO - 10.1007/s41884-019-00017-y
M3 - Article
AN - SCOPUS:85080128738
SN - 2511-2481
VL - 2
SP - 43
EP - 75
JO - Information Geometry
JF - Information Geometry
IS - 1
ER -