Lie PCA improves density estimation on symmetric manifolds.
problem Density estimation for symmetric manifolds.
method Spectral method to approximate Lie algebra of symmetry group.
result Improved sample complexity and density estimation on various data sets.
Method estimates densities on manifolds using dequantization.
problem Estimating densities on non-Euclidean manifolds.
method Inspired by dequantization, coordinate transformation, and normalizing flows.
result Successfully models densities on spheres, tori, and orthogonal groups.
A new method inflates and deflates data manifolds to estimate densities without losing universality.
problem Density estimation on low-dimensional manifolds with non-Euclidean support.
method Inflation-deflation approach using Normalizing Flows with added noise.
result Exact estimation of densities on manifolds with sufficient conditions and Gaussian noise approximation.
NeuroPMD estimates densities on complex product manifolds.
problem Density estimation on high-dimensional product manifolds.
method Neural network directly parameterizes density, trained with manifold differential operators.
result NeuroPMD outperforms traditional methods in density estimation.
Paper proposes methods to learn sub-manifolds and estimate densities in normalizing flows.
problem Normalizing flows struggle with finding sub-manifolds in high-dimensional data.
method Introduces per-pixel penalized log-likelihood and hierarchical training approaches.
result Validated superior performance in manifold learning and density estimation.
A new method for estimating density ratios using geodesics on statistical manifolds.
problem Stability of density ratio estimation when distributions are distant.
method Iterative sampling along generalized geodesics on the Riemannian manifold.
result The proposed method outperforms existing incremental mixture methods.
Normalizing flows can now estimate densities on unknown manifolds.
problem Normalizing flows struggle with data on unknown low-dimensional manifolds.
method Conformal Embedding Flows, which combine standard flows with trainable conformal embeddings.
result Tractable density estimation on manifold-supported data is possible.
The paper improves boundary detection and density estimation on noisy data.
problem Detecting boundary points and estimating density on noisy data from compact manifolds.
method Doubly stochastic scaling of the Gaussian heat kernel via Sinkhorn iterations.
result The new estimates of boundary points and density outperform standard methods, especially under noise.
Research on manifold learning within a density ridge estimation framework has shown great potential in recent work for both estimation and de-noising of manifolds, building on the intuitive and well-defined notion of principal curves and surfaces. However, the problem of unwrapping or unfolding manifolds has received r…
Study on manifolds with density using modified Hessians for curvature comparison.
problem Developing comparison geometry on manifolds with density.
method Modified Hessian approach based on weighted sectional curvature framework.
result Derivation of Hessian comparison and shape operator comparison theorems.
EMDE efficiently estimates manifold densities for diverse recommendation systems.
problem Efficiently estimating manifold densities for multi-modal recommendation systems.
method EMDE (Efficient Manifold Density Estimator) framework for arbitrary vector representations.
result Established new state-of-the-art results in top-k and session-based recommendation settings.
BMTI method estimates densities without bins, outperforming traditional estimators.
problem Nonparametric, robust, and data-efficient density estimation in high-dimensional spaces.
method BMTI integrates log-density differences between neighboring points, weighted by uncertainties, using a maximum-likelihood formulation.
result BMTI reconstructs smooth profiles in high-dimensional spaces, outperforming traditional estimators.
We consider the problem of density estimation on Riemannian manifolds. Density estimation on manifolds has many applications in fluid-mechanics, optics and plasma physics and it appears often when dealing with angular variables (such as used in protein folding, robot limbs, gene-expression) and in general directional s…
Score matching method improves density estimation for truncated data on manifolds.
problem Density estimation for truncated data on manifolds with intractable normalising constant.
method Truncated score matching extended to Riemannian manifolds with boundary.
result Score matching estimator approximates true parameter values with low error.
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.
M-flows learn data manifolds and densities, improving manifold learning and inference.
problem Representing datasets with manifold structure more faithfully.
method Combining normalizing flows, GANs, autoencoders, and energy-based models, with a new training algorithm.
result M-flows learn data manifolds better than standard flows and provide handles for dimensionality reduction.
The paper provides consistency results for KDE on manifolds with irregular kernels.
problem Analyzing density estimation on manifolds with complex kernels.
method Strong uniform consistency with rates for KDE on Riemannian manifolds with Riemann integrable kernels.
result Strong uniform consistency with rates for KDE on manifolds.
We study the problem of estimating the ridges of a density function. Ridge estimation is an extension of mode finding and is useful for understanding the structure of a density. It can also be used to find hidden structure in point cloud data. We show that, under mild regularity conditions, the ridges of the kernel den…
A new method for sampling on manifolds reduces density estimation errors.
problem Sampling on implicitly defined manifolds in various applications.
method Polynomial-Maximization Moment (PMM) estimator replacing local k-nearest-neighbour density estimate.
result Reduces density estimation errors by 22--36% on asymmetric gamma and boundary-spacing regimes.
PFs and iPFs learn principal manifolds for efficient density estimation.
problem Understanding the geometric structure of normalizing flows.
method Characterize flows using principal manifolds and contours.
result PFs and iPFs can learn principal manifolds and perform density estimation.
DADApy analyzes high-dimensional data manifolds in Python.
problem Analyzing complex, high-dimensional data.
method Estimating intrinsic dimension, density, clustering, comparing distance metrics.
result Effective analysis of data manifolds in Python.
This work proposes a new neural implicit manifold model for more accurate density estimation on manifolds.
problem Current generative models struggle with representing manifolds accurately and learning densities within them.
method Proposes a neural implicit manifold model and a constrained energy-based model to learn manifold-supported distributions.
result The proposed model can learn manifold-supported distributions with complex topologies more accurately than pushforward models.
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.
This paper improves Green's function estimates for compact Kähler manifolds.
problem Estimating Green's function norms for compact Kähler manifolds without curvature bounds.
method Proves an improved integral estimate for Green's function under volume density condition.
result Improved global geometric estimates, including eigenvalue bounds for Laplacian.
The paper tackles manifold overfitting in deep generative models.
problem Manifold overfitting occurs when generative models learn the manifold itself instead of the distribution on it.
method The authors propose a two-step procedure: dimensionality reduction followed by maximum-likelihood density estimation.
result The two-step procedure avoids manifold overfitting and enables density estimation on learned manifolds.
Kernel smoothing on unknown manifolds with bounds and asymptotic normality.
problem Data on unknown manifolds without boundaries.
method Finite sample bounds and asymptotic normality for kernel smoothing and its derivatives.
result Established finite sample bounds and asymptotic normality for kernel smoothing.
Robustly infers manifold density and geometry under high-dimensional noise.
problem Inaccurate kernel density estimation under high-dimensional noise.
method Doubly stochastic normalization of Gaussian kernel.
result Robust tools for density estimation, noise magnitude estimation, and distance approximation.
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristics of the data. Recently, the Gaussian Process Latent Variable Model (GPLVM) has successfully been used to find low dimensional manifolds in…
We show that DBSCAN can estimate the connected components of the λ-density level set {x:f(x)≥λ} given n i.i.d. samples from an unknown density f. We characterize the regularity of the level set boundaries using parameter β>0 and analyze the estimation error under the Hausdorff metric. When the data …
In this note we consider versions of both Ricci and sectional curvature pinching for Riemannian manifold with density. In the Ricci curvature case the main result implies a diameter estimate that is new even for compact shrinking Ricci solitons. In the case of sectional curvature we prove a new sphere theorem.
Diffusion models can generalize well even with coarse scores, thanks to the manifold hypothesis.
problem Understanding why diffusion models generate novel samples with coarse scores.
method Exploring the manifold hypothesis to explain diffusion model behavior.
result Diffusion models trained with coarse scores can achieve near-parametric rates of generalization, faster than estimating the full data distribution.
A natural way to characterize the cluster structure of a dataset is by finding regions containing a high density of data. This can be done in a nonparametric way with a kernel density estimate, whose modes and hence clusters can be found using mean-shift algorithms. We describe the theory and practice behind clustering…
New method avoids curse of dimensionality in structured density estimation.
problem Estimating multivariate density with Markov graph constraints.
method Introduces 'graph resilience' to control sample complexity.
result Avoids curse of dimensionality under Markov conditions.
There is a growing demand for nonparametric conditional density estimators (CDEs) in fields such as astronomy and economics. In astronomy, for example, one can dramatically improve estimates of the parameters that dictate the evolution of the Universe by working with full conditional densities instead of regression (i.…
Data analysis in high-dimensional spaces aims at obtaining a synthetic description of a data set, revealing its main structure and its salient features. We here introduce an approach providing this description in the form of a topography of the data, namely a human-readable chart of the probability density from which t…
Modes and ridges of the probability density function behind observed data are useful geometric features. Mode-seeking clustering assigns cluster labels by associating data samples with the nearest modes, and estimation of density ridges enables us to find lower-dimensional structures hidden in data. A key technical cha…
A method for learning distributions on complex manifolds using normalizing flows.
problem Learning distributions on non-Euclidean manifolds with high efficiency and accuracy.
method Learning a distribution on a manifold by combining local models that form an open cover.
result The method achieves better sample efficiency and competitive performance on manifolds of unknown topology.
TAKDE optimizes kernel density estimation for real-time dynamic processes.
problem Real-time density estimation in applications like computer vision and signal processing.
method Derives asymptotic mean integrated squared error (AMISE) upper bound for 'sliding window' kernel density estimator and proposes TAKDE as a novel, theoretically optimal estimator.
result TAKDE outperforms other dynamic density estimators in terms of test log-likelihood and runtime.
MCD reformulates conditional density estimation into binary classification.
problem Conditional density estimation in statistical and machine learning.
method Marginal Contrastive Discrimination, reformulating into marginal and ratio density functions for binary classification.
result Significantly outperforms existing methods on most density models and regression datasets.
Roundtrip uses deep generative models for flexible density estimation.
problem Density estimation in statistics and machine learning.
method Roundtrip is a deep generative neural density estimator that uses flexible mappings.
result Roundtrip achieves state-of-the-art performance in density estimation tasks.
Quantum method improves neural density estimation in high dimensions.
problem High-dimensional density estimation with poor performance and high computational complexity.
method Adaptive Fourier features based on quantum density matrices, integrated with neural networks.
result Competitive performance compared to state-of-the-art methods in various datasets.
Log-density gradient estimation is a fundamental statistical problem and possesses various practical applications such as clustering and measuring non-Gaussianity. A naive two-step approach of first estimating the density and then taking its log-gradient is unreliable because an accurate density estimate does not neces…
A new copula estimation method using classification.
problem Estimating copula density from joint and marginal distributions.
method Train a classifier to distinguish joint density from product of marginals.
result Empirically outperforms existing copula estimators.
New method for modeling densities on Riemannian manifolds with symmetries.
problem Modeling densities on Riemannian manifolds with known symmetry groups.
method Combining implicit neural layers and optimal transport theory to propose IRCPMs.
result IRCPMs are simpler to incorporate symmetries and less expensive than ODE-flows.
New density estimator from Markov Chains outperforms KDE.
problem Density estimation from Markov Chains.
method Nonparametric density estimator based on Markov Chains.
result Consistent and outperforms KDE in large sample size and high dimensionality.
Estimation of density derivatives is a versatile tool in statistical data analysis. A naive approach is to first estimate the density and then compute its derivative. However, such a two-step approach does not work well because a good density estimator does not necessarily mean a good density-derivative estimator. In t…
Let M be a weighted manifold with boundary ∂M, i.e., a Riemannian manifold where a density function is used to weight the Riemannian Hausdorff measures. In this paper we compute the first and the second variational formulas of the interior weighted area for deformations by hypersurfaces with boundary in $\p…
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…