惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Y
Y Combinator Blog
GbyAI
GbyAI
U
Unit 42
WordPress大学
WordPress大学
Last Week in AI
Last Week in AI
P
Proofpoint News Feed
D
DataBreaches.Net
N
Netflix TechBlog - Medium
H
Hackread – Cybersecurity News, Data Breaches, AI and More
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
C
Check Point Blog
Martin Fowler
Martin Fowler
月光博客
月光博客
MongoDB | Blog
MongoDB | Blog
MyScale Blog
MyScale Blog
The Cloudflare Blog
Apple Machine Learning Research
Apple Machine Learning Research
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
M
MIT News - Artificial intelligence
云风的 BLOG
云风的 BLOG
罗磊的独立博客
B
Blog RSS Feed
J
Java Code Geeks
The GitHub Blog
The GitHub Blog

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
The standard cure model with a linear hazard
Emil Aas Stoltenberg · 2020-11-26 · via math.ST updates on arXiv.org

In this paper we introduce a mixture cure model with a linear hazard rate regression model for the event times. Cure models are statistical models for event times that take into account that a fraction of the population might never experience the event of interest, this fraction is said to be {`}cured{'}. The population survival function in a mixture cure model takes the form $S(t) = 1 - π+ π\exp(-\int_0^tα(s)\,d s)$, where $π$ is the probability of being susceptible to the event under study, and $α(s)$ is the hazard rate of the susceptible fraction. We let both $π$ and $α(s)$ depend on possibly different covariate vectors $X$ and $Z$. The probability $π$ is taken to be the logistic function $π(X^{\prime}γ) = 1/\{1+\exp(-X^{\prime}γ)\}$, while we model $α(s)$ by Aalen's linear hazard rate regression model. This model postulates that a susceptible individual has hazard rate function $α(t;Z) = β_0(t) + β_1(t)Z_1 + \cdots + Z_{q-1}β_{q-1}(t)$ in terms of her covariate values $Z_1,\ldots,Z_{q-1}$. The large-sample properties of our estimators are studied by way of parametric models that tend to a semiparametric model as a parameter $K \to \infty$. For each model in the sequence of parametric models, we assume that the data generating mechanism is parametric, thus simplifying the derivation of the estimators, as well as the proofs of consistency and limiting normality. Finally, we use contiguity techniques to switch back to assuming that the data stem from the semiparametric model. This technique for deriving and studying estimators in non- and semiparametric settings has previously been studied and employed in the high-frequency data literature, but seems to be novel in survival analysis.