Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

129257386514 · Jun 202019922001200920172026
48 results for dynamic inputs

Model captures system input variations in latent space for actionable dynamics.

problem Learning dynamical systems from data without prescribing a mathematical model.
method Structured latent ODE model with stochastic factors of variation for each input.
result Improves generation of time-series data and inference of system inputs over baselines.

Extremely accurate prediction of dynamical system bifurcations using control inputs.

problem Predicting complex bifurcation structures in dynamical systems.
method Extending extreme learning machines with control inputs to model system dynamics.
result The model can nearly reproduce the entire structure of bifurcations using only a few parameter values.

Aux-Net model handles dynamic systems with inconsistent inputs.

problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.

Efficiently processes dynamic inputs in AI writing assistants with incremental computation.

problem Efficiently updating AI models in real-time with dynamic inputs.
method Incremental computing using vector quantization to filter and reuse intermediate values in neural networks.
result Comparable accuracy with 12.1X fewer operations for processing dynamic inputs.

Deep learning models converge to Gaussian dynamics with mixed structured inputs.

problem Understanding neural network dynamics with complex input distributions.
method Extended hidden manifold model to Gaussian mixtures, analyzed via SGD.
result Learning dynamics with mixed inputs converge to Gaussian behavior.

Study learns linear system dynamics from noisy bilinear data.

problem Learning linear dynamics from bilinear observations with process and measurement noise.
method Regression with Kronecker product design, data-dependent and independent error bounds.
result Upper bounds on statistical error rates and sample complexity for learning dynamics matrices.

Transformers handle infinite dimensional inputs effectively by feature extraction and dynamic feature selection.

problem Understanding the approximation and estimation ability of Transformers with infinite dimensional inputs.
method Anisotropic smoothness analysis and feature extraction properties of Transformers.
result Transformers avoid the curse of dimensionality and dynamically select important features.

PenduMAV is a 6-input omnidirectional MAV without internal forces.

problem Designing a MAV without internal forces and structural costs.
method Multibody dynamics derivation, SE(3) control, Lyapunov analysis, Gazebo simulations.
result Asymptotic stabilization of the closed-loop system under parametric uncertainty and actuator noise.

This study explains gradient flow dynamics in neural networks for small initialisation.

problem Understanding the training dynamics of neural networks for small initialisation.
method Analysis of gradient flow dynamics for one-hidden layer ReLU networks with orthogonal inputs.
result Gradient flow converges to zero loss and characterizes implicit bias towards minimum variation norm.

Study of deep neural networks using finite-time Lyapunov exponents.

problem Understanding the geometric structures in input space formed by deep neural networks.
method Analogy with dynamical systems, computing finite-time Lyapunov exponents.
result Ridges of large positive exponents divide input space into regions associated with different classes.

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.

Paper proposes a dual-level approach for multi-step forecasting of dynamical systems.

problem Accurate multi-step forecasting of time series systems for automatic control and optimization.
method Hybrid input forecasting using LSTM-STMs and physics-informed neural networks (PINNs).
result Hybrid models achieve higher log-likelihood and lower MSE compared to conventional methods.

Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched t…

2017-02-07abs ↗pdf ↗

Study identifies latent variables and models from spacecraft data.

problem Learning reliable models from spacecraft data with complex relationships.
method Inductive bias inspired by controllable canonical forms for sparse, input-dependent latent variables.
result Identifies latent variables up to scaling and determines dynamic models up to transformations for linear and affine systems.

We propose an algorithm to actively estimate the parameters of a linear dynamical system. Given complete control over the system's input, our algorithm adaptively chooses the inputs to accelerate estimation. We show a finite time bound quantifying the estimation rate our algorithm attains and prove matching upper and l…

2020-02-02abs ↗pdf ↗

Denoising autoencoders (DAEs) have proven useful for unsupervised representation learning, but a thorough theoretical understanding is still lacking of how the input noise influences learning. Here we develop theory for how noise influences learning in DAEs. By focusing on linear DAEs, we are able to derive analytic ex…

2018-06-14abs ↗pdf ↗

Study on neuron dynamics for XOR classification with zero-margin.

problem Understanding neural network training dynamics in zero-margin classification problems.
method Analysis of Gaussian XOR problem, focusing on neuron block dynamics and generalization without margin assumptions.
result Neurons cluster into four directions and block-level signals evolve coherently, essential for reliable prediction in the Gaussian setting.

Parameterized state space models in the form of recurrent networks are often used in machine learning to learn from data streams exhibiting temporal dependencies. To break the black box nature of such models it is important to understand the dynamical features of the input driving time series that are formed in the sta…

2019-07-15abs ↗pdf ↗

While increasingly deep networks are still in general desired for achieving state-of-the-art performance, for many specific inputs a simpler network might already suffice. Existing works exploited this observation by learning to skip convolutional layers in an input-dependent manner. However, we argue their binary deci…

2020-01-03abs ↗pdf ↗

Although deep neural networks generally have fixed network structures, the concept of dynamic mechanism has drawn more and more attention in recent years. Attention mechanisms compute input-dependent dynamic attention weights for aggregating a sequence of hidden states. Dynamic network configuration in convolutional ne…

2019-12-01abs ↗pdf ↗

Study analyzes learning dynamics in nonlinear perceptrons using stochastic-process approach.

problem Understanding the roles of nonlinearity and input-data distribution in neural network learning.
method Stochastic-process approach to derive flow equations for learning dynamics in nonlinear perceptrons.
result Input-data noise affects learning speed differently under supervised and reinforcement learning.

We consider the learning of algorithmic tasks by mere observation of input-output pairs. Rather than studying this as a black-box discrete regression problem with no assumption whatsoever on the input-output mapping, we concentrate on tasks that are amenable to the principle of divide and conquer, and study what are it…

2016-11-08abs ↗pdf ↗

MD-GAN learns long-time molecular behavior from short-time data with multi-particle input.

problem Accurately predicting long-time molecular dynamics from short-time data.
method Machine learning method (MD-GAN) that incorporates dynamics of multiple particles of molecules.
result Predicting diffusion with one-third of the training data length using multi-particle input.

We present an approach for reconfiguration of dynamic visual sensor networks with deep reinforcement learning (RL). Our RL agent uses a modified asynchronous advantage actor-critic framework and the recently proposed Relational Network module at the foundation of its network architecture. To address the issue of sample…

2018-08-13abs ↗pdf ↗

Deep neural networks with more parameters and FLOPs have higher capacity and generalize better to diverse domains. But to be deployed on edge devices, the model's complexity has to be constrained due to limited compute resource. In this work, we propose a method to improve the model capacity without increasing inferenc…

2019-11-26abs ↗pdf ↗

T-SVM improves learning in spiking neurons by maximizing dynamical margin.

problem Finding robust solutions in spiking neuronal networks with temporal correlations.
method Introduces Temporal Support Vector Machine (T-SVM) to maximize dynamical margin.
result T-SVM enables learning of tasks requiring nonlinear spatial integration.

Much work aims to explain a model's prediction on a static input. We consider explanations in a temporal setting where a stateful dynamical model produces a sequence of risk estimates given an input at each time step. When the estimated risk increases, the goal of the explanation is to attribute the increase to a few r…

2019-07-10abs ↗pdf ↗

We propose an input design method for a general class of parametric probabilistic models, including nonlinear dynamical systems with process noise. The goal of the procedure is to select inputs such that the parameter posterior distribution concentrates about the true value of the parameters; however, exact computation…

2019-03-06abs ↗pdf ↗

Sparse codes improve optimal control tasks with correlated inputs.

problem Optimal control tasks with correlated feature inputs.
method Used a sparse code to represent natural images in an optimal control task solved with neuro-dynamic programming.
result An over-complete sparse code increases memory capacity and learning speed beyond a complete code.

A novel deep probabilistic model for dynamic systems forecasting.

problem Probabilistic forecasting in dynamic systems.
method Combining deep generative models and state space models with recurrent neural networks and variational sequence models.
result Outperforms existing models in system identification benchmarks and real-world centrifugal compressor forecasting.

A new method scales CCA parameters by input to learn more correlated representations.

problem Limitation of conventional CCA models in learning highly correlated representations.
method Introduces a dynamic scaling method for training input-dependent canonical correlation models.
result Learned representations are more correlated and retrieval results are preferable.

We present a deep generative model that learns disentangled static and dynamic representations of data from unordered input. Our approach exploits regularities in sequential data that exist regardless of the order in which the data is viewed. The result of our factorized graphical model is a well-organized and coherent…

2018-12-10abs ↗pdf ↗

Reservoir Computing (RC) provides an efficient way for designing dynamical recurrent neural models. While training is restricted to a simple output component, the recurrent connections are left untrained after initialization, subject to stability constraints specified by the Echo State Property (ESP). Literature condit…

2018-11-27abs ↗pdf ↗

The paper tackles adversarial attacks on recurrent neural networks.

problem Adversarial attacks on recurrent neural networks are easy and lack theoretical guarantees.
method Inspired by dynamical systems theory, the paper dynamically computes adversarial perturbations for each timestep of the input sequence.
result The paper provides theoretical guarantees on the existence of adversarial examples and robustness margins.