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

17335066 · May 202619922001200920172026
48 results for Left truncation

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.

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.

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.

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 ↗

The paper estimates common mean of entangled Gaussians with bounded variances.

problem Estimating common mean of entangled Gaussians with bounded variances.
method Iteratively averaging truncated samples.
result Achieves error $O \left(\frac{\sqrt{n\ln n}}{m} ight)$ with high probability when m=Ω(nlnn)m=Ω(\sqrt{n\ln n}).

We show that given an estimate A^\widehat{A} that is close to a general high-rank positive semi-definite (PSD) matrix AA in spectral norm (i.e., A^A2δ\|\widehat{A}-A\|_2 \leq δ), the simple truncated SVD of A^\widehat{A} produces a multiplicative approximation of AA in Frobenius norm. This observation leads to many inte…

2017-02-22abs ↗pdf ↗

A new method prices time-to-event cash flows using survival analysis.

problem Pricing insurance investment portfolios with time-to-event cash flows.
method Discrete-time survival analysis framework, hazard rate estimators, asymptotic multivariate normality.
result Pricing model yields estimates closer to actual cash flows than non-random models.

Paper establishes tight lower bounds for minimizing certain smooth and convex functions.

problem Minimizing high-order Hölder smooth and uniformly convex functions.
method Analyzes two asymmetric cases of q>p+νq > p + ν and q<p+νq < p + ν using worst-case oracle complexities.
result Establishes worst-case oracle complexities for reaching an ε-approximate solution.

The problem of an arbitrary truncated Levy flight description using the method of cumulant approach has been solved. The set of cumulants of the truncated Levy distribution given the assumption of arbitrary truncation has been found. The influence of truncation shape on the truncated Levy flight properties in the Gauss…

2010-06-12abs ↗pdf ↗

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.

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 ↗

Optimal algorithm learns Gaussian under halfspace truncation with minimal samples.

problem Learning a Gaussian distribution truncated to an unknown halfspace.
method Efficient algorithm using n=ildeO(d2/ε2)n = ilde{O}(d^2/\varepsilon^2) samples and runtime dominated by empirical covariance matrix computation.
result Optimal sample and time complexity bounds for learning a Gaussian under halfspace truncation.

Non-negative matrix factorization (NMF) minimizes the Euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large e…

2019-06-02abs ↗pdf ↗

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.

The method approximates stationary distributions of Markov models by truncating irrelevant states.

problem Computing the stationary distribution of complex Markov models is computationally challenging.
method A state-space lumping scheme that aggregates states in a grid structure, iteratively refining the state-space.
result The method provides a well-justified finite-state projection tailored to the stationary behavior of Markov models.

Paper tackles overestimation bias in continuous control, improving performance by 25%.

problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.

The paper constructs minimizers for deep learning networks and analyzes their geometric structure.

problem Underparametrized deep learning networks and their minimizers.
method Direct construction of minimizers without gradient descent, considering specific settings.
result Explicit family of minimizers for the global minimum and a set of degenerate local minima.

As in standard linear regression, in truncated linear regression, we are given access to observations (Ai,yi)i(A_i, y_i)_i whose dependent variable equals yi=AiTx+ηiy_i= A_i^{\rm T} \cdot x^* + η_i, where xx^* is some fixed unknown vector of interest and ηiη_i is independent noise; except we are only given an observation if its dep…

2020-07-29abs ↗pdf ↗

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.

We show that generalised geometry gives a unified description of maximally supersymmetric consistent truncations of ten- and eleven-dimensional supergravity. In all cases the reduction manifold admits a "generalised parallelisation" with a frame algebra with constant coefficients. The consistent truncation then arises …

2014-01-14abs ↗pdf ↗

Proposes a method to handle sparse multiway count data with false zeros using zero-truncated Poisson regression.

problem Handling sparse multiway count data corrupted by false zeros.
method Zero-truncated Poisson regression with tensor completion.
result Accurate estimation of multiway count data from approximately IR2log22(I)IR^2\log_2^2(I) non-zero counts.

The paper studies deformation spaces of Coxeter truncation polytopes.

problem Understanding the geometric properties and deformations of Coxeter truncation polytopes.
method Analyzing Coxeter truncation polytopes and their deformation spaces.
result Description of deformation spaces for Coxeter truncation polytopes of dimension d4d \geqslant 4.

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.

The paper connects quantum 6j6j-symbols to tetrahedra volumes via discrete Fourier transforms.

problem Understanding the asymptotic behavior of quantum 6j6j-symbols and their relation to 3-manifold invariants.
method Proposing and proving a conjecture linking discrete Fourier transforms of quantum 6j6j-symbols to the volumes of deeply truncated tetrahedra.
result Supporting evidence for the conjecture in specific cases, with numerical calculations for larger dihedral angles.

Learning with a {\it convex loss} function has been a dominating paradigm for many years. It remains an interesting question how non-convex loss functions help improve the generalization of learning with broad applicability. In this paper, we study a family of objective functions formed by truncating traditional loss f…

2018-05-21abs ↗pdf ↗

The paper investigates the convergence of Vendi scores under finite samples and introduces a truncated version for better performance.

problem The Vendi score's convergence is hindered by computational limitations when using large sample sizes.
method The authors introduce the t-truncated Vendi score to address this issue by truncating the eigenspectrum of the kernel matrix.
result The t-truncated Vendi score converges to its asymptotic limit with a smaller number of samples, improving upon the standard Vendi score.

We study inference and learning based on a sparse coding model with `spike-and-slab' prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the applic…

2012-11-15abs ↗pdf ↗