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

3673109145 · May 202619922001200920172026
48 results for monotone density

Study online monotone density estimation with expert aggregation and log-optimal calibration.

problem Online monotone density estimation and log-optimal calibration.
method Proposed two online estimators: Grenander estimator and expert aggregation estimator.
result Online estimators achieve O(n1/3)O(n^{1/3}) cumulative log-likelihood gap and nlogn\sqrt{n\log{n}} pathwise regret bound.

DRCD identifies causal direction between continuous and discrete variables using density ratio monotonicity.

problem Inferring causal direction between continuous and discrete variables from observational data.
method Density Ratio-based Causal Discovery (DRCD) method.
result DRCD identifies causal direction between continuous and discrete variables using density ratio monotonicity.

Developed a monotone numerical method for MV portfolio optimization under jump-diffusion models.

problem Efficiently optimizing portfolios with jump-diffusion dynamics and investment constraints.
method Strictly monotone numerical integration method using Fourier transforms and composite quadrature rules.
result Proven to be \ell_{\infty}-stable and pointwise consistent, converging to the MV optimization solution.

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 propose non-stationary spectral kernels for Gaussian process regression. We propose to model the spectral density of a non-stationary kernel function as a mixture of input-dependent Gaussian process frequency density surfaces. We solve the generalised Fourier transform with such a model, and present a family of non-…

2017-05-24abs ↗pdf ↗

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.

A normalizing flow models a complex probability density as an invertible transformation of a simple base density. Flows based on either coupling or autoregressive transforms both offer exact density evaluation and sampling, but rely on the parameterization of an easily invertible elementwise transformation, whose choic…

2019-06-10abs ↗pdf ↗

Monotonic neural networks have recently been proposed as a way to define invertible transformations. These transformations can be combined into powerful autoregressive flows that have been shown to be universal approximators of continuous probability distributions. Architectures that ensure monotonicity typically enfor…

2019-08-14abs ↗pdf ↗

Density estimation is a versatile technique underlying many data mining tasks and techniques,ranging from exploration and presentation of static data, to probabilistic classification, or identifying changes or irregularities in streaming data. With the pervasiveness of embedded systems and digitisation, this latter typ…

2019-06-03abs ↗pdf ↗

A normalizing flow models a complex probability density as an invertible transformation of a simple density. The invertibility means that we can evaluate densities and generate samples from a flow. In practice, autoregressive flow-based models are slow to invert, making either density estimation or sample generation sl…

2019-06-05abs ↗pdf ↗

We prove that a minimal disc in a CAT(0) space is a local embedding away from a finite set of "branch points". On the way we establish several basic properties of minimal surfaces: monotonicity of area densities, density bounds, limit theorems and the existence of tangent maps. As an application, we prove Fary-Milnor's…

2018-08-20abs ↗pdf ↗

Plotting a learner's average performance against the number of training samples results in a learning curve. Studying such curves on one or more data sets is a way to get to a better understanding of the generalization properties of this learner. The behavior of learning curves is, however, not very well understood and…

2019-07-11abs ↗pdf ↗

New framework for learning KR maps from data, ensuring stable generalization.

problem Learning monotone triangular transport maps efficiently and accurately.
method General framework using invertible transformations of smooth functions, ensuring no spurious local minima.
result Unique global minimizer corresponds to the KR map under certain conditions.

Monotone aggregation of dependent random vectors has an absolutely continuous distribution under certain conditions.

problem Monotone aggregation of dependent random vectors
method Coordinatewise monotonicity and uniform lower-increment conditions
result One-dimensional push-forwards of dependent random vectors have an absolutely continuous distribution

Study on regularity of optimal transport maps on convex domains with quadratic cost.

problem Regularity of optimal transport maps between convex domains with quadratic cost.
method Analysis of CαC^α-densities and C1,αC^{1, α} boundary conditions, monotonicity formula for optimal transport maps.
result Proves C1,1εC^{1, 1-\varepsilon}-regularity for nondegenerate CαC^α-densities and C2,αC^{2, α}-regularity for C1,αC^{1, α} boundary.

Random forests is a common non-parametric regression technique which performs well for mixed-type data and irrelevant covariates, while being robust to monotonic variable transformations. Existing random forest implementations target regression or classification. We introduce the RFCDE package for fitting random forest…

2018-04-16abs ↗pdf ↗

Develops Lie-theoretic perspective on Hitchin's equations for cyclic G-Higgs bundles.

problem Analytic and geometric properties of harmonic maps.
method Lie-theoretic perspective on Hitchin's equations for cyclic G-Higgs bundles.
result Proves Dai-Li's conjecture on the monotonicity of the energy density and negative curvature conjecture for Coxeter cyclic G-Higgs bundles.

We define a (mean curvature flow) entropy for Radon measures in Rn\mathbb{R}^n or in a compact manifold. Moreover, we prove a monotonicity formula of the entropy of the measures associated with the parabolic Allen-Cahn equations. If the ambient manifold is a compact manifold with non-negative sectional curvature and pa…

2018-12-20abs ↗pdf ↗

New method for optimizing risk in financial models using Fourier transforms.

problem Optimizing risk in financial models with multi-period mean-CVaR.
method Strictly monotone 2D integration scheme via Fourier-trained transition kernels.
result Established robust and accurate optimization method for financial models.

Efficient methods for Lévy models using SINH-regular processes.

problem Efficient numerical methods for evaluating Lévy models.
method Defining SL-processes and sSL-processes, deriving properties of characteristic exponent, and showing all popular Lévy processes can be subordinated to Brownian motion.
result All crucial properties of characteristic exponent are consequences of a specific representation, and all popular Lévy processes are SL- or sSL-subordinated Brownian motion.

Normalising flows (NFS) map two density functions via a differentiable bijection whose Jacobian determinant can be computed efficiently. Recently, as an alternative to hand-crafted bijections, Huang et al. (2018) proposed neural autoregressive flow (NAF) which is a universal approximator for density functions. Their fl…

2019-04-09abs ↗pdf ↗

We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let pp be an arbitrary distribution over an interval II which is ττ-close (in total variation distance) to an unknown probability distribution $…

2013-05-14abs ↗pdf ↗

FLOWGEM generates complete datasets from incomplete data with non-monotone MAR missingness.

problem Dealing with non-monotone Missing at Random (MAR) missingness in data.
method Iterative particle evolution of Wasserstein Gradient Flow, approximated by local linear estimators of density ratio.
result FLOWGEM achieves state-of-the-art performance across various settings, including non-monotone MAR mechanisms.

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.

Normalizing flows and autoregressive models have been successfully combined to produce state-of-the-art results in density estimation, via Masked Autoregressive Flows (MAF), and to accelerate state-of-the-art WaveNet-based speech synthesis to 20x faster than real-time, via Inverse Autoregressive Flows (IAF). We unify a…

2018-04-03abs ↗pdf ↗

We leverage neural networks as universal approximators of monotonic functions to build a parameterization of conditional cumulative distribution functions (CDFs). By the application of automatic differentiation with respect to response variables and then to parameters of this CDF representation, we are able to build bl…

2018-11-02abs ↗pdf ↗

Rank-statistic method approximates ff-divergences without density-ratio estimation.

problem Approximating ff-divergences without explicit density-ratio estimation.
method Mapping distribution rank histograms to discrete ff-divergence and averaging over random projections.
result The rank-statistic estimator is a lower bound of the true ff-divergence and converges under mild conditions.

We prove existence and uniqueness of weighted ambient metric for manifolds with density.

problem Existence and uniqueness of weighted ambient metric for manifolds with density.
method Proving existence and uniqueness of weighted ambient metric for manifolds with density.
result Existence and uniqueness of weighted ambient metric for manifolds with density.

Modal regression is aimed at estimating the global mode (i.e., global maximum) of the conditional density function of the output variable given input variables, and has led to regression methods robust against heavy-tailed or skewed noises. The conditional mode is often estimated through maximization of the modal regre…

2019-10-18abs ↗pdf ↗

This paper optimizes periodic dividend strategies for Lévy processes with transaction costs.

problem Maximizing dividends for spectrally negative Lévy processes with fixed transaction costs.
method Using periodic strategies and fixed transaction costs, the paper calculates the value function and shows optimality conditions.
result A sufficient condition for optimality is that the Lévy measure is completely monotonic.

The paper studies knot densities under various constraints and degenerations.

problem Understanding knot densities under different constraints and their degenerations.
method Introduces and analyzes unconstrained and ropelength-windowed pp-densities of knot types.
result The degenerations in the unconstrained theory and the introduction of ropelength-windowed densities.

Sharp lower bound found for integral varifolds' mean curvature.

problem Finding a sharp lower bound for the mean curvature integral of integral varifolds.
method Developed a new approach using integral varifolds and mean curvature.
result A sharp lower bound on the mean curvature integral with critical power for integral varifolds.

Neural Lévy model improves risk and density forecasting for financial returns.

problem Financial returns exhibit heavy tails, volatility clustering, and jumps.
method Proposes a neural Lévy jump-diffusion framework that learns conditional drift, diffusion, jump intensity, and size distribution.
result Demonstrates improved calibration, sharper tail control, and risk reduction.

The paper addresses monotonicity in machine learning models for fairness and accountability.

problem Ensuring fairness and accountability in transparent machine learning models.
method Study of three types of monotonicity (individual, weak pairwise, strong pairwise) and propose monotonic groves of neural additive models.
result Monotonic groves of neural additive models maintain transparency, accountability, and fairness.