Cover Image

Online-to-PAC Conversions: Generalization Bounds via Regret Analysis

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lugosi, Gábor, Neu, Gergely
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online-to-PAC generalization bounds under graph-mixing dependencies
by: Abélès, Baptiste, et al.
Published: (2024)

Generalization bounds for mixing processes via delayed online-to-PAC conversions
by: Abeles, Baptiste, et al.
Published: (2024)

Confidence Sequences for Generalized Linear Models via Regret Analysis
by: Clerico, Eugenio, et al.
Published: (2025)

Online combinatorial optimization with stochastic decision sets and adversarial losses
by: Neu, Gergely, et al.
Published: (2026)

Online learning with noisy side observations
by: Kocák, Tomáš, et al.
Published: (2026)

Offline RL via Feature-Occupancy Gradient Ascent
by: Neu, Gergely, et al.
Published: (2024)

Online learning with Erdős-Rényi side-observation graphs
by: Kocák, Tomáš, et al.
Published: (2026)

Uncertainty quantification in metric spaces
by: Lugosi, Gábor, et al.
Published: (2024)

Convergence of continuous-time stochastic gradient descent with applications to deep neural networks
by: Lugosi, Gabor, et al.
Published: (2024)

Conformal and kNN Predictive Uncertainty Quantification Algorithms in Metric Spaces
by: Lugosi, Gábor, et al.
Published: (2025)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Dealing with unbounded gradients in stochastic saddle-point optimization
by: Neu, Gergely, et al.
Published: (2024)

Broadcasting in random recursive dags
by: Briend, Simon, et al.
Published: (2023)

On the quality of randomized approximations of Tukey's depth
by: Briend, Simon, et al.
Published: (2023)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026)

Inverse Q-Learning Done Right: Offline Imitation Learning in $Q^π$-Realizable MDPs
by: Moulin, Antoine, et al.
Published: (2025)

Sparse Optimistic Information Directed Sampling
by: Schwartz, Ludovic, et al.
Published: (2025)

Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning
by: Moulin, Antoine, et al.
Published: (2025)

Optimistic Information Directed Sampling
by: Neu, Gergely, et al.
Published: (2024)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
by: Li, Mingyi, et al.
Published: (2026)

Improved Kernel Alignment Regret Bound for Online Kernel Learning
by: Li, Junfan, et al.
Published: (2022)

Testing properties of trees in graphical models with covariance queries
by: Burova, Sofiya, et al.
Published: (2026)

Estimating the history of a random recursive tree
by: Briend, Simon, et al.
Published: (2024)

Generalization Bounds for Dependent Data using Online-to-Batch Conversion
by: Chatterjee, Sagnik, et al.
Published: (2024)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
by: Frey, Matthias, et al.
Published: (2026)

PAC-Chernoff Bounds: Understanding Generalization in the Interpolation Regime
by: Masegosa, Andrés R., et al.
Published: (2023)

A DPI-PAC-Bayesian Framework for Generalization Bounds
by: Guan, Muhan, et al.
Published: (2025)

Generalization Bounds via Meta-Learned Model Representations: PAC-Bayes and Sample Compression Hypernetworks
by: Leblanc, Benjamin, et al.
Published: (2024)

Regret Bounds for Robust Online Decision Making
by: Appel, Alexander, et al.
Published: (2025)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
by: Supantha, Subhamon, et al.
Published: (2025)

PAC-Bayesian Adversarially Robust Generalization Bounds for Graph Neural Network
by: Sun, Tan, et al.
Published: (2024)

PAC-Bayes Bounds for Gibbs Posteriors via Singular Learning Theory
by: Wang, Chenyang, et al.
Published: (2026)

Linear Bandits with Non-i.i.d. Noise
by: Abélès, Baptiste, et al.
Published: (2025)

Efficient learning by implicit exploration in bandit problems with side observations
by: Kocak, Tomas, et al.
Published: (2026)

Better-than-KL PAC-Bayes Bounds
by: Kuzborskij, Ilja, et al.
Published: (2024)

Empirical PAC-Bayes Bounds for Markov Chains
by: Karagulyan, Vahe, et al.
Published: (2025)

Refined PAC-Bayes Bounds for Offline Bandits
by: Gouverneur, Amaury, et al.
Published: (2025)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
by: Moon, Sang Bin, et al.
Published: (2024)

Uniform Generalization Bounds on Data-Dependent Hypothesis Sets via PAC-Bayesian Theory on Random Sets
by: Dupuis, Benjamin, et al.
Published: (2024)

PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning
by: Lee, Jaejun, et al.
Published: (2024)