Hidden yet quantifiable: A lower bound for confounding strength using randomized trials.
Piersilvio De BartolomeisJavier Abad MartinezKonstantin DonhauserFanny YangPublished in: AISTATS (2024)
Keyphrases
- lower bound
- randomized algorithms
- upper bound
- randomized algorithm
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- np hard
- decision forest
- lower bounding
- worst case
- optimal solution
- objective function
- upper and lower bounds
- constant factor
- information retrieval
- polynomial approximation
- linear programming relaxation
- sufficiently accurate
- theoretical analysis
- search space
- search algorithm
- case study
- website
- e learning