Search Results for author:
Found 4 papers, 1 papers with code
Majority-of-Three: The Simplest Optimal Learner?
Furthermore, we prove a near-optimal high-probability bound on this algorithm's error.
Sparse Dimensionality Reduction Revisited
In this work, we revisit sparse embeddings and identify a loophole in the lower bound.
AdaBoost is not an Optimal Weak to Strong Learner
AdaBoost is a classic boosting algorithm for combining multiple inaccurate classifiers produced by a weak learner, to produce a strong learner with arbitrarily high accuracy when given enough training data.
The Fast Johnson-Lindenstrauss Transform is Even Faster
In this work, we give a surprising new analysis of the Fast JL transform, showing that the $k \ln^2 n$ term in the embedding time can be improved to $(k \ln^2 n)/\alpha$ for an $\alpha = \Omega(\min\{\varepsilon^{-1}\ln(1/\varepsilon), \ln n\})$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
