Research
Robust Least-Squares Optimization for Data-Driven Predictive Control: A Geometric Approach
arXiv:2511.09242v2 Announce Type: replace-cross Abstract: The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizi
arXiv:2511.09242v2 Announce Type: replace-cross Abstract: The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizing residual error for fixed or perturbed data, we interpret least-squares as enforcing approximate subspace inclusion between measured and true data spaces. The uncertainty in this geometric relation is modeled as a metric ball on the Grassmannian manifold, leading to a min-max problem over Euclidean and manifold variables. The inner maximization admits a closed-form solution, enabling an efficient algorithm with a transparent geometric interpretation. Applied to robust finite-horizon linear-quadratic tracking in data-enabled predictive control, the method improves upon existing robust least-squares formulations, achieving stronger robustness and favorable scaling under small uncertainty.
Related
- Distributionally Robust Regret Optimal Control Under Moment-Based Ambiguity Sets
- A Machine Learning Approach to Two-Stage Adaptive Robust Optimization
- Exploiting Differential Flatness for Efficient Learning-based Model Predictive Control of Constrained Multi-Input Control Affine Systems
- Controller Design for Structured State-space Models via Contraction Theory
Source: arXiv cs.LG | 2026-04-28