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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jul 199219922001200920182026
48 results for time to death

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.

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.

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 ↗

Invasive interventions did not significantly shorten ICU patients' time to death.

problem Determining if withholding or withdrawing invasive interventions affects ICU patients' time to death.
method Observational study using MIMIC-III ICU database, stratifying by severity, comparing 2002-2005 vs. 2008-2011.
result Despite a reduction in invasive interventions, time to death did not decrease.

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 ↗

Study uses machine learning to analyze state drug policies and reduce overdose deaths.

problem Epidemic opioid overdose rates and ineffective state-level policies.
method Hierarchical clustering of 138 binomial variables to generate policy bundles, then regression analysis.
result Balancing certain policies leads to reduced overdose deaths, but only after second year.

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.

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.

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.

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.

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 ↗

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.

Random forest models predict CLABSI risk in hospital admissions, with static models performing similarly to dynamic ones.

problem Predicting CLABSI risk in hospital admissions using EHR data with competing risks.
method Comparison of static and dynamic random forest models for binary, multinomial, survival, and competing risks outcomes.
result Static and dynamic random forest models perform similarly in predicting CLABSI risk, with multinomial models having the lowest computation times.

Method summarizes and predicts time series data for COVID-19 cases and deaths.

problem Summarizing and predicting time series data for multiple related time series.
method Hierarchical algorithm generating shapelets for centroids, nearest neighbor search for labeling, dynamic time warping for non-uniform lengths.
result Predictive model for individual time series based on aggregated statistics.

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 ↗

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.

SurvLatent ODE predicts VTE risk for cancer patients, outperforming current methods.

problem Predicting clinical outcomes from irregularly sampled EHR data with competing events.
method Neural ODE-based Recurrent Neural Networks (ODE-RNN) for flexible survival time estimation.
result SurvLatent ODE outperforms Khorana Risk scores for VTE risk prediction.