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.
The study proves optimal isoperimetric regions in manifolds with density.
problem Finding optimal regions with minimal boundary area in manifolds with density.
method Proving existence of isoperimetric regions and using subgroup actions.
result Isoperimetric regions in product manifolds are slabs.
Study shows how near crushing singularities, Kasner-like regions can exist.
problem Understanding spatial volume densities near crushing singularities.
method Relates existence of Kasner-like regions to asymptotics of spatial volume densities under scale-invariant curvature bounds.
result Kasner-like regions can exist near crushing singularities under certain curvature conditions.
Contrast uses normalizing flows to create precise prediction regions for multi-dimensional outputs.
problem Generating reliable prediction regions for multi-dimensional outputs in supervised and unsupervised learning.
method Contrast uses normalizing flows to define nonconformity scores based on distances in latent space, creating sharp prediction regions.
result Contrast maintains guaranteed coverage probability and outperforms existing methods in generating accurate prediction regions.
We completely characterize isoperimetric regions in R^n with density e^h, where h is convex, smooth, and radially symmetric. In particular, balls around the origin constitute isoperimetric regions of any given volume, proving the Log-Convex Density Conjecture due to Kenneth Brakke.
This work introduces a novel nonparametric density index defined on graphs, the Sum-over-Forests (SoF) density index. It is based on a clear and intuitive idea: high-density regions in a graph are characterized by the fact that they contain a large amount of low-cost trees with high outdegrees while low-density regions…
We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive stability conditions, which lead to the conjecture that for a radial log-convex density…
Bayesian model averaging under predictor redundancy
problem Reporting Bayesian model averaging posterior without changing the Bayesian target
method Using hard or soft regions of support space
result Region reports often give shorter and clearer summaries while preserving the main posterior information
Study on bit threads and their locking properties in holographic spacetimes.
problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.
SDG uses optimal control to improve classifier guidance in low-density regions.
problem Inefficient guidance in low-density regions of posterior distributions.
method Integrates stochastic optimal control with Stein variational inference to compute the steepest descent direction.
result SDG improves guidance in low-density regions, outperforming standard methods.
ANODE uses neural density estimation for anomaly detection in physics.
problem Detecting localized anomalies in signal regions with limited background information.
method Estimate data and background densities, construct likelihood ratio, and enhance significance.
result ANODE enhances dijet bump hunt significance by up to 7x with 10% background accuracy.
A new method for time-series data provides guaranteed coverage and adapts to non-exchangeable data.
problem Guaranteed coverage for time-series data prediction intervals.
method Sequential Conformalized Density Regions (SCDR) using quantile random forest.
result SCDR achieves guaranteed asymptotic coverage and outperforms existing methods in simulations.
Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based clustering algorithm. However, its cluster recovery capabilities depend on the combination of the t…
A new method improves flow matching by dynamically weighting density estimates.
problem High-dimensional integration inefficiency in flow matching.
method Density-weighted Dynamic Stein operators.
result Significant improvement in vector field smoothness and sampling efficiency.
SLS optimizes minimum-volume regions for conditional quantiles, bypassing density estimation.
problem Constructing minimum-volume prediction regions that satisfy conditional coverage.
method Super-level-set regression (SLS) directly optimizes geometric boundaries of conditional level sets.
result SLS optimizes regions directly, capturing complex conditional structures end-to-end.
The two most extended density-based approaches to clustering are surely mixture model clustering and modal clustering. In the mixture model approach, the density is represented as a mixture and clusters are associated to the different mixture components. In modal clustering, clusters are understood as regions of high d…
A new method improves quantile regression for high-dimensional data.
problem Handling heteroscedastic, multimodal, or skewed data in quantile regression.
method Dynamic prototypes-based probability density estimation with conformalized high-density quantile regression.
result Enhanced prediction regions with valid coverage guarantees and scalability to higher dimensions.
A new method detects small holes in noisy data.
problem Detecting small holes in high-density regions from noise.
method Robust Density-Aware Distance (RDAD) filtration, incorporating distance-to-measure concept.
result The RDAD filtration prolongs the persistences of small holes, making them distinguishable from noise.
We show that the unique isoperimetric hypersurfaces in Rn with density rp for n≥3 and p>0 are spheres that pass through the origin.
Neural network accuracy improves with denser training samples.
problem Improving neural network accuracy on unseen test samples.
method Bounding empirical training error smoothed across activation regions and using it to discard high-risk test samples.
result Discarding high-risk test samples based on error bounds improves prediction accuracy by up to 20%.
New method calibrates reference distributions for bounded support.
problem Lack of principled method for bounded-support statistical reference distributions.
method Formulated maximum entropy on projective space of nonnegative measures.
result Prescribed acceptance region uniquely determines deformation parameter.
Machine learning is used to approximate density functionals. For the model problem of the kinetic energy of non-interacting fermions in 1d, mean absolute errors below 1 kcal/mol on test densities similar to the training set are reached with fewer than 100 training densities. A predictor identifies if a test density is …
Study identifies high-density anomalies in normal data regions.
problem Detecting anomalies in normal data regions.
method Introduces non-parametric algorithmic frameworks for unsupervised detection.
result IPP framework yields the best detection results.
In the knowledge that the ex-post performance of Markowitz efficient portfolios is inferior to that implied ex-ante, we make two contributions to the portfolio selection literature. Firstly, we propose a methodology to identify the region of risk-expected return space where ex-post performance matches ex-ante estimates…
New method improves Gaussian Mixture Model fitting speed.
problem Slow convergence of EM algorithm for complex data.
method Riemannian Newton Trust-Region method for Gaussian Mixture Models.
result Outperforms existing methods in runtime and iterations.
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.
DADC algorithm improves clustering for data with varying density.
problem Sparse cluster loss and cluster fragmentation in density peak clustering.
method Domain-adaptive density measurement, cluster center self-identification, and cluster self-ensemble.
result DADC achieves more reasonable clustering results on data with varying density.
Density mode clustering is a nonparametric clustering method. The clusters are the basins of attraction of the modes of a density estimator. We study the risk of mode-based clustering. We show that the clustering risk over the cluster cores --- the regions where the density is high --- is very small even in high dimens…
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.
Optimizes noisy IS with better proposal densities.
problem Improving IS estimators with noisy data.
method Derives optimal proposal densities considering noise variance.
result Optimal proposals enhance IS estimators by focusing on noisy regions.
We present a new algorithm for stochastic variational inference that targets at models with non-differentiable densities. One of the key challenges in stochastic variational inference is to come up with a low-variance estimator of the gradient of a variational objective. We tackle the challenge by generalizing the repa…
Study on packing links with geometric constraints.
problem Maximizing link density in space with geometric restrictions.
method Investigates packing essential links within Euclidean space.
result Upper bounds on maximal density are found, but are large.
The large-scale structure of the universe is comprised of virialized blob-like clusters, linear filaments, sheet-like walls and huge near empty three-dimensional voids. Characterizing the large scale universe is essential to our understanding of the formation and evolution of galaxies. The density range of clusters, wa…
Method detects new physics signals without prior knowledge.
problem Selecting signal regions for novel particles.
method Model-agnostic approach using low-pass filtering and density estimation.
result Efficiently identifies data-driven signal regions in high-dimensional feature space.
The study calculates Weyl entropy in spacetime regions and shows its monotonic behavior.
problem Calculating and understanding Weyl entropy in spacetime regions.
method Introducing a candidate density for Weyl entropy in perfect fluid regions and analyzing its behavior in compact spacetime regions.
result Weyl entropy is shown to be monotonic in time and maximal in vacuum static metrics.
Improves generation of minority samples using diffusion models.
problem Generating minority samples on low-density regions of a data manifold.
method Introduces minority guidance to focus diffusion models on minority samples.
result Significantly improves generation of high-quality minority samples.
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…
MD-split+ creates locally valid prediction regions for complex data.
problem Localized prediction regions for complex data.
method Localized model performance-based partitioning of feature space X.
result MD-split+ creates valid prediction regions that scale to high dimensions.
VSPS creates flexible prediction regions for multi-target regression with guaranteed coverage.
problem Uncertainty quantification in multi-target regression with complex distributions.
method Conditional normalizing flows with conformal calibration to identify dense regions.
result VSPS produces smaller, more informative prediction regions with robust coverage guarantees.
OneFlow detects anomalies by finding a minimal volume region, outperforming other methods.
problem Anomaly detection in data with complex outlier structures.
method Flow-based one-class classifier that uses a minimal volume region to define outliers.
result OneFlow outperforms other methods in real-world anomaly detection tasks.
We study the asymptotic behaviour of the partial density function associated to sections of a positive hermitian line bundle that vanish to a particular order along a fixed divisor Y. Assuming the data in question is invariant under an S1-action (locally around Y) we prove that this density function has a distri…
A fast Modal EM algorithm for Gaussian mixtures.
problem Clustering with Gaussian mixtures.
method Modal EM algorithm for Gaussian mixtures.
result High flexibility in various clustering contexts.
While robust parameter estimation has been well studied in parametric density estimation, there has been little investigation into robust density estimation in the nonparametric setting. We present a robust version of the popular kernel density estimator (KDE). As with other estimators, a robust version of the KDE is u…
New method uses dynamic sampling to improve PINNs efficiency.
problem Improving sample efficiency and performance of PINNs.
method pdPINN, inspired by Eulerian formulation, uses dynamic Monte Carlo sampling from particle positions.
result Higher sample efficiency and improved performance of PINNs.
Neural samplers such as variational autoencoders (VAEs) or generative adversarial networks (GANs) approximate distributions by transforming samples from a simple random source---the latent space---to samples from a more complex distribution represented by a dataset. While the manifold hypothesis implies that the densit…
We define and compute plausible counterfactual explanations using density constraints.
problem Efficiently compute plausible counterfactual explanations for machine learning models.
method Propose and study a formal definition of plausible counterfactual explanations, use density estimators, and introduce convex density constraints.
result Convex density constraints ensure plausible and feasible counterfactual explanations.
Deep metric learning algorithms have been utilized to learn discriminative and generalizable models which are effective for classifying unseen classes. In this paper, a novel noise tolerant deep metric learning algorithm is proposed. The proposed method, termed as Density Aware Metric Learning, enforces the model to le…
The problem of inhomogeneous cluster densities has been a long-standing issue for distance-based and density-based algorithms in clustering and anomaly detection. These algorithms implicitly assume that all clusters have approximately the same density. As a result, they often exhibit a bias towards dense clusters in th…