Ruosong Wang
Ruosong Wang
Geverifieerd e-mailadres voor andrew.cmu.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks
S Arora, S Du, W Hu, Z Li, R Wang
International Conference on Machine Learning, 322-332, 2019
4442019
On exact computation with an infinitely wide neural net
S Arora, SS Du, W Hu, Z Li, R Salakhutdinov, R Wang
arXiv preprint arXiv:1904.11955, 2019
3832019
Graph neural tangent kernel: Fusing graph neural networks with graph kernels
SS Du, K Hou, RR Salakhutdinov, B Poczos, R Wang, K Xu
Advances in Neural Information Processing Systems 32, 5723-5733, 2019
842019
Is a good representation sufficient for sample efficient reinforcement learning?
SS Du, SM Kakade, R Wang, LF Yang
arXiv preprint arXiv:1910.03016, 2019
822019
Harnessing the power of infinitely wide deep nets on small-data tasks
S Arora, SS Du, Z Li, R Salakhutdinov, R Wang, D Yu
arXiv preprint arXiv:1910.01663, 2019
672019
Reinforcement learning with general value function approximation: Provably efficient approach via bounded eluder dimension
R Wang, R Salakhutdinov, LF Yang
arXiv preprint arXiv:2005.10804, 2020
64*2020
Provably Efficient -learning with Function Approximation via Distribution Shift Error Checking Oracle
SS Du, Y Luo, R Wang, H Zhang
arXiv preprint arXiv:1906.06321, 2019
552019
Optimism in reinforcement learning with generalized linear function approximation
Y Wang, R Wang, SS Du, A Krishnamurthy
arXiv preprint arXiv:1912.04136, 2019
542019
Enhanced convolutional neural tangent kernels
Z Li, R Wang, D Yu, SS Du, W Hu, R Salakhutdinov, S Arora
arXiv preprint arXiv:1911.00809, 2019
532019
Nearly optimal sampling algorithms for combinatorial pure exploration
L Chen, A Gupta, J Li, M Qiao, R Wang
Conference on Learning Theory, 482-534, 2017
352017
Agnostic -learning with Function Approximation in Deterministic Systems: Near-Optimal Bounds on Approximation Error and Sample Complexity
SS Du, JD Lee, G Mahajan, R Wang
Advances in Neural Information Processing Systems 33, 2020
33*2020
What are the Statistical Limits of Offline RL with Linear Function Approximation?
R Wang, DP Foster, SM Kakade
arXiv preprint arXiv:2010.11895, 2020
302020
On reward-free reinforcement learning with linear function approximation
R Wang, SS Du, LF Yang, R Salakhutdinov
arXiv preprint arXiv:2006.11274, 2020
292020
Is Long Horizon RL More Difficult Than Short Horizon RL?
R Wang, SS Du, L Yang, S Kakade
Advances in neural information processing systems 33, 2020
27*2020
Exponential separations in the energy complexity of leader election
YJ Chang, T Kopelowitz, S Pettie, R Wang, W Zhan
ACM Transactions on Algorithms (TALG) 15 (4), 1-31, 2019
272019
k-regret minimizing set: Efficient algorithms and hardness
W Cao, J Li, H Wang, K Wang, R Wang, R Chi-Wing Wong, W Zhan
20th International Conference on Database Theory (ICDT 2017), 2017
232017
Tight Bounds for p Oblivious Subspace Embeddings
R Wang, DP Woodruff
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
212019
Bilinear classes: A structural framework for provable generalization in rl
SS Du, SM Kakade, JD Lee, S Lovett, G Mahajan, W Sun, R Wang
arXiv preprint arXiv:2103.10897, 2021
182021
Dimensionality reduction for tukey regression
K Clarkson, R Wang, D Woodruff
International Conference on Machine Learning, 1262-1271, 2019
172019
Efficient symmetric norm regression via linear sketching
Z Song, R Wang, LF Yang, H Zhang, P Zhong
arXiv preprint arXiv:1910.01788, 2019
152019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20