Muutke küpsiste eelistusi

E-raamat: Bandit Convex Optimisation

(Google DeepMind, London)
  • Formaat: PDF+DRM
  • Ilmumisaeg: 19-Mar-2026
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781009607582
  • Formaat - PDF+DRM
  • Hind: 61,75 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Ilmumisaeg: 19-Mar-2026
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781009607582

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This comprehensive reference brings readers to the frontier of research on bandit convex optimization or zeroth-order convex optimization. The focus is on theoretical aspects, with short, self-contained chapters covering all the necessary tools from convex optimization and online learning, including gradient-based algorithms, interior point methods, cutting plane methods and information-theoretic machinery. The book features a large number of exercises, open problems and pointers to future research directions, making it ideal for students as well as researchers.

Arvustused

'A landmark text on bandit convex optimization by an authority in the field. This book develops the full theory of zeroth-order online convex optimization-where one must learn from noisy function values without gradients-establishing regret bounds and presenting elegant algorithms from gradient descent to cutting planes, multiplicative updates, and Newton methods. Touching on all areas central to advanced optimization, it is an essential companion for researchers, offering both the conceptual foundations and the algorithmic toolkit that continue to drive progress in online convex optimization and mathematical optimization more broadly.' Elad Hazan, Princeton University

Muu info

A comprehensive reference for the theory of bandit convex optimization (zeroth-order optimisation) for researchers and students.
Preface;
1. Introduction and problem statement;
2. Overview of methods
and history;
3. Mathematical tools;
4. Bisection in one dimension;
5. Online
gradient descent;
6. Self-concordant regularisation;
7. Linear and quadratic
bandits;
8. Exponential weights;
9. Cutting plane methods;
10. Online Newton
step;
11. Online Newton step for adversarial losses;
12. Gaussian optimistic
smoothing;
13. Submodular minimisation;
14. Outlook; Appendix A.
Miscellaneous; Appendix B. Concentration; Appendix C. Notation; Bibliography;
Index.
Tor Lattimore is a researcher at Google DeepMind working on reinforcement learning, bandits, optimisation and the theory of machine learning. He is the co-author of an introductory book on bandit algorithms and has published nearly 100 conference and journal articles. He is an action editor for the Journal of Machine Learning Research.