Items related to Deployment-Time Optimization of AI: Robustness, Compression,...
Deployment-Time Optimization of AI: Robustness, Compression, Evaluation, Inference, and Adaptive Environments - Softcover
Synopsis
What changes when a trained model leaves the training cluster and becomes a deployed AI system? The optimization problem changes with it. Threat models, serving budgets, evaluation protocols, users, tools, and feedback loops now shape what can be optimized—and what must be guaranteed, measured, compressed, routed, or constrained.
This graduate-level text develops a mathematical account of those deployment-induced decisions. It begins with robust value functions, minimax structure, adversarial training dynamics, distributionally robust optimization, robust generalization, and certification. It then turns to the system-level problems that dominate modern foundation-model deployment: curvature-aware compression and rate–distortion tradeoffs; evaluation as a problem of estimands, information, and adversarial search; threat models and reachability for language models and agents; and inference-time optimization through sampling, verification, speculative decoding, routing, cascades, and cache decisions. The final chapters study deployment games in which resources can improve quality while also expanding adversarial exposure, responsive environments in which users change the data distribution, and lifecycle questions involving continual learning, machine unlearning, privacy, and feedback into the next training run.
Rather than serving as an adversarial-ML catalog or an LLM serving handbook, Deployment-Time Optimization for AI Systems focuses on durable mathematical objects: value functions, feasible sets, rate–distortion frontiers, estimands, reachability sets, and shadow prices. It is designed for graduate students, researchers, and engineers who want to reason rigorously about how foundation models become deployed systems under statistical, adversarial, computational, economic, and lifecycle constraints.
"synopsis" may belong to another edition of this title.
Search results for Deployment-Time Optimization of AI: Robustness, Compression,...
Stock Image
Deployment-Time Optimization of AI (Paperback)
Print on DemandSeller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. What changes when a trained model leaves the training cluster and becomes a deployed AI system? The optimization problem changes with it. Threat models, serving budgets, evaluation protocols, users, tools, and feedback loops now shape what can be optimized-and what must be guaranteed, measured, compressed, routed, or constrained. This graduate-level text develops a mathematical account of those deployment-induced decisions. It begins with robust value functions, minimax structure, adversarial training dynamics, distributionally robust optimization, robust generalization, and certification. It then turns to the system-level problems that dominate modern foundation-model deployment: curvature-aware compression and rate-distortion tradeoffs; evaluation as a problem of estimands, information, and adversarial search; threat models and reachability for language models and agents; and inference-time optimization through sampling, verification, speculative decoding, routing, cascades, and cache decisions. The final chapters study deployment games in which resources can improve quality while also expanding adversarial exposure, responsive environments in which users change the data distribution, and lifecycle questions involving continual learning, machine unlearning, privacy, and feedback into the next training run. Rather than serving as an adversarial-ML catalog or an LLM serving handbook, Deployment-Time Optimization for AI Systems focuses on durable mathematical objects: value functions, feasible sets, rate-distortion frontiers, estimands, reachability sets, and shadow prices. It is designed for graduate students, researchers, and engineers who want to reason rigorously about how foundation models become deployed systems under statistical, adversarial, computational, economic, and lifecycle constraints. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9798907070196
Stock Image
Deployment-Time Optimization of AI
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9798907070196
Stock Image
Deployment-Time Optimization of AI
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9798907070196
Buy New
US$ 52.01
US$ 4.42 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Deployment-Time Optimization of AI: Robustness, Compression, Evaluation, Inference, and Adaptive Environments
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9798907070196
Stock Image
Deployment-Time Optimization of AI (Paperback)
Print on DemandSeller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. What changes when a trained model leaves the training cluster and becomes a deployed AI system? The optimization problem changes with it. Threat models, serving budgets, evaluation protocols, users, tools, and feedback loops now shape what can be optimized-and what must be guaranteed, measured, compressed, routed, or constrained. This graduate-level text develops a mathematical account of those deployment-induced decisions. It begins with robust value functions, minimax structure, adversarial training dynamics, distributionally robust optimization, robust generalization, and certification. It then turns to the system-level problems that dominate modern foundation-model deployment: curvature-aware compression and rate-distortion tradeoffs; evaluation as a problem of estimands, information, and adversarial search; threat models and reachability for language models and agents; and inference-time optimization through sampling, verification, speculative decoding, routing, cascades, and cache decisions. The final chapters study deployment games in which resources can improve quality while also expanding adversarial exposure, responsive environments in which users change the data distribution, and lifecycle questions involving continual learning, machine unlearning, privacy, and feedback into the next training run. Rather than serving as an adversarial-ML catalog or an LLM serving handbook, Deployment-Time Optimization for AI Systems focuses on durable mathematical objects: value functions, feasible sets, rate-distortion frontiers, estimands, reachability sets, and shadow prices. It is designed for graduate students, researchers, and engineers who want to reason rigorously about how foundation models become deployed systems under statistical, adversarial, computational, economic, and lifecycle constraints. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9798907070196
Buy New
US$ 57.40
US$ 49.70 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Deployment-Time Optimization of AI : Robustness, Compression, Evaluation, Inference, and Adaptive Environments
Published by
Amazon Digital Services LLC - Kdp Aug 2026, 2026
ISBN 13: 9798907070196
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware - What changes when a trained model leaves the training cluster and becomes a deployed AI system The optimization problem changes with it. Threat models, serving budgets, evaluation protocols, users, tools, and feedback loops now shape what can be optimized-and what must be guaranteed, measured, compressed, routed, or constrained. This graduate-level text develops a mathematical account of those deployment-induced decisions. It begins with robust value functions, minimax structure, adversarial training dynamics, distributionally robust optimization, robust generalization, and certification. It then turns to the system-level problems that dominate modern foundation-model deployment: curvature-aware compression and rate-distortion tradeoffs; evaluation as a problem of estimands, information, and adversarial search; threat models and reachability for language models and agents; and inference-time optimization through sampling, verification, speculative decoding, routing, cascades, and cache decisions. The final chapters study deployment games in which resources can improve quality while also expanding adversarial exposure, responsive environments in which users change the data distribution, and lifecycle questions involving continual learning, machine unlearning, privacy, and feedback into the next training run. Rather than serving as an adversarial-ML catalog or an LLM serving handbook, Deployment-Time Optimization for AI Systems focuses on durable mathematical objects: value functions, feasible sets, rate-distortion frontiers, estimands, reachability sets, and shadow prices. It is designed for graduate students, researchers, and engineers who want to reason rigorously about how foundation models become deployed systems under statistical, adversarial, computational, economic, and lifecycle constraints. Seller Inventory # 9798907070196
Buy New
US$ 80.77
US$ 39.22 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available