{"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/learning-theory/papers/9","list_of":"/task/learning-theory","task":"Learning Theory","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":9,"pages_in_order":9,"rows_per_page":100,"rows":[801,852],"of":852,"counts":{"archive_papers_tagged":852,"with_a_code_link":140,"where_syntology_ran_a_sample":44,"not_listed_spam_title":0,"listed":852,"listed_where_code_ran":44,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":37,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":37,"listed_every_run_a_failure_of_syntologys_instrument":7,"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/learning-theory","prev":"/task/learning-theory/papers/8","next":null,"papers":[{"url":null,"slug":"fast-rates-in-statistical-and-online-learning","title":"Fast rates in statistical and online learning","date":"2015-07-09","arxiv_id":"1507.02592","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-large-margin-structured-learning","title":"Scalable Large-Margin Structured Learning: Theory and Algorithms","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"what-can-ecosystems-learn-expanding","title":"What can ecosystems learn? Expanding evolutionary ecology with learning theory","date":"2015-06-21","arxiv_id":"1506.06374","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nearly-optimal-and-agnostic-algorithm-for","title":"A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k","date":"2015-06-03","arxiv_id":"1506.01367","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-of-formal-synthesis-via-inductive","title":"A Theory of Formal Synthesis via Inductive Learning","date":"2015-05-15","arxiv_id":"1505.03953","repositories_listed":0,"syntology":null},{"url":null,"slug":"permutational-rademacher-complexity-a-new","title":"Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning","date":"2015-05-12","arxiv_id":"1505.02910","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-and-continuous-representations","title":"Deep Learning and Continuous Representations for Natural Language Processing","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-bounds-for-the-majority-vote-from-a-pac","title":"Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm","date":"2015-03-28","arxiv_id":"1503.08329","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-sparse-bayesian-learning-theory","title":"Hierarchical sparse Bayesian learning: theory and application for inferring structural damage from incomplete modal data","date":"2015-03-21","arxiv_id":"1503.06267","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bennett-inequality-for-the-missing-mass","title":"A Bennett Inequality for the Missing Mass","date":"2015-03-20","arxiv_id":"1503.06134","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-of-linear-separators-under","title":"Efficient Learning of Linear Separators under Bounded Noise","date":"2015-03-12","arxiv_id":"1503.03594","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-bernstein-like-concentration","title":"Novel Bernstein-like Concentration Inequalities for the Missing Mass","date":"2015-03-10","arxiv_id":"1503.02768","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixtures-of-gaussians-in-high","title":"Learning Mixtures of Gaussians in High Dimensions","date":"2015-03-02","arxiv_id":"1503.00424","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-aggregation-for-heavy-tailed-classes","title":"On aggregation for heavy-tailed classes","date":"2015-02-25","arxiv_id":"1502.07097","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learning-k-parities-with-and-without-noise","title":"On learning k-parities with and without noise","date":"2015-02-18","arxiv_id":"1502.05375","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-learnability-of-unknown-quantum","title":"The Learnability of Unknown Quantum Measurements","date":"2015-01-03","arxiv_id":"1501.00559","repositories_listed":0,"syntology":null},{"url":null,"slug":"localized-complexities-for-transductive","title":"Localized Complexities for Transductive Learning","date":"2014-11-26","arxiv_id":"1411.7200","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-circuits-with-few-negations","title":"Learning circuits with few negations","date":"2014-10-30","arxiv_id":"1410.8420","repositories_listed":0,"syntology":null},{"url":null,"slug":"computabilities-of-validity-and","title":"Computabilities of Validity and Satisfiability in Probability Logics over Finite and Countable Models","date":"2014-10-12","arxiv_id":"1410.3059","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-model-selection-and-optimization","title":"Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning","date":"2014-06-15","arxiv_id":"1406.3816","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-fisher-kernels-end-to-end-learning-of","title":"Deep Fisher Kernels - End to End Learning of the Fisher Kernel GMM Parameters","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-return-maximization-for","title":"Structural Return Maximization for Reinforcement Learning","date":"2014-05-12","arxiv_id":"1405.2606","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mathematical-theory-of-learning","title":"A Mathematical Theory of Learning","date":"2014-05-07","arxiv_id":"1405.1513","repositories_listed":0,"syntology":null},{"url":null,"slug":"corpus-based-computation-of-reverse","title":"Corpus-Based Computation of Reverse Associations","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-image-segmentations-by-potts-prior","title":"Bayesian image segmentations by Potts prior and loopy belief propagation","date":"2014-04-11","arxiv_id":"1404.3012","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-deviation-bounds-for-mixture-of","title":"Novel Deviation Bounds for Mixture of Independent Bernoulli Variables with Application to the Missing Mass","date":"2014-02-25","arxiv_id":"1402.6262","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-excess-risk-for-smooth-convex","title":"Binary Excess Risk for Smooth Convex Surrogates","date":"2014-02-07","arxiv_id":"1402.1792","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-sampled-learning-theory-on","title":"Two-stage Sampled Learning Theory on Distributions","date":"2014-02-07","arxiv_id":"1402.1754","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounding-embeddings-of-vc-classes-into","title":"Bounding Embeddings of VC Classes into Maximum Classes","date":"2014-01-29","arxiv_id":"1401.7388","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sampling-and-learning-framework-a","title":"The Sampling-and-Learning Framework: A Statistical View of Evolutionary Algorithms","date":"2014-01-24","arxiv_id":"1401.6333","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-rates-of-lq-coefficient","title":"Learning rates of $l^q$ coefficient regularization learning with Gaussian kernel","date":"2013-12-19","arxiv_id":"1312.5465","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolution-and-computational-learning-theory-a","title":"Evolution and Computational Learning Theory: A survey on Valiant's paper","date":"2013-12-17","arxiv_id":"1312.4599","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mapreduce-based-distributed-svm-algorithm","title":"A MapReduce based distributed SVM algorithm for binary classification","date":"2013-12-15","arxiv_id":"1312.4108","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-approach-to-universal-prediction","title":"A Unified Approach to Universal Prediction: Generalized Upper and Lower Bounds","date":"2013-11-25","arxiv_id":"1311.6396","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-average-case-complexity-to-improper","title":"From average case complexity to improper learning complexity","date":"2013-11-10","arxiv_id":"1311.2272","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-and-algorithms-for-revenue","title":"Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reserve","date":"2013-10-21","arxiv_id":"1310.5665","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-statistical-learning-based-system-for-fake","title":"A Statistical Learning Based System for Fake Website Detection","date":"2013-09-27","arxiv_id":"1309.7958","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-statistical-learning-theory-framework-for","title":"A Statistical Learning Theory Framework for Supervised Pattern Discovery","date":"2013-07-02","arxiv_id":"1307.0802","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-lower-bound-on-the-probability-of-a","title":"Tight Lower Bound on the Probability of a Binomial Exceeding its Expectation","date":"2013-06-06","arxiv_id":"1306.1433","repositories_listed":0,"syntology":null},{"url":null,"slug":"passive-learning-with-target-risk","title":"Passive Learning with Target Risk","date":"2013-02-08","arxiv_id":"1302.2157","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-the-true-frequent-itemsets","title":"Finding the True Frequent Itemsets","date":"2013-01-07","arxiv_id":"1301.1218","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-probability-measures-with-respect-to","title":"Learning Probability Measures with respect to Optimal Transport Metrics","date":"2012-12-01","arxiv_id":null,"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-reinforcement-learning-theory-for","title":"A Reinforcement Learning Theory for Homeostatic Regulation","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-stochastic-constrained-and","title":"Online Learning: Stochastic, Constrained, and Smoothed Adversaries","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-experiment-towards-the-learning","title":"Survey & Experiment: Towards the Learning Accuracy","date":"2010-12-18","arxiv_id":"1012.4051","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-random-averages-combinatorial","title":"Online Learning: Random Averages, Combinatorial Parameters, and Learnability","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-via-sequential-complexities","title":"Online Learning via Sequential Complexities","date":"2010-06-06","arxiv_id":"1006.1138","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-rademacher-complexity","title":"Human Rademacher Complexity","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"potential-based-agnostic-boosting","title":"Potential-Based Agnostic Boosting","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"human-active-learning","title":"Human Active Learning","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-bounds-for-non-iid-processes","title":"Stability Bounds for Non-i.i.d. Processes","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"a0aa0b0dc03aded5c74ae694d04f36d5c48eef18cfe79657703748f699166fff","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}