Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes.
Alessio MazzettoCristina MenghiniAndrew YuanEli UpfalStephen H. BachPublished in: CoRR (2022)
Keyphrases
- lower bound
- worst case
- upper bound
- theoretical guarantees
- np hard
- branch and bound
- branch and bound algorithm
- knowledge transfer
- optimal solution
- average case
- running times
- error bounds
- greedy algorithm
- approximation algorithms
- objective function
- lower and upper bounds
- upper and lower bounds
- worst case bounds
- constant factor
- approximation guarantees
- lower bounding
- space complexity
- attribute values
- multi attribute
- vc dimension
- concept classes
- sample size
- active learning
- linear programming relaxation
- scheduling problem
- optimal cost
- randomly generated problems