1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2026
Learning Depth-3 Circuits with Polynomial Savings
Xi Chen, Animesh Fatehpuria, Shyamal Patel +1
We study the challenging problem of learning depth-three circuits in the mistake-bound model of (realizable) online learning, which is a more difficult model than distribution-free…
cs.DS2019★ 1 cited
A Fast Minimum Degree Algorithm and Matching Lower Bound
Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria
The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly hal…