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

Trend · papers per month

212424636848 · Jun 202019922001200920172026
48 results for Latent State Inference

New method infers hidden states in continuous-time phenomena better than traditional models.

problem Traditional HSMM's are limited to discrete time grids and cannot handle irregularly spaced data.
method Formulated integro-differential forward and backward equations for CTSMC's, introduced scalable Viterbi-type algorithm.
result Efficiently solved equations for posterior marginals and path estimates.

New method for efficient Bayesian inference in GPSSMs.

problem Challenges in inference for Gaussian process state-space models.
method Free-form variational inference with stochastic gradient Hamiltonian Monte Carlo.
result Our method learns transition dynamics and latent states more accurately than competing methods.

A new method for efficient inference in sequential latent-variable models.

problem Computational challenges in integrating subject-specific random effects.
method Anchored variational inference framework to approximate posterior distributions.
result The method achieves accurate estimation with significant computational gains.

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.

We describe a Markov latent state space (MLSS) model, where the latent state distribution is a decaying mixture over multiple past states. We present a simple sampling algorithm that allows to approximate such high-order MLSS with fixed time and memory costs.

2017-11-08abs ↗pdf ↗

We propose a nonparametric procedure to achieve fast inference in generative graphical models when the number of latent states is very large. The approach is based on iterative latent variable preselection, where we alternate between learning a 'selection function' to reveal the relevant latent variables, and use this …

2014-12-10abs ↗pdf ↗

cvHM framework speeds up GP inference for neural spike train analysis.

problem Scalability issue in approximate inference for latent GP models.
method cvHM framework using Hida-Matérn kernels and conjugate computation variational inference (CVI).
result Linear time inference for latent neural trajectories.

Bayesian non-linear latent variable modeling for complex data.

problem Inference for GPLVMs is computationally limited and often leads to overfitting or underestimates uncertainty.
method Approximate Gaussian process mappings with random Fourier features for MCMC inference.
result Generalized RFLVMs perform well on various data types and applications.

We introduce the adversarially learned inference (ALI) model, which jointly learns a generation network and an inference network using an adversarial process. The generation network maps samples from stochastic latent variables to the data space while the inference network maps training examples in data space to the sp…

2016-06-02abs ↗pdf ↗

Paper uses Gaussian processes to handle shared latent confounders in causal inference.

problem Bias in causal effect estimates due to shared latent confounders.
method Hierarchical Bayesian model, Gaussian processes with structured latent confounders (GP-SLC), Monte Carlo inference algorithm.
result GP-SLC provides accurate estimates of individual treatment effects with minimal assumptions.

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.

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.

Adaptive learning method identifies and corrects corrupted data.

problem Robust learning from corrupted training sets.
method Identifies corrupted and non-corrupted samples with latent Bernoulli variables, formulates as likelihood maximization with marginalized latent variables, solved via variational inference and Expectation-Maximization.
result Improves over state-of-the-art by automatically inferring corruption level with minimal overhead.

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.

Latent-IMH improves Bayesian inference for expensive operators.

problem Efficient sampling from posterior distributions in inverse problems with computationally expensive operators.
method Metropolis-Hastings independence sampler using approximate and exact operators.
result Latent-IMH outperforms existing methods in computational efficiency.

Latent force models are a class of hybrid models for dynamic systems, combining simple mechanistic models with flexible Gaussian process (GP) perturbations. An extension of this framework to include multiplicative interactions between the state and GP terms allows strong a priori control of the model geometry at the ex…

2018-12-31abs ↗pdf ↗

A body of recent work in modeling neural activity focuses on recovering low-dimensional latent features that capture the statistical structure of large-scale neural populations. Most such approaches have focused on linear generative models, where inference is computationally tractable. Here, we propose fLDS, a general …

2016-05-26abs ↗pdf ↗

ACSSM models irregular time series with continuous dynamics.

problem Modeling irregular time series data.
method ACSSM uses a multi-marginal Doob's h-transform and variational inference with stochastic optimal control.
result ACSSM outperforms in tasks like classification, regression, interpolation, and extrapolation.

Novel graphical models for time series with latent confounders improve causal inference.

problem Causal relationships and independencies in multivariate time series with unobserved confounders.
method Introduced a novel class of graphical models and characterized their properties.
result Novel graphs provide stronger causal inferences without additional assumptions.

Latent variable time-series models are among the most heavily used tools from machine learning and applied statistics. These models have the advantage of learning latent structure both from noisy observations and from the temporal ordering in the data, where it is assumed that meaningful correlation structure exists ac…

2015-11-23abs ↗pdf ↗

Develops methods for causal inference in longitudinal data.

problem Estimating Individual Treatment Effects (ITEs) in high-dimensional, time-varying data.
method Causal Dynamic Variational Autoencoder (CDVAE) and long-term counterfactual regression framework.
result CDVAE outperforms baselines and improves state-of-the-art models, approaching oracle performance.

Framework infers Langevin dynamics from stochastic observations of latent systems.

problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.

Improved robust latent variable estimation for neural dynamics.

problem Inconsistent results due to noise and nonlinearity in existing models.
method Probabilistic approach to latent variable estimation in decomposed models.
result More accurate latent variable inference in nonlinear systems with diverse noise conditions.

Latent force models (LFM) are principled approaches to incorporating solutions to differential equations within non-parametric inference methods. Unfortunately, the development and application of LFMs can be inhibited by their computational cost, especially when closed-form solutions for the LFM are unavailable, as is …

2013-10-23abs ↗pdf ↗

Paper addresses state estimation in sensor networks with intermittent data.

problem State estimation in sensor networks with packet dropouts and corrupted observations.
method Bayesian variational inference with a dual-mask generative model.
result The method effectively identifies system states and noise parameters.