New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.
Brian BrubachKarthik Abinav SankararamanAravind SrinivasanPan XuPublished in: CoRR (2016)
Keyphrases
- theoretical analysis
- error bounds
- probabilistic model
- computationally efficient
- computational complexity
- neural network
- mathematical model
- learning algorithm
- lower bound
- significant improvement
- cost function
- computational cost
- similarity measure
- upper bound
- online learning
- high level
- parameter estimation
- genetic algorithm
- real time
- linear regression
- learning models
- stochastic processes