Learning to control linear systems is statistically hard, especially for underactuated systems.
problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.
Stable deep models learn dynamical systems with formal stability guarantees.
problem Difficulties in making formal claims about stability of deep network dynamics models.
method Jointly learning a dynamics model and Lyapunov function to ensure non-expansiveness.
result Proposes an approach for stable deep learning of dynamical systems.
Federated learning has been a hot research topic in enabling the collaborative training of machine learning models among different organizations under the privacy restrictions. As researchers try to support more machine learning models with different privacy-preserving approaches, there is a requirement in developing s…
Method learns to map dynamics of different systems.
problem Mapping dynamics of different systems.
method Learned latent dynamical system for mapping.
result Learned correspondences enable imagined motions and bisimulation.
Paper discusses flaws in traditional RL for lifelong learning.
problem Traditional RL fails to model lifelong learning systems.
method Simplified prototype of lifelong RL system.
result Insights into lifelong RL, showing traditional RL's limitations.
Paper explores physics-informed deep learning for system reliability assessment.
problem Limited study on deep learning for system reliability assessment.
method Physics-informed deep learning approach for system reliability assessment.
result Physics-informed deep learning can alleviate computational challenges and combine measurement data and mathematical models.
Proposes a RL method using simulators for stabilizing uncertain systems.
problem Limited experiences and potential dangerous actions during RL learning of real systems.
method Two-stage approach: virtual systems for Q-function learning, real system interactions for final policy.
result Proposed method improves RL performance in uncertain discrete-time systems.
Optimizes exploration for nonlinear systems to learn controllers efficiently.
problem Learning optimal controllers for unknown nonlinear systems.
method Formally quantifies which parameters are most critical, and develops an algorithm to efficiently explore these parameters.
result Proves a near-instance-optimal rate for learning controllers.
Study learns dynamics of linear systems from multiple short trajectories.
problem Learning dynamics of autonomous linear systems from multiple short trajectories.
method Finite sample analysis for stable and unstable systems, adjusting trajectory length for marginally stable systems.
result Learning rate of O ( 1 N ) \mathcal{O}(\frac{1}{\sqrt{N}}) O ( N 1 ) for both stable and unstable systems. New online learning algorithms improve cyberattack detection in industrial control systems.
problem Detecting cyberattacks in industrial control systems with limited resources.
method Online learning algorithms to process continuous data streams and address class imbalance.
result Improved detection rate of cyberattacks in industrial control systems.
Active learning method estimates nonlinear systems efficiently.
problem Identifying nonlinear dynamical systems with continuous states and actions.
method Repeating three steps: trajectory planning, tracking, and re-estimation.
result Estimates nonlinear dynamical systems at a parametric rate.
Meta-reinforcement learning improves fault-adaptive control efficiency.
problem Adaptive control under abrupt system faults with strict time constraints.
method Model-agnostic meta learning (MAML) with a fault library of prior policies.
result Improved sample efficiency and quick adaptation to new faults.
This paper proposes a system-agnostic policy for dynamic scheduling.
problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.
Improves deep learning robustness by considering task and model.
problem Adversarial attacks on deep learning systems.
method Binary and interval label encoding strategy to redefine classification tasks and design corresponding loss functions.
result Our method enhances robustness without sacrificing accuracy.
Quantum systems learn like machine learning models, influenced by dissipation.
problem Understanding how quantum systems learn and evolve.
method Hydrodynamical formulation of quantum mechanics, gradient descent model, empirical demonstration.
result Quantum systems follow a disrupted gradient descent model, influenced by dissipation.
Develops neural networks for learning physics of complex systems by enforcing thermodynamics principles.
problem Learning physics of complex systems from incomplete experimental data.
method Integrates port-metriplectic formalism with neural networks to enforce thermodynamics principles.
result Neural networks can learn physics of complex systems by parts, reducing learning burden.
This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.
problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an ℓ 1 \ell_1 ℓ 1 -regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension. result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.
The paper explores when linear system identification is hard or easy, especially for under-actuated systems.
problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.
New loss function helps learn unstable dynamical systems.
problem Gradient descent fails to learn unstable dynamical systems.
method Introduced a time-weighted logarithmic loss function.
result Time-weighted loss function effectively learns unstable systems.
New neural net learns time-reversible symplectic dynamics.
problem Lack of time-reversibility in neural networks for symplectic systems.
method Proposes a new neural network architecture for time-reversible symplectic systems.
result Demonstrates learning of time-reversible symplectic dynamics from data.
Meta learning enables cross-domain Hamiltonian dynamics.
problem Adapting to new physical systems with different laws.
method Graph Neural Network (GNN) with meta learning.
result Unified Hamiltonian representation across multiple system domains.
Deep learning improves conversational recommender systems.
problem Creating effective goal-oriented dialogue systems through natural language interactions.
method Apply deep learning techniques to conversational recommender systems.
result Deep learning models enhance user preference learning in CRS.
Proposes neural delay differential equations for stable system identification with partially observed states.
problem Learning stable models for systems with partial or delayed observations.
method Augments states with history, uses neural delay differential equations, and ensures stability through time delay analysis.
result The approach ensures stability of learned models for partially observed systems.
Examines multiagent systems for complex learning tasks.
problem Achieving cohesive learning behavior in multiagent networks.
method General formulation for multiagent dynamics and conditions for learning.
result Conditions for achieving cohesive learning behavior in multiagent networks.
Cross-validation methods help learn dynamical systems from data.
problem Learning surrogate models for dynamical systems from limited data.
method Variants of cross-validation (Kernel Flows, MMD, Lyapunov exponents).
result Simple approaches for kernel selection in dynamical system emulators.
Algorithm identifies bilinear dynamical systems from noisy data.
problem Learning a realization of a partially observed bilinear dynamical system.
method Regression of outputs to highly correlated covariates for Markov-like parameters.
result High probability error bounds on identification algorithm under uniform stability assumption.
sFML learns stochastic dynamical systems from data.
problem Learning unknown stochastic dynamical systems from measurement data.
method sFML extends FML for deterministic systems, using a stochastic flow map composed of deterministic and stochastic sub-maps.
result sFML constructs a stochastic evolution model approximating unknown stochastic systems.
Learn dynamics of a system using auxiliary data from similar systems.
problem Learning dynamics of a linear system with limited data.
method Weighted least squares approach, incorporating auxiliary data.
result Auxiliary data can help reduce intrinsic error due to noise.
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.
New method learns nonlinear systems from single finite trajectory samples.
problem Learning stabilizable nonlinear systems from single finite trajectory samples.
method Gradient-based algorithms with noise-sensitive uniform convergence guarantees.
result Efficient learning of general nonlinear systems with high accuracy and small sample complexity.
Modeling dynamical systems is important in many disciplines, e.g., control, robotics, or neurotechnology. Commonly the state of these systems is not directly observed, but only available through noisy and potentially high-dimensional observations. In these cases, system identification, i.e., finding the measurement map…
Recursive experts improve dynamic sequential learning systems.
problem Adapt to changing environments in sequential learning.
method Design hyper-experts that recursively merge to achieve optimal performance.
result Achieve minimax optimal regret bounds up to constant factors.
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.
Adversarial perturbations fool wearable sensor systems, showing transferability across different systems.
problem Adversarial examples fool wearable sensor systems, showing transferability across different systems.
method Study of adversarial transferability in wearable sensor systems from four perspectives: systems, subjects, sensor body locations, and datasets.
result Strong untargeted transferability in most cases, targeted attacks less successful.
Temporal-difference (TD) networks are a class of predictive state representations that use well-established TD methods to learn models of partially observable dynamical systems. Previous research with TD networks has dealt only with dynamical systems with finite sets of observations and actions. We present an algorithm…
Kernel methods accurately predict Hamiltonian systems from data.
problem Data-driven simulation of Hamiltonian systems.
method Two-step and one-step kernel-based methods for identifying and forecasting Hamiltonian systems.
result Framework achieves accurate, data-efficient predictions across various benchmark systems.
Coercivity condition ensures learning of interacting particle systems.
problem Ensuring identifiability of interaction functions in learning systems of interacting particles.
method Equivalence of coercivity condition to strictly positive definiteness of an integral kernel.
result For ergodic systems, the integral kernel is strictly positive definite, satisfying the coercivity condition.
Develops VAEs for learning complex physical systems from data.
problem Learning low-dimensional representations of nonlinear physical systems.
method Variational Autoencoders with manifold latent spaces.
result Effective in learning nonlinear Burgers equation and constrained mechanical systems.
Learning from examples is one of the key problems in science and engineering. It deals with function reconstruction from a finite set of direct and noisy samples. Regularization in reproducing kernel Hilbert spaces (RKHSs) is widely used to solve this task and includes powerful estimators such as regularization network…
NDS learns dynamical models with prior knowledge, improving accuracy and efficiency.
problem Learning accurate dynamical models with limited data and varying dynamics.
method Neural Dynamical Systems (NDS) integrates prior knowledge in ODEs with neural networks to estimate parameters and predict states.
result NDS achieves higher accuracy and uses fewer samples compared to other methods.
The paper tackles joint learning of linear systems, improving accuracy with pooled data.
problem Estimating transition matrices of multiple related linear systems more accurately.
method Developed novel techniques to bound estimation errors and establish high probability bounds for singular values.
result Significant gains in accuracy achieved by pooling data across systems.
This work introduces a method to learn dynamical systems from noisy sensor measurements using multiple shooting.
problem Learning dynamical systems from noisy sensor measurements is challenging due to system instability.
method A scalable method based on multiple shooting.
result Robust learning of latent representations of dynamical systems from noisy measurements.
Is it possible to generally construct a dynamical system to simulate a black system without recovering the equations of motion of the latter? Here we show that this goal can be approached by a learning machine. Trained by a set of input-output responses or a segment of time series of a black system, a learning machine …
Machine learning (ML) techniques are enjoying rapidly increasing adoption. However, designing and implementing the systems that support ML models in real-world deployments remains a significant obstacle, in large part due to the radically different development and deployment profile of modern ML methods, and the range …
This thesis explores emergent intelligence in disordered systems like spin glasses and neural networks.
problem Understanding the principles behind emergent intelligent behaviors in disordered systems.
method Statistical physics approach to charting learning mechanisms and dynamics.
result Uncovering relationships between learning mechanisms and physical dynamics.
New algorithm reduces learning regret in multi-agent systems with unknown dynamics.
problem Challenges in decentralized learning due to unknown dynamics and lack of communication.
method Proposed MARL algorithm for two-agent LQ systems with unknown dynamics and one-directional communication.
result Achieved O ( T ) O(\sqrt{T}) O ( T ) regret bound for multi-agent LQ systems with certain communication patterns. Among the machine learning applications to business, recommender systems would take one of the top places when it comes to success and adoption. They help the user in accelerating the process of search while helping businesses maximize sales. Post phenomenal success in computer vision and speech recognition, deep learn…
Method learns latent dynamics of complex systems from noisy data.
problem Challenging to construct ROMs from noisy high-dimensional data.
method Recurrent stochastic variational deep kernel learning (SVDKL).
result Framework accurately predicts system evolution in low-dimensional latent spaces.