{"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/3","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":3,"pages_in_order":7,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/generalization-bounds/papers/4","papers":[{"url":null,"slug":"deep-distributed-optimization-for-large-scale","title":"Deep Distributed Optimization for Large-Scale Quadratic Programming","date":"2024-12-11","arxiv_id":"2412.12156","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-and-regression-problems-in","title":"Representation and Regression Problems in Neural Networks: Relaxation, Generalization, and Numerics","date":"2024-12-02","arxiv_id":"2412.01619","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-generalization-bounds-for-neural-networks","title":"On Generalization Bounds for Neural Networks with Low Rank Layers","date":"2024-11-20","arxiv_id":"2411.13733","repositories_listed":0,"syntology":null},{"url":null,"slug":"smart-predict-then-optimize-method-with","title":"Smart Predict-then-Optimize Method with Dependent Data: Risk Bounds and Calibration of Autoregression","date":"2024-11-19","arxiv_id":"2411.12653","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-majority-vote-learning-algorithms","title":"Multi-View Majority Vote Learning Algorithms: Direct Minimization of PAC-Bayesian Bounds","date":"2024-11-09","arxiv_id":"2411.06276","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-expressivity-and-universality","title":"Generalization, Expressivity, and Universality of Graph Neural Networks on Attributed Graphs","date":"2024-11-08","arxiv_id":"2411.05464","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convex-relaxation-approach-to","title":"A Convex Relaxation Approach to Generalization Analysis for Parallel Positively Homogeneous Networks","date":"2024-11-05","arxiv_id":"2411.02767","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-model-evaluation-over-large-scale","title":"Robust Model Evaluation over Large-scale Federated Networks","date":"2024-10-26","arxiv_id":"2410.20250","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-geometry-of-regularization-in","title":"On the Geometry of Regularization in Adversarial Training: High-Dimensional Asymptotics and Generalization Bounds","date":"2024-10-21","arxiv_id":"2410.16073","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-compression-hypernetworks-from","title":"Sample Compression Hypernetworks: From Generalization Bounds to Meta-Learning","date":"2024-10-17","arxiv_id":"2410.13577","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-rank-dependent-generalisation-error-bounds","title":"On Rank-Dependent Generalisation Error Bounds for Transformers","date":"2024-10-15","arxiv_id":"2410.11500","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-to-pac-generalization-bounds-under","title":"Online-to-PAC generalization bounds under graph-mixing dependencies","date":"2024-10-11","arxiv_id":"2410.08977","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-sharper-risk-bounds-for-minimax","title":"Towards Sharper Risk Bounds for Minimax Problems","date":"2024-10-11","arxiv_id":"2410.08497","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-and-model-complexity","title":"Generalization Bounds and Model Complexity for Kolmogorov-Arnold Networks","date":"2024-10-10","arxiv_id":"2410.08026","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-adversarially-robust","title":"Understanding Adversarially Robust Generalization via Weight-Curvature Index","date":"2024-10-10","arxiv_id":"2410.07719","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-as-markov-chains","title":"Large Language Models as Markov Chains","date":"2024-10-03","arxiv_id":"2410.02724","repositories_listed":0,"syntology":null},{"url":null,"slug":"equivariant-score-based-generative-models","title":"Equivariant score-based generative models provably learn distributions with symmetries efficiently","date":"2024-10-02","arxiv_id":"2410.01244","repositories_listed":0,"syntology":null},{"url":null,"slug":"which-algorithms-have-tight-generalization","title":"Which Algorithms Have Tight Generalization Bounds?","date":"2024-10-02","arxiv_id":"2410.01969","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-classify-quantum-phases-of-matter","title":"Learning to Classify Quantum Phases of Matter with a Few Measurements","date":"2024-09-08","arxiv_id":"2409.05188","repositories_listed":0,"syntology":null},{"url":null,"slug":"introduction-to-machine-learning","title":"Introduction to Machine Learning","date":"2024-09-04","arxiv_id":"2409.02668","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-optimization-for-learning-to","title":"Online Optimization for Learning to Communicate over Time-Correlated Channels","date":"2024-09-01","arxiv_id":"2409.00575","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-markovian-model-for-learning-to-optimize","title":"A Markovian Model for Learning-to-Optimize","date":"2024-08-21","arxiv_id":"2408.11629","repositories_listed":0,"syntology":null},{"url":null,"slug":"misclassification-excess-risk-bounds-for-pac","title":"Misclassification excess risk bounds for PAC-Bayesian classification via convexified loss","date":"2024-08-16","arxiv_id":"2408.08675","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-decisions-offline-from-censored","title":"Learning Decisions Offline from Censored Observations with ε-insensitive Operational Costs","date":"2024-08-14","arxiv_id":"2408.07305","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-regression-and","title":"Generalization bounds for regression and classification on adaptive covering input domains","date":"2024-07-29","arxiv_id":"2407.19715","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlocking-tokens-as-data-points-for","title":"Unlocking Tokens as Data Points for Generalization Bounds on Larger Language Models","date":"2024-07-25","arxiv_id":"2407.18158","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-of-surrogate-policies","title":"Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems","date":"2024-07-24","arxiv_id":"2407.17200","repositories_listed":0,"syntology":null},{"url":null,"slug":"topological-generalization-bounds-for","title":"Topological Generalization Bounds for Discrete-Time Stochastic Optimization Algorithms","date":"2024-07-11","arxiv_id":"2407.08723","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalization-bound-for-nearly-linear","title":"A Generalization Bound for Nearly-Linear Networks","date":"2024-07-09","arxiv_id":"2407.06765","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-invariant-representation-learning-meets","title":"When Invariant Representation Learning Meets Label Shift: Insufficiency and Theoretical Insights","date":"2024-06-24","arxiv_id":"2406.16608","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-deep-learning-of-holomorphic","title":"Optimal deep learning of holomorphic operators between Banach spaces","date":"2024-06-20","arxiv_id":"2406.13928","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-mixing-processes","title":"Generalization bounds for mixing processes via delayed online-to-PAC conversions","date":"2024-06-18","arxiv_id":"2406.12600","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-manifold-perspective-on-the-statistical","title":"A Manifold Perspective on the Statistical Generalization of Graph Neural Networks","date":"2024-06-07","arxiv_id":"2406.05225","repositories_listed":0,"syntology":null},{"url":null,"slug":"pretraining-decision-transformers-with-reward","title":"Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning","date":"2024-06-07","arxiv_id":"2406.05064","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-pac-bayesian-study-of-pessimism-for","title":"Unified PAC-Bayesian Study of Pessimism for Offline Policy Learning with Regularized Importance Sampling","date":"2024-06-05","arxiv_id":"2406.03434","repositories_listed":0,"syntology":null},{"url":null,"slug":"length-independent-generalization-bounds-for","title":"Length independent generalization bounds for deep SSM architectures","date":"2024-05-30","arxiv_id":"2405.20278","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-margin-based-multiclass-generalization","title":"A Margin-based Multiclass Generalization Bound via Geometric Complexity","date":"2024-05-28","arxiv_id":"2405.18590","repositories_listed":0,"syntology":null},{"url":null,"slug":"reality-only-happens-once-single-path","title":"Higher-Order Transformer Derivative Estimates for Explicit Pathwise Learning Guarantees","date":"2024-05-26","arxiv_id":"2405.16563","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-dynamic-framework-for-bias","title":"Fine-Grained Dynamic Framework for Bias-Variance Joint Optimization on Data Missing Not at Random","date":"2024-05-24","arxiv_id":"2405.15403","repositories_listed":0,"syntology":null},{"url":null,"slug":"score-based-generative-models-are-provably","title":"Score-based generative models are provably robust: an uncertainty quantification perspective","date":"2024-05-24","arxiv_id":"2405.15754","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-metrics-pruning-and-generalization","title":"A rescaling-invariant Lipschitz bound based on path-metrics for modern ReLU network parameterizations","date":"2024-05-23","arxiv_id":"2405.15006","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-data-analysis-for-growing-data","title":"Adaptive Data Analysis for Growing Data","date":"2024-05-22","arxiv_id":"2405.13375","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-dependent-data","title":"Generalization Bounds for Dependent Data using Online-to-Batch Conversion","date":"2024-05-22","arxiv_id":"2405.13666","repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-analysis-of-meta-reinforcement","title":"Theoretical Analysis of Meta Reinforcement Learning: Generalization Bounds and Convergence Guarantees","date":"2024-05-22","arxiv_id":"2405.13290","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-generalization-bounds-on-data","title":"Uniform Generalization Bounds on Data-Dependent Hypothesis Sets via PAC-Bayesian Theory on Random Sets","date":"2024-04-26","arxiv_id":"2404.17442","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-generalization-bounds-for","title":"Improved Generalization Bounds for Communication Efficient Federated Learning","date":"2024-04-17","arxiv_id":"2404.11754","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-message-passing","title":"Generalization Bounds for Message Passing Networks on Mixture of Graphons","date":"2024-04-04","arxiv_id":"2404.03473","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-8","title":"Information-Theoretic Generalization Bounds for Deep Neural Networks","date":"2024-04-04","arxiv_id":"2404.03176","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-information-theoretic-framework-for-out-of","title":"An Information-Theoretic Framework for Out-of-Distribution Generalization with Applications to Stochastic Gradient Langevin Dynamics","date":"2024-03-29","arxiv_id":"2403.19895","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-generalization-bounds-for-losses","title":"A note on generalization bounds for losses with finite moments","date":"2024-03-25","arxiv_id":"2403.16681","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-of-scaled-deep-resnets-in-the","title":"Generalization of Scaled Deep ResNets in the Mean-Field Regime","date":"2024-03-14","arxiv_id":"2403.09889","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-robust-out-of-distribution","title":"Towards Robust Out-of-Distribution Generalization Bounds via Sharpness","date":"2024-03-11","arxiv_id":"2403.06392","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-of-graph-neural-networks","title":"Generalization of Graph Neural Networks through the Lens of Homomorphism","date":"2024-03-10","arxiv_id":"2403.06079","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-generalization-bounds-for-deep-compound","title":"On Generalization Bounds for Deep Compound Gaussian Neural Networks","date":"2024-02-20","arxiv_id":"2402.13106","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-information-structures-in-rlhf","title":"Reward Generalization in RLHF: A Topological Perspective","date":"2024-02-15","arxiv_id":"2402.10184","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-complexity-of-stochastic-convex","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","date":"2024-02-14","arxiv_id":"2402.09327","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-few-shot-fine-tuning","title":"Active Few-Shot Fine-Tuning","date":"2024-02-13","arxiv_id":"2402.15441","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-across-temporal-domains-with","title":"Generalizing across Temporal Domains with Koopman Operators","date":"2024-02-12","arxiv_id":"2402.07834","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-federated-learning-of","title":"Personalized Federated Learning of Probabilistic Models: A PAC-Bayesian Approach","date":"2024-01-16","arxiv_id":"2401.08351","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-the-accuracy-and-interpretability-1","title":"Theoretical and Empirical Advances in Forest Pruning","date":"2024-01-10","arxiv_id":"2401.05535","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-dependent-stability-analysis-of","title":"Data-Dependent Stability Analysis of Adversarial Training","date":"2024-01-06","arxiv_id":"2401.03156","repositories_listed":0,"syntology":null},{"url":null,"slug":"class-wise-generalization-error-an","title":"Class-wise Generalization Error: an Information-Theoretic Analysis","date":"2024-01-05","arxiv_id":"2401.02904","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayesian-domain-adaptation-bounds-for-1","title":"PAC-Bayesian Domain Adaptation Bounds for Multi-view learning","date":"2024-01-02","arxiv_id":"2401.01048","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-spatially-inhomogeneous-diffusion","title":"Statistical Spatially Inhomogeneous Diffusion Inference","date":"2023-12-10","arxiv_id":"2312.05793","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayes-generalization-certificates-for-1","title":"PAC-Bayes Generalization Certificates for Learned Inductive Conformal Prediction","date":"2023-12-07","arxiv_id":"2312.04658","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-mutual-information-to-expected-dynamics","title":"From Mutual Information to Expected Dynamics: New Generalization Bounds for Heavy-Tailed SGD","date":"2023-12-01","arxiv_id":"2312.00427","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-learning-with","title":"A unified framework for learning with nonlinear model classes from arbitrary linear samples","date":"2023-11-25","arxiv_id":"2311.14886","repositories_listed":0,"syntology":null},{"url":null,"slug":"aggregation-weighting-of-federated-learning","title":"Aggregation Weighting of Federated Learning via Generalization Bound Estimation","date":"2023-11-10","arxiv_id":"2311.05936","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-7","title":"Information-theoretic generalization bounds for learning from quantum data","date":"2023-11-09","arxiv_id":"2311.05529","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-6","title":"Information-Theoretic Generalization Bounds for Transductive Learning and its Applications","date":"2023-11-08","arxiv_id":"2311.04561","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-independent-information-theoretic","title":"Time-Independent Information-Theoretic Generalization Bounds for SGLD","date":"2023-11-02","arxiv_id":"2311.01046","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-label-noise","title":"Generalization Bounds for Label Noise Stochastic Gradient Descent","date":"2023-11-01","arxiv_id":"2311.00274","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-conditioned-hypothesis-stability","title":"Sample-Conditioned Hypothesis Stability Sharpens Information-Theoretic Generalization Bounds","date":"2023-10-31","arxiv_id":"2310.20102","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-distance-nearest-neighbor-condensing","title":"Weighted Distance Nearest Neighbor Condensing","date":"2023-10-24","arxiv_id":"2310.15951","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-dynamic-variational-autoencoder-for","title":"Causal Dynamic Variational Autoencoder for Counterfactual Regression in Longitudinal Data","date":"2023-10-16","arxiv_id":"2310.10559","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-generalization-bounds-for-projective","title":"On Generalization Bounds for Projective Clustering","date":"2023-10-13","arxiv_id":"2310.09127","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-generalization-via-information","title":"Advocating for the Silent: Enhancing Federated Generalization for Non-Participating Clients","date":"2023-10-11","arxiv_id":"2310.07171","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalization-bound-of-deep-neural","title":"A Generalization Bound of Deep Neural Networks for Dependent Data","date":"2023-10-09","arxiv_id":"2310.05892","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-bayesian-spectrally-normalized-bounds-for","title":"PAC-Bayesian Spectrally-Normalized Bounds for Adversarially Robust Generalization","date":"2023-10-09","arxiv_id":"2310.06182","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-the-ability-of-pinns-to-solve","title":"Investigating the Ability of PINNs To Solve Burgers' PDE Near Finite-Time BlowUp","date":"2023-10-08","arxiv_id":"2310.05169","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-random-feature-model","title":"Diffusion Random Feature Model","date":"2023-10-06","arxiv_id":"2310.04417","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-prompt-engineering-may-not","title":"Understanding prompt engineering may not require rethinking generalization","date":"2023-10-06","arxiv_id":"2310.03957","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-generalization-of-transductive-learning","title":"Sharp Generalization of Transductive Learning: A Transductive Local Rademacher Complexity Approach","date":"2023-09-28","arxiv_id":"2309.16858","repositories_listed":0,"syntology":null},{"url":null,"slug":"fantastic-generalization-measures-are-nowhere","title":"Fantastic Generalization Measures are Nowhere to be Found","date":"2023-09-24","arxiv_id":"2309.13658","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-perspectives-from","title":"Generalization Bounds: Perspectives from Information Theory and PAC-Bayes","date":"2023-09-08","arxiv_id":"2309.04381","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-projection-for-reducing","title":"Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming","date":"2023-09-01","arxiv_id":"2309.00203","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-operators-to-optimality-from","title":"Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Data","date":"2023-08-08","arxiv_id":"2308.04428","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-with-deep-neural-networks-and","title":"Classification with Deep Neural Networks and Logistic Loss","date":"2023-07-31","arxiv_id":"2307.16792","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-sample-complexity-of-estimation-in","title":"On the sample complexity of parameter estimation in logistic regression with normal design","date":"2023-07-09","arxiv_id":"2307.04191","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-guarantees-via-algorithm","title":"Generalization Guarantees via Algorithm-dependent Rademacher Complexity","date":"2023-07-04","arxiv_id":"2307.02501","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-certified-generalization-in-structured","title":"On Certified Generalization in Structured Prediction","date":"2023-06-15","arxiv_id":"2306.09112","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-model-and-dimension-for-interactive","title":"A Unified Model and Dimension for Interactive Estimation","date":"2023-06-09","arxiv_id":"2306.06184","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-stability-and-generalization","title":"Improved Stability and Generalization Guarantees of the Decentralized SGD Algorithm","date":"2023-06-05","arxiv_id":"2306.02939","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-feature-diversity-in-energy-based-models-1","title":"On Feature Diversity in Energy-based Models","date":"2023-06-02","arxiv_id":"2306.01489","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-augmentation-based-self","title":"Understanding Augmentation-based Self-Supervised Representation Learning via RKHS Approximation and Regression","date":"2023-06-01","arxiv_id":"2306.00788","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypothesis-transfer-learning-with-surrogate","title":"Hypothesis Transfer Learning with Surrogate Classification Losses: Generalization Bounds through Algorithmic Stability","date":"2023-05-31","arxiv_id":"2305.19694","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-to-pac-conversions-generalization","title":"Online-to-PAC Conversions: Generalization Bounds via Regret Analysis","date":"2023-05-31","arxiv_id":"2305.19674","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-magnitude-based","title":"Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketching","date":"2023-05-30","arxiv_id":"2305.18789","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-capacity-a-measure-of-the-effective","title":"Learning Capacity: A Measure of the Effective Dimensionality of a Model","date":"2023-05-27","arxiv_id":"2305.17332","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-variational-inference-towards","title":"Federated Variational Inference: Towards Improved Personalization and Generalization","date":"2023-05-23","arxiv_id":"2305.13672","repositories_listed":0,"syntology":null}],"record_sha256":"5de7934962338ee136a1977b14935dbc7aa640ce2470af6b51696adf7e712e6a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}