{"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/generalization-bounds/papers/7","list_of":"/task/generalization-bounds","task":"Generalization Bounds","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":7,"pages_in_order":7,"rows_per_page":100,"rows":[601,686],"of":686,"counts":{"archive_papers_tagged":686,"with_a_code_link":161,"where_syntology_ran_a_sample":55,"not_listed_spam_title":0,"listed":686,"listed_where_code_ran":55,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":45,"every_run_a_failure_of_syntologys_instrument":10,"listed_with_a_run_with_no_instrument_failure":45,"listed_every_run_a_failure_of_syntologys_instrument":10,"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/generalization-bounds","prev":"/task/generalization-bounds/papers/6","next":null,"papers":[{"url":null,"slug":"chaining-mutual-information-and-tightening","title":"Chaining Mutual Information and Tightening Generalization Bounds","date":"2018-06-11","arxiv_id":"1806.03803","repositories_listed":0,"syntology":null},{"url":null,"slug":"minnorm-training-an-algorithm-for-training","title":"Minnorm training: an algorithm for training over-parameterized deep neural networks","date":"2018-06-03","arxiv_id":"1806.00730","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-latent-variable-structured","title":"Learning latent variable structured prediction models with Gaussian perturbations","date":"2018-05-23","arxiv_id":"1805.09213","repositories_listed":0,"syntology":null},{"url":null,"slug":"vc-dimension-based-generalization-bounds-for","title":"VC-Dimension Based Generalization Bounds for Relational Learning","date":"2018-04-17","arxiv_id":"1804.06188","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-dependent-coresets-for-compressing","title":"Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Bounds","date":"2018-04-15","arxiv_id":"1804.05345","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-dependent-pac-bayes-priors-via","title":"Data-dependent PAC-Bayes priors via differential privacy","date":"2018-02-26","arxiv_id":"1802.09583","repositories_listed":0,"syntology":null},{"url":null,"slug":"stronger-generalization-bounds-for-deep-nets","title":"Stronger generalization bounds for deep nets via a compression approach","date":"2018-02-14","arxiv_id":"1802.05296","repositories_listed":0,"syntology":null},{"url":null,"slug":"to-understand-deep-learning-we-need-to","title":"To understand deep learning we need to understand kernel learning","date":"2018-02-05","arxiv_id":"1802.01396","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-hawkes-processes-online","title":"Nonparametric Hawkes Processes: Online Estimation and Generalization Bounds","date":"2018-01-25","arxiv_id":"1801.08273","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-risk-landscape-analysis-for","title":"Empirical Risk Landscape Analysis for Understanding Deep Neural Networks","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"entropy-sgd-optimizes-the-prior-of-a-pac-1","title":"Entropy-SGD optimizes the prior of a PAC-Bayes bound: Data-dependent PAC-Bayes priors via differential privacy","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lifelong-learning-by-adjusting-priors","title":"Lifelong Learning by Adjusting Priors","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"entropy-sgd-optimizes-the-prior-of-a-pac","title":"Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priors","date":"2017-12-26","arxiv_id":"1712.09376","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-well-can-generative-adversarial-networks","title":"How Well Can Generative Adversarial Networks Learn Densities: A Nonparametric View","date":"2017-12-21","arxiv_id":"1712.08244","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-discrimination-generalization-tradeoff","title":"On the Discrimination-Generalization Tradeoff in GANs","date":"2017-11-07","arxiv_id":"1711.02771","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsity-variance-and-curvature-in-multi","title":"Sparsity, variance and curvature in multi-armed bandits","date":"2017-11-03","arxiv_id":"1711.01037","repositories_listed":0,"syntology":null},{"url":null,"slug":"sgd-learns-over-parameterized-networks-that","title":"SGD Learns Over-parameterized Networks that Provably Generalize on Linearly Separable Data","date":"2017-10-27","arxiv_id":"1710.10174","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-generalization-of-learning","title":"Stability and Generalization of Learning Algorithms that Converge to Global Optima","date":"2017-10-23","arxiv_id":"1710.08402","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-the-kernelized-shapelets-theory-and","title":"Boosting the kernelized shapelets: Theory and algorithms for local features","date":"2017-09-05","arxiv_id":"1709.01300","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonlinear-kernel-support-matrix-machine-for","title":"A Nonlinear Kernel Support Matrix Machine for Matrix Learning","date":"2017-07-20","arxiv_id":"1707.06487","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-of-sgld-for-non-convex","title":"Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints","date":"2017-07-19","arxiv_id":"1707.05947","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayes-and-domain-adaptation","title":"PAC-Bayes and Domain Adaptation","date":"2017-07-17","arxiv_id":"1707.05712","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-dependent-generalization-bounds-for","title":"Data-dependent Generalization Bounds for Multi-class Classification","date":"2017-06-29","arxiv_id":"1706.09814","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-a-priori-exponential-tail-bound-for-k","title":"An a Priori Exponential Tail Bound for k-Folds Cross-Validation","date":"2017-06-19","arxiv_id":"1706.05801","repositories_listed":0,"syntology":null},{"url":null,"slug":"nuclear-discrepancy-for-active-learning","title":"Nuclear Discrepancy for Active Learning","date":"2017-06-08","arxiv_id":"1706.02645","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-partial-correction","title":"Learning from partial correction","date":"2017-05-23","arxiv_id":"1705.08076","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearest-neighbor-sample-compression","title":"Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions","date":"2017-05-23","arxiv_id":"1705.08184","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-statistical-learning-with-wasserstein","title":"Minimax Statistical Learning with Wasserstein Distances","date":"2017-05-22","arxiv_id":"1705.07815","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-landscape-of-deep-learning-algorithms","title":"The Landscape of Deep Learning Algorithms","date":"2017-05-19","arxiv_id":"1705.07038","repositories_listed":0,"syntology":null},{"url":null,"slug":"mass-volume-curves-and-anomaly-ranking","title":"Mass Volume Curves and Anomaly Ranking","date":"2017-05-03","arxiv_id":"1705.01305","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-benefits-of-output-sparsity-for-multi","title":"On the benefits of output sparsity for multi-label classification","date":"2017-03-14","arxiv_id":"1703.04697","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-of-output-side-unsupervised-domain","title":"A Theory of Output-Side Unsupervised Domain Adaptation","date":"2017-03-05","arxiv_id":"1703.01606","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-dependent-stability-of-stochastic","title":"Data-Dependent Stability of Stochastic Gradient Descent","date":"2017-03-05","arxiv_id":"1703.01678","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-kernels-with-random-features","title":"Learning Kernels with Random Features","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-weighted-automata","title":"Generalization Bounds for Weighted Automata","date":"2016-10-25","arxiv_id":"1610.07883","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-ridge-regression-via-partitioning","title":"Kernel Ridge Regression via Partitioning","date":"2016-08-05","arxiv_id":"1608.01976","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-dependent-concentration","title":"Distribution-dependent concentration inequalities for tighter generalization bounds","date":"2016-07-19","arxiv_id":"1607.05506","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-and-lifelong-learning-of-kernels","title":"Multi-task and Lifelong Learning of Kernels","date":"2016-02-21","arxiv_id":"1602.06531","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-structured-weighted-violations-perceptron","title":"The Structured Weighted Violations Perceptron Algorithm","date":"2016-02-09","arxiv_id":"1602.03040","repositories_listed":0,"syntology":null},{"url":null,"slug":"loss-factorization-weakly-supervised-learning","title":"Loss factorization, weakly supervised learning and label noise robustness","date":"2016-02-08","arxiv_id":"1602.02450","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-dependent-generalization","title":"Dimensionality-Dependent Generalization Bounds for $k$-Dimensional Coding Schemes","date":"2016-01-03","arxiv_id":"1601.00238","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundations-of-coupled-nonlinear","title":"Foundations of Coupled Nonlinear Dimensionality Reduction","date":"2015-09-29","arxiv_id":"1509.08880","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-the-classification-of-low","title":"A study of the classification of low-dimensional data with supervised manifold learning","date":"2015-07-21","arxiv_id":"1507.05880","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-class-svms-from-tighter-data-dependent","title":"Multi-class SVMs: From Tighter Data-Dependent Generalization Bounds to Novel Algorithms","date":"2015-06-14","arxiv_id":"1506.04359","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-accuracy-of-self-normalized-log-linear","title":"On the accuracy of self-normalized log-linear models","date":"2015-06-12","arxiv_id":"1506.04147","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-maxout-features","title":"Random Maxout Features","date":"2015-06-11","arxiv_id":"1506.03705","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-and-why-are-log-linear-models-self","title":"When and why are log-linear models self-normalizing?","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"almost-no-label-no-cry","title":"(Almost) No Label No Cry","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"task-group-relatedness-and-generalization","title":"Task-group Relatedness and Generalization Bounds for Regularized Multi-task Learning","date":"2014-08-28","arxiv_id":"1408.6617","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-matrix-valued-kernel-learning-for","title":"Scalable Matrix-valued Kernel Learning for High-dimensional Nonlinear Multivariate Regression and Granger Causality","date":"2014-08-09","arxiv_id":"1408.2066","repositories_listed":0,"syntology":null},{"url":null,"slug":"perceptron-like-algorithms-and-generalization","title":"Perceptron-like Algorithms and Generalization Bounds for Learning to Rank","date":"2014-05-03","arxiv_id":"1405.0591","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-margin-multiclass-nearest-neighbors","title":"Maximum Margin Multiclass Nearest Neighbors","date":"2014-01-30","arxiv_id":"1401.7898","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-representative","title":"Generalization Bounds for Representative Domain Adaptation","date":"2014-01-02","arxiv_id":"1401.0376","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-of-dictionary-learning-and","title":"Sample Complexity of Dictionary Learning and other Matrix Factorizations","date":"2013-12-13","arxiv_id":"1312.3790","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-classification-hypothesis-space","title":"Multi-Task Classification Hypothesis Space with Improved Generalization Bounds","date":"2013-12-09","arxiv_id":"1312.2606","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-multiple-models-via-regularized","title":"Learning Multiple Models via Regularized Weighting","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relative-deviation-learning-bounds-and","title":"Relative Deviation Learning Bounds and Generalization with Unbounded Loss Functions","date":"2013-10-22","arxiv_id":"1310.5796","repositories_listed":0,"syntology":null},{"url":null,"slug":"bennett-type-generalization-bounds-large","title":"Bennett-type Generalization Bounds: Large-deviation Case and Faster Rate of Convergence","date":"2013-09-26","arxiv_id":"1309.6876","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-metric-learning-with","title":"Supervised Metric Learning with Generalization Guarantees","date":"2013-07-17","arxiv_id":"1307.4514","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pac-bayesian-tutorial-with-a-dropout-bound","title":"A PAC-Bayesian Tutorial with A Dropout Bound","date":"2013-07-08","arxiv_id":"1307.2118","repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-classification-via-regularized","title":"Guaranteed Classification via Regularized Similarity Learning","date":"2013-06-13","arxiv_id":"1306.3108","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":"boosting-with-the-logistic-loss-is-consistent","title":"Boosting with the Logistic Loss is Consistent","date":"2013-05-13","arxiv_id":"1305.2648","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-generalization-ability-of-online-1","title":"On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions","date":"2013-05-11","arxiv_id":"1305.2505","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-domain-adaptation","title":"Generalization Bounds for Domain Adaptation","date":"2013-04-04","arxiv_id":"1304.1574","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-generalization-bounds-for","title":"Graph-based Generalization Bounds for Learning Binary Relations","date":"2013-02-21","arxiv_id":"1302.5348","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-metric-dimensionality-reduction","title":"Adaptive Metric Dimensionality Reduction","date":"2013-02-12","arxiv_id":"1302.2752","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":"confusion-based-online-learning-and-a-passive","title":"Confusion-Based Online Learning and a Passive-Aggressive Scheme","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-multiple-tasks-using-shared","title":"Learning Multiple Tasks using Shared Hypotheses","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-and-generalization-for-metric","title":"Robustness and Generalization for Metric Learning","date":"2012-09-05","arxiv_id":"1209.1086","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-learning-kernels-based-on","title":"Algorithms for Learning Kernels Based on Centered Alignment","date":"2012-03-02","arxiv_id":"1203.0550","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-and-consistency-for","title":"Generalization Bounds and Consistency for Latent Structural Probit and Ramp Loss","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-margin-multi-label-structured","title":"Maximum Margin Multi-Label Structured Prediction","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-parametric-group-orthogonal-matching","title":"Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-unlabeled-patterns-in","title":"The Impact of Unlabeled Patterns in Rademacher Complexity Theory for Kernel Classifiers","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-combining-machine-learning-with-decision","title":"On Combining Machine Learning with Decision Making","date":"2011-04-27","arxiv_id":"1104.5061","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":"co-regularization-based-semi-supervised","title":"Co-regularization Based Semi-supervised Domain Adaptation","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-learning-with-adversarially","title":"Semi-Supervised Learning with Adversarially Missing Label Information","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sufficient-conditions-for-generating-group","title":"Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"two-layer-generalization-analysis-for-ranking","title":"Two-Layer Generalization Analysis for Ranking Using Rademacher Average","date":"2010-12-01","arxiv_id":null,"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":"domain-adaptation-learning-bounds-and","title":"Domain Adaptation: Learning Bounds and Algorithms","date":"2009-02-19","arxiv_id":"0902.3430","repositories_listed":0,"syntology":null},{"url":null,"slug":"rademacher-complexity-bounds-for-non-iid","title":"Rademacher Complexity Bounds for Non-I.I.D. Processes","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":"e7090fb6842262e4b12b43ff98dcc7c7d68885604bc0d224ca71c8006f97af81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}