Search Results for author:
Found 3 papers, 1 papers with code
Learning with Comparison Feedback: Online Estimation of Sample Statistics
We study an online version of the noisy binary search problem where feedback is generated by a non-stochastic adversary rather than perturbed by random noise.
Tight Dimensionality Reduction for Sketching Low Degree Polynomial Kernels
We give a new analysis of this sketch, providing nearly optimal bounds.
A Data Prism: Semi-Verified Learning in the Small-Alpha Regime
This setting can be viewed as an instance of the semi-verified learning model introduced in [CSV17], which explores the tradeoff between the number of items evaluated by each worker and the fraction of good evaluators.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
