Second, finding the action that maximizes Q(s, a; θ) requires the prediction of all N K possible actions, which is intractable.
we need a procedure to approximate the predicted optimal action from a combinatorial action space.