{"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/papers/3","list_of":"/task/pac-learning","task":"PAC learning","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,289],"of":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"},"first_page":"/task/pac-learning","prev":"/task/pac-learning/papers/2","next":null,"papers":[{"url":null,"slug":"faster-pac-learning-and-smaller-coresets-via","title":"Faster PAC Learning and Smaller Coresets via Smoothed Analysis","date":"2020-06-09","arxiv_id":"2006.05441","repositories_listed":0,"syntology":null},{"url":null,"slug":"probably-approximately-correct-constrained","title":"Probably Approximately Correct Constrained Learning","date":"2020-06-09","arxiv_id":"2006.05487","repositories_listed":0,"syntology":null},{"url":null,"slug":"agnostic-learning-of-a-single-neuron-with","title":"Agnostic Learning of a Single Neuron with Gradient Descent","date":"2020-05-29","arxiv_id":"2005.14426","repositories_listed":0,"syntology":null},{"url":null,"slug":"proper-learning-helly-number-and-an-optimal","title":"Proper Learning, Helly Number, and an Optimal SVM Bound","date":"2020-05-24","arxiv_id":"2005.11818","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-learning-from-label","title":"On the Complexity of Learning from Label Proportions","date":"2020-04-07","arxiv_id":"2004.03515","repositories_listed":0,"syntology":null},{"url":null,"slug":"closure-properties-for-private-classification","title":"Closure Properties for Private Classification and Online Prediction","date":"2020-03-10","arxiv_id":"2003.04509","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-online-learning-with-changing","title":"Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds","date":"2020-03-07","arxiv_id":"2003.03490","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-active-learning-framework-for-constructing","title":"An Active Learning Framework for Constructing High-fidelity Mobility Maps","date":"2020-03-07","arxiv_id":"2003.03517","repositories_listed":0,"syntology":null},{"url":null,"slug":"decidability-of-sample-complexity-of-pac","title":"Decidability of Sample Complexity of PAC Learning in finite setting","date":"2020-02-26","arxiv_id":"2002.11519","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-sample-complexity-of-adversarial-multi","title":"On the Sample Complexity of Adversarial Multi-Source PAC Learning","date":"2020-02-24","arxiv_id":"2002.10384","repositories_listed":0,"syntology":null},{"url":null,"slug":"best-item-learning-in-random-utility-models","title":"Best-item Learning in Random Utility Models with Subset Choices","date":"2020-02-19","arxiv_id":"2002.07994","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-statistical-query-learning","title":"Quantum statistical query learning","date":"2020-02-19","arxiv_id":"2002.08240","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-combinatorial-characterization-of","title":"Towards a combinatorial characterization of bounded memory learning","date":"2020-02-08","arxiv_id":"2002.03123","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learnability-with-computable-learners","title":"On Learnability with Computable Learners","date":"2020-01-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-hypotheses-space-from-data-part","title":"Learning the Hypotheses Space from data: Learning Space and U-curve Property","date":"2020-01-26","arxiv_id":"2001.09532","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-sample-complexity-of-learning-sum","title":"On the Sample Complexity of Learning Sum-Product Networks","date":"2019-12-05","arxiv_id":"1912.02765","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-with-stable-and-private","title":"PAC learning with stable and private predictions","date":"2019-11-24","arxiv_id":"1911.10541","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-mode-estimation-with-oracle","title":"Sequential Mode Estimation with Oracle Queries","date":"2019-11-19","arxiv_id":"1911.08197","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-query-inseparable-elh-ontologies","title":"Learning Query Inseparable ELH Ontologies","date":"2019-11-17","arxiv_id":"1911.07229","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-generalization-bounds-of-a-family-of-1","title":"On Generalization Bounds of a Family of Recurrent Neural Networks","date":"2019-10-28","arxiv_id":"1910.12947","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-concepts-definable-in-first-order","title":"Learning Concepts Definable in First-Order Logic with Counting","date":"2019-09-09","arxiv_id":"1909.03820","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-power-of-comparisons-for-actively","title":"The Power of Comparisons for Actively Learning Linear Classifiers","date":"2019-07-08","arxiv_id":"1907.03816","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-independent-pac-learning-of","title":"Distribution-Independent PAC Learning of Halfspaces with Massart Noise","date":"2019-06-24","arxiv_id":"1906.10075","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-driven-pac-learning-for-reasoning","title":"Query-driven PAC-Learning for Reasoning","date":"2019-06-24","arxiv_id":"1906.10118","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounds-for-adversarially-robust-pac","title":"Lower Bounds for Adversarially Robust PAC Learning","date":"2019-06-13","arxiv_id":"1906.05815","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-hypothesis-selection","title":"Private Hypothesis Selection","date":"2019-05-30","arxiv_id":"1905.13229","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-hardness-of-learning-shallow","title":"Quantum hardness of learning shallow classical circuits","date":"2019-03-07","arxiv_id":"1903.02840","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-pac-to-instance-optimal-sample","title":"From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model","date":"2019-03-01","arxiv_id":"1903.00558","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-learning-of-geometric","title":"Differentially Private Learning of Geometric Concepts","date":"2019-02-13","arxiv_id":"1902.05017","repositories_listed":0,"syntology":null},{"url":null,"slug":"crowdsourced-pac-learning-under","title":"Crowdsourced PAC Learning under Classification Noise","date":"2019-02-12","arxiv_id":"1902.04629","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-hyperparameter-tuning-using-bayesian","title":"Fast Hyperparameter Tuning using Bayesian Optimization with Directional Derivatives","date":"2019-02-06","arxiv_id":"1902.02416","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-sgd-learn-recurrent-neural-networks-with","title":"Can SGD Learn Recurrent Neural Networks with Provable Generalization?","date":"2019-02-04","arxiv_id":"1902.01028","repositories_listed":0,"syntology":null},{"url":null,"slug":"learnability-can-be-undecidable","title":"Learnability can be undecidable","date":"2019-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-guarantees-under-covariate-shift","title":"PAC Learning Guarantees Under Covariate Shift","date":"2018-12-16","arxiv_id":"1812.06393","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-in-the-presence-of-adversaries","title":"PAC-learning in the presence of adversaries","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-use-heuristics-for-differential","title":"How to Use Heuristics for Differential Privacy","date":"2018-11-19","arxiv_id":"1811.07765","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-sample-complexity-of-pac-learning","title":"Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem","date":"2018-10-25","arxiv_id":"1810.10938","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-algorithms-for-learning-from-random","title":"Simple and Fast Algorithms for Interactive Machine Learning with Random Counter-examples","date":"2018-10-01","arxiv_id":"1810.00506","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-without-interaction-requires","title":"Locally Private Learning without Interaction Requires Separation","date":"2018-09-24","arxiv_id":"1809.09165","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-time-dependent-choice","title":"Learning Time Dependent Choice","date":"2018-09-10","arxiv_id":"1809.03154","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-soft-label-propagation-on","title":"Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds","date":"2018-09-06","arxiv_id":"1809.01833","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-is-undecidable","title":"PAC-learning is Undecidable","date":"2018-08-20","arxiv_id":"1808.06324","repositories_listed":0,"syntology":null},{"url":null,"slug":"learnable-theory-vs-applications","title":"Learnable: Theory vs Applications","date":"2018-07-27","arxiv_id":"1807.10681","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-reasoning-systems-pac-and-applied-methods","title":"AI Reasoning Systems: PAC and Applied Methods","date":"2018-07-09","arxiv_id":"1807.05054","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-in-the-presence-of-evasion","title":"PAC-learning in the presence of evasion adversaries","date":"2018-06-05","arxiv_id":"1806.01471","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-pac-learning-implies-finite","title":"Private PAC learning implies finite Littlestone dimension","date":"2018-06-04","arxiv_id":"1806.00949","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-bounds-for-collaborative-pac-learning","title":"Tight Bounds for Collaborative PAC Learning via Multiplicative Weights","date":"2018-05-23","arxiv_id":"1805.09217","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-algorithms-for-collaborative-pac","title":"Improved Algorithms for Collaborative PAC Learning","date":"2018-05-22","arxiv_id":"1805.08356","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-prediction","title":"Privacy-preserving Prediction","date":"2018-03-27","arxiv_id":"1803.10266","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-lower-bounds-for-locally-differentially","title":"Tight Lower Bounds for Locally Differentially Private Selection","date":"2018-02-07","arxiv_id":"1802.02638","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-label-learning-for-large-text-corpora","title":"Multi-label Learning for Large Text Corpora using Latent Variable Model with Provable Gurantees","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-pac-learning","title":"Collaborative PAC Learning","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"markov-decision-processes-with-continuous","title":"Markov Decision Processes with Continuous Side Information","date":"2017-11-15","arxiv_id":"1711.05726","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-learning-problem-that-is-independent-of-the","title":"A learning problem that is independent of the set theory ZFC axioms","date":"2017-11-14","arxiv_id":"1711.05195","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-under-p-tampering-attacks","title":"Learning under $p$-Tampering Attacks","date":"2017-11-10","arxiv_id":"1711.03707","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-to-one-bit-compressed-sensing","title":"An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory","date":"2017-10-22","arxiv_id":"1710.07973","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-neural-networks-with-two-nonlinear","title":"Learning Neural Networks with Two Nonlinear Layers in Polynomial Time","date":"2017-09-18","arxiv_id":"1709.06010","repositories_listed":0,"syntology":null},{"url":null,"slug":"agnostic-learning-by-refuting","title":"Agnostic Learning by Refuting","date":"2017-09-12","arxiv_id":"1709.03871","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-geometric-concepts-with-nasty-noise","title":"Learning Geometric Concepts with Nasty Noise","date":"2017-07-05","arxiv_id":"1707.01242","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-efficient-learning-of-mixtures","title":"Sample-Efficient Learning of Mixtures","date":"2017-06-06","arxiv_id":"1706.01596","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-fundamental-limits-of-robust-learning","title":"On Fundamental Limits of Robust Learning","date":"2017-03-30","arxiv_id":"1703.10444","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pac-learning-from-the-crowd","title":"Efficient PAC Learning from the Crowd","date":"2017-03-21","arxiv_id":"1703.07432","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-power-of-learning-from-k-wise-queries","title":"On the Power of Learning from $k$-Wise Queries","date":"2017-02-28","arxiv_id":"1703.00066","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-step-learning-and-underlying-structure","title":"Multi-step learning and underlying structure in statistical models","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-with-distributions","title":"Predicting with Distributions","date":"2016-06-03","arxiv_id":"1606.01275","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-private-learning-of-multiple","title":"Simultaneous Private Learning of Multiple Concepts","date":"2015-11-27","arxiv_id":"1511.08552","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-collaborative-filtering-from-implicit","title":"Fast Collaborative Filtering from Implicit Feedback with Provable Guarantees","date":"2015-11-03","arxiv_id":"1511.00792","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-based-verification-and-model","title":"PAC Learning-Based Verification and Model Synthesis","date":"2015-11-03","arxiv_id":"1511.00754","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardness-of-online-sleeping-combinatorial","title":"Hardness of Online Sleeping Combinatorial Optimization Problems","date":"2015-09-11","arxiv_id":"1509.03600","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-optimal-sample-complexity-of-pac-learning","title":"The Optimal Sample Complexity of PAC Learning","date":"2015-07-02","arxiv_id":"1507.00473","repositories_listed":0,"syntology":null},{"url":null,"slug":"order-revealing-encryption-and-the-hardness","title":"Order-Revealing Encryption and the Hardness of Private Learning","date":"2015-05-03","arxiv_id":"1505.00388","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-release-and-learning","title":"Differentially Private Release and Learning of Threshold Functions","date":"2015-04-28","arxiv_id":"1504.07553","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-bounds-on-low-degree-spectral","title":"Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions","date":"2015-04-13","arxiv_id":"1504.03391","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-vc-dimension-of-similarity-hypotheses","title":"The VC-Dimension of Similarity Hypotheses Spaces","date":"2015-02-25","arxiv_id":"1502.07143","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-vc-dimension-and-the-arithmetic","title":"PAC Learning, VC Dimension, and the Arithmetic Hierarchy","date":"2014-06-04","arxiv_id":"1406.1111","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-of-k-cnf-boolean-functions","title":"Online Learning of k-CNF Boolean Functions","date":"2014-03-26","arxiv_id":"1403.6863","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-bounds-on-differentially","title":"Sample Complexity Bounds on Differentially Private Learning via Communication Complexity","date":"2014-02-25","arxiv_id":"1402.6278","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-independent-reliable-learning","title":"Distribution-Independent Reliable Learning","date":"2014-02-20","arxiv_id":"1402.5164","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-the-sample-complexity-of","title":"Characterizing the Sample Complexity of Private Learners","date":"2014-02-10","arxiv_id":"1402.2224","repositories_listed":0,"syntology":null},{"url":null,"slug":"more-data-speeds-up-training-time-in-learning","title":"More data speeds up training time in learning halfspaces over sparse vectors","date":"2013-11-10","arxiv_id":"1311.2271","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-pac-learning-and-process","title":"Predictive PAC Learning and Process Decompositions","date":"2013-09-19","arxiv_id":"1309.4859","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-bounds-on-approximation-of-submodular","title":"Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas","date":"2013-07-12","arxiv_id":"1307.3301","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-approximation-and-learning-of","title":"Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees","date":"2013-04-02","arxiv_id":"1304.0730","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-halfspaces-with-the-zero-one-loss","title":"Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-pseudo-boolean-k-dnf-and-submodular","title":"Learning pseudo-Boolean k-DNF and Submodular Functions","date":"2012-08-10","arxiv_id":"1208.2294","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-dnf-expressions-from-fourier","title":"Learning DNF Expressions from Fourier Spectrum","date":"2012-03-03","arxiv_id":"1203.0594","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-approximating-and","title":"A Unified Framework for Approximating and Clustering Data","date":"2011-06-07","arxiv_id":"1106.1379","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-complete-characterization-of-statistical","title":"A Complete Characterization of Statistical Query Learning with Applications to Evolvability","date":"2010-02-16","arxiv_id":"1002.3183","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-with-nasty-noise","title":"PAC learning with nasty noise","date":"2002-10-16","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"4572a6d300183883301b502743ed2d0c1a234857a16372d4da964fc2da276ce0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}