{"ID":2844981,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.05339","arxiv_id":"2511.05339","title":"Convexity and strict convexity for compositional neural networks in high-dimensional optimal control","abstract":"Neural networks (NNs) have emerged as powerful tools for solving high-dimensional optimal control problems. In particular, their compositional structure has been shown to enable efficient approximation of high-dimensional functions, helping to mitigate the curse of dimensionality in optimal control problems. In this work, we build upon the theoretical framework developed by Kang \u0026 Gong (SIAM J. Control Optim. 60(2):786-813, 2022), particularly their results on NN approximations for compositional functions in optimal control. Theorem 6.2 in Kang \u0026 Gong (SIAM J. Control Optim. 60(2):786-813, 2022) establishes that, under suitable assumptions on the compositional structure and its associated features, optimal control problems with strictly convex cost functionals admit a curse-of-dimensionality-free approximation of the optimal control by NNs. We extend this result in two directions. First, we analyze the strict convexity requirement on the cost functional and demonstrate that reformulating a discrete-time optimal control problem with linear transitions and stage costs as a terminal cost problem ensures the necessary strict convexity. Second, we establish a generalization of Theorem 6.2 in Kang \u0026 Gong (SIAM J. Control Optim. 60(2):786-813, 2022) which provides weak error bounds for optimal control approximations by NNs when the cost functional is only convex rather than strictly convex.","short_abstract":"Neural networks (NNs) have emerged as powerful tools for solving high-dimensional optimal control problems. In particular, their compositional structure has been shown to enable efficient approximation of high-dimensional functions, helping to mitigate the curse of dimensionality in optimal control problems. In this wo...","url_abs":"https://arxiv.org/abs/2511.05339","url_pdf":"https://arxiv.org/pdf/2511.05339v1","authors":"[\"Lars Grüne\",\"Konrad Kleinberg\",\"Thomas Kruse\",\"Mario Sperl\"]","published":"2025-11-07T15:34:44Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}
