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

Trend · papers per month

4999148197 · Jun 202019922001200920172026
48 results for flexible density

Combines MCTM and NF for flexible multivariate density regression with interpretable marginals.

problem Difficult interpretation of flexible NF models and limitations of MCTM in flexibility.
method Hybrid approach combining MCTM for interpretable marginals and NF for complex joint distributions.
result Demonstrates versatility and improved performance compared to MCTM and other NF models.

New framework quantifies uncertainty in flexible density-based clustering.

problem Uncertainty quantification in clustering with non-parametric density estimation.
method Martingale posterior distributions and density-based clustering.
result Efficient GPU-compatible inference on clustering structures with uncertainty.

A normalizing flow models a complex probability density as an invertible transformation of a simple base density. Flows based on either coupling or autoregressive transforms both offer exact density evaluation and sampling, but rely on the parameterization of an easily invertible elementwise transformation, whose choic…

2019-06-10abs ↗pdf ↗

Gradient Boosted Normalizing Flows improve flexibility of NFs without increasing complexity.

problem Improving flexibility of normalizing flows without increasing complexity.
method Gradient Boosting applied to normalizing flows to create a mixture model structure.
result GBNFs outperform non-boosted NFs and produce better results with simpler components.

WDL models density curves using Wasserstein distance and flexible mixture models.

problem Modeling entire distribution and non-negativity constraints.
method Wasserstein distance, Semi-parametric Conditional Gaussian Mixture Models (SCGMM), Majorization-Minimization optimization.
result WDL better characterizes nonlinear dependence of conditional densities.

E2^2M optimizes tensor density estimation by relaxing αα-divergence to KL-divergence.

problem Analytical challenges in traditional αα-divergence optimization for tensor-based density estimation.
method E2^2M algorithm: relaxes optimization to KL-divergence, then applies tensor many-body approximation.
result Flexible modeling of various low-rank structures and their mixtures.

A new framework for flexible neural network receptive fields.

problem Adaptive and flexible receptive fields in neural networks.
method Density-embedding layers that replace affine transformations with scalar products of input and density functions.
result Density-embedding layers can adaptively tune receptive fields and are computationally efficient.

Proposes a new method for high-dimensional density estimation.

problem Estimating high-dimensional probability density functions efficiently.
method Tensorizing flow method combining tensor-train and flow-based generative modeling.
result Efficiently constructs an approximate density in tensor-train form and trains a flow model to match empirical distribution.

RNE provides a flexible framework for diffusion models, enabling inference-time control and energy-based training.

problem Insufficient knowledge of marginal densities in diffusion models.
method Introduces Radon-Nikodym Estimator (RNE) to reveal the connection between marginal densities and transition kernels.
result RNE delivers strong results in inference-time control and energy-based diffusion training.

GCAE uses density estimation to achieve reliable disentanglement in latent space.

problem Disentangled learning representations suffer from reliability issues.
method GCAE uses Gaussian Channel Autoencoder with Dual Total Correlation (DTC) to avoid the curse of dimensionality.
result GCAE achieves highly competitive and reliable disentanglement scores.

This paper describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For dd covariates, there are 2d2^d basis coefficients to estimate, which renders conventional approaches computationally prohibitive …

2011-12-07abs ↗pdf ↗

Autoregressive models are among the best performing neural density estimators. We describe an approach for increasing the flexibility of an autoregressive model, based on modelling the random numbers that the model uses internally when generating data. By constructing a stack of autoregressive models, each modelling th…

2017-05-19abs ↗pdf ↗

Maximum entropy modeling is a flexible and popular framework for formulating statistical models given partial knowledge. In this paper, rather than the traditional method of optimizing over the continuous density directly, we learn a smooth and invertible transformation that maps a simple distribution to the desired ma…

2017-01-12abs ↗pdf ↗

The study applies spatial density models to mobile node movements using Möbius distributions.

problem Modeling the steady-state density of mobile nodes on a 2D terrain.
method Used mixture density networks with Möbius distributions to describe node density over a disk.
result Möbius distributions are more suitable for capturing radial changes in node density compared to Gaussian distributions.

Neural density estimators are flexible families of parametric models which have seen widespread use in unsupervised machine learning in recent years. Maximum-likelihood training typically dictates that these models be constrained to specify an explicit density. However, this limitation can be overcome by instead using …

2019-04-11abs ↗pdf ↗

Riesz regression connects to density ratio estimation for causal inference.

problem Estimating average treatment effects in causal inference.
method Riesz regression as a signed density ratio and least-squares importance fitting.
result Riesz regression and DRE are equivalent, allowing transfer of DRE results.

DDN models flexible free-form conditional distributions.

problem Difficulty in explicitly approximating arbitrary conditional distributions.
method Deconvolutional neural network framework for discretizing continuous domains.
result DDN outperforms other density-estimation methods on various tasks.

Semi-implicit variational inference (SIVI) is introduced to expand the commonly used analytic variational distribution family, by mixing the variational parameter with a flexible distribution. This mixing distribution can assume any density function, explicit or not, as long as independent random samples can be generat…

2018-05-28abs ↗pdf ↗

In the modal approach to clustering, clusters are defined as the local maxima of the underlying probability density function, where the latter can be estimated either non-parametrically or using finite mixture models. Thus, clusters are closely related to certain regions around the density modes, and every cluster corr…

2020-02-10abs ↗pdf ↗

Learning a distribution conditional on a set of discrete-valued features is a commonly encountered task. This becomes more challenging with a high-dimensional feature set when there is the possibility of interaction between the features. In addition, many frequently applied techniques consider only prediction of the me…

2013-04-26abs ↗pdf ↗

Unified representation of density-power-based divergences simplifies estimation to M-estimation.

problem Outliers in density estimation.
method Define a norm-based Bregman density power divergence (NB-DPD) that reduces to M-estimation.
result NB-DPD connects and generalizes existing divergences, highlighting robustness properties.

TTF improves performance of normalizing flows for heavy-tailed distributions.

problem Improving performance of normalizing flows for heavy-tailed distributions.
method Uses a Gaussian base distribution and a final transformation layer to produce heavy tails.
result Experimental results show TTF outperforms current methods, especially in high-dimensional or heavy-tailed scenarios.

Modeling complex conditional distributions is critical in a variety of settings. Despite a long tradition of research into conditional density estimation, current methods employ either simple parametric forms or are difficult to learn in practice. This paper employs normalising flows as a flexible likelihood model and …

2018-02-14abs ↗pdf ↗

Normalized compound random measures are flexible nonparametric priors for related distributions. We consider building general nonparametric regression models using normalized compound random measure mixture models. Posterior inference is made using a novel pseudo-marginal Metropolis-Hastings sampler for normalized comp…

2016-08-02abs ↗pdf ↗

In this paper we contribute a novel algorithm family, which generalizes many unsupervised techniques including unnormalized and energy models, and allows us to infer different statistical modalities (e.g. data likelihood and ratio between densities) from data samples. The proposed unsupervised technique, named Probabil…

2019-03-25abs ↗pdf ↗

We model the dynamics of asset prices and associated derivatives by consideration of the dynamics of the conditional probability density process for the value of an asset at some specified time in the future. In the case where the price process is driven by Brownian motion, an associated "master equation" for the dynam…

2010-10-21abs ↗pdf ↗

Flow Matching improves statistical guarantees through kernel density estimation.

problem Improving statistical guarantees for generative models.
method Connecting Flow Matching to kernel density estimation and verifying optimal rates of convergence.
result Flow Matching achieves optimal rates up to logarithmic factors for large networks and on lower-dimensional manifolds.

SPH-ParVI uses fluid dynamics to sample unknown densities efficiently.

problem Sampling partially known densities or using gradients in probabilistic models.
method Smoothed Particle Hydrodynamics (SPH) for modeling fluid dynamics to approximate target densities.
result SPH-ParVI provides fast, flexible, scalable, and deterministic sampling for Bayesian inference and generative models.

We introduce a copula mixture model to perform dependency-seeking clustering when co-occurring samples from different data sources are available. The model takes advantage of the great flexibility offered by the copulas framework to extend mixtures of Canonical Correlation Analysis to multivariate data with arbitrary c…

2012-06-27abs ↗pdf ↗

Paper proposes a novel approach to density ratio estimation using projection pursuit.

problem Density ratio estimation challenges in high dimensions and model misspecification.
method The approach uses projection pursuit to approximate density ratios, addressing high dimensionality and model flexibility issues.
result The proposed estimator is consistent and converges at a certain rate, outperforming existing methods in experiments.

Transformer with denoising diffusion improves probabilistic density estimation.

problem Estimating non-Gaussian and multimodal probability distributions for regression problems.
method Training a denoising diffusion head on top of a Transformer model.
result The model provides reasonable probability density estimation for high-dimensional inputs.

GNet uses Gaussian processes for scalable, flexible neural networks.

problem Large-scale predictive modeling with high computational and storage costs.
method GNet employs Gaussian processes with nonparametric activation functions and a fast algorithm for training and predictions.
result GNet achieves competitive performance across various test problems, including nonlinear function prediction and real-world data regression.