Research map / Learning theory and algorithms / Sample complexity
A Theory of Tournament Representations
Arun Rajkumar, Vishnu Veerathu, Abdul Bakey Mir
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the Flip Feedback Node set size to bound representation dimension | Any tournament T · Arbitrary tournaments | upper bound on minimum representation dimension: 2(μ(T)+1) | Improved |
Closest papers by meaning
- An Exercise in Tournament Design: When Some Matches Must Be Scheduled (AAAI 2024 · similarity 0.82)
- Adaptive Manipulation for Coalitions in Knockout Tournaments (AAAI 2025 · similarity 0.81)
- Learning Representations for Hierarchies with Minimal Support (NeurIPS 2024 · similarity 0.81)
- Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics (ICML 2025 · similarity 0.80)
- On a Combinatorial Problem Arising in Machine Teaching (ICML 2024 · similarity 0.80)
- Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma (NeurIPS 2024 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
