OPSurv: Orthogonal Polynomials Quadrature Algorithm for Survival Analysis

• URL: http://arxiv.org/abs/2402.01955v1
• Date: Fri, 2 Feb 2024 23:26:09 GMT
• Title: OPSurv: Orthogonal Polynomials Quadrature Algorithm for Survival Analysis
• Authors: Lilian W. Bialokozowicz and Hoang M. Le and Tristan Sylvain, Peter A. I. Forsyth, Vineel Nagisetty, Greg Mori
• Abstract summary: This paper introduces the Orthogonal Polynomials Quadrature Algorithm for Survival Analysis (OPSurv) OPSurv provides time-continuous functional outputs for both single and competing risks scenarios in survival analysis.
• Score: 19.65859820376036
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper introduces the Orthogonal Polynomials Quadrature Algorithm for Survival Analysis (OPSurv), a new method providing time-continuous functional outputs for both single and competing risks scenarios in survival analysis. OPSurv utilizes the initial zero condition of the Cumulative Incidence function and a unique decomposition of probability densities using orthogonal polynomials, allowing it to learn functional approximation coefficients for each risk event and construct Cumulative Incidence Function estimates via Gauss--Legendre quadrature. This approach effectively counters overfitting, particularly in competing risks scenarios, enhancing model expressiveness and control. The paper further details empirical validations and theoretical justifications of OPSurv, highlighting its robust performance as an advancement in survival analysis with competing risks.

Related papers

• Statistical Inference for Temporal Difference Learning with Linear Function Approximation [62.69448336714418]
  Temporal Difference (TD) learning, arguably the most widely used for policy evaluation, serves as a natural framework for this purpose. In this paper, we study the consistency properties of TD learning with Polyak-Ruppert averaging and linear function approximation, and obtain three significant improvements over existing results.
  arXiv  Detail & Related papers  (2024-10-21T15:34:44Z)
• Nonparametric Instrumental Variable Regression through Stochastic Approximate Gradients [0.3277163122167434]
  We show how to formulate a functional gradient descent algorithm to tackle NPIV regression by directly minimizing the populational risk. We provide theoretical support in the form of bounds on the excess risk, and conduct numerical experiments showcasing our method's superior stability and competitive performance. This algorithm enables flexible estimator choices, such as neural networks or kernel based methods, as well as non-quadratic loss functions.
  arXiv  Detail & Related papers  (2024-02-08T12:50:38Z)
• Model-Based Epistemic Variance of Values for Risk-Aware Policy Optimization [59.758009422067]
  We consider the problem of quantifying uncertainty over expected cumulative rewards in model-based reinforcement learning. We propose a new uncertainty Bellman equation (UBE) whose solution converges to the true posterior variance over values. We introduce a general-purpose policy optimization algorithm, Q-Uncertainty Soft Actor-Critic (QU-SAC) that can be applied for either risk-seeking or risk-averse policy optimization.
  arXiv  Detail & Related papers  (2023-12-07T15:55:58Z)
• Learning Survival Distribution with Implicit Survival Function [15.588273962274393]
  We propose Implicit Survival Function (ISF) based on Implicit Neural Representation for survival distribution estimation without strong assumptions. Experimental results show ISF outperforms the state-of-the-art methods in three public datasets.
  arXiv  Detail & Related papers  (2023-05-24T02:51:29Z)
• Multivariate Systemic Risk Measures and Computation by Deep Learning Algorithms [63.03966552670014]
  We discuss the key related theoretical aspects, with a particular focus on the fairness properties of primal optima and associated risk allocations. The algorithms we provide allow for learning primals, optima for the dual representation and corresponding fair risk allocations.
  arXiv  Detail & Related papers  (2023-02-02T22:16:49Z)
• Mitigating multiple descents: A model-agnostic framework for risk monotonization [84.6382406922369]
  We develop a general framework for risk monotonization based on cross-validation. We propose two data-driven methodologies, namely zero- and one-step, that are akin to bagging and boosting.
  arXiv  Detail & Related papers  (2022-05-25T17:41:40Z)
• A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits [91.3755431537592]
  This paper unifies the analysis of risk-averse Thompson sampling algorithms for the multi-armed bandit problem. Using the contraction principle in the theory of large deviations, we prove novel concentration bounds for continuous risk functionals. We show that a wide class of risk functionals as well as "nice" functions of them satisfy the continuity condition.
  arXiv  Detail & Related papers  (2021-08-25T17:09:01Z)
• A Full Characterization of Excess Risk via Empirical Risk Landscape [8.797852602680445]
  In this paper, we provide a unified analysis of the risk of the model trained by a proper algorithm with both smooth convex and non- loss functions.
  arXiv  Detail & Related papers  (2020-12-04T08:24:50Z)
• A Stochastic Subgradient Method for Distributionally Robust Non-Convex Learning [2.007262412327553]
  robustness is with respect to uncertainty in the underlying data distribution. We show that our technique converges to satisfying perturbationity conditions. We also illustrate the performance of our algorithm on real datasets.
  arXiv  Detail & Related papers  (2020-06-08T18:52:40Z)
• A robust algorithm for explaining unreliable machine learning survival models using the Kolmogorov-Smirnov bounds [5.482532589225552]
  SurvLIME-KS is proposed for explaining machine learning survival models. It is developed to ensure robustness to cases of a small amount of training data or outliers of survival data. Various numerical experiments with synthetic and real datasets demonstrate the SurvLIME-KS efficiency.
  arXiv  Detail & Related papers  (2020-05-05T14:47:35Z)
• Survival Cluster Analysis [93.50540270973927]
  There is an unmet need in survival analysis for identifying subpopulations with distinct risk profiles. An approach that addresses this need is likely to improve characterization of individual outcomes.
  arXiv  Detail & Related papers  (2020-02-29T22:41:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.