{"total":20,"rows":[{"id":"2403.09053","title":"Towards a theory of model distillation","created":"2024-03-14","cited_by_count":15,"area":null},{"id":"2210.06375","title":"Superpolynomial Lower Bounds for Decision Tree Learning and Testing","created":"2022-10-12","cited_by_count":9,"area":null},{"id":"2303.16208","title":"Lifting uniform learners via distributional decomposition","created":"2023-03-27","cited_by_count":8,"area":null},{"id":"2405.15599","title":"On the Computational Landscape of Replicable Learning","created":"2024-05-24","cited_by_count":7,"area":null},{"id":"2307.04093","title":"Properly Learning Decision Trees with Queries Is NP-Hard","created":"2023-07-09","cited_by_count":5,"area":null},{"id":"2304.02700","title":"Agnostic proper learning of monotone functions: beyond the black-box correction barrier","created":"2023-04-05","cited_by_count":4,"area":null},{"id":"2206.08899","title":"Popular decision tree algorithms are provably noise tolerant","created":"2022-06-17","cited_by_count":3,"area":null},{"id":"2210.00212","title":"Efficient Quantum Agnostic Improper Learning of Decision Trees","created":"2022-10-01","cited_by_count":2,"area":null},{"id":"2310.01551","title":"Harnessing the Power of Choices in Decision Tree Learning","created":"2023-10-02","cited_by_count":2,"area":null},{"id":"2511.02487","title":"Learning CNF formulas from uniform random solutions in the local lemma regime","created":"2025-11-04","cited_by_count":2,"area":null},{"id":"2512.02279","title":"Limitations of Membership Queries in Testable Learning","created":"2025-12-01","cited_by_count":2,"area":null},{"id":"2206.14431","title":"Open Problem: Properly learning decision trees in polynomial time?","created":"2022-06-29","cited_by_count":1,"area":null},{"id":"2601.20775","title":"Active Learning for Decision Trees with Provable Guarantees","created":"2026-01-28","cited_by_count":1,"area":null},{"id":"2409.13096","title":"Fast decision tree learning solves hard coding-theoretic problems","created":"2024-09-19","cited_by_count":0,"area":null},{"id":"2411.03253","title":"Discovering Data Structures: Nearest Neighbor Search and Beyond","created":"2024-11-05","cited_by_count":0,"area":null},{"id":"2509.20848","title":"Actively Learning Halfspaces without Synthetic Data","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2605.12983","title":"Decision Tree Learning on Product Spaces","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2605.27594","title":"Proper Agnostic Learning of Functions of Halfspaces under Gaussian Marginals","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2607.15645","title":"Testing Distributions Against Bounded Distinguishers","created":"2026-07-17","cited_by_count":0,"area":null},{"id":"2609.15268","title":"Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's Algorithm","created":"2026-09-14","cited_by_count":0,"area":null}],"next_cursor":null}