1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
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…
cs.DS2022★ 1 cited
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…