Inductive Inference of Languages from Samplings
Abstract
We introduce, discuss, and study a model for inductive inference from samplings, formalizing an idea of learning different “projections” of languages. One set of our results addresses the problem of finding a uniform learner for all samplings of a language from a certain set when learners for particular samplings are available. Another set of results deals with extending learnability from a large natural set of samplings to larger sets. A number of open problems is formulated.
Cite
Text
Jain and Kinber. "Inductive Inference of Languages from Samplings." International Conference on Algorithmic Learning Theory, 2010. doi:10.1007/978-3-642-16108-7_27Markdown
[Jain and Kinber. "Inductive Inference of Languages from Samplings." International Conference on Algorithmic Learning Theory, 2010.](https://mlanthology.org/alt/2010/jain2010alt-inductive/) doi:10.1007/978-3-642-16108-7_27BibTeX
@inproceedings{jain2010alt-inductive,
title = {{Inductive Inference of Languages from Samplings}},
author = {Jain, Sanjay and Kinber, Efim B.},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2010},
pages = {330-344},
doi = {10.1007/978-3-642-16108-7_27},
url = {https://mlanthology.org/alt/2010/jain2010alt-inductive/}
}