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

131263394525 · Jun 202019922001200920172026
48 results for truncated density estimation

Paper proposes approximate Stein classes for efficient truncated density estimation.

problem Difficulties in estimating truncated density models due to intractable normalising constants and boundary conditions.
method Adapts score matching to solve the problem, introduces approximate Stein classes and a novel discrepancy measure, TKSD.
result TKSD does not require a fixed weighting function and can be evaluated using only boundary samples, leading to improved accuracy.

Score matching method improves density estimation for truncated data on manifolds.

problem Density estimation for truncated data on manifolds with intractable normalising constant.
method Truncated score matching extended to Riemannian manifolds with boundary.
result Score matching estimator approximates true parameter values with low error.

Paper tackles unbounded density ratio estimation for covariate shift adaptation.

problem Understudied challenge in statistical learning: unbounded density ratios.
method Three-step estimation method: relative density ratio, truncation, and transformation.
result Established rigorous convergence guarantees for density ratio and regression estimators.

Soft Truncation improves diffusion model performance by balancing loss scales across diffusion times.

problem Inverse correlation between density estimation and sample generation in diffusion models.
method Introduces Soft Truncation, a training technique that softens the truncation hyperparameter.
result Soft Truncation achieves state-of-the-art performance on various datasets.

We accelerate CNF by reducing ODE truncation errors with polynomial regularization.

problem High computation cost of CNF due to large truncation errors in solving ODEs.
method Add polynomial regularization to approximate ODE trajectories with polynomial functions.
result 42.3% to 71.3% reduction of NFE on density estimation, 19.3% to 32.1% on variational auto-encoder.

The COS method for European options pricing is improved with a new bound for the number of terms.

problem Determining the optimal number of terms in the COS method for accurate European option pricing.
method Using Fourier-cosine expansion, the study finds an explicit bound for the number of terms N in the cosine series approximation.
result The COS method achieves exponential convergence when the log-return density is smooth, but not when it has heavy tails.

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.

Several statistical models are given in the form of unnormalized densities, and calculation of the normalization constant is intractable. We propose estimation methods for such unnormalized models with missing data. The key concept is to combine imputation techniques with estimators for unnormalized models including no…

2019-03-08abs ↗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 ↗

A neural network method estimates densities from characteristic functions.

problem Estimating fixed-horizon probability densities from empirical characteristic functions.
method Data-driven Fourier-mixture neural-network method trained in Fourier space.
result Competitive performance and clear gains on heavy-tailed targets.

Estimates expected information gain using density approximations and dimension reduction.

problem Estimating expected information gain in nonlinear and non-Gaussian settings.
method Flexible transport-based schemes for EIG estimation, optimal sample allocation, and gradient-based upper bounds on mutual information.
result Optimal sample allocation and dimension reduction schemes improve EIG estimation accuracy and convergence rate.

Efficiently estimate Boolean product distribution parameters from truncated samples.

problem Estimating parameters of Boolean product distributions from truncated samples.
method Introducing fatness of truncation set, using membership queries, and adapting Stochastic Gradient Descent.
result Efficiently learn Boolean product distributions from truncated samples with small sample complexity.

We develop a scale-invariant truncated Lévy (STL) process to describe physical systems characterized by correlated stochastic variables. The STL process exhibits Lévy stability for the probability density, and hence shows scaling properties (as observed in empirical data); it has the advantage that all moments are fini…

1999-06-25abs ↗pdf ↗

Unified method for calculating financial option prices from characteristic functions.

problem Calculating financial option prices from characteristic functions in high dimensions.
method Damped Fourier-cosine expansion (COS) method.
result The method converges exponentially if the characteristic function decays exponentially.

Paper proposes robust estimators for heavy-tailed data with infinite variance.

problem Developing robust estimators for heavy-tailed data with infinite variance.
method Proposes two robust estimators: ridge log-truncated M-estimator and elastic net log-truncated M-estimator.
result Demonstrates robustness of log-truncated estimations over standard estimations through simulations and real data analysis.

Bayesian method estimates LTLL distribution parameters for time-to-event data.

problem Parameter estimation for time-to-event data with left truncation.
method Bayesian inference using Metropolis-Hastings algorithm.
result Bayesian estimation provides more stable and reliable parameter estimates.

Paper develops methods for analyzing forms with synchronized singularities.

problem Analyzing forms with synchronized singularities.
method Exact reduction, analytic transfer, and geometric recomposition.
result Transfer of sparse domination principle to synchronized singular forms.

Paper estimates spectral risk measures for insurance data with truncated and censored data.

problem Estimating spectral risk measures for insurance data with left truncation and right censoring.
method Proposes a non-parametric estimator using product limit estimator and establishes asymptotic normality.
result Proposed estimator outperforms existing methods for small k and small sample sizes.

The positivity assumption, or the experimental treatment assignment (ETA) assumption, is important for identifiability in causal inference. Even if the positivity assumption holds, practical violations of this assumption may jeopardize the finite sample performance of the causal estimator. One of the consequences of pr…

2017-07-18abs ↗pdf ↗

In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding bound is an immediate consequence of the theory. Moreover, we propose a rigorous and…

2019-08-19abs ↗pdf ↗

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.

Estimates inverse temperature of Ising models with a single sample.

problem Estimating inverse temperature in truncated Ising models with hard constraints.
method Maximizing pseudolikelihood to estimate the inverse temperature.
result An estimator that is nearly O(n)O(n) time and O(Δ3/n)O(Δ^3/\sqrt{n})-consistent.

A new model simulates non-linear adsorption using Gaussian KDEs.

problem Simulating non-linear adsorption processes in porous materials.
method Combines random walk particle tracking with Gaussian Kernel Density Estimators for nonlinear modeling.
result Effective reproduction of Langmuir and Freundlich isotherms.

Adaptive truncation improves privacy in online Bayesian estimation.

problem Ensuring privacy in online Bayesian estimation of a static parameter.
method Sequential Monte Carlo, adaptive truncation, Thompson sampling.
result Adaptive truncation reduces privacy-preserving noise, enabling more accurate estimation.

This paper gives quantitative global estimates between a time dependent flow on a Riemannian manifold (M)\left( M\right) and the flow of a vector field constructed by truncating the formal Magnus expansion for the logarithm of the flow. As a corollary, we also find quantitative estimates between the composition of the …

2018-10-04abs ↗pdf ↗

In the paper "On Truncated Variation of Brownian Motion with Drift" (Bull. Pol. Acad. Sci. Math. 56 (2008), no.4, 267 - 281) we defined truncated variation of Brownian motion with drift, Wt=Bt+μt,t0,W_t = B_t + μt, t\geq 0, where (Bt)(B_t) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…

2009-12-23abs ↗pdf ↗

Generative model prices basket options efficiently.

problem Real-time pricing of basket options with varying market inputs.
method Truncated path signatures and Mixture Density Networks (MDN) for learning the terminal density.
result The model produces small pricing errors and matches Monte Carlo simulations closely.

We solve for functions from their truncated Hilbert transforms using Chebyshev series.

problem Finding functions from their truncated Hilbert transforms.
method Express functions in Chebyshev series and numerically estimate coefficients.
result Numerical methods work well for extrapolating functions from truncated Hilbert transforms.

New method evaluates personalized treatment in critical care, robust to death.

problem Truncation by death in critical care makes traditional DTR evaluation ineffective.
method Principal stratification-based approach, focusing on always-survivor value function, with a semiparametrically efficient, multiply robust estimator.
result Demonstrates robustness and efficiency of the method for personalized treatment optimization.

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 ↗

Proposes a new method to estimate Bayesian neural network depth.

problem Estimating the depth of Bayesian neural networks.
method Uses a discrete truncated normal distribution to learn depth mean and variance, inferring posterior distributions by minimizing variational free energy.
result Improves test accuracy and reduces posterior depth variance on the spiral dataset.

The paper analyzes and mitigates biases in scalable Gaussian Process methods.

problem Modeling biases in scalable Gaussian Process methods.
method Randomized truncation estimators to eliminate bias in exchange for increased variance.
result Randomized truncation estimators meaningfully outperform biased counterparts with minimal additional computation.

New method estimates treatment effects over time for survival data, improving accuracy and smoothness.

problem Estimating treatment effects over time for survival data with left truncation and right censoring.
method surv-iTMLE, a targeted learning procedure for estimating conditional survival probabilities.
result surv-iTMLE outperforms existing methods in bias and smoothness of time-varying effect estimates.

We provide an efficient algorithm for the classical problem, going back to Galton, Pearson, and Fisher, of estimating, with arbitrary accuracy the parameters of a multivariate normal distribution from truncated samples. Truncated samples from a dd-variate normal N(μ,Σ){\cal N}(\mathbfμ,\mathbfΣ) means a samples is only re…

2018-09-11abs ↗pdf ↗