Search Results for author:
Found 2 papers, 0 papers with code
Generalization Bounds for Gradient Methods via Discrete and Continuous Prior
In this paper, we introduce a new discrete data-dependent prior to the PAC-Bayesian framework, and prove a high probability generalization bound of order $O(\frac{1}{n}\cdot \sum_{t=1}^T(\gamma_t/\varepsilon_t)^2\left\|{\mathbf{g}_t}\right\|^2)$ for Floored GD (i. e. a version of gradient descent with precision level $\varepsilon_t$), where $n$ is the number of training samples, $\gamma_t$ is the learning rate at step $t$, $\mathbf{g}_t$ is roughly the difference of the gradient computed using all samples and that using only prior samples.
On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning
We develop a new framework, termed Bayes-Stability, for proving algorithm-dependent generalization error bounds.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
