- [Home]
- [Research achievement]
- [Research achievement detail]
Title | A Note on Decision Theoretic Formulation for Learning from Queries (in Japanese) |
---|---|
Authors | Yoshifumi Ukita 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
Released Year | 1998 |
Format | Journal |
Category | Knowledge information processing |
Jounal Name | IPSJ Journal |
Jounal Page | vol.39, no.11, pp.2937-2948 |
Published Year | 1998 |
Published Month | 11 |
Abstract (English) |
There are two main learning paradigms in machine learning. One is leaning from examples and the other is learning from queries. It is necessary in learning from queries to use good query strategy because the probability that the true hypothesis is learned depends on it. However, from the computational learning theory it is important to judge whether it can learn or cannot, and it cannot be decided which query strategy is good. In this paper, we formulate learning from queries by the decision theory and propose a method of evaluating query strategy, where under the conditon that one of learning criteria (success principle, efficiency principle) is restricted, the other is minimized. Furthermore, we propose a new lower bound required for the branch-and-bound algorithm which gets efficiently the optimal query strategy. This paper is an effective study from the viewpoint of guaranteeing that the computational work for an oracle is made the smallest in learning. |
Note (English) |
3 |
Manuscript | |
Presentation |
Involved Papers
- A Note on Mixed Level Experimental Designs Using Augmented Orthogonal Arrays (in Japanese)
- 半教師付き学習における一致性を満たすゆう度方程式の解に基づく予測の漸近評価
- A CLASS OF NOISELESS CODES DESIGNED BY DECISION THEORY
- 相互情報量最大に基準を置くユーザインタフェースの効率化
- パターンごと・ステージごとに事後確率のしきい値をおくストッピングルール
- Inductive Inference and Description Length (in Japanese)
- 信頼性を考慮した推論について
- On Knowledge Representation and Reasoning System with a Range of Certainty Factors (in Japanese)
- 特集にあたって
- On Statistical Model Selection based on Bayes Decision Theory (in Japanese)
- On Complexity of Decoding beyond the BCH Bound Using Berlekamp-Massey Algorithm (in Japanese)
- On Decoding Methods beyond the BCH Bound and their Applications to Soft-Decision Decoding (in Japanese)
- Soft-Decision Decoding Using Decoding Method beyond the BCH Bound for Binary BCH Codes (in Japanese)
- A Study on Difference of Codelengths between Codes Based on MDL Principle and Bayes Codes for Given Prior Distributions (in Japanese)
- A Decision Feedback Scheme Using List Decoding for Tree Codes (in Japanese)
- Asymptotic Normality of Extended Posterior Density Functions with Loss Functions (in Japanese)
- A New Decoding Algorithm Using Likelihood Ratio Testing for Tree Codes (in Japanese)
- On Error Exponents for Variable Size List Decoder Using the Viterbi Algorithm with Likelihood Ratio Testing (in Japanese)
- On the Interleaver Design Method for Block Turbo Codes and Its Minimum Distance (in Japanese)
- あいまいな命題を含む推論モデルに関する一考察