{"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/2","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":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"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","next":"/task/pac-learning/papers/3","papers":[{"url":null,"slug":"the-sample-complexity-of-multi-distribution","title":"The Sample Complexity of Multi-Distribution Learning for VC Classes","date":"2023-07-22","arxiv_id":"2307.12135","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-learners-for-realizable-regression","title":"Optimal Learners for Realizable Regression: PAC Learning and Online Learning","date":"2023-07-07","arxiv_id":"2307.03848","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-boosting-simple-and-intuitive-weak","title":"Multiclass Boosting: Simple and Intuitive Weak Learning Criteria","date":"2023-07-02","arxiv_id":"2307.00642","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-computation-tradeoffs-for","title":"Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise","date":"2023-06-28","arxiv_id":"2306.16352","repositories_listed":0,"syntology":null},{"url":null,"slug":"learnability-with-pac-semantics-for-multi","title":"Learnability with PAC Semantics for Multi-agent Beliefs","date":"2023-06-08","arxiv_id":"2306.05490","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-role-of-entanglement-and-statistics-in","title":"On the Role of Entanglement and Statistics in Learning","date":"2023-06-05","arxiv_id":"2306.03161","repositories_listed":0,"syntology":null},{"url":null,"slug":"agnostic-multi-group-active-learning","title":"Agnostic Multi-Group Active Learning","date":"2023-06-02","arxiv_id":"2306.01922","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute-efficient-pac-learning-of-low","title":"Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise","date":"2023-06-01","arxiv_id":"2306.00673","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-role-of-noise-in-the-sample-complexity","title":"On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences","date":"2023-05-28","arxiv_id":"2305.18423","repositories_listed":0,"syntology":null},{"url":null,"slug":"policy-synthesis-and-reinforcement-learning","title":"Policy Synthesis and Reinforcement Learning for Discounted LTL","date":"2023-05-26","arxiv_id":"2305.17115","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parameterized-theory-of-pac-learning","title":"A Parameterized Theory of PAC Learning","date":"2023-04-27","arxiv_id":"2304.14058","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-pac-learning","title":"Probably Approximately Correct Federated Learning","date":"2023-04-10","arxiv_id":"2304.04641","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-and-disambiguations-of","title":"Online Learning and Disambiguations of Partial Concept Classes","date":"2023-03-30","arxiv_id":"2303.17578","repositories_listed":0,"syntology":null},{"url":null,"slug":"lifting-uniform-learners-via-distributional","title":"Lifting uniform learners via distributional decomposition","date":"2023-03-27","arxiv_id":"2303.16208","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-is-stable-connections-between","title":"Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization","date":"2023-03-22","arxiv_id":"2303.12921","repositories_listed":0,"syntology":null},{"url":null,"slug":"agnostic-pac-learning-of-k-juntas-using-l2","title":"Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression","date":"2023-03-08","arxiv_id":"2303.04859","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-pac-learning-in-hilbert","title":"On the complexity of PAC learning in Hilbert spaces","date":"2023-03-03","arxiv_id":"2303.02047","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-pac-learners-learn-the-marginal","title":"Do PAC-Learners Learn the Marginal Distribution?","date":"2023-02-13","arxiv_id":"2302.06285","repositories_listed":0,"syntology":null},{"url":null,"slug":"tree-learning-optimal-algorithms-and-sample","title":"Tree Learning: Optimal Algorithms and Sample Complexity","date":"2023-02-09","arxiv_id":"2302.04492","repositories_listed":0,"syntology":null},{"url":null,"slug":"find-a-witness-or-shatter-the-landscape-of","title":"Find a witness or shatter: the landscape of computable PAC learning","date":"2023-02-06","arxiv_id":"2302.04731","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-and-stabilizing-hedonic-games","title":"PAC learning and stabilizing Hedonic Games: towards a unifying approach","date":"2023-01-31","arxiv_id":"2301.13756","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-lower-bounds-for-quantum-learning-via","title":"Optimal lower bounds for Quantum Learning via Information Theory","date":"2023-01-05","arxiv_id":"2301.02227","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-strongly-polynomial-algorithm-for-1","title":"A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning","date":"2022-12-06","arxiv_id":"2212.03008","repositories_listed":0,"syntology":null},{"url":null,"slug":"bagging-is-an-optimal-pac-learner","title":"Bagging is an Optimal PAC Learner","date":"2022-12-05","arxiv_id":"2212.02264","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-verification-of-statistical-algorithms","title":"PAC Verification of Statistical Algorithms","date":"2022-11-28","arxiv_id":"2211.17096","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-learning-a-sample-complexity","title":"Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes","date":"2022-11-16","arxiv_id":"2211.09101","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistically-robust-pac-learning","title":"On Proper Learnability between Average- and Worst-case Robustness","date":"2022-11-10","arxiv_id":"2211.05656","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-characterization-of-list-learnability","title":"A Characterization of List Learnability","date":"2022-11-07","arxiv_id":"2211.04956","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-out-of-distribution-detection-learnable","title":"Is Out-of-Distribution Detection Learnable?","date":"2022-10-26","arxiv_id":"2210.14707","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-versus-refutation-in-noninteractive","title":"Learning versus Refutation in Noninteractive Local Differential Privacy","date":"2022-10-26","arxiv_id":"2210.15439","repositories_listed":0,"syntology":null},{"url":null,"slug":"sq-lower-bounds-for-learning-single-neurons","title":"SQ Lower Bounds for Learning Single Neurons with Massart Noise","date":"2022-10-18","arxiv_id":"2210.09949","repositories_listed":0,"syntology":null},{"url":null,"slug":"superpolynomial-lower-bounds-for-decision","title":"Superpolynomial Lower Bounds for Decision Tree Learning and Testing","date":"2022-10-12","arxiv_id":"2210.06375","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-algorithms-for-rl-with-decision","title":"Unified Algorithms for RL with Decision-Estimation Coefficients: PAC, Reward-Free, Preference-Based Learning, and Beyond","date":"2022-09-23","arxiv_id":"2209.11745","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-robustness-of-angluin-s-l-algorithm","title":"Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise","date":"2022-09-21","arxiv_id":"2209.10315","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-pac-learning-halfspaces-in-non-interactive","title":"On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data","date":"2022-09-17","arxiv_id":"2209.08319","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-distribution-dependent-learning","title":"Fine-Grained Distribution-Dependent Learning Curves","date":"2022-08-31","arxiv_id":"2208.14615","repositories_listed":0,"syntology":null},{"url":null,"slug":"cryptographic-hardness-of-learning-halfspaces","title":"Cryptographic Hardness of Learning Halfspaces with Massart Noise","date":"2022-07-28","arxiv_id":"2207.14266","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-data-driven","title":"Generalization Bounds for Data-Driven Numerical Linear Algebra","date":"2022-06-16","arxiv_id":"2206.07886","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-generalisation-via-invariant","title":"PAC Generalization via Invariant Representations","date":"2022-05-30","arxiv_id":"2205.15196","repositories_listed":0,"syntology":null},{"url":null,"slug":"bezier-flow-a-surface-wise-gradient-descent","title":"Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization","date":"2022-05-23","arxiv_id":"2205.11099","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-bounds-for-robustly","title":"Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks","date":"2022-05-12","arxiv_id":"2205.06127","repositories_listed":0,"syntology":null},{"url":null,"slug":"clifford-circuits-can-be-properly-pac-learned","title":"Clifford Circuits can be Properly PAC Learned if and only if $\\textsf{RP}=\\textsf{NP}$","date":"2022-04-13","arxiv_id":"2204.06638","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-based-non-intrusive-model","title":"Active-learning-based non-intrusive Model Order Reduction","date":"2022-04-08","arxiv_id":"2204.08523","repositories_listed":0,"syntology":null},{"url":null,"slug":"metric-entropy-duality-and-the-sample","title":"Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability","date":"2022-03-09","arxiv_id":"2203.04536","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-characterization-of-multiclass-learnability","title":"A Characterization of Multiclass Learnability","date":"2022-03-03","arxiv_id":"2203.01550","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarially-robust-learning-with-tolerance","title":"Adversarially Robust Learning with Tolerance","date":"2022-03-02","arxiv_id":"2203.00849","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learning-and-enforcing-latent-assessment","title":"On Learning and Enforcing Latent Assessment Models using Binary Feedback from Human Auditors Regarding Black-Box Classifiers","date":"2022-02-16","arxiv_id":"2202.08250","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-characterization-of-semi-supervised","title":"A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability","date":"2022-02-11","arxiv_id":"2202.05420","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardness-of-noise-free-learning-for-two","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","date":"2022-02-10","arxiv_id":"2202.05258","repositories_listed":0,"syntology":null},{"url":null,"slug":"monotone-learning","title":"Monotone Learning","date":"2022-02-10","arxiv_id":"2202.05246","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-learning-one-hidden-layer-relu","title":"Efficiently Learning One Hidden Layer ReLU Networks From Queries","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-separation-between-two-learning","title":"Exponential Separation between Two Learning Models and Adversarial Robustness","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-computable-learning-of-continuous-features","title":"On computable learning of continuous features","date":"2021-11-24","arxiv_id":"2111.14630","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-uniform-ergodic-communicative","title":"PAC-Learning Uniform Ergodic Communicative Networks","date":"2021-11-21","arxiv_id":"2111.10708","repositories_listed":0,"syntology":null},{"url":null,"slug":"realizable-learning-is-all-you-need","title":"Realizable Learning is All You Need","date":"2021-11-08","arxiv_id":"2111.04746","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-for-contextual-search-with","title":"Active Learning for Contextual Search with Binary Feedbacks","date":"2021-10-03","arxiv_id":"2110.01072","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-theory-of-out-of-distribution","title":"Towards a theory of out-of-distribution learning","date":"2021-09-29","arxiv_id":"2109.14501","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-hypotheses-space-from-data","title":"Learning the hypotheses space from data through a U-curve algorithm","date":"2021-09-08","arxiv_id":"2109.03866","repositories_listed":0,"syntology":null},{"url":null,"slug":"threshold-phenomena-in-learning-halfspaces","title":"Learning General Halfspaces with General Massart Noise under the Gaussian Distribution","date":"2021-08-19","arxiv_id":"2108.08767","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-compute-approximate-nash","title":"Is Nash Equilibrium Approximator Learnable?","date":"2021-08-17","arxiv_id":"2108.07472","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistically-near-optimal-hypothesis","title":"Statistically Near-Optimal Hypothesis Selection","date":"2021-08-17","arxiv_id":"2108.07880","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-power-of-differentiable-learning","title":"On the Power of Differentiable Learning versus PAC and SQ Learning","date":"2021-08-09","arxiv_id":"2108.04190","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-versus-binary-differentially","title":"Multiclass versus Binary Differentially Private PAC Learning","date":"2021-07-22","arxiv_id":"2107.10870","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-of-pac-learnability-of-partial","title":"A Theory of PAC Learnability of Partial Concept Classes","date":"2021-07-18","arxiv_id":"2107.08444","repositories_listed":0,"syntology":null},{"url":null,"slug":"forster-decomposition-and-learning-halfspaces","title":"Forster Decomposition and Learning Halfspaces with Noise","date":"2021-07-12","arxiv_id":"2107.05582","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-verified-learning-from-the-crowd-with","title":"Semi-verified PAC Learning from the Crowd","date":"2021-06-13","arxiv_id":"2106.07080","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervising-the-transfer-of-reasoning","title":"Supervising the Transfer of Reasoning Patterns in VQA","date":"2021-06-10","arxiv_id":"2106.05597","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-group-agnostic-pac-learnability","title":"Multi-group Agnostic PAC Learnability","date":"2021-05-20","arxiv_id":"2105.09989","repositories_listed":0,"syntology":null},{"url":null,"slug":"incentive-aware-pac-learning","title":"Incentive-aware PAC learning","date":"2021-05-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-and-certification-under-instance","title":"Learning and Certification under Instance-targeted Poisoning","date":"2021-05-18","arxiv_id":"2105.08709","repositories_listed":0,"syntology":null},{"url":null,"slug":"broadly-applicable-targeted-data-sample","title":"Broadly Applicable Targeted Data Sample Omission Attacks","date":"2021-05-04","arxiv_id":"2105.01560","repositories_listed":0,"syntology":null},{"url":null,"slug":"symbolic-abstractions-from-data-a-pac","title":"Symbolic Abstractions From Data: A PAC Learning Approach","date":"2021-04-28","arxiv_id":"2104.13901","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-gains-of-turing-machines-over","title":"PAC-learning gains of Turing machines over circuits and neural networks","date":"2021-03-23","arxiv_id":"2103.12686","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-learning-under-clean-label-attack","title":"Robust learning under clean-label attack","date":"2021-03-01","arxiv_id":"2103.00671","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-learning-implies-quantum-stability","title":"Private learning implies quantum stability","date":"2021-02-14","arxiv_id":"2102.07171","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-learning-from-corrupted-data","title":"Fairness-Aware PAC Learning from Corrupted Data","date":"2021-02-11","arxiv_id":"2102.06004","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-agnostic-pac-learning-using-mathcal-l-2","title":"On Agnostic PAC Learning using $\\mathcal{L}_2$-polynomial Regression and Fourier-based Algorithms","date":"2021-02-11","arxiv_id":"2102.06277","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-optimal-pac-learning-of-halfspaces","title":"Sample-Optimal PAC Learning of Halfspaces with Malicious Noise","date":"2021-02-11","arxiv_id":"2102.06247","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-what-fools-you-makes","title":"Adversarial Robustness: What fools you makes you stronger","date":"2021-02-10","arxiv_id":"2102.05475","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-hardness-of-pac-learning-stabilizer","title":"On the Hardness of PAC-learning Stabilizer States with Noise","date":"2021-02-09","arxiv_id":"2102.05174","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-laws-of-large-numbers-and-optimal","title":"Adversarial Laws of Large Numbers and Optimal Regret in Online Classification","date":"2021-01-22","arxiv_id":"2101.09054","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-local-pseudorandom-generators-to","title":"From Local Pseudorandom Generators to Hardness of Learning","date":"2021-01-20","arxiv_id":"2101.08303","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-price-is-probably-right-learning-market","title":"The Price is (Probably) Right: Learning Market Equilibria from Samples","date":"2020-12-29","arxiv_id":"2012.14838","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-aware-collaborative-learning","title":"Communication-Aware Collaborative Learning","date":"2020-12-19","arxiv_id":"2012.10569","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardness-of-learning-halfspaces-with-massart","title":"Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise","date":"2020-12-17","arxiv_id":"2012.09720","repositories_listed":0,"syntology":null},{"url":null,"slug":"small-covers-for-near-zero-sets-of","title":"Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models","date":"2020-12-14","arxiv_id":"2012.07774","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-efficient-proper-pac-learning-with","title":"Sample-efficient proper PAC learning with approximate differential privacy","date":"2020-12-07","arxiv_id":"2012.03893","repositories_listed":0,"syntology":null},{"url":null,"slug":"vc-dimension-and-distribution-free-sample","title":"VC Dimension and Distribution-Free Sample-Based Testing","date":"2020-12-07","arxiv_id":"2012.03923","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-for-strategic-classification","title":"PAC-Learning for Strategic Classification","date":"2020-12-06","arxiv_id":"2012.03310","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-combinatorial-characterization-of-1","title":"Towards a Combinatorial Characterization of Bounded-Memory Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-halfspaces-with-pairwise-comparisons","title":"Efficient PAC Learning from the Crowd with Pairwise Comparisons","date":"2020-11-02","arxiv_id":"2011.01104","repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-adversarially-robust-learning-to-non","title":"Reducing Adversarially Robust Learning to Non-Robust PAC Learning","date":"2020-10-22","arxiv_id":"2010.12039","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-compression-and-leakage-minimizing","title":"Learning, compression, and leakage: Minimising classification error via meta-universal compression principles","date":"2020-10-14","arxiv_id":"2010.07382","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-polynomial-time-algorithm-for-learning-1","title":"A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise","date":"2020-10-04","arxiv_id":"2010.01705","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-mixtures-of-private-and-public","title":"Learning from Mixtures of Private and Public Populations","date":"2020-08-01","arxiv_id":"2008.00331","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-computational-separation-between-private","title":"A Computational Separation between Private Learning and Online Learning","date":"2020-07-11","arxiv_id":"2007.05665","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-and-sq-lower-bounds-for-pac","title":"Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks","date":"2020-06-22","arxiv_id":"2006.12476","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-elimination-algorithm-for-learning","title":"An Optimal Elimination Algorithm for Learning a Best Arm","date":"2020-06-20","arxiv_id":"2006.11647","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-halfspaces-with-tsybakov-noise","title":"Learning Halfspaces with Tsybakov Noise","date":"2020-06-11","arxiv_id":"2006.06467","repositories_listed":0,"syntology":null},{"url":null,"slug":"list-learning-with-attribute-noise","title":"List Learning with Attribute Noise","date":"2020-06-11","arxiv_id":"2006.06850","repositories_listed":0,"syntology":null}],"record_sha256":"097c3e27e813e72f9d9c4b6038261f69ff39711ea954057f416847b3f0601146","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}