English
Related papers

Related papers: Boosted nonparametric hazards with time-dependent …

200 papers

We propose a soft gradient boosting framework for sequential regression that embeds a learnable linear feature transform within the boosting procedure. At each boosting iteration, we train a soft decision tree and learn a linear input…

Machine Learning · Computer Science 2025-09-17 Huseyin Karaca , Suleyman Serdar Kozat

We present a general principle for estimating a regression function nonparametrically, allowing for a wide variety of data filtering, for example, repeated left truncation and right censoring. Both the mean and the median regression cases…

Statistics Theory · Mathematics 2011-02-10 Oliver Linton , Enno Mammen , Jens Perch Nielsen , Ingrid Van Keilegom

This paper presents a novel stochastic gradient descent algorithm for constrained optimization. The proposed algorithm randomly samples constraints and components of the finite sum objective function and relies on a relaxed logarithmic…

Optimization and Control · Mathematics 2025-05-13 Naum Dimitrieski , Jing Cao , Christian Ebenbauer

The convergence of stochastic gradient descent is highly dependent on the step-size, especially on non-convex problems such as neural network training. Step decay step-size schedules (constant and then cut) are widely used in practice…

Optimization and Control · Mathematics 2021-02-19 Xiaoyu Wang , Sindri Magnússon , Mikael Johansson

Frailty models are often the model of choice for heterogeneous survival data. A frailty model contains both random effects and fixed effects, with the random effects accommodating for the correlation in the data. Different estimation…

Methodology · Statistics 2019-09-17 Oodally Ajmal , Luc Duchateau , Estelle Kuhn

In this paper, we revisit Stochastic Continuous Submodular Maximization in both offline and online settings, which can benefit wide applications in machine learning and operations research areas. We present a boosting framework covering…

Machine Learning · Computer Science 2022-06-13 Qixin Zhang , Zengde Deng , Zaiyi Chen , Haoyuan Hu , Yu Yang

Boosting is a learning scheme that combines weak prediction rules to produce a strong composite estimator, with the underlying intuition that one can obtain accurate prediction rules by combining "rough" ones. Although boosting is proved to…

Machine Learning · Computer Science 2015-05-07 Shaobo Lin , Yao Wang , Lin Xu

Many single-target regression problems require estimates of uncertainty along with the point predictions. Probabilistic regression algorithms are well-suited for these tasks. However, the options are much more limited when the prediction…

Machine Learning · Statistics 2021-06-08 Michael O'Malley , Adam M. Sykulski , Rick Lumpkin , Alejandro Schuler

Stochastic (sub)gradient methods require step size schedule tuning to perform well in practice. Classical tuning strategies decay the step size polynomially and lead to optimal sublinear rates on (strongly) convex problems. An alternative…

Optimization and Control · Mathematics 2019-07-24 Damek Davis , Dmitriy Drusvyatskiy , Vasileios Charisopoulos

Prognostic models in survival analysis are aimed at understanding the relationship between patients' covariates and the distribution of survival time. Traditionally, semi-parametric models, such as the Cox model, have been assumed. These…

Machine Learning · Statistics 2020-11-06 Denise Rava , Jelena Bradic

Statistical estimation and inference for marginal hazard models with varying coefficients for multivariate failure time data are important subjects in survival analysis. A local pseudo-partial likelihood procedure is proposed for estimating…

Statistics Theory · Mathematics 2009-09-29 Jianwen Cai , Jianqing Fan , Haibo Zhou , Yong Zhou

This paper examines the role and efficiency of the non-convex loss functions for binary classification problems. In particular, we investigate how to design a simple and effective boosting algorithm that is robust to the outliers in the…

Machine Learning · Statistics 2017-08-25 Alexander Hanbo Li , Jelena Bradic

In this article we propose a boosting algorithm for regression with functional explanatory variables and scalar responses. The algorithm uses decision trees constructed with multiple projections as the "base-learners", which we call…

Methodology · Statistics 2023-04-07 Xiaomeng Ju , Matías Salibián-Barrera

The ratio of the hazard functions of two populations or two strata of a single population plays an important role in time-to-event analysis. Cox regression is commonly used to estimate the hazard ratio under the assumption that it is…

Methodology · Statistics 2022-07-13 Yujian Wu , Ted Westling

We study the multiplicative hazards model with intermittently observed longitudinal covariates and time-varying coefficients. For such models, the existing ad hoc approach, such as the last value carried forward, is biased. We propose a…

Methodology · Statistics 2025-03-13 Zhuowei Sun , Hongyuan Cao

This paper examines a novel gradient boosting framework for regression. We regularize gradient boosted trees by introducing subsampling and employ a modified shrinkage algorithm so that at every boosting stage the estimate is given by an…

Methodology · Statistics 2019-09-16 Yichen Zhou , Giles Hooker

Online nonparametric estimators are gaining popularity due to their efficient computation and competitive generalization abilities. An important example includes variants of stochastic gradient descent. These algorithms often take one…

Statistics Theory · Mathematics 2025-07-08 Tianyu Zhang , Jing Lei

The hazard ratio from the Cox proportional hazards model is a ubiquitous summary of treatment effect. However, when hazards are non-proportional, the hazard ratio can lose a stable causal interpretation and become study-dependent because it…

Methodology · Statistics 2026-02-17 Xiang Meng , Lu Tian , Kenneth Kehl , Hajime Uno

Multicalibration gradient boosting has recently emerged as a scalable method that empirically produces approximately multicalibrated predictors and has been deployed at web scale. Despite this empirical success, its convergence properties…

Machine Learning · Computer Science 2026-02-09 Daniel Haimovich , Fridolin Linder , Lorenzo Perini , Niek Tax , Milan Vojnovic

For many practical, high-risk applications, it is essential to quantify uncertainty in a model's predictions to avoid costly mistakes. While predictive uncertainty is widely studied for neural networks, the topic seems to be under-explored…

Machine Learning · Computer Science 2021-04-05 Andrey Malinin , Liudmila Prokhorenkova , Aleksei Ustimenko