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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Hierarchical Probabilistic Model

End-to-end deep model for coherent probabilistic forecasts in hierarchical time series.

problem Hierarchical probabilistic forecasting for coherent predictions.
method Dirichlet proportions model for learning root and child distributions.
result Significant improvements over state-of-the-art baselines (up to 26%).

Improves sampling from complex hierarchical models using HMC and automatic marginalization.

problem Sampling from complex hierarchical models is difficult for HMC.
method Proposes automatic marginalization as part of the sampling process using HMC in a graphical model extracted from a PPL.
result Significantly improves sampling from real-world hierarchical models.

t-NEB clusters high-dimensional data hierarchically with density paths.

problem Hierarchical clustering struggles with high-dimensional data.
method t-NEB uses density estimation, maximum density paths, and probabilistic merging.
result t-NEB yields state-of-the-art clustering performance on high-dimensional data.

A new method for Bayesian neural networks using probabilistic backpropagation.

problem Approximating posterior distributions in Bayesian neural networks.
method Variational Expectation Propagation (VEP) with probabilistic backpropagation.
result Efficient algorithm for approximate integration over posterior distributions.

HPPCA improves imputation of longitudinal data with missing values.

problem Handling incomplete, high-dimensional longitudinal data with nested sources of variation and temporal dependency.
method Hierarchical probabilistic principal component analysis (HPPCA) with a two-level latent factor model and Gaussian process.
result HPPCA outperforms standard PPCA and multivariate functional PCA in imputation accuracy, even under heavy missingness and model misspecification.

InferPy is a Python package for probabilistic modeling with deep neural networks. It defines a user-friendly API that trades-off model complexity with ease of use, unlike other libraries whose focus is on dealing with very general probabilistic models at the cost of having a more complex API. In particular, this packag…

2019-08-29abs ↗pdf ↗

Unified theory for neural scaling laws in hierarchically compositional data.

problem Understanding neural scaling laws in hierarchically compositional data.
method Probabilistic context-free grammars and power-law distributed production rules.
result Unified learning curve behavior for classification and next-token prediction tasks.

Probabilistic label trees improve XMLC by organizing labels hierarchically.

problem Efficiently tagging instances with a small subset of relevant labels from a large pool.
method Introduce and analyze probabilistic label trees (PLTs) as a generalization of hierarchical softmax for multi-label problems.
result PLTs are consistent for various performance metrics and can be trained online without prior knowledge.

We propose a new framework for imposing monotonicity constraints in a Bayesian nonparametric setting based on numerical solutions of stochastic differential equations. We derive a nonparametric model of monotonic functions that allows for interpretable priors and principled quantification of hierarchical uncertainty. W…

2019-05-30abs ↗pdf ↗

PGBM creates probabilistic predictions efficiently.

problem Creating probabilistic predictions for large-scale data.
method Approximates leaf weights as random variables, learns moments via stochastic tree ensemble update equations.
result PGBM offers significant speedup and accuracy improvements over existing methods.

A new Bayesian model improves forecasting for intermittent demand.

problem Sparse observations, cold-start items, and obsolescence in intermittent demand forecasting.
method Hierarchical Bayesian TSB model with partial pooling and calibrated probabilistic configuration.
result TSB-HB achieves the lowest RMSE and RMSSE on the UCI Online Retail dataset.

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 ↗

Researchers develop methods for inference in hierarchical models using neural simulations.

problem Inference in hierarchical models with intractable likelihoods.
method Construct neural estimators for likelihood-ratio or posterior, accounting for hierarchical structure.
result Explicitly accounting for hierarchical structure leads to tighter parameter constraints.

The paper proposes blending gradient boosted trees and neural networks for hierarchical time series forecasting.

problem Point and probabilistic forecasting of hierarchical time series.
method A blending methodology of gradient boosted trees and neural networks, with feature engineering and diverse model selection.
result Ranked within the gold medal range in both Accuracy and Uncertainty tracks of the M5 Competition.

Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.

problem Learning dependencies in hierarchical feature spaces.
method Exploits hierarchical parent-child relationships as constraints to learn a dependency tree.
result Hie-TAN-Lite outperforms Hie-TAN and other methods in predictive accuracy.

Proposes a new algorithm for efficient probabilistic reconciliation of forecasts.

problem Ensuring coherence in forecasts for hierarchical time series.
method Bottom-Up Importance Sampling algorithm for any type of forecast distribution.
result Significant improvement over base probabilistic forecasts in experiments.

A method for efficient CV estimates in Bayesian hierarchical models.

problem Computational infeasibility of cross-validation in Bayesian hierarchical regression models.
method Conditioning on variance-covariance parameters to transform CV into an optimization problem.
result Equivalent or improved predictive estimates compared to full cross-validation.

We present a comparative study of different probabilistic forecasting techniques on the task of predicting the electrical load of secondary substations and cabinets located in a low voltage distribution grid, as well as their aggregated power profile. The methods are evaluated using standard KPIs for deterministic and …

2019-10-03abs ↗pdf ↗

Develops a method for probabilistic simulation of renewable energy production at grid scale.

problem Uncertainty in short-term electricity generation from renewable assets.
method Probabilistic framework with asset calibration, hierarchical clustering, and Gaussianization.
result Full uncertainty quantification at asset and collection levels.

PALM learns abstract models for efficient planning and task transfer.

problem Efficiently learning and transferring hierarchical models for planning.
method PALM uses a new formal structure (L-AMDP) to learn independent, modular models at multiple levels of abstraction.
result PALM integrates planning and execution, facilitating rapid learning of abstract models.

Probabilistic graphical models are traditionally known for their successes in generative modeling. In this work, we advocate layered graphical models (LGMs) for probabilistic discriminative learning. To this end, we design LGMs in close analogy to neural networks (NNs), that is, they have deep hierarchical structures a…

2019-01-31abs ↗pdf ↗

In this paper we introduce ZhuSuan, a python probabilistic programming library for Bayesian deep learning, which conjoins the complimentary advantages of Bayesian methods and deep learning. ZhuSuan is built upon Tensorflow. Unlike existing deep learning libraries, which are mainly designed for deterministic neural netw…

2017-09-18abs ↗pdf ↗

Probabilistic techniques are central to data analysis, but different approaches can be difficult to apply, combine, and compare. This paper introduces composable generative population models (CGPMs), a computational abstraction that extends directed graphical models and can be used to describe and compose a broad class…

2016-08-18abs ↗pdf ↗

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.

Physicists use quantum models to describe the behavior of physical systems. Quantum models owe their success to their interpretability, to their relation to probabilistic models (quantization of classical models) and to their high predictive power. Beyond physics, these properties are valuable in general data science. …

2016-01-22abs ↗pdf ↗

d3p package enables efficient Bayesian inference with differential privacy.

problem Efficiently performing Bayesian inference under differential privacy constraints.
method Differentially private variational inference for flexible probabilistic models.
result Achieves significant speed-up in runtime for complex models.

HEBAE improves VAEs by adaptively balancing reconstruction and regularization.

problem Posterior collapse in VAEs leading to over-regularization and poor latent encoding.
method Hierarchical Empirical Bayes approach to probabilistic generative models.
result HEBAE generates higher quality samples with better FID scores.

Improved hierarchical discrete VAEs for better stability and performance.

problem Training stable and efficient hierarchical discrete VAEs with numerous latent variables.
method Introducing Relaxed-Responsibility Vector-Quantisation to parameterise discrete latent variables in a hierarchical structure.
result Achieved state-of-the-art bits-per-dim results for various standard datasets.

HIRM models noisy, sparse, heterogeneous relational data using hierarchical clustering and Dirichlet processes.

problem Modeling noisy, sparse, and heterogeneous relational data.
method Hierarchical Chinese restaurant process and Dirichlet process mixture for clustering and modeling relation values.
result HIRM generalizes standard models and discovers relational structure in real-world datasets.

Transformer models perform slower than convolutional networks in learning hierarchical language structures.

problem Understanding how neural networks learn hierarchical language structures.
method Theoretical scaling laws and empirical validation of neural network performance.
result Convolutional networks outperform transformers in learning hierarchical language structures.

Probabilistic models with discrete latent variables naturally capture datasets composed of discrete classes. However, they are difficult to train efficiently, since backpropagation through discrete variables is generally not possible. We present a novel method to train a class of probabilistic models with discrete late…

2016-09-07abs ↗pdf ↗