Improved bounds on the sample complexity of learning
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Saved in:
Main Authors: | Li, Yi, Long, Philip M., Srinivasan, Aravind |
---|---|
Other Authors: | MATERIALS SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/43158 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Improved bounds on the sample complexity of learning
by: Li, Y., et al.
Published: (2013) -
On the sample complexity of learning functions with bounded variation
by: Long, Philip M.
Published: (2014) -
Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems
by: Srinivasan, Aravind
Published: (2014) -
Improved bounds about on-line learning of smooth-functions of a single variable
by: Long, P.M.
Published: (2013) -
Improved bounds for the randomized decision tree complexity of recursive majority
by: Magniez, F., et al.
Published: (2014)