Back to Results
First PageMeta Content
Operations research / Convex analysis / Generalized functions / Convex optimization / Lipschitz continuity / Distribution / Convex function / Vector space / Loss function / Mathematics / Mathematical analysis / Mathematical optimization


Information-theoretic lower bounds on the oracle complexity of convex optimization Alekh Agarwal Computer Science Division UC Berkeley
Add to Reading List

Document Date: 2011-07-20 18:14:16

Open Document

File Size: 164,17 KB

Share Result on Facebook

City

Belmont / Springer-Verlag / /

Company

Cambridge University Press / Oracle / Computer Sciences / /

Country

United States / United Kingdom / /

/

IndustryTerm

particular algorithms / stochastic gradient descent algorithm / /

NaturalFeature

P[b α(MT / α(MT / /

Organization

Cambridge University / Department of EECS / National Science Foundation / UC Berkeley / /

Person

Convex / L. Le Cam / Martin J. Wainwright / John Wiley / Peter Bartlett / /

Position

oracle model / /

Product

Altec XT1 Speakers / /

ProgrammingLanguage

E / L / C / /

ProvinceOrState

Montana / New York / Massachusetts / /

Technology

machine learning / stochastic gradient descent algorithm / /

SocialTag