New method models unknown systems with hidden parameters using neural networks.
problem Modeling unknown dynamical systems with hidden parameters.
method Training a deep neural network (DNN) model using trajectory data of the unknown system.
result DNN model accurately predicts unknown dynamical systems with new initial conditions.
Method learns model for unknown stochastic system from data.
problem Modeling unknown stochastic dynamical systems.
method Autoencoder approach using deep neural networks (DNNs).
result Decoder serves as a predictive model for unknown stochastic systems.
Paper develops PAC-Bayes bounds for unknown linear systems.
problem Learning controllers for unknown stochastic linear discrete-time systems.
method PAC-Bayes framework for data-dependent high probability bounds.
result Proposes efficient learning algorithms with theoretical guarantees.
FML uses neural networks to model unknown systems accurately.
problem Modeling unknown dynamical systems with incomplete data.
method Flow map learning (FML) combined with deep neural networks.
result Accurate predictive models for partially observed systems.
Bayesian method synthesizes barrier certificates for unknown systems with latent states.
problem Certifying safety in systems with unknown dynamics and latent states.
method Bayesian inference with Metropolis-Hastings sampler and sum-of-squares program.
result Probabilistic validity of barrier certificates for unknown systems.
Safety filter for unknown discrete-time systems with learned models and noise covariance.
problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.
Generative ODE model learns unknown variables in medical systems.
problem Estimating unknown variables in complex medical systems.
method Variational autoencoder incorporating known ODE functions.
result Modeling known-unknowns improves system parameter discovery and extrapolation.
DeepONet models system discrepancies with low data.
problem Modeling complex systems with limited data.
method Bi-fidelity modeling using DeepONet for uncertain and partially unknown systems.
result DeepONet effectively models complex systems with parametric uncertainty and partial unknownness.
Bayesian algorithm stabilizes unknown continuous-time systems from unstable data.
problem Learning and stabilizing unknown continuous-time systems with uncertain dynamics.
method Bayesian learning algorithm that learns from unstable data to stabilize the system in finite time.
result The algorithm stabilizes unknown continuous-time stochastic linear systems effectively after a short time period.
Efficient algorithm for unknown linear systems with convex costs.
problem Controlling an unknown linear system with stochastic convex costs.
method Optimism in the Face of Uncertainty paradigm.
result Achieves optimal T \sqrt{T} T regret-rate. Localization of unknown faults in industrial systems is a difficult task for data-driven diagnosis methods. The classification performance of many machine learning methods relies on the quality of training data. Unknown faults, for example faults not represented in training data, can be detected using, for example, ano…
Our objective is to estimate the unknown compositional input from its output response through an unknown system after estimating the inverse of the original system with a training set. The proposed methods using artificial neural networks (ANNs) can compete with the optimal bounds for linear systems, where convex optim…
New algorithm controls systems with unknown, changing losses.
problem Control systems with adversarial perturbations and unknown loss function.
method Efficient sublinear regret algorithm for bandit convex optimization with memory.
result Achieves efficient control with sublinear regret in the presence of unknown, changing losses.
Paper proposes method for optimal control of unknown systems with latent states.
problem Jointly estimating dynamics and latent states in systems with unmeasurable states.
method Combination of particle Markov chain Monte Carlo methods and scenario theory.
result Probabilistic performance guarantees for optimal input trajectories.
Study online control of unknown time-varying systems with negative and positive results.
problem Online control of time-varying systems with unknown dynamics.
method Algorithmic upper bounds and lower bounds for different policy classes.
result Sublinear adaptive regret bounds for Disturbance Response policies.
Develops inverse EKF for non-linear systems with stability guarantees and learning unknown dynamics.
problem Estimating adversary's Kalman-filtered estimates in highly non-linear systems.
method Proposes inverse extended Kalman filter (I-EKF) for second-order, Gaussian sum, and dithered forward models. Uses reproducing kernel Hilbert space for learning unknown dynamics.
result Derives theoretical stability guarantees for inverse second-order EKF.
Identification of patterns from discrete data time-series for statistical inference, threat detection, social opinion dynamics, brain activity prediction has received recent momentum. In addition to the huge data size, the associated challenges are, for example, (i) missing data to construct a closed time-varying compl…
Estimates system parameters from a single observation using kernel-based score.
problem Estimating parameters of a dynamical system from a high-dimensional signal.
method Kernel-based score to compare temporal dependencies between signal and model.
result Accuracy and efficiency demonstrated on chaotic systems.
Greedy policy maximizes information in unknown linear systems.
problem Exploration in unknown linear dynamical systems.
method Online greedy policy maximizing information.
result Competitive performance compared to gradient-based methods.
Guaranteed reachable set for unknown nonlinear systems on manifolds.
problem Determining reachable set for unknown nonlinear systems on manifolds.
method Underapproximations of reachable set using local dynamics and bounds on dynamics rate of change.
result Guaranteed set of reachable states for systems on complete Riemannian manifolds.
KCRL learns stable policies for nonlinear systems with formal guarantees.
problem Lack of stabilization guarantees in RL methods for safety-critical systems.
method KCRL uses Krasovskii's Lyapunov functions as a stability constraint and a primal-dual approach to learn stabilizing policies.
result KCRL guarantees learning a stabilizing policy in a finite number of interactions.
Bayesian framework integrates prior and data knowledge for nonlinear dynamical systems.
problem Fusing diverse prior knowledge with data for accurate model learning.
method General-purpose Bayesian inference and learning framework combining explicit and implicit prior knowledge.
result Efficient parameter marginalization and closed-form densities for online and offline inference.
Improved RL algorithm stabilizes unknown linear systems with polynomial regret.
problem Learning and stabilizing unknown linear dynamical systems.
method Proposes an algorithm with an improved exploration strategy for fast stabilization.
result Achieves i l d e O ( T ) ilde{\mathcal{O}}(\sqrt{T}) i l d e O ( T ) regret after T T T time steps. Deep neural networks with memory learn reduced equations from partial data.
problem Constructing governing equations for unknown dynamical systems from limited data.
method Formulate a discrete approximation of memory integrals, use deep neural networks to incorporate history terms.
result Deep neural networks can learn reduced equations with memory from partial data.
MAGI-X learns unknown dynamics from data without numerical integration.
problem Difficult to propose ODEs in closed-form for complex systems.
method MAGI-X uses neural networks within a manifold-constrained Gaussian process framework.
result MAGI-X achieves competitive accuracy in fitting and forecasting with reduced computational time.
Paper presents a method to reduce prediction variance of DNNs for unknown systems.
problem Uncertainty in DNN predictions due to high variance.
method Ensemble averaging of multiple DNN models trained independently.
result Reduction in variance of DNN predictions, improving reliability.
New bounds quantify estimation error in kernel-based system identification with unknown hyperparameters.
problem Inaccurate error bounds for kernel-based system identification with unknown hyperparameters.
method Construct a high-probability set for true hyperparameters from marginal likelihood, then find worst-case posterior covariance.
result Proposed bounds contain true model with high probability and verified in simulations.
The paper presents a method to infer unknown forcing functions in differential equations using Gaussian processes and adjoints.
problem Inferring unknown forcing functions in differential equations from noisy observations.
method Using adjoint methods to efficiently infer Gaussian process (GP) driven differential equations, with truncated basis expansions of the GP kernel.
result Efficient Bayesian inference of forcing functions modeled as GPs using adjoints, with lower computation than MCMC methods.
Develops inverse extended Kalman filter for predicting adversarial steps.
problem Predicting adversarial Kalman filter estimates from limited information.
method Proposes inverse extended Kalman filter (I-EKF) for non-linear systems with unknown inputs.
result Derives I-EKF with theoretical stability guarantees and consistency proofs.
Method learns dynamics of slow variables from stochastic data.
problem Modeling unknown multiscale stochastic systems with limited data.
method Data-driven approach to learn effective dynamics from bursts of observation data.
result Generative model accurately captures effective dynamics of slow variables.
Study optimal control in unknown nonlinear systems with near-optimal regret bound.
problem Sequential control in unknown, nonlinear dynamical systems.
method LC^3 algorithm, based on information theory.
result Near-optimal O ( T ) O(\sqrt{T}) O ( T ) regret bound for episodic settings. We present a numerical approach for approximating unknown Hamiltonian systems using observation data. A distinct feature of the proposed method is that it is structure-preserving, in the sense that it enforces conservation of the reconstructed Hamiltonian. This is achieved by directly approximating the underlying unkno…
We develop an unsupervised, nonparametric, and scalable statistical learning method for detection of unknown objects in noisy images. The method uses results from percolation theory and random graph theory. We present an algorithm that allows to detect objects of unknown shapes and sizes in the presence of nonparametri…
A theoretical framework that supports automated construction of dynamic prime models purely from experimental time series data has been invented and developed, which can automatically generate (construct) data-driven models of any time series data in seconds. This has resulted in the formulation and formalisation of ne…
Paper tackles SMPC for linear systems with unknown noise distribution.
problem Stochastic MPC for linear systems with chance state constraints and unknown noise distribution.
method Reformulate chance constraints, design robust benchmark SMPC, and develop adaptive SMPC with online noise statistics learning.
result Adaptive SMPC guarantees time-uniform satisfaction of unknown reformulated state constraints with high probability.
The paper presents a model-free method for stabilizing unknown control systems.
problem Stabilizing unknown control systems in engineering.
method Solving discounted LQR problems with increasing discount factors.
result The method efficiently recovers a stabilizing controller for linear and smooth nonlinear systems.
In conventional ODE modelling coefficients of an equation driving the system state forward in time are estimated. However, for many complex systems it is practically impossible to determine the equations or interactions governing the underlying dynamics. In these settings, parametric ODE model cannot be formulated. Her…
MetaCaDI learns causal graphs and unknown interventions from few data instances.
problem Discovering causal mechanisms in systems with high data costs and unknown interventions.
method MetaCaDI is a Bayesian meta-learning framework that optimizes for rapid adaptation to new intervention targets.
result MetaCaDI significantly outperforms state-of-the-art methods in causal graph recovery and intervention target prediction.
In this paper, we consider the task of designing a Kalman Filter (KF) for an unknown and partially observed autonomous linear time invariant system driven by process and sensor noise. To do so, we propose studying the following two step process: first, using system identification tools rooted in subspace methods, we ob…
Two algorithms for nonlinear systems with unknown inputs are compared and implemented.
problem Analysis and comparison of algorithms for nonlinear systems with unknown inputs.
method Two symbolic algorithms, ORC-DF and FISPO, are compared and implemented in a MATLAB toolbox.
result FISPO is more generally applicable, while ORC-DF is more efficient for affine input models.
Develops Φ Φ Φ -DVAE for assimilating unstructured data into physical models.
problem Challenges in incorporating unstructured data into physical models.
method Physics-informed dynamical variational autoencoder ( Φ Φ Φ -DVAE) combining latent state-space model and VAE. result Demonstrates data-efficient dynamics encoding with competitive performance and uncertainty quantification.
Efficient algorithm predicts unknown linear systems with long-term memory.
problem Predicting unknown and partially observed linear dynamical systems with long-term memory.
method Bounding the generalized Kolmogorov width of the Kalman filter model using spectral methods and conducting tight convex relaxation.
result Competes with Kalman filter in hindsight with only logarithmic regret.
DUE framework models unknown equations from data using deep learning.
problem Unknown equations in complex systems.
method Data-driven modeling using deep learning techniques.
result Framework capable of learning various types of unknown equations.
New model stabilizes asynchronous LTI systems, independent of synchronous stability.
problem Stability of asynchronous LTI systems under randomization and asynchrony.
method Introduced a new model for random asynchronous LTI systems and developed a method for system identification.
result Stability of random asynchronous LTI systems is independent of synchronous stability.
Bayesian ODEs with Gaussian processes infer unknown dynamics from data.
problem Estimating unknown continuous-time system dynamics from data.
method Bayesian nonparametric model using Gaussian processes, sparse variational inference, probabilistic shooting.
result Posterior predictive uncertainty scores outperform alternative methods on multiple ODE learning tasks.
Regret analysis is challenging in Multi-Agent Reinforcement Learning (MARL) primarily due to the dynamical environments and the decentralized information among agents. We attempt to solve this challenge in the context of decentralized learning in multi-agent linear-quadratic (LQ) dynamical systems. We begin with a simp…
Survey on deep learning for malware classification, including unknown threats.
problem Classifying and recognizing unknown malware variants.
method Review of deep learning techniques and OSR solutions.
result Deep learning can effectively classify known malware and recognize unknown threats.
This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.
problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O ( T ) \mathcal{O}(\sqrt{T}) O ( T ) regret, improving to O ( p o l y l o g ( T ) ) \mathcal{O}(polylog(T)) O ( p o l y l o g ( T )) with partial knowledge.