✦ LIBER ✦

A lower bound on complexity of optimization under the -fold integrated Wiener measure

✍ Scribed by James M. Calvin

Book ID: 108163830
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 240 KB
Volume: 27
Category: Article
ISSN: 0885-064X
DOI: 10.1016/j.jco.2010.10.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lower bounds on the complexity of sol

On lower bounds on the complexity of solution of integral equations

✍ I. V. Boikov 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 281 KB

A One-Dimensional Optimization Algorithm

A One-Dimensional Optimization Algorithm and Its Convergence Rate under the Wiener Measure

✍ James M. Calvin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 258 KB

In this paper we describe an adaptive algorithm for approximating the global minimum of a continuous function on the unit interval, motivated by viewing the function as a sample path of a Wiener process. It operates by choosing the next observation point to maximize the probability that the objectiv

A Lower Bound on the Complexity of Arbit

A Lower Bound on the Complexity of Arbitrary Switching Function Realizers

✍ Hansalik, W.E. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 548 KB

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Information-Theoretic Lower Bounds on th

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

✍ Agarwal, A.; Bartlett, P.L.; Ravikumar, P.; Wainwright, M.J. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 401 KB

An Optimal Lower Bound on the Communicat

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

✍ Chakrabarti, Amit; Regev, Oded 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 278 KB