4 citations · 18 across the 38 of their papers we have counts for
4 papers · 1 filter
Near-Linear Sample Complexity for Polynomial Regression
Raphael A. Meyer, Cameron Musco, Christopher Musco +2
We study polynomial regression. Given query access to a function , the goal is to find a degree polynomial such that, for a giv…
Adaptive Sketches for Robust Regression with Importance Sampling
Sepideh Mahabadi, David P. Woodruff, Samson Zhou
We introduce data structures for solving robust regression through stochastic gradient descent (SGD) by sampling gradients with probability proportional to their norm, i.e., import…
Memory Bounds for the Experts Problem
Vaidehi Srinivas, David P. Woodruff, Ziyu Xu +1
Online learning with expert advice is a fundamental problem of sequential prediction. In this problem, the algorithm has access to a set of "experts" who make predictions on ea…
Fast Regression for Structured Inputs
Raphael A. Meyer, Cameron Musco, Christopher Musco +2
We study the regression problem, which requires finding that minimizes for a matrix $\mathbf{A}\in\mat…