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

Trend · papers per month

3673109145 · May 202619922001200920172026
48 results for density drop argument

Low-entropy surfaces can be flowed into spheres and cylinders.

problem Proving mean curvature flow for low-entropy hypersurfaces.
method Low-entropy density drop argument and recent work on hypersurfaces.
result Closed hypersurfaces with entropy ≤ 2 can be flowed into spherical and cylindrical shapes.

Paper proposes a new binary quantization method for faster DNN inference.

problem Accelerating deep neural network inference on resource-limited devices.
method Quantized Compressed Sensing (QCS) for binary quantization.
result The proposed method preserves benefits of standard methods while reducing quantization error.

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 ↗

Proposes a new feature preprocessing method using kernel density integral transformation.

problem Feature preprocessing for tabular data in machine learning and statistics.
method Kernel density integral transformation as a drop-in replacement or improved alternative to min-max scaling and quantile transformation.
result Frequently outperforms min-max scaling and quantile transformation with hyperparameter tuning.

We describe some problems, observations, and conjectures concerning thickness and packing density of knots and links in $\sp^3$ and R3\R^3. We prove the thickness of a nontrivial knot or link in $\sp^3$ is no more than π4\fracπ{4}, the thickness of a Hopf link. We also give arguments and evidence supporting the conject…

2002-03-28abs ↗pdf ↗

Study geodesics on Grushin spaces, proving upper bounds on conjugate times.

problem Classify geodesics on higher-dimensional Grushin spaces.
method Solve Hamilton's equations using calculus of generalized trigonometric functions, analyze symmetries, and use density arguments.
result Prove a conjectured cut time provides an upper bound on conjugate times.

Conditional Density Estimation (CDE) models deal with estimating conditional distributions. The conditions imposed on the distribution are the inputs of the model. CDE is a challenging task as there is a fundamental trade-off between model complexity, representational capacity and overfitting. In this work, we propose …

2018-10-30abs ↗pdf ↗

We propose two nonparametric statistical tests of goodness of fit for conditional distributions: given a conditional probability density function p(yx)p(y|x) and a joint sample, decide whether the sample is drawn from p(yx)rx(x)p(y|x)r_x(x) for some density rxr_x. Our tests, formulated with a Stein operator, can be applied to any…

2020-02-24abs ↗pdf ↗

Let $(M, \om)$ be a symplectic manifold, endowed with a compatible almost complex structure J and the associated metric g . For any p \in {1, 2, ... (dim M)/2} the form $\Om := \frac{\om^p}{p!}$ is a calibration. More generally, dropping the closedness assumption on $\om$, we get an almost hermitian manifold $(M, \om, …

2011-11-07abs ↗pdf ↗

New noncompact Coxeter polytopes found in various dimensions.

problem Classifying and constructing noncompact hyperbolic Coxeter polytopes.
method Maximal-cusp density and noncompact analog of Bogachev-Douba-Raimbault's argument.
result Infinitely many pairwise incommensurable noncompact Coxeter polytopes in dimensions 4-9.

Researchers calculate the price of a perpetual put option in Lévy models.

problem Calculating the price of a perpetual American put option in Lévy models.
method Derive the explicit price using geometric spectrally negative Lévy processes and optimal threshold.
result The optimal exercise time is the first epoch when the asset price drops below an optimal threshold.

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…

2010-10-21abs ↗pdf ↗

We propose a new framework for Hamiltonian Monte Carlo (HMC) on truncated probability distributions with smooth underlying density functions. Traditional HMC requires computing the gradient of potential function associated with the target distribution, and therefore does not perform its full power on truncated distribu…

2017-09-08abs ↗pdf ↗

We investigate the role of networks of alliances in preventing (multilateral) interstate wars. We first show that, in the absence of international trade, no network of alliances is peaceful and stable. We then show that international trade induces peaceful and stable networks: trade increases the density of alliances s…

2014-05-25abs ↗pdf ↗

This paper analyzes the configurations of shapes that shows a spacelike liquid drop in Minkowski space deposited over a spacelike plane ΠΠ. We assume the presence of a uniform gravity field directed toward ΠΠ and that the volume of the drop is prescribed. Our interest are the liquid drops that are critical points of …

2005-01-12abs ↗pdf ↗

Deep neural networks have dramatically achieved great success on a variety of challenging tasks. However, most successful DNNs have an extremely complex structure, leading to extensive research on model compression.As a significant area of progress in model compression, traditional gradual pruning approaches involve an…

2018-12-05abs ↗pdf ↗

A new robust PCA estimator combining M-estimators and minimum divergence estimators.

problem Adverse effect of outlying observations in PCA for high-dimensional data.
method Minimum density power divergence estimator combined with a computationally efficient algorithm.
result High breakdown guarantee regardless of data dimension with theoretical support and practical applications.

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.

Deep neural networks (DNNs) have been proven to have many redundancies. Hence, many efforts have been made to compress DNNs. However, the existing model compression methods treat all the input samples equally while ignoring the fact that the difficulties of various input samples being correctly classified are different…

2018-07-04abs ↗pdf ↗

Transfer learning has recently attracted significant research attention, as it simultaneously learns from different source domains, which have plenty of labeled data, and transfers the relevant knowledge to the target domain with limited labeled data to improve the prediction performance. We propose a Bayesian transfer…

2018-01-02abs ↗pdf ↗

Study on how reparametrization affects neural nets' parameter spaces from a geometric perspective.

problem Inconsistencies in flatness measures, optimization, and probability densities under reparametrization.
method Riemannian geometry to study invariance of neural nets under reparametrization.
result Invariance of neural nets is an inherent property if the metric is explicitly represented and transformation rules are correct.

T-EMDE bridges the heterogeneity gap between image and text modalities.

problem Finding similarities between image and text modalities with non-related feature spaces.
method Inspired by EMDE, T-EMDE uses sketches for multimodal operations, avoiding self-attention's quadratic complexity.
result T-EMDE achieves state-of-the-art results and reduces model latency.

Dual-ISL improves implicit generative model training with convex optimization and explicit density approximation.

problem Training implicit generative models with robust and practical likelihood-free objectives.
method Introduces dual-ISL, a novel likelihood-free objective using a convex divergence derived from the invariant statistical loss (ISL) framework.
result Dual-ISL yields a convex optimization problem in the space of model densities, providing explicit density approximation and improved training stability.

New analysis of annealing paths in sampling and estimation.

problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.

We analyze convergence of Fermat distances and their application in clustering.

problem Understanding convergence properties of Fermat distances on Riemannian manifolds.
method Geometric and statistical arguments in percolation theory, leveraging novel arguments for non-uniform densities and curved domains.
result Discrete, sample-based Fermat distances converge to their continuum analogues with a precise rate dependent on intrinsic dimensionality.

The Frank-Wolfe (FW) algorithm has been widely used in solving nuclear norm constrained problems, since it does not require projections. However, FW often yields high rank intermediate iterates, which can be very expensive in time and space costs for large problems. To address this issue, we propose a rank-drop method …

2017-04-13abs ↗pdf ↗