Follow
Wenlong Mou
Title
Cited by
Cited by
Year
Generalization bounds of sgld for non-convex learning: Two theoretical viewpoints
W Mou, L Wang, X Zhai, K Zheng
Conference on Learning Theory, 605-638, 2018
1432018
Efficient private ERM for smooth objectives
J Zhang, K Zheng, W Mou, L Wang
arXiv preprint arXiv:1703.09947, 2017
1402017
Differentially private clustering in high-dimensional euclidean spaces
MF Balcan, T Dick, Y Liang, W Mou, H Zhang
International Conference on Machine Learning, 322-331, 2017
882017
High-order Langevin diffusion yields an accelerated MCMC algorithm
W Mou, YA Ma, MJ Wainwright, PL Bartlett, MI Jordan
Journal of Machine Learning Research 22 (42), 1-41, 2021
832021
On linear stochastic approximation: Fine-grained Polyak-Ruppert and non-asymptotic concentration
W Mou, CJ Li, MJ Wainwright, PL Bartlett, MI Jordan
Conference on learning theory, 2947-2997, 2020
682020
Improved bounds for discretization of Langevin diffusions: Near-optimal rates without convexity
W Mou, N Flammarion, MJ Wainwright, PL Bartlett
Bernoulli 28 (3), 1577-1601, 2022
632022
Collect at once, use effectively: Making non-interactive locally private learning possible
K Zheng, W Mou, L Wang
International Conference on Machine Learning, 4130-4139, 2017
502017
Dropout training, data-dependent regularization, and generalization bounds
W Mou, Y Zhou, J Gao, L Wang
International conference on machine learning, 3645-3653, 2018
322018
An efficient sampling algorithm for non-smooth composite potentials
W Mou, N Flammarion, MJ Wainwright, PL Bartlett
Journal of Machine Learning Research 23 (233), 1-50, 2022
262022
Optimal Oracle Inequalities for Projected Fixed-Point Equations, with Applications to Policy Evaluation
W Mou, A Pananjady, MJ Wainwright
Mathematics of Operations Research 48 (4), 2308-2336, 2023
21*2023
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation
W Mou, A Pananjady, MJ Wainwright, PL Bartlett
Mathematical Statistics and Learning, 2024
182024
Root-sgd: Sharp nonasymptotics and asymptotic efficiency in a single algorithm
CJ Li, W Mou, M Wainwright, M Jordan
Conference on Learning Theory, 909-981, 2022
172022
A diffusion process perspective on posterior contraction rates for parameters
W Mou, N Ho, MJ Wainwright, P Bartlett, MI Jordan
arXiv preprint arXiv:1909.00966, 2019
152019
On the sample complexity of reinforcement learning with policy space generalization
W Mou, Z Wen, X Chen
arXiv preprint arXiv:2008.07353, 2020
122020
The impact of local oscillator frequency jitter and laser linewidth to ultra high baud rate coherent systems
R Zhang, WJ Jiang, K Kuzmin, Y Weng, W Mou, GK Chang, WI Way
Journal of Lightwave Technology 38 (6), 1138-1147, 2020
102020
Optimal variance-reduced stochastic approximation in banach spaces
W Mou, K Khamaru, MJ Wainwright, PL Bartlett, MI Jordan
arXiv preprint arXiv:2201.08518, 2022
92022
Sampling for bayesian mixture models: Mcmc with polynomial-time mixing
W Mou, N Ho, MJ Wainwright, PL Bartlett, MI Jordan
arXiv preprint arXiv:1912.05153, 2019
9*2019
Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency
W Mou, P Ding, MJ Wainwright, PL Bartlett
arXiv preprint arXiv:2301.06240, 2023
82023
Off-policy estimation of linear functionals: Non-asymptotic theory for semi-parametric efficiency
W Mou, MJ Wainwright, PL Bartlett
arXiv preprint arXiv:2209.13075, 2022
82022
When is the estimated propensity score better? high-dimensional analysis and bias correction
F Su, W Mou, P Ding, MJ Wainwright
arXiv preprint arXiv:2303.17102, 2023
62023
The system can't perform the operation now. Try again later.
Articles 1–20