9 citations · 19 across the 5 of their papers we have counts for
3 papers · 1 filter
Optimal Sketching Bounds for Sparse Linear Regression
Tung Mai, Alexander Munteanu, Cameron Musco +3
We study oblivious sketching for -sparse linear regression under various loss functions such as an norm, or from a broad class of hinge-like loss functions, which inclu…
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries
Raghavendra Addanki, Andrew McGregor, Cameron Musco
We study the problem of estimating the number of edges in an -vertex graph, accessed via the Bipartite Independent Set query model introduced by Beame et al. (ITCS '18). In this…
Intervention Efficient Algorithms for Approximate Learning of Causal Graphs
Raghavendra Addanki, Andrew McGregor, Cameron Musco
We study the problem of learning the causal relationships between a set of observed variables in the presence of latents, while minimizing the cost of interventions on the observed…