11 citations · 30 across the 12 of their papers we have counts for
4 papers · 1 filter
Hardness of Approximate Nearest Neighbor Search under L-infinity
Young Kun Ko, Min Jae Song
We show conditional hardness of Approximate Nearest Neighbor Search (ANN) under the norm with two simple reductions. Our first reduction shows that hardness of a spec…
Evaluating representations by the complexity of learning low-loss predictors
William F. Whitney, Min Jae Song, David Brandfonbrener +2
We consider the problem of evaluating representations of data for use in solving a downstream task. We propose to measure the quality of a representation by the complexity of learn…
Rapid Structural Pruning of Neural Networks with Set-based Task-Adaptive Meta-Pruning
Minyoung Song, Jaehong Yoon, Eunho Yang +1
As deep neural networks are growing in size and being increasingly deployed to more resource-limited devices, there has been a recent surge of interest in network pruning methods,…
Continuous LWE
Joan Bruna, Oded Regev, Min Jae Song +1
We introduce a continuous analogue of the Learning with Errors (LWE) problem, which we name CLWE. We give a polynomial-time quantum reduction from worst-case lattice problems to CL…