New CTBNs with clocks allow for non-exponential survival times.
problem Modeling phenomena with non-exponential survival times in continuous time.
method Introduced node-wise clocks to construct graph-coupled semi-Markov chains, enabling non-exponential survival times without auxiliary states.
result Parameter and structure inference algorithms provided, demonstrating advantages over current CTBN extensions.
In this paper, the survival function of waiting times between orders and the corresponding trades in a double-auction market is studied both by means of experiments and of empirical data. It turns out that, already at the level of order durations, the survival function cannot be represented by a single exponential, thu…
In high-frequency financial data not only returns, but also waiting times between consecutive trades are random variables. Therefore, it is possible to apply continuous-time random walks (CTRWs) as phenomenological models of the high-frequency price dynamics. An empirical analysis performed on the 30 DJIA stocks shows …
In high-frequency financial data not only returns, but also waiting times between consecutive trades are random variables. Therefore, it is possible to apply continuous-time random walks (CTRWs) as phenomenological models of the high-frequency price dynamics. An empirical analysis performed on the 30 DJIA stocks shows …
New theory extends LQ control to non-exponential discount scenarios.
problem Time-inconsistent deterministic LQ control problems.
method Extended equivalent relationship to non-exponential discount functions, studied Riccati equation solvability.
result Existence and uniqueness of linear equilibrium for time-inconsistent LQ problem.
Study optimal stopping times for multi-dimensional processes with non-exponential discounting.
problem Optimal stopping in multi-dimensional processes with non-exponential discounting.
method Probabilistic potential theory to establish existence of optimal equilibria.
result Existence of optimal equilibria for multi-dimensional stopping problems.
New RL approach handles non-exponential discounting for sequential decisions.
problem Modeling human discounting in sequential decision-making tasks.
method Generalized model-based reinforcement learning with arbitrary discount functions, using Hamilton-Jacobi-Bellman equation and collocation method.
result Validated approach on simulated problems, showing applicability to human discounting.
The paper analyzes a game where players must balance short-term and long-term interests, leading to cooperative or competitive outcomes.
problem Analyzing time inconsistency in inter-personal decision-making under non-exponential discounting.
method Iterative procedures and Zorn's lemma to find Nash equilibria between players' intra-personal equilibria.
result Inter-personal equilibria exist and depend on the impatience levels of the players.
Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.
problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.
It will be discussed the statistics of the extreme values in time series characterized by finite-term correlations with non-exponential decay. Precisely, it will be considered the results of numerical analyses concerning the return intervals of extreme values of the fluctuations of resistance and defect-fraction displa…
Survival MDN uses invertible functions to speed up survival analysis models.
problem Training neural ODEs for survival analysis is computationally expensive.
method Survival MDN applies an invertible positive function to MDN outputs.
result Survival MDN outperforms or matches other models on concordance, Brier score, and log-likelihood.
SurvFD and SurvSHAP-IQ provide interpretable survival models by analyzing feature interactions.
problem Non-additivity of hazard and survival functions limits standard additive explanation methods.
method SurvFD decomposes higher-order effects into time-dependent and time-independent components, extending Shapley interactions to time-indexed functions.
result SurvFD and SurvSHAP-IQ offer a new perspective on survival explanations, explicitly characterizing feature interactions.
SurvMixClust clusters survival data and predicts individual survival curves.
problem Integrating clustering into survival analysis for precision medicine.
method SurvMixClust learns latent representations for clustering and predicts survival functions using a mixture of non-parametric experts.
result SurvMixClust creates balanced clusters with distinct survival curves, outperforming clustering baselines and competing with non-clustering models in predictive accuracy.
New methods estimate survival functions with time-varying covariates.
problem Estimating survival functions with time-varying covariates.
method Generalized conditional inference and relative risk forests, adapted transformation forest.
result Proposed methods outperform traditional models in estimating survival functions.
SDPM models survival analysis without parametric assumptions, achieving competitive performance.
problem Estimating survival distributions from censored data with flexibility and accuracy.
method Generative model using denoising diffusion, avoiding parametric assumptions and discretization.
result SDPM achieves competitive predictive performance across various metrics.
Survival kernets scale deep kernel survival analysis to large datasets with interpretability and theoretical guarantees.
problem Scalable and interpretable deep kernel survival analysis for large datasets.
method Survival kernets use kernel netting for training set compression and XGBoost for warm-starting neural architecture search.
result Survival kernets achieve optimal time-dependent concordance index on various survival analysis datasets.
Neural network learns kernel functions for survival analysis and prediction intervals.
problem Predicting survival times for individuals based on similar training subjects.
method Develops a neural network framework to learn kernel functions for kernel survival analysis and uses these to construct valid prediction intervals.
result Neural network survival estimators are competitive with existing methods and provide valid prediction intervals.
TripleSurv improves survival analysis by ranking samples with time-adaptive adjustments.
problem Modeling censored time-to-event data with high accuracy and robustness.
method Introduces a time-adaptive coordinate loss function to rank samples and calibrate robustness.
result TripleSurv outperforms state-of-the-art methods on various survival datasets.
Application of discrete-time survival methods for continuous-time survival prediction is considered. For this purpose, a scheme for discretization of continuous-time data is proposed by considering the quantiles of the estimated event-time distribution, and, for smaller data sets, it is found to be preferable over the …
SurvFM-RMST converts survival outcomes into pseudo-observation targets for tabular models.
problem Right-censored follow-up prevents direct use of survival labels in tabular patient data.
method SurvFM-RMST framework that converts survival outcomes into jackknife pseudo-observation targets for restricted mean survival time.
result SurvFM-RMST accurately recovered restricted event-free time in simulations and outperformed naive targets in static datasets.
We study an infinite-horizon discrete-time optimal stopping problem under non-exponential discounting. A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibria. When the discount function induces decreasing impatience, we establish the existence of an equilibrium through …
FinSurvival provides a large-scale financial survival modeling benchmark.
problem Lack of large-scale, realistic, and freely available datasets for benchmarking AI survival models.
method Derived 16 survival modeling tasks from cryptocurrency lending data using an automated pipeline.
result Demonstrated that existing AI survival models are not well-suited for these challenging tasks.
Enhances patient failure prediction using dynamic survival models.
problem Lack of precise individual level prediction in conventional models.
method Developed counterfactual dynamic survival model (CDSM).
result Inflection point of estimated survival curves predicts patient failure time.
auton-survival simplifies survival analysis for healthcare data.
problem Handling censored time-to-event data in healthcare.
method Open-source package for survival regression, adjustment, counterfactual estimation, phenotyping, and treatment effects.
result Demonstrates auton-survival's ability to support complex health and epidemiological questions.
Efficiently clusters survival curves without computationally intensive resampling.
problem Identifying clusters of survival curves efficiently and scalably.
method Log-rank test combined with k-means clustering.
result Achieves comparable results to bootstrap-based methods but with improved efficiency.
An accurate model of patient-specific kidney graft survival distributions can help to improve shared-decision making in the treatment and care of patients. In this paper, we propose a deep learning method that directly models the survival function instead of estimating the hazard function to predict survival times for …
PyDTS analyzes survival data with discrete intervals and competing risks.
problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.
Bayesian approach clusters survival data for better risk prediction.
problem Identifying subpopulations with distinct risk profiles in survival analysis.
method Bayesian nonparametric approach in a clustered latent space.
result Consistent improvements in predictive performance and interpretability.
New survival learners estimate heterogeneous treatment effects from time-to-event data.
problem Estimating HTEs from time-to-event data with censoring outcomes.
method Orthogonal survival learners with theoretical guarantees and custom weighting functions.
result Orthogonal survival learners provide robust and model-agnostic HTE estimation.
An accurate model of a patient's individual survival distribution can help determine the appropriate treatment for terminal patients. Unfortunately, risk scores (e.g., from Cox Proportional Hazard models) do not provide survival probabilities, single-time probability models (e.g., the Gail model, predicting 5 year prob…
Paper proposes robust methods for estimating optimal treatment rules with censored survival data.
problem Estimating optimal treatment rules for censored survival data.
method Developed two robust criteria and a sampling-based difference-of-convex algorithm for learning optimal treatment rules.
result Proposed methods show improved performance compared to existing methods in simulations and real data.
SurvCaus improves survival CATE estimation using neural nets.
problem Estimating Individual Treatment Effects (ITE) in survival analysis.
method Representation balancing for counterfactual inference with neural networks.
result The proposed method outperforms baseline methods in synthetic and semisynthetic datasets.
A new method clusters survival data using deep variational models.
problem Clustering survival data, a challenging task.
method Semi-supervised probabilistic approach with deep generative model.
result The method outperforms previous models in clustering and predicting survival times.
Improves survival analysis across multiple domains with machine learning.
problem Adapting survival analysis to new or rare illness types with limited labeled data.
method Introduces a new survival metric and discrepancy measure for censored data, enabling domain adaptation.
result Superb performance on target domains, better treatment recommendations, and interpretable weight matrix.
Credit scoring plays a vital role in the field of consumer finance. Survival analysis provides an advanced solution to the credit-scoring problem by quantifying the probability of survival time. In order to deal with highly heterogeneous industrial data collected in Chinese market of consumer finance, we propose a nonp…
Study solves HJB equations for time-inconsistent control problems.
problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.
CENNSurv models cumulative effects of time-dependent exposures on survival outcomes.
problem Challenges in modeling cumulative effects of time-dependent exposures on survival outcomes.
method CENNSurv, a novel deep learning approach that captures dynamic risk relationships from time-dependent data.
result CENNSurv reveals multi-year lagged and short-term behavioral shifts in survival outcomes.
We consider a stochastic game-theoretic model of an investment market in continuous time with short-lived assets and study strategies, called survival, which guarantee that the relative wealth of an investor who uses such a strategy remains bounded away from zero. The main results consist in obtaining a sufficient cond…
SurvBESA predicts survival times using ensemble methods with self-attention.
problem Challenges in survival analysis due to censored data and unstable predictions.
method SurvBESA combines Beran estimators with a self-attention mechanism to predict survival times.
result SurvBESA outperforms state-of-the-art models in predicting survival times.
New method generates synthetic survival data by conditioning on event times and censoring indicators.
problem Generating accurate synthetic survival data with censored event times.
method Conditioning covariates on event times and censoring indicators using existing tabular data generation models.
result Our method consistently outperforms baselines and improves survival model performance.
BoXHED2.0 boosts survival analysis for complex data.
problem Survival analysis with time-dependent covariates.
method Tree-boosted hazard estimator, fully nonparametric, scalable.
result Scalable to parametric boosted survival models in speed.
This paper considers the Merton portfolio management problem. We are concerned with non-exponential discounting of time and this leads to time inconsistencies of the decision maker. Following Ekeland and Pirvu 2006, we introduce the notion of equilibrium policies and we characterize them by an integral equation. The ma…
Ridge regression linked to Poisson resetting in statistical physics.
problem Understanding and extending ridge regularization in machine learning.
method Connecting stochastic resetting from statistical physics with ridge regularization in machine learning, using renewal processes.
result Exact filter identities for ridge regularization in various reset laws, including exponential and non-exponential.
Interpretable survival analysis improves heart failure risk prediction.
problem Improving heart failure risk prediction using survival analysis.
method Survival stacking, ControlBurn, Explainable Boosting Machines.
result Achieves state-of-the-art performance and provides novel insights.
TV-SurvCaus improves causal inference for dynamic treatments in survival analysis.
problem Estimating causal effects of time-varying treatments on survival outcomes.
method Representation balancing techniques extended to time-varying treatment regimes with survival outcomes.
result TV-SurvCaus outperforms existing methods in estimating individualized treatment effects with time-varying covariates and treatments.
Paper tackles survival data analysis with positive and unlabeled observations.
problem Traditional survival analysis yields biased results with positive-unlabeled data.
method Developed parametric, nonparametric, and machine learning models for positive and unlabeled survival data.
result Proposed estimation method provides valid results for positive-unlabeled survival data.
SurvSHAP(t) explains time-dependent survival predictions from machine learning models.
problem Interpreting complex survival models for time-dependent effects.
method SHapley Additive exPlanations (SHAP) adapted for time-dependent survival predictions.
result SurvSHAP(t) detects time-dependent effects and improves variable importance detection.
SAVAE uses deep learning for survival analysis, improving model performance and interpretability.
problem Complex medical data with censoring and covariate interactions.
method SAVAE is a Variational Autoencoder tailored for survival analysis, using a novel ELBO formulation.
result SAVAE outperforms state-of-the-art techniques in various datasets, demonstrating robustness and interpretability.