The Generative Capacity of the Lambek-Grishin Calculus: A New Lower Bound.
Matthijs MelissenPublished in: FG (2009)
Keyphrases
- lower bound
- upper bound
- generative model
- branch and bound algorithm
- branch and bound
- optimal solution
- worst case
- np hard
- unsupervised learning
- upper and lower bounds
- constant factor
- lower and upper bounds
- sufficiently accurate
- probabilistic model
- discriminative learning
- lagrangian relaxation
- objective function
- sample complexity
- integer programming
- online algorithms
- competitive ratio
- search algorithm
- high capacity
- polynomial approximation
- data driven