{"total":20,"rows":[{"id":"2204.02892","title":"Sub-Task Decomposition Enables Learning in Sequence to Sequence Tasks","created":"2022-04-06","cited_by_count":41,"area":null},{"id":"2202.05258","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","created":"2022-02-10","cited_by_count":28,"area":null},{"id":"2211.13312","title":"A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity","created":"2022-11-23","cited_by_count":27,"area":null},{"id":"2101.08303","title":"From Local Pseudorandom Generators to Hardness of Learning","created":"2021-01-20","cited_by_count":24,"area":null},{"id":"2102.07802","title":"Efficient Learning with Arbitrary Covariate Shift","created":"2021-02-15","cited_by_count":15,"area":null},{"id":"2302.07426","title":"Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy","created":"2023-02-15","cited_by_count":10,"area":null},{"id":"2101.06178","title":"Learning to Sample from Censored Markov Random Fields","created":"2021-01-15","cited_by_count":6,"area":null},{"id":"2201.07206","title":"Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs","created":"2022-01-18","cited_by_count":6,"area":null},{"id":"2402.15995","title":"Improved Hardness Results for Learning Intersections of Halfspaces","created":"2024-02-25","cited_by_count":6,"area":null},{"id":"2310.03641","title":"Distributional PAC-Learning from Nisan's Natural Proofs","created":"2023-10-05","cited_by_count":4,"area":null},{"id":"2511.08791","title":"The Probably Approximately Correct Learning Model in Computational Learning Theory","created":"2025-11-11","cited_by_count":3,"area":null},{"id":"2602.08907","title":"Positive Distribution Shift as a Framework for Understanding Tractable Learning","created":"2026-02-09","cited_by_count":3,"area":null},{"id":"2305.16508","title":"Most Neural Networks Are Almost Learnable","created":"2023-05-25","cited_by_count":2,"area":null},{"id":"2502.02221","title":"Bias Detection via Maximum Subgroup Discrepancy","created":"2025-02-04","cited_by_count":2,"area":null},{"id":"2510.04834","title":"On the Hardness of Learning Regular Expressions","created":"2025-10-06","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":"2204.06638","title":"Clifford Circuits can be Properly PAC Learned if and only if $\\textsf{RP}=\\textsf{NP}$","created":"2022-04-13","cited_by_count":1,"area":null},{"id":"2110.13664","title":"Iterative Rule Extension for Logic Analysis of Data: an MILP-based heuristic to derive interpretable binary classification from large datasets","created":"2021-10-25","cited_by_count":0,"area":null},{"id":"2306.05490","title":"Learnability with PAC Semantics for Multi-agent Beliefs","created":"2023-06-08","cited_by_count":0,"area":null},{"id":"2410.16100","title":"ExDBN: Learning Dynamic Bayesian Networks using Extended Mixed-Integer Programming Formulations","created":"2024-10-21","cited_by_count":0,"area":null}],"next_cursor":null}