Lattimore Tor (35 results)

Hardcover. Condition: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Condition: New. 1. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.

hardcover. Condition: Very Good.

Condition: New.

Hardback or Cased Book. Condition: New. Bandit Algorithms. Book.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Hardback. Condition: New. 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.…

Condition: As New. Unread book in perfect condition.

Hardback. Condition: New. Decision-making in the face of uncertainty is a significant challenge in machine learning, and the multi-armed bandit model is a commonly used framework to address it. This comprehensive and rigorous introduction to the multi-armed bandit problem examines all the major settings, including stochastic, adversarial, and Bayesian frameworks. A focus on both mathematical intuition and carefully worked proofs makes this an excellent reference for established researchers and a helpful resource for graduate students in computer science, engineering, statistics, applied mathematics and economics. Linear bandits receive special attention as one of the most useful models in applications, while other chapters are dedicated to combinatorial bandits, ranking, non-stationary problems, Thompson sampling and pure exploration. The book ends with a peek into the world beyond bandits with an introduction to partial monitoring and learning in Markov decision processes.…

Condition: New.

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: New. 2020. Hardcover. . . . . .

Condition: New. 2026. hardcover. . . . . .

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Hardcover. Condition: Brand New. 280 pages. 6.00x0.69x9.00 inches. In Stock.

Condition: New. 2020. Hardcover. . . . . . Books ship from the US and Ireland.

Hardcover. Condition: Brand New. 517 pages. 9.50x7.00x1.25 inches. In Stock.

Condition: New. 2026. hardcover. . . . . . Books ship from the US and Ireland.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Hardback. Condition: New. 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.…

Hardback. Condition: New. Decision-making in the face of uncertainty is a significant challenge in machine learning, and the multi-armed bandit model is a commonly used framework to address it. This comprehensive and rigorous introduction to the multi-armed bandit problem examines all the major settings, including stochastic, adversarial, and Bayesian frameworks. A focus on both mathematical intuition and carefully worked proofs makes this an excellent reference for established researchers and a helpful resource for graduate students in computer science, engineering, statistics, applied mathematics and economics. Linear bandits receive special attention as one of the most useful models in applications, while other chapters are dedicated to combinatorial bandits, ranking, non-stationary problems, Thompson sampling and pure exploration. The book ends with a peek into the world beyond bandits with an introduction to partial monitoring and learning in Markov decision processes.…

Hardcover. Condition: new. Hardcover. 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. This self-contained reference brings readers to the frontier of research on bandit convex optimization while presenting fundamental tools from convex optimization such as gradient-based algorithms, interior point methods and cutting plane methods. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Condition: New. PRINT ON DEMAND.