arXiv Open Access 2017

Lower Bound for Randomized First Order Convex Optimization

Blake Woodworth Nathan Srebro

Lihat Sumber

Abstrak

We provide an explicit construction and direct proof for the lower bound on the number of first order oracle accesses required for a randomized algorithm to minimize a convex Lipschitz function.

Topik & Kata Kunci

math.OC

Penulis (2)

Blake Woodworth

Nathan Srebro

Format Sitasi

APA MLA BibTeX

Woodworth, B., Srebro, N. (2017). Lower Bound for Randomized First Order Convex Optimization. https://arxiv.org/abs/1709.03594

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓