本資料は、掲載誌(URI)等のリンク先にある学位授与機関のWebサイトやCiNii Dissertationsから、本文を自由に閲覧できる場合があります。
博士論文
国立国会図書館館内限定公開
収録元データベースで確認する
国立国会図書館デジタルコレクション
デジタルデータあり
パラメータ制約付き特異モデルの統計的学習理論
- 国立国会図書館永続的識別子
- info:ndljp/pid/12304749
国立国会図書館での利用に関する注記
資料に関する注記
一般注記:
- Statistical models used in machine learning are called learning machines. It is well-known that learning machines are widely applied to predict unknow...
書店で探す
障害者向け資料で読む
書店で探す
障害者向け資料で読む
書誌情報
この資料の詳細や典拠(同じ主題の資料を指すキーワード、著者名)等を確認できます。
デジタル
- 資料種別
- 博士論文
- 著者・編者
- 林, 直輝Hayashi, Naoki
- 出版年月日等
- 2021-06
- 出版年(W3CDTF)
- 2021-06
- 並列タイトル等
- Statistical Learning Theory of Parameter-Restricted Singular Models
- 授与機関名
- 東京工業大学
- 授与年月日
- 2021-06-30
- 授与年月日(W3CDTF)
- 2021-06-30
- 報告番号
- 甲第12028号
- 学位
- 博士(理学)
- 博論授与番号
- 甲第12028号
- 本文の言語コード
- eng
- 件名標目
- 対象利用者
- 一般
- 一般注記
- Statistical models used in machine learning are called learning machines. It is well-known that learning machines are widely applied to predict unknown events and discover knowledge by computers in many fields. Indeed, machine learning has grown over the last several decades. They are used for statistical learning/inference and usually have hierarchical structures. These structures are effective for generalizing to the real world. Statistical learning theory is a theory to clarify the generalization performances of learning machines.Singular learning theory is a mathematical foundation for statistical inference using singular models. Typical hierarchical models, such as neural networks, tree and forest model, mixture model, matrix factorization, and topic model, are statistically singular since a map from a parameter to a probability density function is not one-to-one. Clarifying generalization behaviors in singular models is an important problem to estimate sufficient sample sizes, design models, and tune hyperparameters. However, conventional statistics theory cannot be applied to these models because their likelihoods cannot be approximated by any normal distribution.Singular learning theory provides a general view for this problem; birational invariants of an analytic set (a.k.a. algebraic variety) determine the generalization error. That is defined by zero of a Kullback-Leibler (KL) divergence between the data-generating distribution and the model. Algebraic structures of statistical models are essential in singular learning theory; thus, it can be interpreted as an intersection between algebraic statistics and statistical learning theory.One of such invariants is a real log canonical threshold (RLCT). An RLCT is a negative-maximum pole of a zeta function defined by an integral of a KL divergence. Determining an RLCT of a concrete model is performed by resolution of singularities. In fact, algebraic statisticians and machine learning researchers have derived the exact values or upper bounds of the RLCTs for several singular models. The theoretical value of the RLCT is effective in statistical model selection such as sBIC proposed by Drton and Plummer. Besides, Nagata proposed a tuning method using RLCTs for exchange Monte Carlo.On the other hand, from the practical point of view, the parameter region of the model is often restricted to improve interpretability. Non-negative matrix factorization (NMF) and latent Dirichlet allocation (LDA) are well-known examples of parameter-restricted singular models.In general, such constraints make the generalization error changed. However, for each singular model and condition, the quantitative effect of those constraints has not yet been clarified because the singularities in the above analytic set are also changed by the restriction to the parameter region.In this dissertation, as a foundation to establish a singular learning theory of parameter-restricted statistical models,we theoretically study the asymptotic behavior of the Bayesian generalization error in NMF and LDA. NMF and LDA are two typical singular models whose parameter regions are constrained.In NMF, we derive an upper bound of the RLCT and a lower bound of the variational approximation error.In LDA, we prove that its RLCT is equal to that of matrix factorization with simplex restrictionand clarify the exact asymptotic form of the generalization error, i.e. we determine the exact value of the RLCT of LDA.These results provide quantitative differences of generalization errors from matrix factorization whose parameter space is not restricted.identifier:oai:t2r2.star.titech.ac.jp:50574456
- 国立国会図書館永続的識別子
- info:ndljp/pid/12304749
- コレクション(共通)
- コレクション(障害者向け資料:レベル1)
- コレクション(個別)
- 国立国会図書館デジタルコレクション > デジタル化資料 > 博士論文
- 収集根拠
- 博士論文(自動収集)
- 受理日(W3CDTF)
- 2022-07-05T02:30:21+09:00
- 作成日(W3CDTF)
- 2021-05-20
- 記録形式(IMT)
- application/pdf
- オンライン閲覧公開範囲
- 国立国会図書館内限定公開
- デジタル化資料送信
- 図書館・個人送信対象外
- 遠隔複写可否(NDL)
- 可
- 掲載誌(URI)
- 連携機関・データベース
- 国立国会図書館 : 国立国会図書館デジタルコレクション