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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Hierarchical Hidden Markov Models

Hierarchical hidden Markov models predict market trends in financial time series.

problem Misinterpretation of short-term price fluctuations as long-term trend changes.
method Hierarchical hidden Markov models to capture both short- and long-term trends.
result Hierarchical models provide a comprehensive picture of financial markets.

A new model separates persistence and transition priors in HDP-HMM.

problem Limitation of sticky HDP-HMM in expressing different persistence strengths.
method Developed a disentangled sticky HDP-HMM (DS-HDP-HMM) with novel Gibbs sampling algorithms.
result DS-HDP-HMM outperforms sticky HDP-HMM and HDP-HMM on synthetic and real data.

There is much interest in the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) as a natural Bayesian nonparametric extension of the ubiquitous Hidden Markov Model for learning from sequential and time-series data. However, in many settings the HDP-HMM's strict Markovian constraints are undesirable, particul…

2012-03-07abs ↗pdf ↗

Paper presents a novel online HAR method using Hierarchical Hidden Markov Models.

problem Challenges in robust online activity recognition in smart environments.
method Two-phase approach: 1) Segmentation and activity reporting using Hierarchical Hidden Markov Models, 2) Correction of labels based on statistical features.
result Proposes a method that can detect and correct interrupted activities, outperforming state-of-the-art methods.

New model improves cancer screening prediction accuracy.

problem Modeling disease progression with heterogeneous populations and irregular data.
method Hierarchical Hidden Markov Jump Processes with piece-wise stationary transitions and scalable EM algorithm.
result Model outperforms state-of-the-art models in prediction accuracy and generating Kaplan-Meier estimators.

Study evaluates initialization strategies for infinite hidden Markov models.

problem Limited attention to initialization in infinite hidden Markov models.
method Systematically evaluated distance-based clustering, model-based, and uniform initializations.
result Distance-based clustering initializations consistently outperform other methods.

Stochastic variational inference for collapsed models has recently been successfully applied to large scale topic modelling. In this paper, we propose a stochastic collapsed variational inference algorithm in the sequential data setting. Our algorithm is applicable to both finite hidden Markov models and hierarchical D…

2015-12-05abs ↗pdf ↗

The hidden Markov model (HMM) is a widely-used generative model that copes with sequential data, assuming that each observation is conditioned on the state of a hidden Markov chain. In this paper, we derive a novel algorithm to cluster HMMs based on the hierarchical EM (HEM) algorithm. The proposed algorithm i) cluster…

2012-10-24abs ↗pdf ↗

There is much interest in the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) as a natural Bayesian nonparametric extension of the traditional HMM. However, in many settings the HDP-HMM's strict Markovian constraints are undesirable, particularly if we wish to learn or encode non-geometric state durations.…

2012-03-15abs ↗pdf ↗

Aggregates models from different datasets using shared latent structures.

problem Aggregating models from heterogeneous datasets with shared latent structures.
method Bayesian nonparametrics for identifying correspondences among local model parameterizations.
result Framework successfully aggregates various model types across different applications.

We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between "nearby" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pai…

2017-07-21abs ↗pdf ↗

In unsupervised classification, Hidden Markov Models (HMM) are used to account for a neighborhood structure between observations. The emission distributions are often supposed to belong to some parametric family. In this paper, a semiparametric modeling where the emission distributions are a mixture of parametric distr…

2012-06-22abs ↗pdf ↗

A scalable Bayesian additive model for stellar flare detection using Gaussian process inference and hidden Markov models.

problem Bayesian time-series modeling for astronomical datasets
method Generative surrogate framework with Variational Autoencoder and neural network forward pass
result Significant reduction in computational time for stellar flare detection

This paper reviews recent advances in Bayesian nonparametric techniques for constructing and performing inference in infinite hidden Markov models. We focus on variants of Bayesian nonparametric hidden Markov models that enhance a posteriori state-persistence in particular. This paper also introduces a new Bayesian non…

2014-06-30abs ↗pdf ↗

We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model (iHMM) that supports a simple, efficient inference scheme. The siHMM is well suited to segmentation problems, where the goal is to identify points at which a time series transitions from one relatively stable regime to a new regime. Conv…

2016-02-20abs ↗pdf ↗

We propose a Bayesian nonparametric mixture model for prediction- and information extraction tasks with an efficient inference scheme. It models categorical-valued time series that exhibit dynamics from multiple underlying patterns (e.g. user behavior traces). We simplify the idea of capturing these patterns by hierarc…

2017-06-19abs ↗pdf ↗

In this paper, computer-based techniques for stylistic analysis of paintings are applied to the five panels of the 14th century Peruzzi Altarpiece by Giotto di Bondone. Features are extracted by combining a dual-tree complex wavelet transform with a hidden Markov tree (HMT) model. Hierarchical clustering is used to ide…

2014-01-26abs ↗pdf ↗

A deep Neyman-Scott process uses Poisson processes for efficient inference in complex point processes.

problem Efficient inference in complex hierarchical point processes.
method Developed an efficient posterior sampling via Markov chain Monte Carlo for likelihood-based inference.
result More hidden Poisson processes improve likelihood fitting and event prediction.

The paper estimates key metrics for linear models with Markov or hidden Markov sources.

problem Estimating free energy, mutual information, and MMSE for linear models with specific signal priors.
method Replica analysis in statistical physics, focusing on Markov and hidden Markov sources.
result The linear model with Markov or hidden Markov sources can be simplified into decoupled AWGN channels.

Hidden Markov Neural Networks balance adaptation and forgetting in time-series data.

problem Balancing adaptation to new data and forgetting outdated information in time-series forecasting.
method Modeling weights as hidden states of a Hidden Markov model, using a filtering algorithm for learning a variational approximation of the posterior distribution over weights, and employing sequential Bayes by Backprop with variational DropConnect for regularization.
result Achieves strong predictive performance and effective uncertainty quantification on various tasks.

Modified asymmetric hidden Markov models for time series with autoregressive components.

problem Dynamic relationships between variables in time series data.
method Introducing an asymmetric autoregressive component to recent asymmetric hidden Markov models.
result The model can choose the optimal autoregressive order for better likelihood.

Investor selects portfolios based on news attention in a hidden Markov model.

problem Mean-variance portfolio selection in a dynamic attention context.
method Closed-loop equilibrium strategies via extended HJB equation and Markov chain approximation.
result Equilibrium strategies found through iterative algorithm and numerical examples.

A new HMM model captures kernel dependencies using context-specific Bayesian networks.

problem Traditional HMMs struggle with non-Gaussian data and independence assumptions.
method Kernel density estimation with context-specific Bayesian networks.
result The proposed model outperforms related HMMs in likelihood and classification accuracy.

Paper proposes a new HMM approach for better action recognition.

problem Capturing complex temporal dependency patterns in skeleton-based actions.
method Introduces a hierarchical HMM with a latent variable layer for dynamic inference.
result Proposed approach effectively models complex sequential data and handles missing values.

New algorithm for collective Gaussian hidden Markov models inference.

problem Inference of collective Gaussian hidden Markov models from aggregate data.
method Collective Gaussian forward-backward algorithm, extending Sinkhorn belief propagation.
result Convergence guarantee and applicability to single individual Kalman filter.

Hidden tree Markov models allow learning distributions for tree structured data while being interpretable as nondeterministic automata. We provide a concise summary of the main approaches in literature, focusing in particular on the causality assumptions introduced by the choice of a specific tree visit direction. We w…

2018-05-31abs ↗pdf ↗

The study uses Bayesian Hidden Markov Models to predict cryptocurrency returns.

problem Predicting the volatility and trends of cryptocurrencies.
method Bayesian Hidden Markov Models with four states to capture different return characteristics.
result The NHHM model with four states outperforms other models in predicting cryptocurrency returns.

New clustering method recovers hidden tree structure from data.

problem Recovering hidden hierarchical structure in data.
method Maximum average dot product for merging clusters in hierarchical clustering.
result The algorithm produces a tree that accurately represents the underlying generative hierarchical structure.