Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

Published 2012 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
Authors
Keywords
-
Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 58, Issue 5, Pages 3235-3249
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Online
2012-02-01
DOI
10.1109/tit.2011.2182178

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.