From post

Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints.

, , , и . COLT, том 75 из Proceedings of Machine Learning Research, стр. 605-638. PMLR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Optimal oracle inequalities for solving projected fixed-point equations., , и . CoRR, (2020)Dropout Training, Data-dependent Regularization, and Generalization Bounds., , , и . ICML, том 80 из Proceedings of Machine Learning Research, стр. 3642-3650. PMLR, (2018)An Efficient Sampling Algorithm for Non-smooth Composite Potentials., , , и . J. Mach. Learn. Res., (2022)A Refined Analysis of LSH for Well-dispersed Data Points., и . ANALCO, стр. 174-182. SIAM, (2017)Off-policy estimation of linear functionals: Non-asymptotic theory for semi-parametric efficiency., , и . CoRR, (2022)On Bellman equations for continuous-time policy evaluation I: discretization and approximation., и . CoRR, (2024)High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm., , , , и . J. Mach. Learn. Res., (2021)ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm., , , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 909-981. PMLR, (2022)High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm, , , , и . (2019)cite arxiv:1908.10859.Politicize and Depoliticize: A Study of Semantic Shifts on People's Daily Fifty Years' Corpus via Distributed Word Representation Space., , , , и . CLSW, том 9332 из Lecture Notes in Computer Science, стр. 438-447. Springer, (2015)