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

78155233310 · May 202619922001200920172026
48 results for local densities

This paper presents a simple but effective density-based outlier detection approach with the local kernel density estimation (KDE). A Relative Density-based Outlier Score (RDOS) is introduced to measure the local outlierness of objects, in which the density distribution at the location of an object is estimated with a …

2016-06-28abs ↗pdf ↗

EagleEye detects localized density anomalies in multivariate data.

problem Identifying signal events, regime changes, or model mismatch in scientific data.
method EagleEye pinpoints local over- and under-densities by assigning anomaly scores based on binary membership sequences and binomial null models.
result EagleEye can detect genuine local anomalies and estimate background purity.

Paper tackles privacy-preserving data density issues using deconvolution.

problem Privacy-preserving noise affects data density, leading to under/over-estimation.
method Develops deconvoluting kernel density estimators and regression models.
result Demonstrates improved accuracy in estimating heavy-hitters with locally differential data.

Non-parametric estimation of a multivariate density estimation is tackled via a method which combines traditional local smoothing with a form of global smoothing but without imposing a rigid structure. Simulation work delivers encouraging indications on the effectiveness of the method. An application to density-based c…

2016-10-07abs ↗pdf ↗

Interactive privacy mechanisms improve spectral density estimation under local differential privacy.

problem Estimating spectral density of Gaussian time series with local differential privacy constraints.
method Two-stage process: Laplace mechanism followed by privatized sample analysis.
result Interactive mechanisms achieve faster rates for spectral density estimation.

A new clustering algorithm GDT improves on HDBSCAN for uneven data.

problem Data clustering with uneven distribution and high noise.
method GDT combines local and global structures, forming local clusters and estimating a global topological graph based on connectivity between clusters.
result GDT achieves SOTA performance on various datasets with low time complexity.

An image pattern can be represented by a probability distribution whose density is concentrated on different low-dimensional subspaces in the high-dimensional image space. Such probability densities have an astronomical number of local modes corresponding to typical pattern appearances. Related groups of modes can join…

2018-03-02abs ↗pdf ↗

New approach improves computational efficiency of Bass Local Volatility model.

problem Eliminate interpolation and improve computational efficiency in local volatility models.
method Combines local quadratic estimation and lognormal mixture tails for state price densities; uses trapezoidal rule for numerical convolutions.
result Proposed method outperforms traditional numerical methods in option pricing and market case studies.

We consider a defaultable asset whose risk-neutral pricing dynamics are described by an exponential Levy-type martingale subject to default. This class of models allows for local volatility, local default intensity, and a locally dependent Levy measure. Generalizing and extending the novel adjoint expansion technique o…

2013-12-27abs ↗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 ↗

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…

2016-04-06abs ↗pdf ↗

Efficiently sparsifies simplicial complexes using local densities of states.

problem Prohibitive computational requirements for dense simplicial complexes.
method Probabilistic sparsification using local densities of states and kernel-ignoring decomposition.
result Approximates the spectrum of the original SC with a sparser surrogate SC.

LADaR framework calibrates machine learning models for instance-wise predictions.

problem Challenges in assessing and calibrating predictive distributions for complex inputs.
method Local Amortized Diagnostics and Reshaping of Conditional Densities (LADaR) framework and extttCalPIT exttt{Cal-PIT} algorithm.
result Achieves better instance-wise calibration than existing methods in galaxy distance estimation.

Develops a local Fokker--Planck geometric framework for more accurate score estimation.

problem Inaccurate estimation of score function in non-linear, state-dependent drifts.
method Local Fokker--Planck geometric framework, time change to cumulative-variance coordinate, heat-ball mean-value representations, exact high-dimensional sampling.
result Exact local mean-value representations for the score and density, improved accuracy in low-density regions.

Estimates modes and ridges in mixed Euclidean and directional spaces.

problem Estimating local modes and density ridges in product spaces combining Euclidean and directional metrics.
method Extends mean shift algorithm to product spaces, addressing challenges in generalization.
result Established convergence of the proposed methods and demonstrated effectiveness on real-world datasets.

Kernel methods are popular in clustering due to their generality and discriminating power. However, we show that many kernel clustering criteria have density biases theoretically explaining some practically significant artifacts empirically observed in the past. For example, we provide conditions and formally prove the…

2017-05-16abs ↗pdf ↗

The L1 loss landscape of neural nets near local minima behaves differently, revealing exponential decay and increased vertex density.

problem Understanding the L1 loss landscape of neural nets near local minima.
method Iterative minimization of the loss function on adjacent vertices of the Deep ReLU Simplex algorithm.
result Exponential decay of loss levels and increased vertex density around local minima.

Hyperplanes, hyperspheres and hypercylinders in Rn\Bbb R^n with suitable densities are proved to be weighted minimizing by a calibration argument. Also calibration method is used to prove a weighted minimal hypersurface is weighted area-minimizing locally.

2010-04-06abs ↗pdf ↗

Conformal-DP improves differential privacy on manifold data by calibrating perturbations based on local densities.

problem Lack of density-awareness in existing differential privacy mechanisms for manifold data leads to biased and suboptimal privacy-utility trade-offs.
method Proposes Conformal-DP, a density-aware differential privacy mechanism using conformal transformations to calibrate perturbations based on local densities.
result Demonstrates improved privacy-utility trade-off in heterogeneous data distribution settings compared to state-of-the-art mechanisms.

For an infinite cardinal κκ let 2(κ)\ell_2(κ) be the linear hull of the standard othonormal base of the Hilbert space 2(κ)\ell_2(κ) of density κκ. We prove that a non-separable convex subset XX of density κκ in a locally convex linear metric space if homeomorphic to the space (i) 2f(κ)\ell_2^f(κ) if and only if XX can be…

2013-05-07abs ↗pdf ↗

SDCOR clusters massive datasets efficiently, detecting outliers with low memory usage.

problem Local outlier detection in large-scale datasets.
method Chunk-based density clustering with incremental updates.
result SDCOR achieves lower linear time complexity and better efficiency than traditional methods.

Kernel ridge regression is used to approximate the kinetic energy of non-interacting fermions in a one-dimensional box as a functional of their density. The properties of different kernels and methods of cross-validation are explored, and highly accurate energies are achieved. Accurate {\em constrained optimal densitie…

2014-04-04abs ↗pdf ↗

The study bounds Hausdorff measure of flat singular points in area-minimizing currents.

problem Bounding Hausdorff measure of flat singular points in area-minimizing currents.
method Proving locally finite (m2)(m-2)-dimensional Hausdorff measure and Minkowski content bounds.
result The set of flat singular points has locally finite (m2)(m-2)-dimensional Hausdorff measure.

Kolesnikov-Milman [9] established a local LpL_p-Brunn-Minkowski inequality for p(1c/n32,1).p\in(1-c/n^{\frac{3}{2}},1). Based on their local uniqueness results for the LpL_p-Minkowski problem, we prove in this paper the (global) LpL_p-Brunn-Minkowski inequality. Two uniqueness results are also obtained: the first one is for the …

2018-11-26abs ↗pdf ↗

We present a first procedure that can estimate -- with statistical consistency guarantees -- any local-maxima of a density, under benign distributional conditions. The procedure estimates all such local maxima, or modal-sets\textit{modal-sets}, of any bounded shape or dimension, including usual point-modes. In practice, modal-…

2016-06-13abs ↗pdf ↗

Paper proposes a new method for estimating conditional densities using logistic regressions.

problem Estimating conditional densities for complex distributions.
method Parametric conditional density estimation via weighted logistic regressions.
result Maximum likelihood estimates can be obtained efficiently via a block-wise alternating maximization scheme and local case-control sampling.