Hidden yet quantifiable: A lower bound for confounding strength using randomized trials.
Piersilvio De BartolomeisJavier AbadKonstantin DonhauserFanny YangPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- randomized algorithms
- randomized algorithm
- optimal solution
- branch and bound
- branch and bound algorithm
- objective function
- lower bounding
- np hard
- worst case
- vc dimension
- data sets
- sample complexity
- linear programming relaxation
- hidden information
- neural network
- search algorithm
- knapsack problem
- machine learning