Ying Xiao

12 papers A* 4Misc 1Journal 6
YearRankTypeTitle / Venue / Authors
2017 J jnl
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques.
J. ACM
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao
2015 A* conf
Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample Complexity.
COLT
Santosh S. Vempala, Ying Xiao
2015 — —
New tools for unsupervised learning.
Ying Xiao
2014 A* conf
Compact Random Feature Maps.
ICML
Raffay Hamid, Ying Xiao, Alex Gittens, Dennis DeCoste
2014 A* conf
Fourier PCA and robust tensor decomposition.
STOC
Navin Goyal, Santosh S. Vempala, Ying Xiao
2014 J jnl
Max vs Min: Independent Component Analysis with nearly Linear Sample Complexity.
CoRR
Santosh S. Vempala, Ying Xiao
2013 J jnl
Compact Random Feature Maps.
CoRR
Raffay Hamid, Ying Xiao, Alex Gittens, Dennis DeCoste
2013 Misc conf
Complexity of learning subspace juntas and ICA.
ACSSC
Santosh S. Vempala, Ying Xiao
2013 J jnl
Fourier PCA.
CoRR
Navin Goyal, Santosh S. Vempala, Ying Xiao
2013 A* conf
Statistical algorithms and a lower bound for detecting planted cliques.
STOC
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao
2012 J jnl
Statistical Algorithms and a Lower Bound for Planted Clique.
Electron. Colloquium Comput. Complex.
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao
2011 J jnl
Structure from Local Optima: Learning Subspace Juntas via Higher Order PCA
CoRR
Santosh S. Vempala, Ying Xiao