We show a general relation between the spatially disjoint product of probability density functions and the sum of their Fisher information metric tensors. We then utilise this result to give a method for constructing the probability density functions for an arbitrary Riemannian Fisher information metric tensor. We note…
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,657 papers · 148 categories
Trend · papers per month
48 results for “probability density functions”
The probability density function for the visible sector of a Riemann-Theta Boltzmann machine can be taken conditional on a subset of the visible units. We derive that the corresponding conditional density function is given by a reparameterization of the Riemann-Theta Boltzmann machine modelling the original probability…
This paper introduces a probability density estimator based on Green's function identities. A density model is constructed under the sole assumption that the probability density is differentiable. The method is implemented as a binary likelihood estimator for classification purposes, so issues such as mis-modeling and …
Probability density estimation is a classical and well studied problem, but standard density estimation methods have historically lacked the power to model complex and high-dimensional image distributions. More recent generative models leverage the power of neural networks to implicitly learn and represent probability …
OPAA estimates probability densities using functional analysis.
problem Estimating probability density functions efficiently and accurately.
method OPAA uses a parallelizable algorithm based on functional analysis to estimate probability distributions.
result OPAA provides an efficient method to estimate probability density functions and normalizing weights.
Paper connects probability density cuts to graph theory eigenfunctions.
problem Developing sparse cuts for probability densities.
method Defines sparse cuts and principal eigenfunctions for probability densities, proving Cheeger and Buser inequalities.
result No such inequalities hold for prior definitions, proving new inequalities for probability densities.
We show that the visible sector probability density function of the Riemann-Theta Boltzmann machine corresponds to a gaussian mixture model consisting of an infinite number of component multi-variate gaussians. The weights of the mixture are given by a discrete multi-variate gaussian over the hidden state space. This a…
This research improves demand forecasting by predicting complete probability density functions using machine learning.
problem Forecasting complete probability density functions for better operational decision making.
method Supervised machine learning method 'Cyclic Boosting' for explainable predictions.
result Predicted probability density functions are fully explainable and avoid 'black-box' models.
Proposes a method to estimate time-dependent probability density functions using binary classifiers.
problem Estimating time-dependent probability density functions of stochastic processes.
method Trains a time-dependent binary classifier to discriminate between realizations of a stochastic process at two nearby time instants.
result Explicitly models and accurately reconstructs complex time-dependent, multi-modal, and near-degenerate densities.
VI approximates complex densities faster than classical methods.
problem Approximating complex probability densities.
method Optimization of a family of probability density functions using KL divergence.
result VI converges faster than Markov Chain Monte Carlo.
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.
New method improves sampling from high-dimensional target densities.
problem Sampling from high-dimensional target densities using Monte Carlo algorithms.
method Extends Metropolis-Adjusted Langevin Diffusion algorithm with random precondition matrix modeling.
result Significantly improves performance and computational efficiency over standard MCMC methods.
A new machine learning model uses score matching to estimate probability densities efficiently.
problem Estimating probability density functions is challenging.
method Introduced a product Jacobi-Theta Boltzmann machine (pJTBM) and used score matching for efficient fitting.
result The pJTBM can fit probability densities more efficiently than the RTBM using score matching.
The paper analyzes kNN density estimation's convergence rates under different conditions.
problem Analyzing convergence rates of kNN density estimation under bounded and unbounded support conditions.
method Examined two cases: bounded support with known and unknown support sets, and unbounded support with smooth density function.
result kNN density estimation is minimax optimal under certain conditions and better than kernel density estimation in some cases.
Bayesian inference engines improve density estimation accuracy and scalability.
problem Constructing accurate and scalable probability density functions.
method Bayesian inference engines (no-U-turn sampling and expectation propagation) with binning strategy.
result Density estimates have excellent comparative performance and scale well to large sample sizes.
Develops a new density ratio estimator for causal inference.
problem Estimation of density ratio functions in statistics.
method Super learning approach with a novel loss function.
result Empirical validation of the density ratio super learner's performance.
Triangular map is a recent construct in probability theory that allows one to transform any source probability density function to any target density function. Based on triangular maps, we propose a general framework for high-dimensional density estimation, by specifying one-dimensional transformations (equivalently co…
A number of fundamental quantities in statistical signal processing and information theory can be expressed as integral functions of two probability density functions. Such quantities are called density functionals as they map density functions onto the real line. For example, information divergence functions measure t…
PSD models simplify probability density estimation.
problem Effective modeling of probability densities for inference.
method Positive semi-definite (PSD) models for non-negative functions.
result PSD models efficiently support product and sum rules.
We study the rank distribution, the cumulative probability, and the probability density of returns of stock prices of listed firms traded in four stock markets. We find that the rank distribution and the cumulative probability of stock prices traded in are consistent approximately with the Zipf's law or a power law. It…
The paper introduces a new method to find meaningful data subsets in multivariate probability density functions.
problem Finding meaningful data subsets in multivariate probability density functions.
method The paper defines an abstract bump construct based on curvature functionals of the probability density and proposes a multivariate implementation of Good and Gaskins' original concave bumps.
result The method provides theoretical results for asymptotic consistency of bump boundaries and confidence regions.
Conformal Prediction Regions match Imprecise Highest Density Regions under consonance.
problem Matching conformal prediction regions with highest density regions.
method Using consonance and the Imprecise Probability theory of clouds.
result Imprecise Highest Density Regions are equivalent to Conformal Prediction Regions under consonance.
Unified framework for constructing nonconvex sparse recovery methods.
problem Constructing valid nonconvex regularization functions remains open.
method Unified framework based on probability density function, using Weibull distribution.
result New nonconvex sparse recovery method based on Weibull distribution.
By representing words with probability densities rather than point vectors, probabilistic word embeddings can capture rich and interpretable semantic information and uncertainty. The uncertainty information can be particularly meaningful in capturing entailment relationships -- whereby general words such as "entity" co…
Truncated densities are probability density functions defined on truncated domains. They share the same parametric form with their non-truncated counterparts up to a normalizing constant. Since the computation of their normalizing constants is usually infeasible, Maximum Likelihood Estimation cannot be easily applied t…
LLMs learn probability density functions in-context, showing distinct learning trajectories.
problem Density estimation of time series data in LLMs.
method Intensive Principal Component Analysis (InPCA) to visualize and analyze LLMs' learning dynamics.
result LLMs follow similar learning trajectories in a low-dimensional InPCA space, distinct from traditional methods.
A New Type Of Upper And Lower Bounds On Right-Tail Probabilities Of Continuous Random Variablesmath.PR
New bounds on continuous random variables' right-tail probabilities.
problem Finding precise upper and lower limits for right-tail probabilities of continuous random variables.
method Developed new bounds based on PDF, first derivative, and two parameters.
result The new bounds are tight for various continuous random variables.
Improved MLMC method for robust and efficient probability and density estimation.
problem Stability and poor complexity of MLMC for low-regularity functionals.
method Numerical smoothing combined with MLMC for deterministic quadrature methods.
result Significant improvement in strong convergence and robustness of MLMC method.
New model for density estimation using tensor trains.
problem Estimation of high-dimensional probability density functions.
method Tensor train-based density estimation (TTDE) with Riemannian optimization.
result TTDE outperforms competitors in training speed and performance.
The study examines Fisher-Riemann geodesics for nonparametric probability densities.
problem Understanding nonparametric probability densities using Fisher-Riemann geometry.
method Obtaining Fisher-Riemann geodesics as a limit of parametric cases with increasing parameters.
result The weak limit approach for nonparametric probability densities.
Minimum Density Hyperplanesstat.ML
Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is central to many statistical and machine learning approaches to the classification of unlabelled data. We propose a novel hyperplane classifier for clustering and semi-supervised classificati…
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…
A reliable and accurate forecasting model for crop yields is of crucial importance for efficient decision-making process in the agricultural sector. However, due to weather extremes and uncertainties, most forecasting models for crop yield are not reliable and accurate. For measuring the uncertainty and obtaining furth…
Kernel Density Machinesstat.ML
Kernel Density Machines learn probability densities without structural assumptions.
problem Learning probability densities under minimal assumptions.
method Kernel-based framework, agnostic to structural requirements.
result Consistency and functional central limit theorem for sample estimator.
Discussing new econophysics methods for volatility and probability density estimation.
problem Estimating volatility and probability densities in econophysics.
method Reviewing recent methods for volatility and probability density estimation.
result Pioneering methods for volatility and probability density estimation in econophysics.
The paper introduces flat-topped PDFs for better fitting machine learning models.
problem Improving goodness of fit in machine learning models.
method Developed a new PDF based on the Fermi-Dirac or logistic function for adaptability.
result Flat-topped PDFs enhance model simplicity and fit quality.
Paper proposes new density estimators for high-dimensional data.
problem Prohibitive computational cost and slow convergence rate in high-dimensional density estimation.
method Adaptive hyperbolic cross density estimators in mixed smooth Sobolev spaces.
result Proposed estimators do not suffer curse of dimensionality under Integral Probability Metrics.
In Divide & Recombine (D&R), big data are divided into subsets, each analytic method is applied to subsets, and the outputs are recombined. This enables deep analysis and practical computational performance. An innovate D\&R procedure is proposed to compute likelihood functions of data-model (DM) parameters for big dat…
Method uses normalizing flows to efficiently sample from complex target densities.
problem Sampling from complex target densities with zero values in regions of transformation.
method Normalizing flows to address exploding reverse Kullback-Leibler divergence.
result Demonstrated efficient sampling from multi-mode complex density function.
Quasiprobabilistic Density Ratio Estimation with a Reverse Engineered Classification Loss Functionstat.ML
We develop a new loss function for estimating quasiprobabilistic density ratios.
problem Discontinuous or non-surjective relationships between optimal classifiers and target densities.
method Introduce a convex loss function compatible with both probabilistic and quasiprobabilistic densities.
result Achieve state-of-the-art results in estimating di-Higgs production in particle physics.
SDE automatically recovers interpretable discrete distributions.
problem Limited interpretable discrete probability laws.
method Unsupervised framework using symbolic density estimation.
result Accurately recovers interpretable discrete distributions.
Improved manifold-adaptive dimension estimator for better data complexity assessment.
problem Estimating intrinsic dimensionality of complex data.
method Revised and improved Farahmand-Szepesvári-Audibert (FSA) estimator, incorporating probability density function and median.
result Median-FSA estimator outperforms existing methods in accuracy and robustness.
A method for eliciting expert beliefs using preferential questions and normalizing flows.
problem Eliciting high-dimensional probability distributions from noisy judgments.
method Normalizing flows based on preferential questions with a novel functional prior.
result The method allows for the inference of arbitrarily flexible densities from preferential judgments.
Study improves density estimation for compact domains using -lifted KL divergence.
problem Estimating probability density functions on compact domains.
method Introduced -lifted Kullback--Leibler (KL) divergence for risk minimization.
result Proved bound on estimation error.
Modified lognormal distribution with flexible tails for skewed data.
problem Skewed and fat-tailed data in natural and engineering datasets.
method Developed a family of three-parameter non-Gaussian probability density functions based on generalized kappa-exponential and kappa-logarithm functions.
result Closed-form analytic expressions for statistical functions and maximum-likelihood estimation.
This paper derives the non-analytic solution to the Fokker-Planck equation of fractional Brownian motion using the method of Laplace transform. Sequentially, by considering the fundamental solution of the non-analytic solution, this paper obtains the transition probability density function of the random variable that i…
Hierarchical correlation reconstruction with missing data, for example for biology-inspired neuroncs.LG
Machine learning often needs to model density from a multidimensional data sample, including correlations between coordinates. Additionally, we often have missing data case: that data points can miss values for some of coordinates. This article adapts rapid parametric density estimation approach for this purpose: model…
One of the fundamental problems in machine learning is the estimation of a probability distribution from data. Many techniques have been proposed to study the structure of data, most often building around the assumption that observations lie on a lower-dimensional manifold of high probability. It has been more difficul…