Searching for Interactions in Linear Time

Searching for Interactions in Linear Time

Neyman Seminar
May 5, 2021, 04:00 PM - 05:00 PM | On Zoom Evans Hall | Happening As Scheduled
Feng Ruan, UC Berkeley

We tackle the problem of variable selection with a focus on discovering interactions between variables. With p variables, there are O(p^k) possible interactions of order k making exhaustive search infeasible.
We show that it is nonetheless possible to identify the variables involved in interactions (of any order) with only linear computation cost, O(p), and in a nonparametric fashion.
Our...