activity
20122023
most citedAn Investigation into Neural Net Optimization via Hessian Eigenvalue Density

103 citations · 179 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LG2023★ 1 cited

DBGSA: A Novel Data Adaptive Bregman Clustering Algorithm

Ying Xiao, Hou-biao Li, Yu-pu Zhang

With the development of Big data technology, data analysis has become increasingly important. Traditional clustering algorithms such as K-means are highly sensitive to the initial…

cs.LG2019★ 103 cited

An Investigation into Neural Net Optimization via Hessian Eigenvalue Density

Behrooz Ghorbani, Shankar Krishnan, Ying Xiao

To understand the dynamics of optimization in deep neural networks, we develop a tool to study the evolution of the entire Hessian spectrum throughout the optimization process. Usi…

cs.LG2017★ 3 cited

Neumann Optimizer: A Practical Optimization Algorithm for Deep Neural Networks

Shankar Krishnan, Ying Xiao, Rif A. Saurous

Progress in deep learning is slowed by the days or weeks it takes to train large models. The natural solution of using more hardware is limited by diminishing returns, and leads to…

cs.DS2014★ 1 cited

Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample Complexity

Santosh S. Vempala, Ying Xiao

We present a simple, general technique for reducing the sample complexity of matrix and tensor decomposition algorithms applied to distributions. We use the technique to give a pol…

stat.ML2013★ 60 cited

Compact Random Feature Maps

Raffay Hamid, Ying Xiao, Alex Gittens +1

Kernel approximation using randomized feature maps has recently gained a lot of interest. In this work, we identify that previous approaches for polynomial kernel approximation cre…

cs.LG2013★ 5 cited

Fourier PCA and Robust Tensor Decomposition

Navin Goyal, Santosh Vempala, Ying Xiao

Fourier PCA is Principal Component Analysis of a matrix obtained from higher order derivatives of the logarithm of the Fourier transform of a distribution.We make this method algor…

cs.CC2012★ 6 cited

Statistical Algorithms and a Lower Bound for Detecting Planted Clique

Vitaly Feldman, Elena Grigorescu, Lev Reyzin +2

We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a statistical query oracle…