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

4739461,4191,892 · Jun 202019922001200920172026
48 results for observable state space models

Method estimates observation functions in state-space models without supervision.

problem Unsupervised learning of non-invertible observation functions in nonlinear state-space models.
method Nonparametric generalized moment method using constrained regression.
result Estimates function space of identifiability from state process.

Adversarial attacks on probabilistic state-space models affect latent state and policy decisions.

problem Robust reinforcement learning under adversarial observability.
method Analyzing adversarial attacks on linear probabilistic state-space models.
result Demonstrating the influence of adversarial observations on latent state and policy decisions.

In nonlinear state-space models, sequential learning about the hidden state can proceed by particle filtering when the density of the observation conditional on the state is available analytically (e.g. Gordon et al., 1993). This condition need not hold in complex environments, such as the incomplete-information equili…

2011-05-23abs ↗pdf ↗

A new method for state estimation in state-space models using incomplete data.

problem State estimation in nonlinear state-space models with incomplete observations.
method Statistical analysis of incomplete observations, score function, observed information matrices, EM-gradient-particle filtering.
result Maximum likelihood estimation of state-vector with explicit form of observed information matrix.

Predictive State Representations (PSRs) are an expressive class of models for controlled stochastic processes. PSRs represent state as a set of predictions of future observable events. Because PSRs are defined entirely in terms of observable data, statistically consistent estimates of PSR parameters can be learned effi…

2013-09-26abs ↗pdf ↗

New model captures state-dependent variability in partially observed systems.

problem Structured stochasticity not captured by constant-variance models.
method State-coupled stochastic volatility framework with particle expectation-maximization.
result Model consistently reduces recovery bias under partial observation.

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.

New algorithm infers trajectories from partial observations using optimal transport.

problem Inferring trajectories from partial observations of coupled systems.
method Extends MFL algorithm to latent SDEs using observable state space models and partial observations.
result Experiments show significant outperformance over latent-free baseline.

New BED method handles online inference for partially observed dynamical systems.

problem Optimizing data collection for partially observable, partially online dynamical systems.
method Derived estimators of expected information gain and its gradient for SSMs, using nested particle filters.
result Successfully handles both partial observability and online inference in realistic models.

New method for state inference in state-space models with unknown dynamics.

problem State inference in state-space models with computationally expensive and undefined dynamics.
method Estimate state transition dynamics using a multi-output Gaussian process and Bayesian Neural Network as a surrogate model.
result Significant improvement in accuracy for state inference and prediction in non-stationary user models.

The paper analyzes variational autoencoders for state space models with risk bounds.

problem Analyzing the risk associated with variational autoencoders for state space models.
method Backward factorization of variational distributions to analyze excess risk, providing oracle inequalities and upper bounds.
result Explicit upper bounds on variational estimation error for state space models under strong mixing assumptions.

Reinforcement learning (RL) in Markov decision processes (MDPs) with large state spaces is a challenging problem. The performance of standard RL algorithms degrades drastically with the dimensionality of state space. However, in practice, these large MDPs typically incorporate a latent or hidden low-dimensional structu…

2016-11-11abs ↗pdf ↗

Efficient RL in large POMDPs with latent determinism and embeddings.

problem Efficient reinforcement learning in large-scale POMDPs with latent states and observations.
method Conditional Hilbert space embeddings, linear optimal QQ-function, deterministic latent transitions, gap assumption.
result Computationally and statistically efficient algorithm for exact optimal policy.

A new method for analyzing high-dimensional time-series data using deep neural networks.

problem Challenges in modeling high-dimensional time-series data with explicit state and observation processes.
method Deep Direct Discriminative Decoders (D4) for high-dimensional observation processes.
result D4 outperforms traditional SSMs and RNNs in various time-series data applications.

NCDSSM models irregularly sampled time series with improved imputation and forecasting.

problem Accurate modeling of irregularly sampled time series with missing observations.
method Neural Continuous-Discrete State Space Model (NCDSSM) with amortized inference for auxiliary variables and flexible dynamic state parameterizations.
result Improved imputation and forecasting performance on multiple benchmark datasets.

Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…

2019-08-30abs ↗pdf ↗

AUCRSS detects change points in partially observed multivariate autocorrelated data.

problem Detecting change points in multivariate autocorrelated data with limited sensing resources.
method Adaptive Upper Confidence Region (AUCRSS) with state space model (SSM), adaptive sampling policy, and generalized likelihood ratio test.
result The method outperforms existing approaches in detecting change points efficiently.

The paper tackles restless bandits with limited observation, proposing a method to analyze and approximate their optimal strategies.

problem Restless bandits with limited observation.
method General probabilistic model, PCL analysis, and approximation process.
result The proposed method can transform the problem into a finite-state problem, enabling the use of existing algorithms.

CVRL tackles complex visual observations in reinforcement learning.

problem Complex visual observations in natural environments.
method Contrastive Variational Reinforcement Learning (CVRL) learns a contrastive variational model by maximizing mutual information between latent states and observations.
result CVRL achieves comparable performance with state-of-the-art model-based DRL methods and significantly outperforms them on tasks with complex observations.

New algorithm for aggregate inference in HMMs with continuous observations.

problem Inference in large populations with indistinguishable individuals and continuous measurements.
method Continuous observation collective forward-backward algorithm extending existing discrete case algorithm.
result Efficacy demonstrated through numerical experiments.

This paper addresses the problem of filtering with a state-space model. Standard approaches for filtering assume that a probabilistic model for observations (i.e. the observation model) is given explicitly or at least parametrically. We consider a setting where this assumption is not satisfied; we assume that the knowl…

2013-12-17abs ↗pdf ↗

New method for efficient online variational estimation in streaming data.

problem Efficiently estimating parameters and latent states in online parametric models.
method i.i.d. Monte Carlo sampling coupled with deep architecture.
result The method computes the evidence lower bound and its gradient efficiently.

A new method learns state and proposal dynamics in state-space models using neural networks.

problem Inference in non-linear state-space models.
method StateMixNN method using neural networks for proposal and transition distributions.
result Significantly improved recovery of hidden state, especially in highly non-linear scenarios.

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.

This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class mod…

2012-07-11abs ↗pdf ↗

This paper addresses the data-driven identification of latent dynamical representations of partially-observed systems, i.e., dynamical systems for which some components are never observed, with an emphasis on forecasting applications, including long-term asymptotic patterns. Whereas state-of-the-art data-driven approac…

2019-07-04abs ↗pdf ↗

New method uncovers small but significant local activities in time-series data.

problem Reconstructing small but important local activities in time-series data.
method Neural state-space models with latent causal-effect disentanglement.
result Demonstrated proof-of-concept on reconstructing ectopic foci in cardiac electrical propagation.

A nonparametric approach for policy learning for POMDPs is proposed. The approach represents distributions over the states, observations, and actions as embeddings in feature spaces, which are reproducing kernel Hilbert spaces. Distributions over states given the observations are obtained by applying the kernel Bayes' …

2012-10-16abs ↗pdf ↗

Clinical forecasting based on electronic medical records (EMR) can uncover the temporal correlations between patients' conditions and outcomes from sequences of longitudinal clinical measurements. In this work, we propose an intervention-augmented deep state space generative model to capture the interactions among clin…

2019-12-04abs ↗pdf ↗

New technologies for recording the activity of large neural populations during complex behavior provide exciting opportunities for investigating the neural computations that underlie perception, cognition, and decision-making. Nonlinear state space models provide an interpretable signal processing framework by combinin…

2017-07-27abs ↗pdf ↗

A new method for state estimation on complex networks.

problem Reconstructing latent dynamics from multivariate time-series on topological cell complexes.
method Topology-aware state space framework derived from stochastic partial differential equations, with state evolution following heat-like topological diffusion.
result The proposed method successfully recovers latent states and topological structures in real-world networks.

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 ↗

QATS efficiently decodes HMMs with polylogarithmic complexity.

problem Efficiently decoding hidden Markov models from noisy observations.
method Divide-and-conquer procedure with polylogarithmic sequence complexity and cubic state space complexity.
result QATS outperforms Viterbi and PMAP in speed and accuracy.