Information-theoretic lower bounds on the oracle complexity of convex optimization
| Contribuinte(s) |
Bengio, Y Schuurmans, D Lafferty, J Williams, C Culotta, A |
|---|---|
| Data(s) |
2009
|
| Identificador | |
| Publicador |
Neural Information Processing Systems (NIPS) Foundation |
| Relação |
Agarwal, Alekh, Bartlett, Peter, Ravikumar, Pradeep, & Wainwright, Martin (2009) Information-theoretic lower bounds on the oracle complexity of convex optimization. In Bengio, Y, Schuurmans, D, Lafferty, J, Williams, C, & Culotta, A (Eds.) Advances in Neural Information Processing Systems 22: Proceedings of the 2009 Conference, 7 - 10 December, 2009, Canada. |
| Tipo |
Conference Paper |
