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

4.4%8.8%13.2%17.6% · Mar 202619922001200920172026
48 results for Bayesian Temporal Factorization

Bayesian Temporal Factorization predicts multidimensional time series with missing data.

problem Predicting large-scale, multidimensional spatiotemporal data with missing values.
method Integrates low-rank matrix/tensor factorization and VAR process into a probabilistic model.
result Superior performance on real-world spatiotemporal data sets compared to existing methods.

DF2M uses deep neural networks within a factor model for high-dimensional functional time series forecasting.

problem Forecasting high-dimensional functional time series with explainability and accuracy.
method Bayesian nonparametric model based on Indian Buffet Process and multi-task Gaussian Process, incorporating a deep kernel function.
result DF2M provides better explainability and superior predictive accuracy compared to conventional deep learning models.

Paper proposes a new method for sparse covariance Cholesky factor estimation.

problem Estimating sparse covariance matrices for ordered data.
method Matrix loss penalization approach for sparse Cholesky factor estimation.
result The proposed method outperforms existing regression-based approaches in simulations and real data.

NoTMF forecasts sparse urban road movement speeds with nonstationary temporal matrix factorization.

problem Sparse and nonstationary movement speed data from urban roads.
method Nonstationary Temporal Matrix Factorization (NoTMF) model.
result NoTMF outperforms baseline models in forecasting urban road movement speeds.

New method predicts spatio-temporal data with short and long-range dependence.

problem Uncertainty in predicting the distribution of mixed moving average fields.
method Theory-guided machine learning approach using generalized Bayesian algorithm.
result Fixed-time and any-time PAC Bayesian bounds for ensemble forecasts.

TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.

problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.

Method improves clarity in forecasting spatio-temporal data.

problem Forecasting spatio-temporal data with clarity and interpretability.
method Supervised semi-nonnegative matrix factorization with frequency regularization.
result Method offers clearer interpretability in forecasting spatio-temporal data.

Novel Bayesian framework for spatio-temporal neuroimaging data.

problem Inference on multi-task sparse hierarchical regression models with complex spatio-temporal dynamics.
method Flexible hierarchical Bayesian framework with Kronecker product covariance structure, majorization-minimization optimization, and Riemannian geometry.
result Improved performance on synthetic and real M/EEG data.

BKTR models spatiotemporal data with scalable tensor regression.

problem High computational cost in applying STVC to large-scale spatiotemporal data.
method Summarize STVC coefficients in a tensor, reformulate as low-rank tensor regression, incorporate GP priors for local dependencies.
result BKTR efficiently models large spatiotemporal datasets with reduced parameters and local dependencies.

Optimizes Gaussian process hyperparameters using Bayesian autoregression.

problem Optimizing hyperparameters for Matérn kernel temporal Gaussian processes.
method Recursive Bayesian estimation for autoregressive parameters.
result Outperforms traditional optimization methods in runtime and accuracy.

TASTE combines static and temporal data for phenotyping EHRs.

problem Phenotyping EHRs with both static and temporal data.
method Jointly models static and temporal tensors using PARAFAC2 and non-negative matrix factorization, alternatingly solving sub-problems.
result TASTE outperforms existing methods in speed and clinical meaningfulness of phenotypes.

FactorGCL uses hypergraph learning to predict stock returns by mining hidden factors.

problem Mining effective factors in data-driven models is challenging due to low signal-to-noise ratio in market data.
method FactorGCL employs a hypergraph structure and temporal residual contrastive learning to extract hidden factors.
result FactorGCL outperforms existing methods and mines effective hidden factors for predicting stock returns.

A new method for CT-DCEGs simplifies inference for asymmetric processes.

problem Inference in asymmetric state space problems with continuous time evolution.
method An extension of CEG propagation for CT-DCEGs, employing junction tree inference.
result CT-DCEGs are preferred over DBNs and continuous time BNs for asymmetric processes.

Smart app tracks relapse history and predicts relapse based on spatial-temporal factors.

problem Relapse prevention for alcohol and tobacco addiction users.
method Records user profiles, tracks relapse history, uses machine learning for prediction, and recommends activities.
result Predictive machine learning algorithms help in preventing relapse.

Proposes a new tensor decomposition method for functional temporal data with adaptive complexity.

problem Challenges in temporal tensor decomposition for general tensor data with continuous indexes.
method Encodes continuous spatial indexes as learnable Fourier features and uses neural ODEs for temporal trajectories. Introduces a sparsity-inducing prior for complexity adaptation.
result Significantly outperforms existing methods in prediction performance and robustness against noise.

We focus on the problem of streaming recommender system and explore novel collaborative filtering algorithms to handle the data dynamicity and complexity in a streaming manner. Although deep neural networks have demonstrated the effectiveness of recommendation tasks, it is lack of explorations on integrating probabilis…

2019-06-11abs ↗pdf ↗

Despite the fact that they do not consider the temporal nature of data, classic dimensionality reduction techniques, such as PCA, are widely applied to time series data. In this paper, we introduce a factor decomposition specific for time series that builds upon the Bayesian multivariate autoregressive model and hence …

2014-06-14abs ↗pdf ↗

In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully Bayesian hierarchy for …

2010-04-29abs ↗pdf ↗

Bayesian method improves grid admittance matrix estimation from noisy data.

problem Accurate estimation of power grid admittance matrix in dynamic systems.
method Data-driven identification using voltage and current measurements, Bayesian approach.
result Significantly greater accuracy in admittance matrix estimation compared to existing methods.

We propose practical extensions to Bayesian optimization for solving dynamic problems. We model dynamic objective functions using spatiotemporal Gaussian process priors which capture all the instances of the functions over time. Our extensions to Bayesian optimization use the information learnt from this model to guide…

2018-03-09abs ↗pdf ↗

CtrlNS learns latent factors and distribution shifts from sparse transitions without prior knowledge.

problem Lack of prior knowledge of domain variables limits causal temporal representation learning.
method Sparse transition assumption and identifiability results from theoretical perspective.
result Effective in identifying distribution shifts and latent factors without prior knowledge.

Paper presents a spatio-temporal Bayesian model for early detection of COVID-19 hotspots.

problem Understanding spatio-temporal dynamics of COVID-19 hotspots to prevent outbreaks.
method Spatio-temporal Bayesian framework with a zero-mean Gaussian process and non-stationary kernel function enhanced by deep neural networks.
result Model demonstrates superior hotspot-detection performance compared to baseline methods.

In many fields observations are performed irregularly along time, due to either measurement limitations or lack of a constant immanent rate. While discrete-time Markov models (as Dynamic Bayesian Networks) introduce either inefficient computation or an information loss to reasoning about such processes, continuous-time…

2012-03-15abs ↗pdf ↗

Temporal difference learning explained through gradient splitting, improving convergence times.

problem Learning value functions in Markov Decision Processes with linear approximations.
method Interpreting TD learning as gradient splitting and applying convergence proofs from gradient descent.
result Improved convergence times for TD learning, especially with a minor variation.

We introduce Bayesian multi-tensor factorization, a model that is the first Bayesian formulation for joint factorization of multiple matrices and tensors. The research problem generalizes the joint matrix-tensor factorization problem to arbitrary sets of tensors of any depth, including matrices, can be interpreted as u…

2014-12-15abs ↗pdf ↗

HRTPP improves TPP interpretability and accuracy in medical event modeling.

problem Lack of interpretability in TPPs for medical event sequences.
method Hybrid-Rule Temporal Point Processes (HRTPP) integrating temporal logic rules and numerical features.
result HRTPP outperforms state-of-the-art interpretable TPPs in predictive performance and clinical interpretability.