On Batch Teaching Without Collusion

Autor: Fallat, S., Kirkpatrick, D., Simon, H., Soltani, A., Zilles, S.

Publikováno v: Journal of Machine Learning Research

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1874::849ec81ddb4c7aae804bd4ed6ab18121
https://hdl.handle.net/21.11116/0000-000C-7CCF-121.11116/0000-000C-7CD1-D

On Batch Teaching with Sample Complexity Bounded by {VCD}

Autor: Mansouri, F., Simon, H., Singla, A., Zilles, S.

Publikováno v: Advances in Neural Information Processing Systems 35

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1874::d9825a793046c82e380073ea9faefb1d
https://hdl.handle.net/21.11116/0000-000C-1601-A21.11116/0000-000C-D2CB-2

An Overview of Machine Teaching

Autor: Zhu, X., Singla, A., Zilles, S., Rafferty, A.

In this paper we try to organize machine teaching as a coherent set of ideas. Each idea is presented as varying along a dimension. The collection of dimensions then form the problem space of machine teaching, such that existing teaching problems can

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1874::298892c83023bd8f13adcfff98473c6a
https://hdl.handle.net/21.11116/0000-0003-4254-421.11116/0000-0003-4256-2

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling

Autor: Lelis, L., Roni Stern, Felner, A., Zilles, S., Holte, R. C.

Publikováno v: Scopus-Elsevier

Optimal planning and heuristic search systems solve state-space searchproblems by finding a least-cost path from start to goal. As a byproduct of having an optimal path they also determine the optimal solution cost. In this paper we focus on the prob

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7250570fe12046e7787bfebdded92473
https://doi.org/10.1609/icaps.v22i1.13512

Two problems for sophistication

Autor: Bloem, P., de Rooij, S., Adriaans, P., Chaudhuri, K., Gentile, C., Zilles, S.

Publikováno v: Algorithmic Learning Theory: 26th International Conference, ALT 2015, Banff, AB, Canada, October 4-6, 2015 : proceedings, 379-394
STARTPAGE=379;ENDPAGE=394;TITLE=Algorithmic Learning Theory
Lecture Notes in Computer Science ISBN: 9783319244853
ALT

Kolmogorov complexity measures the amount of information in data, but does not distinguish structure from noise. Kolmogorov’s definition of the structure function was the first attempt to measure only the structural information in data, by measurin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3892c4f2589a30e70a274ce817d4e316
https://dare.uva.nl/personal/pure/en/publications/two-problems-for-sophistication(73820b56-7045-494a-9800-3cf1ebd88a33).html