{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":3,"rows_per_page":100,"shown":100,"of":289,"of_with_code":13,"tagged_in_all":289,"counts":{"archive_papers_tagged":289,"with_a_code_link":13,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":289,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/vice-variational-inference-for-concept-1","slug":"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_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/vice-variational-inference-for-concept-1#ran","syntology_url":"https://syntology.ai/paper/2205.00756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00756"}},"official":{"repos":["lukasmut/vice"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/understanding-boolean-function-learnability","slug":"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","slug":"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","slug":"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":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":4,"n_pointer_only":11,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/prospective-learning-learning-for-a-dynamic#ran","syntology_url":"https://syntology.ai/paper/2411.00109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.00109"}},"official":{"repos":["neurodata/prolearn"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/optimistic-rates-for-learning-from-label","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/optimistic-rates-for-learning-from-label#ran","syntology_url":"https://syntology.ai/paper/2406.00487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00487"}},"official":{"repos":["GXLI97/llp_experiments"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/towards-a-theory-of-model-distillation","slug":"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_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-a-theory-of-model-distillation#ran","syntology_url":"https://syntology.ai/paper/2403.09053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09053"}},"official":{"repos":["eboix/theory-of-model-distillation"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sat-based-pac-learning-of-description-logic","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"url":null,"slug":"computational-statistical-tradeoffs-from-np","title":"Computational-Statistical Tradeoffs from NP-hardness","date":"2025-07-17","arxiv_id":"2507.13222","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-distributional-lifting-theorem-for-pac","title":"A Distributional-Lifting Theorem for PAC Learning","date":"2025-06-19","arxiv_id":"2506.16651","repositories_listed":0,"syntology":null},{"url":null,"slug":"conservative-classifiers-do-consistently-well","title":"Conservative classifiers do consistently well with improving agents: characterizing statistical and online learning","date":"2025-06-05","arxiv_id":"2506.05252","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-and-sq-lower-bounds-for-robustly","title":"Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-index Models","date":"2025-05-27","arxiv_id":"2505.21475","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute-efficient-pac-learning-of-sparse","title":"Attribute-Efficient PAC Learning of Sparse Halfspaces with Constant Malicious Noise Rate","date":"2025-05-27","arxiv_id":"2505.21430","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-packing-lemma-for-vcn-k-dimension-and","title":"A packing lemma for VCN${}_k$-dimension and learning high-dimensional data","date":"2025-05-21","arxiv_id":"2505.15688","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-perspectives-on-learning-statistical","title":"From learnable objects to learnable random objects","date":"2025-04-01","arxiv_id":"2504.00847","repositories_listed":0,"syntology":null},{"url":null,"slug":"numerical-and-statistical-analysis-of","title":"Numerical and statistical analysis of NeuralODE with Runge-Kutta time integration","date":"2025-03-13","arxiv_id":"2503.10729","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-linear-theory-of-multi-winner-voting","title":"A Linear Theory of Multi-Winner Voting","date":"2025-03-05","arxiv_id":"2503.03082","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-with-improvements","title":"PAC Learning with Improvements","date":"2025-03-05","arxiv_id":"2503.03184","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-understanding-multi-round-large","title":"Towards Understanding Multi-Round Large Language Model Reasoning: Approximability, Learnability and Generalizability","date":"2025-03-05","arxiv_id":"2503.03128","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-learning-with-nasty-noise","title":"Contrastive Learning with Nasty Noise","date":"2025-02-25","arxiv_id":"2502.17872","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-contrastive-pac-learning","title":"Towards Efficient Contrastive PAC Learning","date":"2025-02-21","arxiv_id":"2502.15962","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-multiclass-list-classification","title":"Bandit Multiclass List Classification","date":"2025-02-13","arxiv_id":"2502.09257","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-agnostic-pac-learning-in-the-small-error","title":"On Agnostic PAC Learning in the Small Error Regime","date":"2025-02-13","arxiv_id":"2502.09496","repositories_listed":0,"syntology":null},{"url":null,"slug":"simplifying-adversarially-robust-pac-learning","title":"Simplifying Adversarially Robust PAC Learning with Tolerance","date":"2025-02-11","arxiv_id":"2502.07232","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-computability-of-multiclass-pac","title":"On the Computability of Multiclass PAC Learning","date":"2025-02-10","arxiv_id":"2502.06089","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-neural-certificate-synthesis","title":"Data-Driven Neural Certificate Synthesis","date":"2025-02-08","arxiv_id":"2502.05510","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-optimal-pac-learning","title":"Efficient Optimal PAC Learning","date":"2025-02-05","arxiv_id":"2502.03620","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-is-just-bipartite-matching-sort","title":"PAC Learning is just Bipartite Matching (Sort of)","date":"2025-02-02","arxiv_id":"2502.00607","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-specific-agnostic-conditional","title":"Distribution-Specific Agnostic Conditional Classification With Halfspaces","date":"2025-01-31","arxiv_id":"2502.00172","repositories_listed":0,"syntology":null},{"url":null,"slug":"ehrenfeucht-haussler-rank-and-chain-of","title":"Ehrenfeucht-Haussler Rank and Chain of Thought","date":"2025-01-22","arxiv_id":"2501.12997","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-working-principles-of-model-based-gas","title":"The working principles of model-based GAs fall within the PAC framework: A mathematical theory of problem decomposition","date":"2025-01-18","arxiv_id":"2501.10777","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-near-optimal-algorithm-for-learning-margin","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","date":"2025-01-16","arxiv_id":"2501.09691","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-information-from-observations","title":"Identifying Information from Observations with Uncertainty and Novelty","date":"2025-01-16","arxiv_id":"2501.09331","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-noisy-halfspaces-with-a-margin","title":"Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random","date":"2025-01-16","arxiv_id":"2501.09851","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-closer-look-at-the-learnability-of-out-of","title":"A Closer Look at the Learnability of Out-of-Distribution (OOD) Detection","date":"2025-01-15","arxiv_id":"2501.08821","repositories_listed":0,"syntology":null},{"url":null,"slug":"monotonic-learning-in-the-pac-framework-a-new","title":"Monotonic Learning in the PAC Framework: A New Perspective","date":"2025-01-09","arxiv_id":"2501.05493","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensuring-superior-learning-outcomes-and-data","title":"Ensuring superior learning outcomes and data security for authorized learner","date":"2025-01-01","arxiv_id":"2501.00754","repositories_listed":0,"syntology":null},{"url":null,"slug":"of-dice-and-games-a-theory-of-generalized","title":"Of Dice and Games: A Theory of Generalized Boosting","date":"2024-12-11","arxiv_id":"2412.08012","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-high-order-moment-tensor-estimation","title":"Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models","date":"2024-11-23","arxiv_id":"2411.15669","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-littlestone-dimension","title":"Effective Littlestone Dimension","date":"2024-11-22","arxiv_id":"2411.15109","repositories_listed":0,"syntology":null},{"url":null,"slug":"probably-approximately-precision-and-recall","title":"Probably Approximately Precision and Recall Learning","date":"2024-11-20","arxiv_id":"2411.13029","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-multivariate-gaussians-with","title":"Learning multivariate Gaussians with imperfect advice","date":"2024-11-19","arxiv_id":"2411.12700","repositories_listed":0,"syntology":null},{"url":null,"slug":"reliable-learning-of-halfspaces-under","title":"Reliable Learning of Halfspaces under Gaussian Marginals","date":"2024-11-18","arxiv_id":"2411.11238","repositories_listed":0,"syntology":null},{"url":null,"slug":"probably-approximately-correct-high","title":"Probably approximately correct high-dimensional causal effect estimation given a valid adjustment set","date":"2024-11-12","arxiv_id":"2411.08141","repositories_listed":0,"syntology":null},{"url":null,"slug":"screw-geometry-meets-bandits-incremental","title":"Screw Geometry Meets Bandits: Incremental Acquisition of Demonstrations to Generate Manipulation Plans","date":"2024-10-23","arxiv_id":"2410.18275","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-pac-learning-of-half-spaces-through","title":"Enhancing PAC Learning of Half spaces Through Robust Optimization Techniques","date":"2024-10-21","arxiv_id":"2410.16573","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-linear-attention-in-polynomial-time","title":"Learning Linear Attention in Polynomial Time","date":"2024-10-14","arxiv_id":"2410.10101","repositories_listed":0,"syntology":null},{"url":null,"slug":"measurability-in-the-fundamental-theorem-of","title":"Measurability in the Fundamental Theorem of Statistical Learning","date":"2024-10-14","arxiv_id":"2410.10243","repositories_listed":0,"syntology":null},{"url":null,"slug":"strategic-classification-with-externalities","title":"Strategic Classification With Externalities","date":"2024-10-10","arxiv_id":"2410.08032","repositories_listed":0,"syntology":null},{"url":null,"slug":"agnostic-smoothed-online-learning","title":"Agnostic Smoothed Online Learning","date":"2024-10-07","arxiv_id":"2410.05124","repositories_listed":0,"syntology":null},{"url":null,"slug":"fill-in-the-gaps-model-calibration-and","title":"Fill In The Gaps: Model Calibration and Generalization with Synthetic Data","date":"2024-10-07","arxiv_id":"2410.10864","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pac-learning-of-halfspaces-with","title":"Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate","date":"2024-10-02","arxiv_id":"2410.01186","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-statistics-with-unknown-truncation","title":"Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians","date":"2024-10-02","arxiv_id":"2410.01656","repositories_listed":0,"syntology":null},{"url":null,"slug":"derandomizing-multi-distribution-learning","title":"Derandomizing Multi-Distribution Learning","date":"2024-09-26","arxiv_id":"2409.17567","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-decision-tree-learning-solves-hard","title":"Fast decision tree learning solves hard coding-theoretic problems","date":"2024-09-19","arxiv_id":"2409.13096","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-practical-theory-of-generalization-in","title":"A Practical Theory of Generalization in Selectivity Learning","date":"2024-09-11","arxiv_id":"2409.07014","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-agnostic-pac-learning","title":"Revisiting Agnostic PAC Learning","date":"2024-07-29","arxiv_id":"2407.19777","repositories_listed":0,"syntology":null},{"url":null,"slug":"ramsey-theorems-for-trees-and-a-general","title":"Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem","date":"2024-07-10","arxiv_id":"2407.07765","repositories_listed":0,"syntology":null},{"url":null,"slug":"superconstant-inapproximability-of-decision","title":"Superconstant Inapproximability of Decision Tree Learning","date":"2024-07-01","arxiv_id":"2407.01402","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-learnability-and-robustness-1","title":"Distribution Learnability and Robustness","date":"2024-06-25","arxiv_id":"2406.17814","repositories_listed":0,"syntology":null},{"url":null,"slug":"credit-attribution-and-stable-compression","title":"Credit Attribution and Stable Compression","date":"2024-06-22","arxiv_id":"2406.15916","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-rates-for-bandit-pac-multiclass","title":"Fast Rates for Bandit PAC Multiclass Classification","date":"2024-06-18","arxiv_id":"2406.12406","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-efficient-pac-learning-possible-with-an","title":"Is Efficient PAC Learning Possible with an Oracle That Responds 'Yes' or 'No'?","date":"2024-06-17","arxiv_id":"2406.11667","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-computability-of-robust-pac-learning","title":"On the Computability of Robust PAC Learning","date":"2024-06-14","arxiv_id":"2406.10161","repositories_listed":0,"syntology":null},{"url":null,"slug":"weak-robust-compatibility-between-learning","title":"Weak Robust Compatibility Between Learning Algorithms and Counterfactual Explanation Generation Algorithms","date":"2024-05-31","arxiv_id":"2405.20664","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-computational-landscape-of-replicable","title":"On the Computational Landscape of Replicable Learning","date":"2024-05-24","arxiv_id":"2405.15599","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-learning-meets-graph-structure","title":"Distribution Learning Meets Graph Structure Sampling","date":"2024-05-13","arxiv_id":"2405.07914","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pac-learnability-of-dynamical","title":"Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks","date":"2024-05-11","arxiv_id":"2405.06884","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-transductive-learning-equivalent-to-pac","title":"Is Transductive Learning Equivalent to PAC Learning?","date":"2024-05-08","arxiv_id":"2405.05190","repositories_listed":0,"syntology":null},{"url":null,"slug":"error-exponent-in-agnostic-pac-learning","title":"Error Exponent in Agnostic PAC Learning","date":"2024-05-01","arxiv_id":"2405.00792","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-power-of-interactive-proofs-for","title":"On the Power of Interactive Proofs for Learning","date":"2024-04-11","arxiv_id":"2404.08158","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-learnability-of-out-of-distribution","title":"On the Learnability of Out-of-distribution Detection","date":"2024-04-07","arxiv_id":"2404.04865","repositories_listed":0,"syntology":null},{"url":null,"slug":"super-non-singular-decompositions-of","title":"Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs","date":"2024-03-31","arxiv_id":"2404.00529","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardness-of-learning-boolean-functions-from","title":"Hardness of Learning Boolean Functions from Label Proportions","date":"2024-03-28","arxiv_id":"2403.19401","repositories_listed":0,"syntology":null},{"url":null,"slug":"list-sample-compression-and-uniform","title":"List Sample Compression and Uniform Convergence","date":"2024-03-16","arxiv_id":"2403.10889","repositories_listed":0,"syntology":null},{"url":null,"slug":"majority-of-three-the-simplest-optimal","title":"Majority-of-Three: The Simplest Optimal Learner?","date":"2024-03-12","arxiv_id":"2403.08831","repositories_listed":0,"syntology":null},{"url":null,"slug":"proper-vs-improper-quantum-pac-learning","title":"Proper vs Improper Quantum PAC learning","date":"2024-03-05","arxiv_id":"2403.03295","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-arity-pac-learning-via-exchangeability","title":"High-arity PAC learning via exchangeability","date":"2024-02-22","arxiv_id":"2402.14294","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-learning-with-different","title":"Collaborative Learning with Different Labeling Functions","date":"2024-02-16","arxiv_id":"2402.10445","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-pac-learning-may-be-harder-than","title":"Private PAC Learning May be Harder than Online Learning","date":"2024-02-16","arxiv_id":"2402.11119","repositories_listed":0,"syntology":null},{"url":null,"slug":"learnability-is-a-compact-property","title":"Transductive Learning Is Compact","date":"2024-02-15","arxiv_id":"2402.10360","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sample-complexity-of-multi-distribution-1","title":"The sample complexity of multi-distribution learning","date":"2023-12-07","arxiv_id":"2312.04027","repositories_listed":0,"syntology":null},{"url":null,"slug":"varepsilon-fractional-core-stability-in","title":"$\\varepsilon$-fractional Core Stability in Hedonic Games","date":"2023-11-18","arxiv_id":"2311.11101","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-7","title":"Information-theoretic generalization bounds for learning from quantum data","date":"2023-11-09","arxiv_id":"2311.05529","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-mdps-with-continuous-action-spaces","title":"Low-Rank MDPs with Continuous Action Spaces","date":"2023-11-06","arxiv_id":"2311.03564","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pac-learning-algorithm-for-ltl-and-omega","title":"A PAC Learning Algorithm for LTL and Omega-regular Objectives in MDPs","date":"2023-10-18","arxiv_id":"2310.12248","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-linear-thresholds-from-label","title":"PAC Learning Linear Thresholds from Label Proportions","date":"2023-10-16","arxiv_id":"2310.10098","repositories_listed":0,"syntology":null},{"url":null,"slug":"overview-of-adaboost-reconciling-its-views-to","title":"Overview of AdaBoost : Reconciling its views to better understand its dynamics","date":"2023-10-06","arxiv_id":"2310.18323","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributional-pac-learning-from-nisan-s","title":"Distributional PAC-Learning from Nisan's Natural Proofs","date":"2023-10-05","arxiv_id":"2310.03641","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-for-gaussian-processes-with-matern","title":"Inference for Gaussian Processes with Matern Covariogram on Compact Riemannian Manifolds","date":"2023-09-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-for-gaussian-processes-with-matern-1","title":"Inference for Gaussian Processes with Matern Covariogram on Compact Riemannian Manifolds","date":"2023-09-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"user-level-differential-privacy-with-few","title":"User-Level Differential Privacy With Few Examples Per User","date":"2023-09-21","arxiv_id":"2309.12500","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-learning-of-quantum-states-with","title":"Provable learning of quantum states with graphical models","date":"2023-09-17","arxiv_id":"2309.09235","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-the-vapnik-chervonenkis-dimension","title":"Computing the Vapnik Chervonenkis Dimension for Non-Discrete Settings","date":"2023-08-19","arxiv_id":"2308.10041","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-learning-one-hidden-layer-relu-1","title":"Efficiently Learning One-Hidden-Layer ReLU Networks via Schur Polynomials","date":"2023-07-24","arxiv_id":"2307.12840","repositories_listed":0,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/task/pac-learning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":3,"url":"/task/pac-learning/papers/2","json":"/task/pac-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/pac-learning/papers/3","json":"/task/pac-learning/papers/3.json","rows":89},{"order":"ran","page":1,"of":1,"url":"/task/pac-learning/papers/ran/1","json":"/task/pac-learning/papers/ran/1.json","rows":3}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"b060077f31aee7f3b4b1642233d120e32625b5835709ab34a9b3117a4623c779","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}