{"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/5","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":5,"pages_in_order":7,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/generalization-bounds/papers/6","papers":[{"url":null,"slug":"efficient-and-reliable-overlay-networks-for","title":"Efficient and Reliable Overlay Networks for Decentralized Federated Learning","date":"2021-12-12","arxiv_id":"2112.15486","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-error-bounds-for-iterative","title":"Generalization Error Bounds for Iterative Recovery Algorithms Unfolded as Neural Networks","date":"2021-12-08","arxiv_id":"2112.04364","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-graph-embedding","title":"Generalization Bounds for Graph Embedding Using Negative Sampling: Linear vs Hyperbolic","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-wasserstein-robust","title":"Generalization Bounds for (Wasserstein) Robust Optimization","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-guarantee-of-sgd-for-pairwise","title":"Generalization Guarantee of SGD for Pairwise Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-stochastic-and-online-gradient-descent","title":"Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-sharper-generalization-bounds-for","title":"Towards Sharper Generalization Bounds for Structured Prediction","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-predicting-generalization-using-gans-1","title":"On Predicting Generalization using GANs","date":"2021-11-28","arxiv_id":"2111.14212","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-independent-generalization-bounds-for-1","title":"Time-independent Generalization Bounds for SGLD in Non-convex Settings","date":"2021-11-25","arxiv_id":"2111.12876","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-provably-robust-motion-planners","title":"Learning Provably Robust Motion Planners Using Funnel Libraries","date":"2021-11-16","arxiv_id":"2111.08733","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-unified-information-theoretic","title":"Towards a Unified Information-Theoretic Framework for Generalization","date":"2021-11-09","arxiv_id":"2111.05275","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-on-random-balls-is-sufficient-for","title":"Learning on Random Balls is Sufficient for Estimating (Some) Graph Parameters","date":"2021-11-05","arxiv_id":"2111.03317","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-aggregations-of-binary-activated","title":"PAC-Bayesian Learning of Aggregated Binary Activated Neural Networks with Probabilities over Representations","date":"2021-10-28","arxiv_id":"2110.15137","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-information-theoretical","title":"Optimizing Information-theoretical Generalization Bounds via Anisotropic Noise in SGLD","date":"2021-10-26","arxiv_id":"2110.13750","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrated-conditional-estimation","title":"Integrated Conditional Estimation-Optimization","date":"2021-10-24","arxiv_id":"2110.12351","repositories_listed":0,"syntology":null},{"url":null,"slug":"tsmobn-interventional-generalization-for-1","title":"UniFed: A Unified Framework for Federated Learning on Non-IID Image Features","date":"2021-10-19","arxiv_id":"2110.09974","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-generalization-in-deep-learning","title":"Explaining generalization in deep learning: progress and fundamental limits","date":"2021-10-17","arxiv_id":"2110.08922","repositories_listed":0,"syntology":null},{"url":null,"slug":"block-contextual-mdps-for-continual-learning-1","title":"Block Contextual MDPs for Continual Learning","date":"2021-10-13","arxiv_id":"2110.06972","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-non-irreducible-markov-chains","title":"Learning from non-irreducible Markov chains","date":"2021-10-08","arxiv_id":"2110.04338","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-the-confidence-of-near-tight","title":"Boosting the Confidence of Near-Tight Generalization Bounds for Uniformly Stable Randomized Algorithms","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-federated-learning","title":"Fairness-aware Federated Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"high-probability-generalization-bounds-for-1","title":"High Probability Generalization Bounds for Minimax Problems with Fast Rates","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"huber-additive-models-for-non-stationary-time","title":"Huber Additive Models for Non-stationary Time Series Analysis","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-generalization-bound-for-deep-neural","title":"Improved Generalization Bound for Deep Neural Networks Using Geometric Functional Analysis","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-generalization-risk-bounds-for-meta","title":"Improved Generalization Risk Bounds for Meta-Learning with PAC-Bayes-kl Analysis","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-5","title":"Information-Theoretic Generalization Bounds for Iterative Semi-Supervised Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-and-adaptive-generalization-of","title":"Optimization and Adaptive Generalization of Three layer Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"task-relatedness-based-generalization-bounds","title":"Task Relatedness-Based Generalization Bounds for Meta Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-analysis-of-consistency","title":"Theoretical Analysis of Consistency Regularization with Limited Augmented Data","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-understanding-of-adversarial","title":"Theoretical understanding of adversarial reinforcement learning via mean-field optimal control","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"two-regimes-of-generalization-for-non-linear","title":"Two Regimes of Generalization for Non-Linear Metric Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-generalization-of-quadratic-neural","title":"Robust Generalization of Quadratic Neural Networks via Function Identification","date":"2021-09-22","arxiv_id":"2109.10935","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-generalization-bounds-for","title":"Uniform Generalization Bounds for Overparameterized Neural Networks","date":"2021-09-13","arxiv_id":"2109.06099","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-reinitialization-on","title":"The Impact of Reinitialization on Generalization in Convolutional Neural Networks","date":"2021-09-01","arxiv_id":"2109.00267","repositories_listed":0,"syntology":null},{"url":"/paper/adaptive-and-interpretable-graph-convolution","slug":"adaptive-and-interpretable-graph-convolution","title":"Layer-wise Adaptive Graph Convolution Networks Using Generalized Pagerank","date":"2021-08-24","arxiv_id":"2108.10636","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-bounds-and-calibration-for-a-smart","title":"Risk Bounds and Calibration for a Smart Predict-then-Optimize Method","date":"2021-08-19","arxiv_id":"2108.08887","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-generalization-for-randomized","title":"Stability and Generalization for Randomized Coordinate Descent","date":"2021-08-17","arxiv_id":"2108.07414","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-nonparametric","title":"Generalization bounds for nonparametric regression with $β-$mixing samples","date":"2021-08-02","arxiv_id":"2108.00997","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-properties-of-stochastic","title":"Generalization Bounds using Lower Tail Exponents in Stochastic Optimizers","date":"2021-08-02","arxiv_id":"2108.00781","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistically-meaningful-approximation-a-case","title":"Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers","date":"2021-07-28","arxiv_id":"2107.13163","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiaccurate-proxies-for-downstream-fairness","title":"Multiaccurate Proxies for Downstream Fairness","date":"2021-07-09","arxiv_id":"2107.04423","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexity-free-generalization-via","title":"Generalization Bounds with Minimal Dependency on Hypothesis Class via Distributionally Robust Optimization","date":"2021-06-21","arxiv_id":"2106.11180","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayes-mac-bayes-and-conditional-mutual","title":"PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes","date":"2021-06-17","arxiv_id":"2106.09683","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-convergence-of-interpolators-gaussian","title":"Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfitting","date":"2021-06-17","arxiv_id":"2106.09276","repositories_listed":0,"syntology":null},{"url":null,"slug":"compression-implies-generalization","title":"Compression Implies Generalization","date":"2021-06-15","arxiv_id":"2106.07989","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-optimization-kernel-towards-robust","title":"Neural Optimization Kernel: Towards Robust Deep Learning","date":"2021-06-11","arxiv_id":"2106.06097","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-understanding-generalization-via","title":"Towards Understanding Generalization via Decomposing Excess Risk Dynamics","date":"2021-06-11","arxiv_id":"2106.06153","repositories_listed":0,"syntology":null},{"url":null,"slug":"within-layer-diversity-reduces-generalization","title":"Learning distinct features helps, provably","date":"2021-06-10","arxiv_id":"2106.06012","repositories_listed":0,"syntology":null},{"url":null,"slug":"fractal-structure-and-generalization","title":"Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms","date":"2021-06-09","arxiv_id":"2106.04881","repositories_listed":0,"syntology":null},{"url":null,"slug":"encoding-dependent-generalization-bounds-for","title":"Encoding-dependent generalization bounds for parametrized quantum circuits","date":"2021-06-07","arxiv_id":"2106.03880","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-generalization-analysis-of-1","title":"Fine-grained Generalization Analysis of Structured Output Prediction","date":"2021-05-31","arxiv_id":"2106.00115","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-optimally-abstaining-from-prediction","title":"Towards optimally abstaining from prediction with OOD test examples","date":"2021-05-28","arxiv_id":"2105.14119","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressing-heavy-tailed-weight-matrices-for","title":"Compressing Heavy-Tailed Weight Matrices for Non-Vacuous Generalization Bounds","date":"2021-05-23","arxiv_id":"2105.11025","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-and-estimating-causal-effects","title":"Identifying and Estimating Causal Effects under Weak Overlap by Generative Prognostic Model","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-information-theoretical-1","title":"Optimizing Information-theoretical Generalization Bound via Anisotropic Noise of SGLD","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-convergence-of-interpolators-gaussian-1","title":"Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds and Benign Overfitting","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"information-complexity-and-generalization","title":"Information Complexity and Generalization Bounds","date":"2021-05-04","arxiv_id":"2105.01747","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-generalization-analysis-of","title":"Fine-grained Generalization Analysis of Vector-valued Learning","date":"2021-04-29","arxiv_id":"2104.14173","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-guarantees-for-neural","title":"Generalization Guarantees for Neural Architecture Search with Train-Validation Split","date":"2021-04-29","arxiv_id":"2104.14132","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-sparse-matrix-factorization-for","title":"Group-Sparse Matrix Factorization for Transfer Learning of Word Embeddings","date":"2021-04-18","arxiv_id":"2104.08928","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-via-distillation-1","title":"Generalization bounds via distillation","date":"2021-04-12","arxiv_id":"2104.05641","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-of-gans-under-lipschitz","title":"Generalization of GANs and overparameterized models under Lipschitz continuity","date":"2021-04-06","arxiv_id":"2104.02388","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-deviation-optimal-risk-bounds","title":"Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$","date":"2021-03-22","arxiv_id":"2103.12024","repositories_listed":0,"syntology":null},{"url":null,"slug":"mean-field-methods-and-algorithmic","title":"Mean-field methods and algorithmic perspectives for high-dimensional machine learning","date":"2021-03-10","arxiv_id":"2103.05945","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayes-and-information-complexity","title":"PAC-Bayes and Information Complexity","date":"2021-03-04","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"self-regularity-of-non-negative-output","title":"Self-Regularity of Non-Negative Output Weights for Overparameterized Two-Layer Neural Networks","date":"2021-03-02","arxiv_id":"2103.01887","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-of-label-propagation-for","title":"A Theory of Label Propagation for Subpopulation Shift","date":"2021-02-22","arxiv_id":"2102.11203","repositories_listed":0,"syntology":null},{"url":null,"slug":"closing-the-closed-loop-distribution-shift-in","title":"On the Sample Complexity of Stability Constrained Imitation Learning","date":"2021-02-18","arxiv_id":"2102.09161","repositories_listed":0,"syntology":null},{"url":null,"slug":"lexicographically-fair-learning-algorithms","title":"Lexicographically Fair Learning: Algorithms and Generalization","date":"2021-02-16","arxiv_id":"2102.08454","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimension-free-generalization-bounds-for-non","title":"Dimension Free Generalization Bounds for Non Linear Metric Learning","date":"2021-02-07","arxiv_id":"2102.03802","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-of-model-agnostic-meta","title":"Generalization of Model-Agnostic Meta-Learning Algorithms: Recurring and Unseen Tasks","date":"2021-02-07","arxiv_id":"2102.03832","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-while-dissipating-information","title":"Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channels","date":"2021-02-05","arxiv_id":"2102.02976","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-1","title":"Information-Theoretic Generalization Bounds for Stochastic Gradient Descent","date":"2021-02-01","arxiv_id":"2102.00931","repositories_listed":0,"syntology":null},{"url":null,"slug":"heating-up-decision-boundaries-isocapacitory-1","title":"Heating up decision boundaries: isocapacitory saturation, adversarial scenarios and generalization bounds","date":"2021-01-15","arxiv_id":"2101.06061","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-gnns-a-sample-efficient-architecture","title":"Beyond GNNs: A Sample Efficient Architecture for Graph Problems","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-distributed-learning-with-random","title":"Effective Distributed Learning with Random Features: Improved Bounds and Algorithms","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-lipschitz-constants-of-monotone","title":"Estimating Lipschitz constants of monotone deep equilibrium models","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"f-domain-adversarial-learning-theory-and","title":"f-Domain-Adversarial Learning: Theory and Algorithms for Unsupervised Domain Adaptation with Neural Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-better-structured-representations","title":"Learning Better Structured Representations Using Low-rank Adaptive Label Smoothing","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lipschitz-bounded-equilibrium-networks","title":"Lipschitz-Bounded Equilibrium Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sharper-generalization-bounds-for-learning","title":"Sharper Generalization Bounds for Learning with Gradient-dominated Objective Functions","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-analysis-of-sgd-through-the","title":"Stability analysis of SGD through the normalized loss function","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tight-lower-bound-for-uniformly-stable","title":"A Tight Lower Bound for Uniformly Stable Algorithms","date":"2020-12-24","arxiv_id":"2012.13326","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pac-bayesian-approach-to-generalization-1","title":"A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks","date":"2020-12-14","arxiv_id":"2012.07690","repositories_listed":0,"syntology":null},{"url":null,"slug":"neurips-2020-competition-predicting","title":"NeurIPS 2020 Competition: Predicting Generalization in Deep Learning","date":"2020-12-14","arxiv_id":"2012.07976","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-deep-learning","title":"Generalization bounds for deep learning","date":"2020-12-07","arxiv_id":"2012.04115","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditioning-and-processing-techniques-to","title":"Conditioning and Processing: Techniques to Improve Information-Theoretic Generalization Bounds","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"instance-based-generalization-in-1","title":"Instance-based Generalization in Reinforcement Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sharper-generalization-bounds-for-pairwise","title":"Sharper Generalization Bounds for Pairwise Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-abstract-reasoner","title":"Neural Abstract Reasoner","date":"2020-11-12","arxiv_id":"2011.09860","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-deep-thresholding","title":"Compressive Sensing and Neural Networks from a Statistical Learning Perspective","date":"2020-10-29","arxiv_id":"2010.15658","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-better-generalization-bounds-with","title":"Toward Better Generalization Bounds with Locally Elastic Stability","date":"2020-10-27","arxiv_id":"2010.13988","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-parametric-binary-regression-in-metric","title":"Non-parametric Binary regression in metric spaces with KL loss","date":"2020-10-19","arxiv_id":"2010.09886","repositories_listed":0,"syntology":null},{"url":null,"slug":"failures-of-model-dependent-generalization","title":"Failures of model-dependent generalization bounds for least-norm interpolation","date":"2020-10-16","arxiv_id":"2010.08479","repositories_listed":0,"syntology":null},{"url":null,"slug":"dissecting-hessian-understanding-common-1","title":"Dissecting Hessian: Understanding Common Structure of Hessian in Neural Networks","date":"2020-10-08","arxiv_id":"2010.04261","repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-analysis-of-self-training-with-1","title":"Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Data","date":"2020-10-07","arxiv_id":"2010.03622","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-high-probability-versus-in","title":"A Note on High-Probability versus In-Expectation Guarantees of Generalization Bounds in Machine Learning","date":"2020-10-06","arxiv_id":"2010.02576","repositories_listed":0,"syntology":null},{"url":null,"slug":"lipschitz-bounded-equilibrium-networks-1","title":"Lipschitz Bounded Equilibrium Networks","date":"2020-10-05","arxiv_id":"2010.01732","repositories_listed":0,"syntology":null},{"url":null,"slug":"benign-overfitting-in-ridge-regression","title":"Benign overfitting in ridge regression","date":"2020-09-29","arxiv_id":"2009.14286","repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-valued-embeddings-of-generic","title":"Complex-valued embeddings of generic proximity data","date":"2020-08-31","arxiv_id":"2008.13454","repositories_listed":0,"syntology":null}],"record_sha256":"58bd4da28ef65c9874e060517d5315007b521e1fcae9905f9650034c14d231ed","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}