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

Trend · papers per month

3877115153 · May 202619922001200920172026
48 results for density equalization

Develops spherical density-equalizing maps for closed surfaces.

problem Lack of methods for genus-0 closed surfaces.
method Conformal parameterization onto unit sphere, density equalization, quasi-conformal theory, harmonic energy, landmark constraints.
result Landmark-aligned spherical density-equalizing maps balancing different distortion measures.

Developed an ellipsoidal density-equalizing map for genus-0 closed surfaces.

problem Large geometric distortion when using spherical domain for genus-0 closed surfaces.
method Developed a novel method for ellipsoidal density-equalizing maps and combined with quasi-conformal maps.
result Significantly improved surface remeshing performance for genus-0 closed surfaces.

Method flattens complex surfaces with consistent density and shape.

problem Shape deformations and local geometric distortions in density-equalizing maps for multiply-connected surfaces.
method Formulates density diffusion as a quasiconformal flow, solving an energy minimization problem involving the Beltrami coefficient to ensure bijectivity and control distortion.
result Achieves optimal parameterization of multiply-connected surfaces with bijective and controlled geometric distortions.

In this paper, we are concerned with the problem of creating flattening maps of simply-connected open surfaces in R3\mathbb{R}^3. Using a natural principle of density diffusion in physics, we propose an effective algorithm for computing density-equalizing flattening maps with any prescribed density distribution. By var…

2017-04-08abs ↗pdf ↗

OLLA framework efficiently samples from constrained distributions with nonconvex constraints.

problem Sampling from constrained distributions with nonconvex constraints is challenging.
method Overdamped Langevin with Landing (OLLA) framework that handles both equality and inequality constraints.
result OLLA converges exponentially fast to the constrained target density in W2W_2 distance.

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 ↗

In this article we relate two different densities. Let FkF_k be the free group of finite rank k2k \ge 2 and let αα be the abelianization map from FkF_k onto Zk \mathbb{Z}^k. We prove that if SZkS \subseteq \mathbb{Z}^k is invariant under the natural action of SL(k,Z)SL(k, \mathbb{Z}) then the asymptotic density of SS in $\…

2005-07-27abs ↗pdf ↗

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

In this paper the author studies the isoperimetric problem in $\re^n$ with perimeter density xp|x|^p and volume density 1.1. We settle completely the case n=2,n=2, completing a previous work by the author: we characterize the case of equality if 0p10\leq p\leq 1 and deal with the case <p<1-\infty<p<-1 (with the additional a…

2017-06-29abs ↗pdf ↗

The paper proposes methods for volumetric parameterization of 3D solid manifolds.

problem Complex structure of solid manifolds makes conventional approaches ineffective.
method Incorporates models to preserve geometric structure, achieve density equalization, and balance distortions.
result Various 3D manifold parameterizations with different properties can be achieved.

Machine learning models, especially based on deep architectures are used in everyday applications ranging from self driving cars to medical diagnostics. It has been shown that such models are dangerously susceptible to adversarial samples, indistinguishable from real samples to human eye, adversarial samples lead to in…

2017-05-05abs ↗pdf ↗

We prove a generalization of the fundamental inequality of Guivarc'h relating entropy, drift and critical exponent to Gibbs measures on geometrically finite quotients of CAT(-1) metric spaces. For random walks with finite superexponential moment, we show that the equality is achieved if and only if the Gibbs density is…

2019-04-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 ↗

Maximum Likelihood Estimators (MLE) has many good properties. For example, the asymptotic variance of MLE solution attains equality of the asymptotic Cram{é}r-Rao lower bound (efficiency bound), which is the minimum possible variance for an unbiased estimator. However, obtaining such MLE solution requires calculating t…

2018-05-18abs ↗pdf ↗

AdaAnn optimizes annealing for efficient probability density approximation.

problem Efficiently approximating complex probability distributions with multiple modes.
method AdaAnn is an adaptive annealing scheduler that adjusts temperature increments based on KL divergence.
result AdaAnn improves computational efficiency in variational inference and parameter estimation.

We give a proof that Brakke's mean curvature flow under the unit density assumption is smooth almost everywhere in space-time. More generally, if the velocity is equal in a weak sense to its mean curvature plus some given α-Hölder continuous vector field, then we show C^{2,α} regularity almost everywhere.

2012-04-20abs ↗pdf ↗

We prove directly without using a density theorem that (i) the ADM mass defined in the usual way on an asymptotically flat manifold is equal to the mass defined intrinsically using Ricci tensor; (ii) the Hamiltonian formulation of center of mass and the center of mass defined intrinsically using Ricci tensor are the sa…

2014-08-18abs ↗pdf ↗

i-DenseNets improve parameter efficiency and performance in density estimation.

problem Improving parameter efficiency and performance in density estimation models.
method Invertible Dense Networks (i-DenseNets) with learnable weighted concatenation and Concatenated LipSwish activation function.
result i-DenseNets outperform Residual Flows and other flow-based models in bits per dimension.

By studying the group of rigid motions, PSH(1)PSH(1), in the 3D-Heisenberg group H1H_1, we define the density and the measure for the sets of horizontal lines. We show that the volume of a convex domain DH1D\subset H_1 is equal to the integral of length of chord over all horizontal lines intersecting DD. As the classical r…

2016-09-10abs ↗pdf ↗

Proves ε-regularity for capillary surfaces in Riemannian manifolds.

problem Regularity of minimal surfaces with capillary boundary conditions.
method Uniform first variation control and ε-regularity theorems for varifolds.
result Capillary varifolds with bounded mean curvature and close to a capillary half-plane coincide with a C1,αC^{1,α} properly embedded hypersurface.

Let (S,g0)(S,g_0) be a hyperbolic surface, ρρ be a Hitchin representation for PSL(n,R)PSL(n,\mathbb R), and ff be the unique ρρ-equivariant harmonic map from (S~,g~0)(\widetilde S, \widetilde g_0) to the corresponding symmetric space. We show its energy density satisfies e(f)1e(f)\geq 1 and equality holds at one point only if $e(f)\eq…

2018-06-18abs ↗pdf ↗

We consider two random group models: the hexagonal model and the square model, defined as the quotient of a free group by a random set of reduced words of length four and six respectively. Our first main result is that in this model there exists a sharp density threshold for Kazhdan's Property (T) and it equals 1/3. Ou…

2019-06-12abs ↗pdf ↗

New insights into noise distribution for self-supervised learning.

problem Challenges the assumption that optimal noise should match data distribution.
method Turns to Noise-Contrastive Estimation (NCE) to define optimality of noise distribution.
result Optimal noise distribution is different from data distribution, challenging GANs assumption.

New method improves counterfactual distribution learning for high-dimensional outcomes.

problem Counterfactual distribution learning for high-dimensional outcomes with concentrated structure.
method Geometry-adaptive diffusion-guided smoothing estimators combining causal nuisance adjustment and local outcome geometry.
result Geometry-adaptive methods show steeper error decay in semi-synthetic experiments.

Random groups prove length constraints on product of conjugates.

problem Quantify products of conjugates in random groups.
method Sharp van Kampen diagram argument and boundary block-counting.
result Prove a sharp inequality for products of conjugates in random groups.

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.

We develop a novel "decouple-recouple" dynamic predictive strategy and contribute to the literature on forecasting and economic decision making in a data-rich environment. Under this framework, clusters of predictors generate different latent states in the form of predictive densities that are later synthesized within …

2018-03-18abs ↗pdf ↗

New complexity analysis for estimating normalizing constants in high dimensions.

problem Estimating the normalizing constant of unnormalized probability densities in high dimensions.
method Analyze and derive the oracle complexity of annealed importance sampling.
result Oracle complexity of $\widetilde{O}\left(\frac{dβ^2{\mathcal{A}}^2}{\varepsilon^4} ight)$ for estimating ZZ within ε\varepsilon relative error.

In this work, a deep learning-based method for log-likelihood ratio (LLR) lossy compression and quantization is proposed, with emphasis on a single-input single-output uncorrelated fading communication setting. A deep autoencoder network is trained to compress, quantize and reconstruct the bit log-likelihood ratios cor…

2019-03-11abs ↗pdf ↗

This paper finds a unique partition of a sample space for estimating continuous distributions.

problem Estimating continuous probability distributions from finite samples.
method Equal-probability partition of the sample space using order statistics.
result The partition yields an entropy of log2(N+1) bits, providing a discrete entropy estimate.

OT-Flow uses optimal transport to improve CNFs for faster and more accurate density estimation.

problem Computational challenges in continuous normalizing flows.
method OT-Flow leverages optimal transport to regularize CNFs and uses exact trace computation.
result OT-Flow achieves competitive performance with one-fourth the number of weights and significant speedups.