The LaSO framework relies on a monotonicity assumption: given a structure and a node " in the search space, we must be able to calculate whether it is possible for this node , where weights correspond to features of search space nodes and inputs.
we write as a function that takes a pair of an input and a node in the search space " and produces a vector of features.