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,742 papers · 148 categories

Trend · papers per month

90180269359 · Jun 202019922001200920172026
48 results for state-space representation

Empirical mode modeling improves state-space analysis of noisy data.

problem Analyzing nonlinear systems with noisy data.
method Combining empirical mode decomposition with empirical dynamic modeling.
result Empirical mode modeling enhances state-space representations in noisy data.

A new method for estimating uncertainty in deep neural networks.

problem Challenges in uncertainty estimation in deep neural networks, especially with increased complexity.
method Decompose tasks into representation learning and state space model for uncertainty estimation.
result The proposed method can estimate predictive distributions on top of existing neural networks.

The state space (SS) representation of Gaussian processes (GP) has recently gained a lot of interest. The main reason is that it allows to compute GPs based inferences in O(n), where nn is the number of observations. This implementation makes GPs suitable for Big Data. For this reason, it is important to provide a SS …

2016-01-07abs ↗pdf ↗

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 ↗

Model-based reinforcement learning methods typically learn models for high-dimensional state spaces by aiming to reconstruct and predict the original observations. However, drawing inspiration from model-free reinforcement learning, we propose learning a latent dynamics model directly from rewards. In this work, we int…

2019-12-09abs ↗pdf ↗

Neural Physicist learns physical dynamics from images.

problem Learning meaningful physical state representations and accurate state transitions from image sequences.
method Neural Physicist uses VAE for state extraction, NP for parameters, and SSM for dynamics.
result Achieves long-term predictions and identifies system degrees of freedom.

A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.

problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.

KalMamba improves RL efficiency with probabilistic SSMs.

problem Efficiency in learning and inference for probabilistic SSMs in RL.
method Combines Mamba's scalability with Kalman filtering for efficient probabilistic SSMs.
result KalMamba outperforms state-of-the-art SSMs in RL, especially on longer sequences.

New method learns high-quality Laplacian representations for reinforcement learning.

problem Lack of accurate Laplacian representations in large or continuous state spaces.
method Reformulated spectral graph drawing objective to have eigenvectors as unique global minimizer.
result Learned Laplacian representations more faithfully approximate the ground truth.

Sequential data often originates from diverse domains across which statistical regularities and domain specifics exist. To specifically learn cross-domain sequence representations, we introduce disentangled state space models (DSSM) -- a class of SSM in which domain-invariant state dynamics is explicitly disentangled f…

2019-06-07abs ↗pdf ↗

D-LinOSS models learn to dissipate energy, improving performance on long-range tasks.

problem Representational limitations of LinOSS models in long-range reasoning.
method Introducing Damped Linear Oscillatory State-Space models (D-LinOSS) that learn to dissipate latent state energy on arbitrary time scales.
result D-LinOSS consistently outperforms previous LinOSS methods on long-range learning tasks, achieving faster convergence and reducing hyperparameter search space.

New model preserves symmetry in multivariate time series, improving performance.

problem Implicit ordering in MTS models violates inherent exchangeability.
method Permutation-equivariant 2D state space model with canonical architecture.
result Eliminates sequential dependency chains and simplifies stability analysis.

Federated framework learns causal states to predict counterfactuals without centralizing data.

problem Decentralized counterfactual reasoning in coupled industrial systems with private data.
method Federated causal representation learning in state-space systems.
result Proves convergence to centralized oracle and provides privacy guarantees.

Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervised learning problem, have been proposed recently. Finding good policies with such methods requires not only an appropriate classifier, but also reliable e…

2008-05-14abs ↗pdf ↗

Restricts quantum representations of mapping class groups to integral coefficients.

problem Integrality of non-semisimple quantum representations of mapping class groups.
method Exhibits explicit bases of states spaces that span Z[ζ]\mathbb{Z}[ζ]-lattices invariant under mapping class groups.
result Restricts quantum representations to integral coefficients from Q(ζ)\mathbb{Q}(ζ) to Z[ζ]\mathbb{Z}[ζ].

New Hida-Matérn kernels enable flexible process priors and efficient GP inference.

problem Flexible modeling of stationary processes with oscillatory components.
method Introducing a new class of covariance functions (Hida-Matérn kernels) and their state space representations.
result Efficient Gaussian Process inference and improved numerical stability.

Reinforcement learning (RL) algorithms allow artificial agents to improve their selection of actions to increase rewarding experiences in their environments. Temporal Difference (TD) Learning -- a model-free RL method -- is a leading account of the midbrain dopamine system and the basal ganglia in reinforcement learnin…

2019-09-04abs ↗pdf ↗

From social networks to Internet applications, a wide variety of electronic communication tools are producing streams of graph data; where the nodes represent users and the edges represent the contacts between them over time. This has led to an increased interest in mechanisms to model the dynamic structure of time-var…

2014-03-14abs ↗pdf ↗

Paper tackles reinforcement learning for STL specifications with state history.

problem Learning optimal policies to satisfy STL specifications often requires too much state history, making the problem computationally intractable.
method Proposes a compact augmented state-space representation to capture state history and an approximation method to solve the objective.
result Shows the performance bound of the approximate solution and compares it with an existing technique.

SPECTRA improves probabilistic energy forecasting by separating trends and uncertainties.

problem Interacting uncertainties from renewable intermittency, demand flexibility, market volatility, and weather impact probabilistic forecasts.
method Adaptive state-space exogenous context and temporal-frequency resolution architecture.
result Achieved best CRPS in 14 out of 18 settings, reducing CRPS by 5.74% and upper-tail quantile risk by 7.27%.

DAC-SSM learns domain-agnostic states for better imitation learning.

problem Domain shifts hinder imitation learning in partially observable tasks.
method DAC-SSM uses adversarial training to remove domain-dependent information from states.
result DAC-SSM achieves comparable performance to experts in sparse reward tasks.

Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinforcementlearning algorithm for learning in these domains and prove for certain environments the algorithm is probably approximately correct wit…

2012-06-13abs ↗pdf ↗

ETC learns minimal representations for reinforcement learning in POMDPs.

problem Sample complexity challenges in reinforcement learning for POMDPs.
method ETC learns low-dimensional features and embeddings at two levels, optimizing policy.
result ETC achieves polynomial sample complexity for POMDPs with low-rank transition kernels.

How can we efficiently propagate uncertainty in a latent state representation with recurrent neural networks? This paper introduces stochastic recurrent neural networks which glue a deterministic recurrent neural network and a state space model together to form a stochastic and sequential neural generative model. The c…

2016-05-24abs ↗pdf ↗

Hybrid model improves sequential data prediction by combining neural and time series models.

problem Nonlinear prediction in online settings with domain-specific feature engineering issues.
method Joint optimization of LSTM for feature extraction and SARIMAX for time series data using state space representations.
result Significant improvements in real-life competition datasets.

New model-free algorithms learn representations for low-rank MDPs efficiently.

problem Learning representations in reinforcement learning for low-rank MDPs.
method Developed minimax representation learning objective and interleaved with reward-free exploration.
result Proven sample efficiency and scalability to complex environments.

A new particle filter avoids resampling to improve state estimation in high dimensions.

problem Particle deprivation in high-dimensional state spaces.
method A resampling-free particle filter designed to mitigate particle deprivation.
result The filter offers a near-accurate representation of the posterior distribution in high-dimensional contexts.

Gaussian processes are used in machine learning to learn input-output mappings from observed data. Gaussian process regression is based on imposing a Gaussian process prior on the unknown regressor function and statistically conditioning it on the observed data. In system identification, Gaussian processes are used to …

2019-07-13abs ↗pdf ↗

Bayesian reinforcement learning (BRL) encodes prior knowledge of the world in a model and represents uncertainty in model parameters by maintaining a probability distribution over them. This paper presents Monte Carlo BRL (MC-BRL), a simple and general approach to BRL. MC-BRL samples a priori a finite set of hypotheses…

2012-06-27abs ↗pdf ↗