130 citations · 272 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 2 cited
Multiplying Matrices Without Multiplying
Davis Blalock, John Guttag
Multiplying matrices is among the most fundamental and compute-intensive operations in machine learning. Consequently, there has been significant work on efficiently approximating…
cs.LG2021★ 8 cited
Causally motivated Shortcut Removal Using Auxiliary Labels
Maggie Makar, Ben Packer, Dan Moldovan +3
Shortcut learning, in which models make use of easy-to-represent but unstable associations, is a major failure mode for robust machine learning. We study a flexible, causally-motiv…