{"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/6","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":6,"pages_in_order":7,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/generalization-bounds/papers/7","papers":[{"url":null,"slug":"a-functional-perspective-on-learning","title":"A Functional Perspective on Learning Symmetric Functions with Neural Networks","date":"2020-08-16","arxiv_id":"2008.06952","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-localized-discrepancy-for-domain","title":"On Localized Discrepancy for Domain Adaptation","date":"2020-08-14","arxiv_id":"2008.06242","repositories_listed":0,"syntology":null},{"url":null,"slug":"tighter-generalization-bounds-for-iterative","title":"Tighter Generalization Bounds for Iterative Differentially Private Learning Algorithms","date":"2020-07-18","arxiv_id":"2007.09371","repositories_listed":0,"syntology":null},{"url":null,"slug":"functions-with-average-smoothness-structure","title":"Functions with average smoothness: structure, algorithms, and learning","date":"2020-07-13","arxiv_id":"2007.06283","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-value-generalization-bounds","title":"Predictive Value Generalization Bounds","date":"2020-07-09","arxiv_id":"2007.05073","repositories_listed":0,"syntology":null},{"url":null,"slug":"relative-deviation-margin-bounds","title":"Relative Deviation Margin Bounds","date":"2020-06-26","arxiv_id":"2006.14950","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-limitation-of-the-pac-bayes-framework","title":"A Limitation of the PAC-Bayes Framework","date":"2020-06-24","arxiv_id":"2006.13508","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-stochastic-non-convex-optimization","title":"Private Stochastic Non-Convex Optimization: Adaptive Algorithms and Tighter Generalization Bounds","date":"2020-06-24","arxiv_id":"2006.13501","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayesian-generalization-bounds-for","title":"PAC-Bayesian Generalization Bounds for MultiLayer Perceptrons","date":"2020-06-16","arxiv_id":"2006.08888","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-analysis-of-stability-and","title":"Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent","date":"2020-06-15","arxiv_id":"2006.08157","repositories_listed":0,"syntology":null},{"url":null,"slug":"learnability-with-indirect-supervision","title":"Learnability with Indirect Supervision Signals","date":"2020-06-15","arxiv_id":"2006.08791","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-of-stochastic-gradient-descent-on","title":"Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses","date":"2020-06-12","arxiv_id":"2006.06914","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovery-and-generalization-in-over-realized","title":"Recovery and Generalization in Over-Realized Dictionary Learning","date":"2020-06-11","arxiv_id":"2006.06179","repositories_listed":0,"syntology":null},{"url":null,"slug":"tangent-space-sensitivity-and-distribution-of","title":"Tangent Space Sensitivity and Distribution of Linear Regions in ReLU Networks","date":"2020-06-11","arxiv_id":"2006.06780","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-robust-is-the-median-of-means","title":"Generalization Bounds in the Presence of Outliers: a Median-of-Means Study","date":"2020-06-09","arxiv_id":"2006.05240","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-tight-margin-based-generalization-bounds","title":"Near-Tight Margin-Based Generalization Bounds for Support Vector Machines","date":"2020-06-03","arxiv_id":"2006.02175","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-via-information-density","title":"Generalization Bounds via Information Density and Conditional Information Density","date":"2020-05-16","arxiv_id":"2005.08044","repositories_listed":0,"syntology":null},{"url":null,"slug":"stopping-criterion-for-active-learning-based","title":"Stopping criterion for active learning based on deterministic generalization bounds","date":"2020-05-15","arxiv_id":"2005.07402","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-2","title":"Information-Theoretic Generalization Bounds for Meta-Learning and Applications","date":"2020-05-09","arxiv_id":"2005.04372","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-sample-complexities-for-deep-neural","title":"Improved Sample Complexities for Deep Neural Networks and Robust Classification via an All-Layer Margin","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-generalization-in-recurrent","title":"Understanding Generalization in Recurrent Neural Networks","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sharpened-generalization-bounds-based-on","title":"Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms","date":"2020-04-27","arxiv_id":"2004.12983","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploit-where-optimizer-explores-via","title":"Detached Error Feedback for Distributed SGD with Random Sparsification","date":"2020-04-11","arxiv_id":"2004.05298","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-networks-as-logical-circuits","title":"Deep Networks as Logical Circuits: Generalization and Interpretation","date":"2020-03-25","arxiv_id":"2003.11619","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-and-polynomial-regression","title":"Neural Networks and Polynomial Regression. Demystifying the Overparametrization Phenomena","date":"2020-03-23","arxiv_id":"2003.10523","repositories_listed":0,"syntology":null},{"url":null,"slug":"de-randomized-pac-bayes-margin-bounds","title":"De-randomized PAC-Bayes Margin Bounds: Applications to Non-convex and Non-smooth Predictors","date":"2020-02-23","arxiv_id":"2002.09956","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-generalization-of-bayesian-deep-nets","title":"On the generalization of bayesian deep nets for multi-class classification","date":"2020-02-23","arxiv_id":"2002.09866","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-bounds-for-moment-based-domain","title":"On generalization in moment-based domain adaptation","date":"2020-02-19","arxiv_id":"2002.08260","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fair-scoring-functions-fairness","title":"Learning Fair Scoring Functions: Bipartite Ranking under ROC-based Fairness Constraints","date":"2020-02-19","arxiv_id":"2002.08159","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-and-representational-limits-of","title":"Generalization and Representational Limits of Graph Neural Networks","date":"2020-02-14","arxiv_id":"2002.06157","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonasymptotic-analysis-of-stochastic-gradient","title":"Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization","date":"2020-02-13","arxiv_id":"2002.05465","repositories_listed":0,"syntology":null},{"url":null,"slug":"nested-barycentric-coordinate-system-as-an","title":"Nested Barycentric Coordinate System as an Explicit Feature Map","date":"2020-02-05","arxiv_id":"2002.01999","repositories_listed":0,"syntology":null},{"url":null,"slug":"apportioned-margin-approach-for-cost","title":"Apportioned Margin Approach for Cost Sensitive Large Margin Classifiers","date":"2020-02-04","arxiv_id":"2002.01408","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-and-representation","title":"Generalization Bounds and Representation Learning for Estimation of Potential Outcomes and Causal Effects","date":"2020-01-21","arxiv_id":"2001.07426","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-bounds-for-low-cost-bipartite-ranking","title":"Risk Bounds for Low Cost Bipartite Ranking","date":"2019-12-02","arxiv_id":"1912.00537","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-primal-dual-link-between-gans-and","title":"A Primal-Dual link between GANs and Autoencoders","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-gradient-boosting","title":"Regularized Gradient Boosting","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"coarse-refinement-dilemma-on-generalization","title":"Coarse-Refinement Dilemma: On Generalization Bounds for Data Clustering","date":"2019-11-13","arxiv_id":"1911.05806","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-low-rank-approximations","title":"Learning-Based Low-Rank Approximations","date":"2019-10-30","arxiv_id":"1910.13984","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":"global-capacity-measures-for-deep-relu","title":"Global Capacity Measures for Deep ReLU Networks via Path Sampling","date":"2019-10-22","arxiv_id":"1910.10245","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharper-bounds-for-uniformly-stable","title":"Sharper bounds for uniformly stable algorithms","date":"2019-10-17","arxiv_id":"1910.07833","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-generalization-bound-of-permutation","title":"Improved Generalization Bounds of Group Invariant / Equivariant Deep Networks via Quotient Feature Spaces","date":"2019-10-15","arxiv_id":"1910.06552","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-neural-networks-via","title":"Generalization Bounds for Neural Networks via Approximate Description Length","date":"2019-10-13","arxiv_id":"1910.05697","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithm-dependent-generalization-bounds-for","title":"Algorithm-Dependent Generalization Bounds for Overparameterized Deep Residual Networks","date":"2019-10-07","arxiv_id":"1910.02934","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-membership-privacy-in","title":"Characterizing Membership Privacy in Stochastic Gradient Langevin Dynamics","date":"2019-10-05","arxiv_id":"1910.02249","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rademacher-complexity-based-method-fo","title":"A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis","date":"2019-10-04","arxiv_id":"1910.03493","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-convolutional","title":"Generalization Bounds for Convolutional Neural Networks","date":"2019-10-03","arxiv_id":"1910.01487","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-differential-equation-regularization","title":"Partial differential equation regularization for supervised machine learning","date":"2019-10-03","arxiv_id":"1910.01612","repositories_listed":0,"syntology":null},{"url":null,"slug":"margin-based-generalization-lower-bounds-for","title":"Margin-Based Generalization Lower Bounds for Boosted Classifiers","date":"2019-09-27","arxiv_id":"1909.12518","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mechanism-of-implicit-regularization-in","title":"A Mechanism of Implicit Regularization in Deep Learning","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-uniform-generalization-error-bound-for","title":"A Uniform Generalization Error Bound for Generative Adversarial Networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-a-probabilistic","title":"Knowledge Graph Embedding: A Probabilistic Perspective and Generalization Bounds","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayesian-neural-network-bounds","title":"PAC-Bayesian Neural Network Bounds","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"wide-neural-networks-are-interpolating-kernel","title":"Wide Neural Networks are Interpolating Kernel Methods: Impact of Initialization on Generalization","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"better-pac-bayes-bounds-for-deep-neural","title":"Dissecting Non-Vacuous Generalization Bounds based on the Mean-Field Approximation","date":"2019-09-06","arxiv_id":"1909.03009","repositories_listed":0,"syntology":null},{"url":null,"slug":"efron-stein-pac-bayesian-inequalities","title":"Efron-Stein PAC-Bayesian Inequalities","date":"2019-09-04","arxiv_id":"1909.01931","repositories_listed":0,"syntology":null},{"url":null,"slug":"190807585","title":"Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes","date":"2019-08-20","arxiv_id":"1908.07585","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-much-data-is-sufficient-to-learn-high","title":"How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design","date":"2019-08-08","arxiv_id":"1908.02894","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-weakly-dependent-data-under","title":"Learning from weakly dependent data under Dobrushin's condition","date":"2019-06-21","arxiv_id":"1906.09247","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-regression-for-safe-exploration-in","title":"Robust Regression for Safe Exploration in Control","date":"2019-06-13","arxiv_id":"1906.05819","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoupling-gating-from-linearity-1","title":"Decoupling Gating from Linearity","date":"2019-06-12","arxiv_id":"1906.05032","repositories_listed":0,"syntology":null},{"url":"/paper/stable-rank-normalization-for-improved","slug":"stable-rank-normalization-for-improved","title":"Stable Rank Normalization for Improved Generalization in Neural Networks and GANs","date":"2019-06-11","arxiv_id":"1906.04659","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-pac-bayesian-generalization-1","title":"Deterministic PAC-Bayesian generalization bounds for deep networks via generalizing noise-resilience","date":"2019-05-30","arxiv_id":"1905.13344","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-of-stochastic-gradient","title":"Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks","date":"2019-05-30","arxiv_id":"1905.13210","repositories_listed":0,"syntology":null},{"url":null,"slug":"size-free-generalization-bounds-for","title":"Generalization bounds for deep convolutional neural networks","date":"2019-05-29","arxiv_id":"1905.12600","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-in-the-predict-then","title":"Generalization Bounds in the Predict-then-Optimize Framework","date":"2019-05-27","arxiv_id":"1905.11488","repositories_listed":0,"syntology":null},{"url":null,"slug":"refined-generalization-analysis-of-gradient","title":"Gradient Descent can Learn Less Over-parameterized Two-layer Neural Networks on Classification Problems","date":"2019-05-23","arxiv_id":"1905.09870","repositories_listed":0,"syntology":null},{"url":null,"slug":"some-limitations-of-norm-based-generalization","title":"The role of invariance in spectral complexity-based generalization bounds","date":"2019-05-23","arxiv_id":"1905.09677","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-generalization-of-graph","title":"Stability and Generalization of Graph Convolutional Neural Networks","date":"2019-05-03","arxiv_id":"1905.01004","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-breimans-dilemma-in-neural-networks","title":"ON BREIMAN’S DILEMMA IN NEURAL NETWORKS: SUCCESS AND FAILURE OF NORMALIZED MARGINS","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-tighter-generalization-bounds-for-deep","title":"On Tighter Generalization Bounds for Deep Neural Networks: CNNs, ResNets, and Beyond","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-optimization-error-of","title":"Stability and Optimization Error of Stochastic Gradient Descent for Pairwise Learning","date":"2019-04-25","arxiv_id":"1904.11316","repositories_listed":0,"syntology":null},{"url":null,"slug":"plume-polyhedral-learning-using-mixture-of","title":"PLUME: Polyhedral Learning Using Mixture of Experts","date":"2019-04-22","arxiv_id":"1904.09948","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalization-bound-for-online-variational","title":"A Generalization Bound for Online Variational Inference","date":"2019-04-08","arxiv_id":"1904.03920","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-exponential-efron-stein-inequality-for-lq","title":"An Exponential Efron-Stein Inequality for Lq Stable Learning Rules","date":"2019-03-12","arxiv_id":"1903.05457","repositories_listed":0,"syntology":null},{"url":null,"slug":"support-and-invertibility-in-domain-invariant","title":"Support and Invertibility in Domain-Invariant Representations","date":"2019-03-08","arxiv_id":"1903.03448","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-probability-generalization-bounds-for","title":"High probability generalization bounds for uniformly stable algorithms with nearly optimal rate","date":"2019-02-27","arxiv_id":"1902.10710","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-kernel-learning-from-u-statistics-of","title":"A Distributionally Robust Optimization Method for Adversarial Multiple Kernel Learning","date":"2019-02-27","arxiv_id":"1902.10365","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalization-theory-of-gradient-descent","title":"Generalization Error Bounds of Gradient Descent for Learning Over-parameterized Deep ReLU Networks","date":"2019-02-04","arxiv_id":"1902.01384","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":"generalization-bounds-for-unsupervised-and","title":"Generalization Bounds For Unsupervised and Semi-Supervised Learning With Autoencoders","date":"2019-02-04","arxiv_id":"1902.01449","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-networks-and-autoencoders-the","title":"Adversarial Networks and Autoencoders: The Primal-Dual Relationship and Generalization Bounds","date":"2019-02-03","arxiv_id":"1902.00985","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-generalization-error-bounds-of-noisy","title":"On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning","date":"2019-02-02","arxiv_id":"1902.00621","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-classification-via-minimax","title":"Supervised classification via minimax probabilistic transformations","date":"2019-02-02","arxiv_id":"1902.00693","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-analysts-in-adaptive-data-analysis","title":"Natural Analysts in Adaptive Data Analysis","date":"2019-01-30","arxiv_id":"1901.11143","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-perspective-on-machine-learning-how-to","title":"A New Perspective on Machine Learning: How to do Perfect Supervised Learning","date":"2019-01-07","arxiv_id":"1901.02046","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-uniformly-stable","title":"Generalization Bounds for Uniformly Stable Algorithms","date":"2018-12-24","arxiv_id":"1812.09859","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-finite-dimensional-coding-schemes","title":"Learning finite-dimensional coding schemes with nonlinear reconstruction maps","date":"2018-12-23","arxiv_id":"1812.09658","repositories_listed":0,"syntology":null},{"url":"/paper/adversarial-multiple-source-domain-adaptation","slug":"adversarial-multiple-source-domain-adaptation","title":"Adversarial Multiple Source Domain Adaptation","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-composite-mirror-descent-optimal","title":"Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"support-recovery-for-orthogonal-matching","title":"Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-structure-of-optimal-private-tests-for","title":"The Structure of Optimal Private Tests for Simple Hypotheses","date":"2018-11-27","arxiv_id":"1811.11148","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-vicinal-risk","title":"Generalization Bounds for Vicinal Risk Minimization Principle","date":"2018-11-11","arxiv_id":"1811.04351","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-generalization-bounds-for-robust","title":"Improved Generalization Bounds for Adversarially Robust Learning","date":"2018-10-04","arxiv_id":"1810.02180","repositories_listed":0,"syntology":null},{"url":null,"slug":"rademacher-generalization-bounds-for","title":"Rademacher Generalization Bounds for Classifier Chains","date":"2018-07-26","arxiv_id":"1807.10166","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-distance-support-matrix-machines","title":"Multi-distance Support Matrix Machines","date":"2018-07-02","arxiv_id":"1807.00451","repositories_listed":0,"syntology":null},{"url":null,"slug":"dropout-training-data-dependent","title":"Dropout Training, Data-dependent Regularization, and Generalization Bounds","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-generalization-error-of-dictionary","title":"The Generalization Error of Dictionary Learning with Moreau Envelopes","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-tighter-generalization-bound-for-deep","title":"On Tighter Generalization Bound for Deep Neural Networks: CNNs, ResNets, and Beyond","date":"2018-06-13","arxiv_id":"1806.05159","repositories_listed":0,"syntology":null}],"record_sha256":"99613c3bead7d7ae21d692f12838fba336a0990c9fff7c87ee2beb1e1cd3c6c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}