Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness.
Igor Carboni OliveiraRahul SanthanamPublished in: Computational Complexity Conference (2017)
Keyphrases
- lower bound
- learning algorithm
- upper bound
- online algorithms
- branch and bound algorithm
- sample complexity
- branch and bound
- machine learning algorithms
- objective function
- active learning
- machine learning
- learning problems
- high speed
- lower and upper bounds
- np hard
- randomly generated problems
- optimal solution
- worst case
- quadratic assignment problem
- learning process
- learning tasks
- back propagation
- decision tree learning
- lower bounding
- electronic circuits
- reinforcement learning
- efficient learning
- circuit design
- set of randomly generated instances
- neural network
- linear programming relaxation
- upper and lower bounds
- training examples
- learning scheme
- learning rate
- generalization error
- supervised learning
- deep architectures
- analog vlsi
- training samples