Regular price €82.99
Title
Quantity:
Will Deliver When Available
Will Deliver When Available
14 days return policy Shipping & Delivery
A01=Matus Telgarsky
A01=Miroslav Dudik
A01=Robert E. Schapire
Author_Matus Telgarsky
Author_Miroslav Dudik
Author_Robert E. Schapire
Category=PBKD
Category=PBU
Category=UYQM
eq_bestseller
eq_computing
eq_isMigrated=1
eq_nobargain
eq_non-fiction
forthcoming

Product details

  • ISBN 9780691261126
  • Dimensions: 178 x 254mm
  • Publication Date: 01 Dec 2026
  • Publisher: Princeton University Press
  • Publication City/Country: US
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

From three of today’s top researchers in machine learning, a groundbreaking new theory for understanding convex minimization at infinity

Numerous fields of study rely on methods for minimizing convex functions. Not all convex functions, however, have finite minimizers; some can only be minimized by a sequence as it heads to infinity, making it considerably more challenging to prove correct convergence to a minimizer.

This book develops an expansive new theory for understanding such minimizers at infinity, introducing astral space, a compact extension of Euclidean space to which such points at infinity have been added. Astral space is constructed to be as small as possible while still ensuring that all linear functions can be continuously extended to the new space. These favorable properties make it especially compatible with standard convex analysis, whose key notions are systematically extended to the new space, providing the foundation for a more complete theory.

Astral space includes Euclidean space but is neither a vector space nor a metric space. Nevertheless, it is sufficiently well-structured to admit useful and meaningful extensions of the most important concepts from convex analysis, including convexity of sets and functions, conjugacy, separation theorems, subdifferentials, as well as central topics from optimization and applications, such as Fenchel duality, KKT conditions, and exponential-family distributions. Applied to widely used algorithms, these tools afford simplified proofs of convergence, even when the only minimizers are at infinity.

All these and more are fully explored and elucidated with care and rigor, beginning with a review of general topology and convex analysis, with numerous figures and examples throughout.

Miroslav Dudík is senior principal research manager at Microsoft Research in New York City and cofounder of Fairlearn, an open-source project for algorithmic fairness. Robert E. Schapire is partner researcher at Microsoft Research in New York City and the coauthor (with Yoav Freund) of Boosting: Foundations and Algorithms. Matus Telgarsky is associate professor at the Courant Institute School of Mathematics, Computing, and Data Science at New York University.

More from this author