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,694 papers · 148 categories

Trend · papers per month

14284155 · May 202619922001200920172026
48 results for death reporting

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.

The paper audits trading filters, finding a high save-to-miss ratio.

problem Improving the efficiency and accuracy of trading filters in decentralized exchanges.
method A precision audit of filter rules against real trading data, classifying rejection events.
result Conservative save-to-miss ratio of 3.7 : 1, with wider interpretation of 14.8 : 1.

Study shows oil prices but not COVID-19 cases affect US economic policy uncertainty.

problem Effect of COVID-19 and crude oil prices on US economic policy uncertainty.
method Used ARDL model with daily data from January 21-March 13, 2020.
result Crude oil price dynamics increase US economic policy uncertainty, while COVID-19 cases have mixed effects.

Paper analyzes factors affecting COVID-19 risk in US counties.

problem Identifying factors influencing COVID-19 risk in US counties.
method Combines unsupervised (K-means clustering) and supervised learning models.
result Mean temperature, poverty, obesity, and other factors are most significant.

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.

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 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 ↗

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.

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.

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 ↗

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.

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.

Decision trees are flexible models that are well suited for many statistical regression problems. In a Bayesian framework for regression trees, Markov Chain Monte Carlo (MCMC) search algorithms are required to generate samples of tree models according to their posterior probabilities. The critical component of such an …

2019-04-19abs ↗pdf ↗