4 citations · 6 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021★ 1 cited
Learning Linear Models Using Distributed Iterative Hessian Sketching
Han Wang, James Anderson
This work considers the problem of learning the Markov parameters of a linear system from observed data. Recent non-asymptotic system identification results have characterized the…
math.CO2021★ 4 cited
Coloring graphs with forbidden bipartite subgraphs
James Anderson, Anton Bernshteyn, Abhishek Dhawan
A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph , there is a constant such that if is an -free graph of maximum degree , then $χ(G)…