7 citations · 9 across the 2 of their papers we have counts for
4 papers
Fast Sketching of Polynomial Kernels of Polynomial Degree
Zhao Song, David P. Woodruff, Zheng Yu +1
Kernel methods are fundamental in machine learning, and faster algorithms for kernel approximation provide direct speedups for many core tasks in machine learning. The polynomial k…
On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method
Junyu Zhang, Chengzhuo Ni, Zheng Yu +2
Policy gradient (PG) gives rise to a rich class of reinforcement learning (RL) methods. Recently, there has been an emerging trend to accelerate the existing PG methods such as REI…
Generalized Leverage Score Sampling for Neural Networks
Jason D. Lee, Ruoqi Shen, Zhao Song +2
Leverage score sampling is a powerful technique that originates from theoretical computer science, which can be used to speed up a large number of fundamental questions, e.g. linea…
Scalable Lattice Influence Maximization
Wei Chen, Ruihan Wu, Zheng Yu
Influence maximization is the task of finding k seed nodes in a social network such that the expected number of activated nodes in the network (under certain influence propagation…