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

4178341,2511,668 · Jun 202019922001200920172026
48 results for truncation by death

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 propose a Bayesian nonparametric approach to the problem of jointly modeling multiple related time series. Our approach is based on the discovery of a set of latent, shared dynamical behaviors. Using a beta process prior, the size of the set and the sharing pattern are both inferred from data. We develop efficient M…

2011-11-17abs ↗pdf ↗

AI generates a sequence of death causes from hospital records.

problem Accurate death reporting for vital statistics and policy formulation.
method Neural machine translation models to generate causal chains, incorporating medical domain knowledge.
result Achieved 16.04 BLEU score for generating accurate causal chains.

Study identifies clusters of EU countries with similar young mortality patterns.

problem Identify clusters of EU countries with similar mortality patterns in young population.
method Symbolic data analysis (SDA) with age, gender, and main causes of death dimensions.
result Identified clusters of EU countries with similar mortality patterns in young population.

Jointly models cause-of-death mortality rates across multiple countries and genders.

problem Modeling cause-of-death mortality rates in a multinational setting.
method Multi-Output Gaussian Processes (MOGP) with Kronecker-structured kernels and latent factors.
result Efficiently captures heterogeneity and dependence across different factor inputs.

Study birth-death dynamics for sampling Gibbs measures with nonconvex potentials.

problem Sampling Gibbs measures with nonconvex potentials.
method Birth-death dynamics, Kullback-Leibler divergence, χ2χ^2 divergence, kernel-based approximations, ΓΓ-convergence of gradient flows.
result Probability density converges exponentially fast to Gibbs equilibrium measure with a universal rate.

We consider models of the population or opinion dynamics which result in the non-linear stochastic differential equations (SDEs) exhibiting the spurious long-range memory. In this context, the correspondence between the description of the birth-death processes as the continuous-time Markov chains and the continuous SDE…

2019-04-30abs ↗pdf ↗

We find the optimal investment strategy for an individual who seeks to minimize one of four objectives: (1) the probability that his wealth reaches a specified ruin level {\it before} death, (2) the probability that his wealth reaches that level {\it at} death, (3) the expectation of how low his wealth drops below a sp…

2007-03-28abs ↗pdf ↗

A fundamental problem in Bayesian inference and statistical machine learning is to efficiently sample from multimodal distributions. Due to metastability, multimodal distributions are difficult to sample using standard Markov chain Monte Carlo methods. We propose a new sampling algorithm based on a birth-death mechanis…

2019-05-23abs ↗pdf ↗

New method uses birth-death process and exploration component to accelerate sampling from multimodal distributions.

problem Sampling from multimodal probability distributions efficiently.
method Combines birth-death process and exploration component to accelerate sampling.
result Proves exponential asymptotic convergence under mild assumptions.

Patients who suffer an acute coronary syndrome are at elevated risk for adverse cardiovascular events such as myocardial infarction and cardiovascular death. Accurate assessment of this risk is crucial to their course of care. We focus on estimating a patient's risk of cardiovascular death after an acute coronary syndr…

2018-12-02abs ↗pdf ↗

Bayesian networks (BNs) are graphical models that are useful for representing high-dimensional probability distributions. There has been a great deal of interest in recent years in the NP-hard problem of learning the structure of a BN from observed data. Typically, one assigns a score to various structures and the sear…

2016-10-01abs ↗pdf ↗

Looking for associations among multiple variables is a topical issue in statistics due to the increasing amount of data encountered in biology, medicine and many other domains involving statistical applications. Graphical models have recently gained popularity for this purpose in the statistical literature. Following t…

2010-04-13abs ↗pdf ↗

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 ↗

In this paper we study the financial repercussions of the destruction of two fully armed and operational moon-sized battle stations ("Death Stars") in a 4-year period and the dissolution of the galactic government in Star Wars. The emphasis of this work is to calibrate and simulate a model of the banking and financial …

2015-11-29abs ↗pdf ↗

Probabilistic bounds on neuron death in deep networks, showing depth can be increased indefinitely.

problem Understanding neuron death in deep rectifier networks and its impact on model trainability.
method Deriving upper and lower bounds on neuron death probability as a function of model hyperparameters.
result The probability of neuron death decreases as network depth increases, provided width increases proportionally.

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 ↗

FS&P uses birth-death process to ensure global convergence of stochastic conic particle gradient descent.

problem Global optimization of non-convex objective functions over measure space.
method Introduces Fast Spawn\&Prune (FS\&P) combining CPGD with birth-death process.
result First theoretical guarantee of global convergence for discrete-time stochastic algorithms.

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.

This paper addresses the risk-minimization problem, with and without mortality securitization, à la Föllmer-Sondermann for a large class of equity-linked mortality contracts when no model for the death time is specified. This framework includes the situation where the correlation between the market model and the time o…

2018-05-30abs ↗pdf ↗

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.

The paper values variable annuities using complex stochastic models and deep learning.

problem Valuation of variable annuities with early surrender options under non-Markovian models.
method Developed a deep signature Least Squares Monte Carlo approach to handle path-dependent continuation values.
result Fair fees increase with Hurst parameters of stock volatility and mortality force.

Near a birth-death critical point in a one-parameter family of gradient flows, there are precisely two Morse critical points of index difference one on the birth side. This paper gives a self-contained proof of the folklore theorem that these two critical points are joined by a unique gradient trajectory up to time-shi…

2017-06-23abs ↗pdf ↗

New RL algorithm reduces regret in birth-death queueing problems.

problem Efficiency of reinforcement learning in MDPs with large state spaces.
method Modified Ucrl2 algorithm exploiting birth-death structure.
result Regret bound of ildeO(E2AT) ilde{\mathcal{O}}(\sqrt{E_2AT}) independent of state space size.

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.

condLSTM-Q predicts COVID-19 deaths at county level with quantile forecasts.

problem Predicting COVID-19 mortality at fine geographical scales.
method Conditional Long Short-Term Memory networks with quantile output.
result Fine-scale quantile predictions inform about death toll distribution.