Introduction to Online Control (Hardcover)
暫譯: 線上控制導論 (精裝版)
Hazan, Elad, Singh, Karan
- 出版商: Cambridge
- 出版日期: 2026-03-26
- 售價: $2,490
- 貴賓價: 9.8 折 $2,440
- 語言: 英文
- 頁數: 171
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 1009499661
- ISBN-13: 9781009499668
-
相關分類:
Reinforcement
海外代購書籍(需單獨結帳)
商品描述
This tutorial guide introduces online nonstochastic control, an emerging paradigm in control of dynamical systems and differentiable reinforcement learning that applies techniques from online convex optimization and convex relaxations to obtain new methods with provable guarantees for classical settings in optimal and robust control. In optimal control, robust control, and other control methodologies that assume stochastic noise, the goal is to perform comparably to an offline optimal strategy. In online control, both cost functions and perturbations from the assumed dynamical model are chosen by an adversary. Thus, the optimal policy is not defined a priori and the goal is to attain low regret against the best policy in hindsight from a benchmark class of policies. The resulting methods are based on iterative mathematical optimization algorithms and are accompanied by finite-time regret and computational complexity guarantees. This book is ideal for graduate students and researchers interested in bridging classical control theory and modern machine learning.
商品描述(中文翻譯)
這本教程指南介紹了在線非隨機控制(online nonstochastic control),這是一種新興的動態系統控制和可微增強學習的範式,應用了在線凸優化(online convex optimization)和凸放鬆(convex relaxations)技術,以獲得在最佳和穩健控制的經典設置中具有可證明保證的新方法。在最佳控制、穩健控制及其他假設隨機噪聲的控制方法中,目標是與離線最佳策略表現相當。在在線控制中,成本函數和來自假設動態模型的擾動都是由對手選擇的。因此,最佳策略並不是事先定義的,目標是相對於基準策略類別中的最佳策略在事後達到低後悔(low regret)。所得到的方法基於迭代數學優化算法,並附有有限時間的後悔和計算複雜度保證。本書非常適合對橋接經典控制理論和現代機器學習感興趣的研究生和研究人員。