{"url":"/task/pac-learning","name":"PAC learning","slug":"pac-learning","description_markdown":"Probably Approximately Correct (PAC) learning analyzes machine learning mathematically using probability bounds.","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":289,"papers_with_code":13,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":13,"of":13,"tagged_in_all":289,"items":[{"url":"/paper/vice-variational-inference-for-concept-1","title":"VICE: Variational Interpretable Concept Embeddings","date":"2022-05-02","arxiv_id":"2205.00756","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_unverified":3,"n_pointer_only":10}},{"url":"/paper/understanding-boolean-function-learnability","title":"Understanding Boolean Function Learnability on Deep Neural Networks: PAC Learning Meets Neurosymbolic Models","date":"2020-09-13","arxiv_id":"2009.05908","repositories_listed":2,"syntology":null},{"url":"/paper/lean-formalization-of-generalization-error","title":"Lean Formalization of Generalization Error Bound by Rademacher Complexity","date":"2025-03-25","arxiv_id":"2503.19605","repositories_listed":1,"syntology":null},{"url":"/paper/prospective-learning-learning-for-a-dynamic","title":"Prospective Learning: Learning for a Dynamic Future","date":"2024-10-31","arxiv_id":"2411.00109","repositories_listed":1,"syntology":{"n":11,"n_ran":0,"n_unverified":11,"n_pointer_only":11}},{"url":"/paper/optimistic-rates-for-learning-from-label","title":"Optimistic Rates for Learning from Label Proportions","date":"2024-06-01","arxiv_id":"2406.00487","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/towards-a-theory-of-model-distillation","title":"Towards a theory of model distillation","date":"2024-03-14","arxiv_id":"2403.09053","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_unverified":0,"n_pointer_only":8}},{"url":"/paper/sat-based-pac-learning-of-description-logic","title":"SAT-Based PAC Learning of Description Logic Concepts","date":"2023-05-15","arxiv_id":"2305.08511","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-induces-robustness-information","title":"Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation","date":"2022-11-01","arxiv_id":"2211.00724","repositories_listed":1,"syntology":null},{"url":"/paper/planted-dense-subgraphs-in-dense-random","title":"Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning","date":"2022-01-05","arxiv_id":"2201.01825","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-boosting-using-domain-partitioning","title":"Quantum Boosting using Domain-Partitioning Hypotheses","date":"2021-10-25","arxiv_id":"2110.12793","repositories_listed":1,"syntology":null},{"url":"/paper/slip-learning-to-predict-in-unknown-dynamical","title":"SLIP: Learning to Predict in Unknown Dynamical Systems with Long-Term Memory","date":"2020-10-12","arxiv_id":"2010.05899","repositories_listed":1,"syntology":null},{"url":"/paper/regression-equilibrium","title":"Regression Equilibrium","date":"2019-05-04","arxiv_id":"1905.02576","repositories_listed":1,"syntology":null},{"url":"/paper/introduction-to-machine-learning-class-notes","title":"Introduction to Machine Learning: Class Notes 67577","date":"2009-04-23","arxiv_id":"0904.3664","repositories_listed":1,"syntology":null}],"syntology_records":4,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}