Regret bounds for online-learning-based linear quadratic control under database attacks
From MaRDI portal
Recommendations
- Logarithmic regret in online linear quadratic control using Riccati updates
- Regret bounded by gradual variation for online convex optimization
- Controlling unknown linear dynamics with bounded multiplicative regret
- Adversarial laws of large numbers and optimal regret in online classification
- LQG online learning
- Control-based algorithms for high dimensional online learning
- Linear Minimax Regret Estimation of Deterministic Parameters with Bounded Data Uncertainties
- Near-optimal regret bounds for reinforcement learning
- Quantized data‐based iterative learning control under denial‐of‐service attacks
Cites work
- Adaptive Linear Quadratic Gaussian Control: The Cost-Biased Approach Revisited
- Efficient Computations of a Security Index for False Data Attacks in Power Networks
- On adaptive linear-quadratic regulators
- On the computational complexity of the secure state-reconstruction problem
- Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
- Stealthy deception attacks on water SCADA systems
Cited in
(2)
This page was built for publication: Regret bounds for online-learning-based linear quadratic control under database attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163981)
