Learning switched systems from simulation models
원문 초록
The design of decision and control strategies for switched systems typically requires complete knowledge of (i) mathematical models of the subsystems and (ii) restrictions on admissible switches between the subsystems. We propose an active learning algorithm that infers (i) and (ii) for discrete-time switched systems whose subsystems dynamics are governed by sets of scalar polynomials and switching signals are constrained by automata. We collect data from gray-box simulation models of the switched systems for this purpose. Our technique for learning (i) involves linear algebraic tools, while for learning (ii) we employ a modified version of the well-known $L^*$-algorithm from machine learning literature. A numerical example is presented to demonstrate our learning algorithm.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Near-Polynomially Competitive Active Logistic Regression
CriticLean: Critic-Guided Reinforcement Learning for Mathematical Formalization
Active Learning for Manifold Gaussian Process Regression
The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning
Info-Coevolution: An Efficient Framework for Data Model Coevolution
ALINE: Joint Amortization for Bayesian Inference and Active Data Acquisition
토론
이 논문과 연결된 포럼 글이 아직 없습니다.