On a Combinatorial Problem Arising in Machine Teaching
Authors: Joakim Sunde, Brigt Håvardstun, Jan Kratochvı́l, Jan Arne Telle
ICML 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper we prove their conjecture. The result can be seen as a generalization of a theorem resolving the edge isoperimetry problem for hypercubes (Hart, 1976). Our proof is based on a generalization of a lemma of (Graham, 1970). |
| Researcher Affiliation | Academia | 1Department of Informatics, University of Bergen, Bergen, Norway 2Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic. |
| Pseudocode | No | The paper describes the 'Greedy' algorithm in prose, but it does not contain any structured pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not contain any statements or links indicating that open-source code for the described methodology is available. |
| Open Datasets | No | As a theoretical paper focused on mathematical proofs, the concept of training datasets is not applicable, and no such data is mentioned or used. |
| Dataset Splits | No | As a theoretical paper focused on mathematical proofs, the concepts of validation splits are not applicable, and no such data is mentioned or used. |
| Hardware Specification | No | This is a theoretical paper involving mathematical proofs, and therefore, it does not detail any specific hardware used for experiments. |
| Software Dependencies | No | This is a theoretical paper focused on mathematical proofs, and as such, it does not list any specific software dependencies with version numbers required for replication of experiments. |
| Experiment Setup | No | This is a theoretical paper focused on mathematical proofs and does not describe an experimental setup with hyperparameters or training configurations. |