Bounds for Learning from Evolutionary-Related Data in the Realizable Case
Authors: Ondřej Kuželka, Yuyi Wang, Jan Ramon
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | For the realizable case, we prove PAC-type upper and lower bounds based on symmetries and matchings in such trees. |
| Researcher Affiliation | Academia | Ondˇrej Kuˇzelka Cardiff University, UK Kuzelka O@cardiff.ac.uk Yuyi Wang ETH, Switzerland yuyi.wang@tik.ee.ethz.ch Jan Ramon INRIA, France/KU Leuven, Belgium jan.ramon@inria.fr |
| Pseudocode | No | The paper contains mathematical proofs and definitions but no structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any statements about open-source code availability or links to code repositories. |
| Open Datasets | No | The paper is theoretical and models a learning task with 'samples' and 'examples' within its framework, but it does not specify or use any publicly available or open datasets for training experimental models. |
| Dataset Splits | No | The paper is theoretical and does not conduct experiments, therefore no training/validation/test dataset splits are provided. |
| Hardware Specification | No | The paper is theoretical and does not describe computational experiments, therefore no specific hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not describe implementation details or computational experiments, therefore no specific software dependencies or versions are mentioned. |
| Experiment Setup | No | The paper is theoretical and does not report on empirical experiments, therefore no experimental setup details such as hyperparameters or training configurations are provided. |