default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenlong Mou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Wenlong Mou, Nhat Ho, Martin J. Wainwright
, Peter L. Bartlett, Michael I. Jordan:
A Diffusion Process Perspective on Posterior Contraction Rates for Parameters. SIAM J. Math. Data Sci. 6(2): 553-577 (2024)- [i16]Wenlong Mou, Yuhua Zhu:
On Bellman equations for continuous-time policy evaluation I: discretization and approximation. CoRR abs/2407.05966 (2024) - 2022
- [j2]Wenlong Mou, Nicolas Flammarion, Martin J. Wainwright, Peter L. Bartlett:
An Efficient Sampling Algorithm for Non-smooth Composite Potentials. J. Mach. Learn. Res. 23: 233:1-233:50 (2022) - [c10]Chris Junchi Li, Wenlong Mou, Martin J. Wainwright, Michael I. Jordan:
ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm. COLT 2022: 909-981 - [c9]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright, Peter L. Bartlett:
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. COLT 2022: 2060-2061 - [i15]Wenlong Mou, Koulik Khamaru, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
Optimal variance-reduced stochastic approximation in Banach spaces. CoRR abs/2201.08518 (2022) - [i14]Wenlong Mou, Martin J. Wainwright, Peter L. Bartlett:
Off-policy estimation of linear functionals: Non-asymptotic theory for semi-parametric efficiency. CoRR abs/2209.13075 (2022) - 2021
- [j1]Wenlong Mou, Yi-An Ma, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm. J. Mach. Learn. Res. 22: 42:1-42:41 (2021) - [i13]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright, Peter L. Bartlett:
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. CoRR abs/2112.12770 (2021) - 2020
- [c8]Wenlong Mou, Chris Junchi Li, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentration. COLT 2020: 2947-2997 - [i12]Wenlong Mou, Chris Junchi Li, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentration. CoRR abs/2004.04719 (2020) - [i11]Wenlong Mou, Zheng Wen, Xi Chen:
On the Sample Complexity of Reinforcement Learning with Policy Space Generalization. CoRR abs/2008.07353 (2020) - [i10]Chris Junchi Li, Wenlong Mou, Martin J. Wainwright, Michael I. Jordan:
ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm. CoRR abs/2008.12690 (2020) - [i9]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright:
Optimal oracle inequalities for solving projected fixed-point equations. CoRR abs/2012.05299 (2020)
2010 – 2019
- 2019
- [i8]Wenlong Mou, Yi-An Ma, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm. CoRR abs/1908.10859 (2019) - [i7]Wenlong Mou, Nicolas Flammarion, Martin J. Wainwright, Peter L. Bartlett:
An Efficient Sampling Algorithm for Non-smooth Composite Potentials. CoRR abs/1910.00551 (2019) - [i6]Wenlong Mou, Nhat Ho, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
Sampling for Bayesian Mixture Models: MCMC with Polynomial-Time Mixing. CoRR abs/1912.05153 (2019) - 2018
- [c7]Wenlong Mou, Liwei Wang, Xiyu Zhai, Kai Zheng:
Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints. COLT 2018: 605-638 - [c6]Wenlong Mou, Yuchen Zhou, Jun Gao, Liwei Wang:
Dropout Training, Data-dependent Regularization, and Generalization Bounds. ICML 2018: 3642-3650 - 2017
- [c5]Wenlong Mou, Liwei Wang:
A Refined Analysis of LSH for Well-dispersed Data Points. ANALCO 2017: 174-182 - [c4]Maria-Florina Balcan, Travis Dick, Yingyu Liang, Wenlong Mou, Hongyang Zhang:
Differentially Private Clustering in High-Dimensional Euclidean Spaces. ICML 2017: 322-331 - [c3]Kai Zheng, Wenlong Mou, Liwei Wang:
Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible. ICML 2017: 4130-4139 - [c2]Jiaqi Zhang, Kai Zheng, Wenlong Mou, Liwei Wang:
Efficient Private ERM for Smooth Objectives. IJCAI 2017: 3922-3928 - [i5]Jiaqi Zhang, Kai Zheng, Wenlong Mou, Liwei Wang:
Efficient Private ERM for Smooth Objectives. CoRR abs/1703.09947 (2017) - [i4]Kai Zheng, Wenlong Mou, Liwei Wang:
Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible. CoRR abs/1706.03316 (2017) - [i3]Wenlong Mou, Liwei Wang, Xiyu Zhai, Kai Zheng:
Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints. CoRR abs/1707.05947 (2017) - 2016
- [i2]Wenlong Mou, Liwei Wang:
A Refined Analysis of LSH for Well-dispersed Data Points. CoRR abs/1612.04571 (2016) - [i1]Wenlong Mou, Zhi Wang, Liwei Wang:
Stable Memory Allocation in the Hippocampus: Fundamental Limits and Neural Realization. CoRR abs/1612.04659 (2016) - 2015
- [c1]Wenlong Mou, Ni Sun, Junhao Zhang, Zhixuan Yang, Junfeng Hu:
Politicize and Depoliticize: A Study of Semantic Shifts on People's Daily Fifty Years' Corpus via Distributed Word Representation Space. CLSW 2015: 438-447
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
