Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarRuosong Wang
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c19]Sanjeev Arora, Simon S. Du, Zhiyuan Li, Ruslan Salakhutdinov, Ruosong Wang, Dingli Yu:
Harnessing the Power of Infinitely Wide Deep Nets on Small-data Tasks. ICLR 2020- [c18]Simon S. Du, Sham M. Kakade, Ruosong Wang, Lin F. Yang:
Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning? ICLR 2020 - [c17]Yi Li, Ruosong Wang, David P. Woodruff:
Tight Bounds for the Subspace Sketch Problem with Applications. SODA 2020: 1655-1674 - [c16]Santosh S. Vempala, Ruosong Wang, David P. Woodruff:
The Communication Complexity of Optimization. SODA 2020: 1733-1752 - [i22]Simon S. Du, Jason D. Lee, Gaurav Mahajan, Ruosong Wang:
Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity. CoRR abs/2002.07125 (2020) - [i21]Fei Feng, Ruosong Wang, Wotao Yin, Simon S. Du, Lin F. Yang:
Provably Efficient Exploration for RL with Unsupervised Learning. CoRR abs/2003.06898 (2020) - [i20]Ruosong Wang, Simon S. Du, Lin F. Yang, Sham M. Kakade:
Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning? CoRR abs/2005.00527 (2020) - [i19]Ruosong Wang, Ruslan Salakhutdinov, Lin F. Yang:
Provably Efficient Reinforcement Learning with General Value Function Approximation. CoRR abs/2005.10804 (2020)
2010 – 2019
- 2019
- [j1]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
Exponential Separations in the Energy Complexity of Leader Election. ACM Trans. Algorithms 15(4): 49:1-49:31 (2019) - [c15]Sanjeev Arora, Simon S. Du, Wei Hu, Zhiyuan Li, Ruosong Wang:
Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks. ICML 2019: 322-332 - [c14]Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff:
Dimensionality Reduction for Tukey Regression. ICML 2019: 1262-1271 - [c13]Lijie Chen, Ruosong Wang:
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. ITCS 2019: 23:1-23:20 - [c12]Zhao Song, Ruosong Wang, Lin F. Yang, Hongyang Zhang, Peilin Zhong:
Efficient Symmetric Norm Regression via Linear Sketching. NeurIPS 2019: 828-838 - [c11]Simon S. Du, Kangcheng Hou, Ruslan Salakhutdinov, Barnabás Póczos, Ruosong Wang, Keyulu Xu:
Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels. NeurIPS 2019: 5724-5734 - [c10]Simon S. Du, Yuping Luo, Ruosong Wang, Hanrui Zhang:
Provably Efficient Q-learning with Function Approximation via Distribution Shift Error Checking Oracle. NeurIPS 2019: 8058-8068 - [c9]Sanjeev Arora, Simon S. Du, Wei Hu, Zhiyuan Li, Ruslan Salakhutdinov, Ruosong Wang:
On Exact Computation with an Infinitely Wide Neural Net. NeurIPS 2019: 8139-8148 - [c8]Ruosong Wang, David P. Woodruff:
Tight Bounds for ℓp Oblivious Subspace Embeddings. SODA 2019: 1825-1843 - [i18]Sanjeev Arora, Simon S. Du, Wei Hu, Zhiyuan Li, Ruosong Wang:
Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks. CoRR abs/1901.08584 (2019) - [i17]Yi Li, Ruosong Wang, David P. Woodruff:
Tight Bounds for the Subspace Sketch Problem with Applications. CoRR abs/1904.05543 (2019) - [i16]Sanjeev Arora, Simon S. Du, Wei Hu, Zhiyuan Li, Ruslan Salakhutdinov, Ruosong Wang:
On Exact Computation with an Infinitely Wide Neural Net. CoRR abs/1904.11955 (2019) - [i15]Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff:
Dimensionality Reduction for Tukey Regression. CoRR abs/1905.05376 (2019) - [i14]Simon S. Du, Kangcheng Hou, Barnabás Póczos, Ruslan Salakhutdinov, Ruosong Wang, Keyulu Xu:
Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels. CoRR abs/1905.13192 (2019) - [i13]Santosh S. Vempala, Ruosong Wang, David P. Woodruff:
The Communication Complexity of Optimization. CoRR abs/1906.05832 (2019) - [i12]Simon S. Du, Yuping Luo, Ruosong Wang, Hanrui Zhang:
Provably Efficient Q-learning with Function Approximation via Distribution Shift Error Checking Oracle. CoRR abs/1906.06321 (2019) - [i11]Sanjeev Arora, Simon S. Du, Zhiyuan Li, Ruslan Salakhutdinov, Ruosong Wang, Dingli Yu:
Harnessing the Power of Infinitely Wide Deep Nets on Small-data Tasks. CoRR abs/1910.01663 (2019) - [i10]Zhao Song, Ruosong Wang, Lin F. Yang, Hongyang Zhang, Peilin Zhong:
Efficient Symmetric Norm Regression via Linear Sketching. CoRR abs/1910.01788 (2019) - [i9]Simon S. Du, Sham M. Kakade, Ruosong Wang, Lin F. Yang:
Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning? CoRR abs/1910.03016 (2019) - [i8]Simon S. Du, Ruosong Wang, Mengdi Wang, Lin F. Yang:
Continuous Control with Contexts, Provably. CoRR abs/1910.13614 (2019) - [i7]Zhiyuan Li, Ruosong Wang, Dingli Yu, Simon S. Du, Wei Hu, Ruslan Salakhutdinov, Sanjeev Arora:
Enhanced Convolutional Neural Tangent Kernels. CoRR abs/1911.00809 (2019) - [i6]Yining Wang, Ruosong Wang, Simon S. Du, Akshay Krishnamurthy:
Optimism in Reinforcement Learning with Generalized Linear Function Approximation. CoRR abs/1912.04136 (2019) - 2018
- [c7]Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang:
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. SWAT 2018: 16:1-16:12 - [i5]Ruosong Wang, David P. Woodruff:
Tight Bounds for 𝓁p Oblivious Subspace Embeddings. CoRR abs/1801.04414 (2018) - [i4]Lijie Chen, Ruosong Wang:
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. CoRR abs/1811.07515 (2018) - 2017
- [c6]Lijie Chen, Pingzhong Tang, Ruosong Wang:
Bounded Rationality of Restricted Turing Machines. AAAI 2017: 444-450 - [c5]Zhipeng Jia, Pingzhong Tang, Ruosong Wang, Hanrui Zhang:
Efficient Near-optimal Algorithms for Barter Exchange. AAMAS 2017: 362-370 - [c4]Lijie Chen, Fangzhen Lin, Pingzhong Tang, Kangning Wang, Ruosong Wang, Shiheng Wang:
K-Memory Strategies in Repeated Games. AAMAS 2017: 1493-1498 - [c3]Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang:
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. COLT 2017: 482-534 - [c2]Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, Wei Zhan:
k-Regret Minimizing Set: Efficient Algorithms and Hardness. ICDT 2017: 11:1-11:19 - [c1]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
Exponential separations in the energy complexity of leader election. STOC 2017: 771-783 - [i3]Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang:
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. CoRR abs/1706.01081 (2017) - 2016
- [i2]Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang:
Improved Algorithms for Maintaining DFS Tree in Undirected Graphs. CoRR abs/1607.04913 (2016) - [i1]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
How to Elect a Low-energy Leader. CoRR abs/1609.08486 (2016)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-06-05 00:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
