conftrace_

covering number

34 papers

Explore in graph

Co-occurring keywords

generalization bound (652) rademacher complexity (109) neural network (6616) learning theory (519) fat-shattering dimension (9) sample complexity (1169) average smoothness (4) empirical process (22) metric space (87) convergence rate (607)

Papers

Generalization Analysis for Deep Contrastive Representation Learning AAAI 2025
Correlated Binomial Process COLT 2024
Functions with average smoothness: structure, algorithms, and learning JMLR 2024
Bridging the Gap: Rademacher Complexity in Robust and Standard Generalization COLT 2024
Sequence Length Independent Norm-Based Generalization Bounds for Transformers AISTATS 2024
Generalization Analysis for Contrastive Representation Learning ICML 2023
Generalization Bounds for Adversarial Metric Learning IJCAI 2023
On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds AAAI 2023
Robustness Implies Generalization via Data-Dependent Generalization Bounds ICML 2022
KAM Theory Meets Statistical Learning Theory: Hamiltonian Neural Networks with Non-zero Training Loss AAAI 2022
Generalization Bounds for Stochastic Gradient Descent via Localized $\varepsilon$-Covers NIPS 2022
Majorizing Measures, Sequential Complexities, and Online Learning COLT 2021
Suboptimal coverings for continuous spaces of control tasks L4DC 2021
Functions with average smoothness: structure, algorithms, and learning COLT 2021
Sharper Generalization Bounds for Clustering ICML 2021
On the Estimation of Network Complexity: Dimension of Graphons JMLR 2021
Relative Deviation Margin Bounds ICML 2021
Maximum-and-Concatenation Networks ICML 2020
PAC-Bayes Learning Bounds for Sample-Dependent Priors NIPS 2020
Is Long Horizon RL More Difficult Than Short Horizon RL? NIPS 2020
Sparse Kernel Regression with Coefficient-based $\ell_q-$regularization JMLR 2019
Theoretical Analysis of Adversarial Learning: A Minimax Approach NIPS 2019
Minimax Statistical Learning with Wasserstein distances NIPS 2018
Multi-Armed Bandits with Metric Movement Costs NIPS 2017
Covering Number for Efficient Heuristic-based POMDP Planning ICML 2014