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.

169,181 papers · 148 categories

Trend · papers per month

186372557743 · Jun 202019922001200920182026
48 results for latent time series

New method identifies causes in time series with latent variables.

problem Identifying direct and indirect causes in time series data with hidden variables.
method Proves necessary and sufficient conditions for causal feature selection using graph constraints and conditional independence tests.
result Method outperforms Granger causality in identifying causes with low false positives and false negatives.

Study evaluates interpretability of time series foundation models' latent spaces.

problem Improving interpretability of latent spaces in time series models for visual analytics.
method Evaluated MOMENT family of transformer-based models on five datasets, fine-tuning for performance.
result Fine-tuning improved latent space clarity but limited interpretability remained.

Proposes iVDFM for identifying latent factors in multivariate time series.

problem Identifying latent factors in multivariate time series with structural dynamics.
method Identifiable Variational Dynamic Factor Model (iVDFM) with iVAE-style conditioning.
result Identifiable latent factors up to permutation and component-wise affine transformations.

Optimal model selection for forecasting large collections of short time series using latent space.

problem Challenges in choosing among multiple forecasting methods for large, high-dimensional time series with limited data.
method Combining low-rank temporal matrix factorization with optimal model selection using cross-validation.
result Forecasting latent factors leads to significant performance gains compared to direct uni-variate model application.

Method learns latent SDEs from high-dimensional time series.

problem Learning latent stochastic differential equations from time series data.
method Self-supervised learning with variational autoencoders and Euler-Maruyama approximation.
result Can recover SDE coefficients and latent variables up to isometry with infinite data.

New bounds for causal effect identification in time series graphs with latent confounders.

problem Identifying causal effects in time series graphs with latent confounders over unbounded time intervals.
method Applying the Causal Identification algorithm to a constant-size segment of the time series graph.
result A bound on the number of past time steps needed for causal effect identification.

This paper tackles time series imputation by identifying and modeling different missing mechanisms.

problem Different types of missing mechanisms (MAR, MNAR) in time series data.
method Proposes a framework for time series imputation by analyzing data generation processes and modeling latent variables via variational inference and normalizing flow.
result Establishes identifiability results for latent variables under nonlinear independent component analysis, showing that latent variables are identifiable.

Model predicts spatial-temporal series with latent dynamical component.

problem Forecasting and discovering spatial-temporal relations in series.
method Recurrent neural network with latent dynamical component and various prior hypotheses.
result Model outperforms baselines in various forecasting tasks.

Enhances time-series regression trees with latent factors for robust financial analysis.

problem Handling predictors with measurement error, trends, seasonality, and missing data.
method Integrates latent stationary factors extracted via state-space methods into time-series regression trees.
result Factor-augmented trees provide a reliable approach for macro-finance problems, exemplified by the lead-lag effect between equity volatility and the business cycle.

DualVDT improves time-series forecasting with a novel dual reparametrized structure.

problem Time-series forecasting with improved performance and analytical rigor.
method Dual reparametrized variational mechanisms on VAE, latent score based generative model, reverse time stochastic differential equation, variational ancestral sampling, KL divergence reduction.
result Advanced performance in time-series forecasting with reduced KL divergence.

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.

SDE Matching eliminates simulation for training Latent SDEs, achieving similar performance.

problem Training Latent SDEs with adjoint sensitivity methods is computationally expensive and limited.
method SDE Matching, inspired by Score- and Flow Matching, eliminates simulation for training Latent SDEs.
result SDE Matching achieves performance comparable to adjoint sensitivity methods while reducing computational complexity.

The study uses Gaussian Processes with Tweedie likelihood for forecasting intermittent time series.

problem Forecasting intermittent time series with high accuracy and flexibility.
method The approach combines Gaussian Processes with two forecast distributions: negative binomial and Tweedie.
result TweedieGP provides better probabilistic forecasts, especially for high quantiles.

Efficiently trains dynamic word embedding models with structured variational inference.

problem Training continuous latent time series models with structured variational approximations.
method Analogous to the forward-backward algorithm, a BBVI algorithm that scales linearly in time.
result Efficiently samples from variational distribution and estimates ELBO gradients.

Generalizes bits back coding for time-series models with latent Markov structures.

problem Efficiently compressing time-series data with latent Markov structures.
method Extends bits back coding to time-series models with latent Markov structures, including HMMs and LGSSMs.
result Effective for small scale models, promising for larger scale settings like video compression.

LSSDM improves imputation of multivariate time series data.

problem Imputation of multivariate time series data without labels.
method LSSDM projects observed data into latent space, reconstructs missing values without labels, and uses a conditional diffusion model for precise imputation.
result LSSDM achieves superior imputation performance and uncertainty analysis.

New method improves causal discovery in time series with latent confounders.

problem Low recall in causal discovery for autocorrelated time series with latent confounders.
method Iterative procedure that includes causal parents in conditioning sets, using novel orientation rules.
result Significantly higher recall compared to existing methods, especially in strong autocorrelation cases.

Framework LiLY recovers latent causal variables from time-series data under distribution shifts.

problem Learning and correcting models under unknown distribution shifts in time-series data.
method LiLY framework that recovers latent causal variables and identifies their relations from temporal data under different distribution shifts.
result The framework reliably identifies time-delayed latent causal influences from observed variables under different distribution changes.

TimeVQVAE-AD detects anomalies in time series data with high accuracy and provides explainable results.

problem Detecting and explaining anomalies in time series data accurately.
method Masked latent generative modeling in time-frequency domain.
result TimeVQVAE-AD outperforms existing methods in anomaly detection and explainability.

Proposes a new VAE framework for anomaly detection in time series data.

problem Data scarcity leads to latent holes and discontinuous regions in latent space, causing non-robust reconstructions.
method Combines VAEs with self-supervised learning to address data scarcity and improve anomaly detection.
result Improves robustness of anomaly detection in time series data by addressing latent holes and discontinuities.

New method embeds correlation networks to reveal underlying time series patterns.

problem Analyzing correlation networks derived from time series data.
method Spectral embedding of noisy correlation networks, leveraging Fourier basis elements.
result Spectral embedding recovers true vertex-level latent representations under suitable assumptions.

A technique uncovers latent causal relationships in multiple time series data.

problem Identifying causal relationships in complex, dynamic systems.
method Blindly identifies latent sources by projecting observed data into pairs of components to maximize causality.
result Reveals multiple strong causal relationships not evident in observed data.

New framework IDOL identifies latent causal processes with instantaneous relations from time series data.

problem Identifying latent causal processes with instantaneous relations from time series data.
method Sparse influence constraint and variational inference architecture with sparsity regularization.
result Our method can identify latent causal processes with instantaneous relations.

CLPF models continuous time-series data with improved representational power and variational approximations.

problem Fitting continuous time-series data with existing models faces challenges in representational power and variational quality.
method CLPF uses a time-dependent normalizing flow driven by a stochastic differential equation to decode continuous latent processes into continuous observables. Maximum likelihood optimization is achieved through a novel variational posterior process.
result CLPF outperforms state-of-the-art baselines on synthetic and real-world time-series data.

GGP models multivariate time series with latent sub-sequences for diverse behaviors.

problem Modeling multivariate time series with diverse behaviors and patterns.
method Graph Gamma Process (GGP) linear dynamical systems with latent sub-sequences.
result GGP models exhibit good predictive performance and reveal interpretable latent patterns.

Recurrent Neural Processes model time series with conditional independence to capture slow variabilities efficiently.

problem Modeling time series data with slow long-term variabilities efficiently.
method Recurrent Neural Processes (RNP) model state space with conditional independence among subsequences.
result RNP state spaces improve predictive performance on real-world time-series data and nonlinear system identification.

Causal relationships in time series with latent variables are discovered using LPCMCI.

problem Discovering causal relationships in complex, time-series data with hidden variables.
method Evaluated LPCMCI algorithm for finding generators compatible with multi-dimensional, autocorrelated time series with latent variables.
result LPCMCI performs better than random guessing but is not optimal.

LLapDiff models irregular multivariate time series without step-by-step integration.

problem Trade-off between discrete and continuous methods for long-horizon forecasting.
method Generative framework that models target as a low-dimensional latent trajectory, guided by modal parameterization and Laplace domain poles.
result Improves long-horizon forecasting over baselines and supports missing-value imputation.

This paper improves QoS metric prediction in DTNs using diffusion models.

problem Improving QoS metric prediction in Delay-Tolerant Networks (DTNs) to enhance network performance.
method Formulates QoS metric prediction as a probabilistic forecasting problem on multivariate time series, incorporating latent temporal dynamics.
result The proposed approach outperforms traditional methods in QoS metric prediction for DTNs.

New method handles missing data and multiple data types in time series models.

problem Handling missing data and multiple data modalities in time series models.
method Factorized inference method for Multimodal Deep Markov Models (MDMMs).
result Method performs well even with high levels of missing data and outperforms existing approaches.

The paper proposes a deep generative model for complex disease trajectories.

problem Modeling and analyzing complex disease trajectories.
method Deep generative time series approach with semi-supervised latent processes.
result The model can discover novel aspects of diseases and cluster them into new sub-types.

SPLICE generates accurate time-series imputations with reliable prediction intervals.

problem Lack of reliability guarantees in time-series imputation models.
method Modular framework combining latent generative imputation with distribution-free prediction intervals.
result SPLICE achieves lowest mean Load-only MSE and best CRPS on various datasets.