This paper addresses issues with the Brier score in administrative censoring scenarios.
problem Problems with the Brier score in administrative censoring scenarios.
method Proposes an alternative Brier score for administratively censored data.
result The administrative Brier score is valid even when censoring times can be identified from covariates.
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.
We establish the first nonasymptotic error bounds for Kaplan-Meier-based nearest neighbor and kernel survival probability estimators where feature vectors reside in metric spaces. Our bounds imply rates of strong consistency for these nonparametric estimators and, up to a log factor, match an existing lower bound for c…
Survival function estimation is used in many disciplines, but it is most common in medical analytics in the form of the Kaplan-Meier estimator. Sensitive data (patient records) is used in the estimation without any explicit control on the information leakage, which is a significant privacy concern. We propose a first d…
We consider the classic supervised learning problem, where a continuous non-negative random label Y (i.e. a random duration) is to be predicted based upon observing a random vector X valued in Rd with d≥1 by means of a regression rule with minimum least square error. In various applications, rangi…
Securely analyzes survival data across multiple institutions without revealing individual patient records.
problem Privacy concerns in federated survival analysis of health data.
method Multiparty homomorphic encryption for approximate floating-point computation and encrypted aggregation.
result Privacy-preserving federated Kaplan--Meier survival analysis with high fidelity and predictable overhead.
KM-GPT automates IPD reconstruction from KM plots with high accuracy and scalability.
problem Manual digitization of IPD from KM plots is error-prone and lacks scalability.
method KM-GPT integrates advanced image preprocessing, multi-modal reasoning, and iterative reconstruction algorithms.
result KM-GPT generates high-quality IPD without manual input or intervention, achieving superior accuracy.
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.
New estimator for survival function with missing not at random censoring indicators.
problem Estimating survival function with missing not at random censoring indicators.
method Proposes a new estimator based on a conditional copula model for the missingness mechanism.
result Provides a new method for estimating conditional survival function with MNAR censoring indicators.
We propose a method for detection and prediction of native and synthetic iceberg orders on Chicago Mercantile Exchange. Native (managed by the exchange) icebergs are detected using discrepancies between the resting volume of an order and the actual trade size as indicated by trade summary messages, as well as by tracki…
This monograph introduces deep learning models for predicting time-to-event outcomes.
problem Predicting critical events and their timing from time series data.
method Neural networks and deep learning models for survival analysis.
result Improved accuracy in predicting time-to-event outcomes using deep learning.
Non-parametric estimators improve quickest changepoint detection under irregular sequence lengths.
problem Limited and irregular sequence lengths hinder application of ARL and ADD in QCD.
method Analogies with survival analysis to model detection probabilities under truncation.
result KM-ARL and KM-ADD non-parametric estimators are asymptotically unbiased.
Survival analysis is a type of semi-supervised ranking task where the target output (the survival time) is often right-censored. Utilizing this information is a challenge because it is not obvious how to correctly incorporate these censored examples into a model. We study how three categories of loss functions, namely …
Hidden Markov jump processes are an attractive approach for modeling clinical disease progression data because they are explainable and capable of handling both irregularly sampled and noisy data. Most applications in this context consider time-homogeneous models due to their relative computational simplicity. However,…
A fundamental question in data analysis, machine learning and signal processing is how to compare between data points. The choice of the distance metric is specifically challenging for high-dimensional data sets, where the problem of meaningfulness is more prominent (e.g. the Euclidean distance between images). In this…
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…
Quantum neural networks improve causal inference in biomedical studies, especially for small samples.
problem Addressing selection bias in comparing surgical techniques using observational data.
method Developed QNN-based propensity score models focusing on four key covariates (Age, Sex, Stage, BMI). Employed a linear ZFeatureMap for data encoding, SummedPaulis for predictions, and CMA-ES for optimization. Integrated noise modeling to enhance predictive stability.
result QNNs, particularly with noise-aware strategies, outperformed classical models in small samples, achieving AUC up to 0.750 for n=100.
Develops algorithms to optimize machine replacement schedules using operational data.
problem Optimizing machine replacement intervals when the lifetime distribution is unknown.
method Formulates as a stochastic multi-armed bandit problem and proposes Hoeffding- and Bernstein-based algorithms.
result Achieves optimal or near-optimal replacement intervals with minimal regret.
Study predicts when ALS patients will lose speech, swallowing, etc. based on covariates.
problem Predicting when ALS patients will experience significant functional decline.
method Multi-event survival analysis, covariate-based models.
result Covariate-based models outperform Kaplan-Meier estimator in predicting time-to-event outcomes.
Identifying patient characteristics that influence the rate of colorectal polyp recurrence can provide important insights into which patients are at higher risk for recurrence. We used natural language processing to extract polyp morphological characteristics from 953 polyp-presenting patients' electronic medical recor…
Machine learning improves kidney transplant outcomes prediction.
problem Improving prediction of kidney transplant success.
method Random forest machine learning model trained on kidney donor risk index data.
result Random forest predicted 2,148 more successful transplants than the risk index.
Study evaluates multi-omics data's role in predicting cancer survival.
problem Determining the usefulness of multi-omics data for predicting disease outcomes.
method 5-fold cross-validation with 12 prediction methods applied to 18 cancer datasets.
result Multi-omics data generally improves prediction performance, but not consistently.
Copula-based fusion improves breast cancer risk stratification.
problem Combining clinical and genomic risk scores using simple rules fails to capture their joint relationship.
method Used copulas to model the joint relationship between clinical and genomic risk scores.
result Copula-based fusion improves risk stratification, identifying subgroups with the worst prognosis.
Survival analysis of 832,941 Solana token launches shows a significant decline in graduation rate.
problem Analyzing the survival rate of Solana token launches and identifying factors affecting graduation.
method Survival analysis using Kaplan-Meier and Cox proportional-hazards models.
result The survival rate of Solana token launches has declined significantly, with a 3.18x decrease from previous rates.
New estimators outperform maximum likelihood without hyper-parameter estimation.
problem Improving system identification performance without hyper-parameter estimation.
method Developed generalized Bayes and closed-form biased estimators using excess MSE.
result New estimators have comparable performance to empirical-Bayes-based regularized estimator.
New estimator reduces kernel mean estimation error.
problem Kernel mean estimation in reproducing kernel Hilbert spaces.
method Corrupt data with known distributions and estimate kernel mean under the corrupted distribution.
result The marginalized kernel mean estimator achieves lower estimation error.
Dual Bayesian Affine Estimators for Wiener-type state-space models
problem Estimating parameters in Wiener-type state-space models
method Fixed-point architecture combining two affine estimators
result Dual basis-parameter estimator achieves comparable parameter MSE to purely affine estimator
Enhances gradient estimates for Hermitian Monge-Ampère equations.
problem Improving estimates for Hermitian Monge-Ampère equations.
method Improves gradient estimates using Evans-Krylov and third derivatives estimates.
result Enhanced estimates for second and third order derivatives.
Paper proposes robust estimators for GANs under Wasserstein contamination.
problem Robust estimation of distributions under contamination.
method Wasserstein GAN-based estimators for location, covariance, and regression.
result Proposed estimators are minimax optimal in many scenarios.
New framework converts offline to online estimation using black-box offline estimators.
problem Convert offline estimation algorithms to online estimation algorithms.
method Oracle-Efficient Online Estimation (OEOE) framework.
result Achieves near-optimal online estimation error via black-box offline estimators.
Proposes variational autoencoder for efficient MMSE estimation.
problem Efficient parameterized MMSE estimation for noisy observations.
method Variational autoencoder models data distribution, approximates MMSE.
result Proposed estimator performs well compared to state-of-the-art.
Paper improves Fisher information estimation methods.
problem Estimating Fisher information for location parameters.
method Revisits and improves Bhattacharya estimator, introduces clipped estimator.
result Clipped estimator shows superior convergence rates in Gaussian noise.
Proposes a robust estimator for RD designs.
problem Estimating treatment effects in RD designs.
method Doubly robust estimator combining two estimators.
result Enhances robustness of treatment effect estimators.
New estimator reduces variance in discrete random variables.
problem Estimating gradients for discrete random variables with reduced variance.
method Sampling without replacement and Rao-Blackwellization.
result Our estimator is the most consistent gradient estimator across different entropy settings.
SCOPE estimator improves covariance and precision matrix estimation.
problem Estimating covariance and precision matrices accurately.
method Distributionally robust optimization with convex spectral divergence.
result SCOPE estimator reduces spectral bias and improves condition number.
We present a multi-task learning approach to jointly estimate the means of multiple independent data sets. The proposed multi-task averaging (MTA) algorithm results in a convex combination of the single-task maximum likelihood estimates. We derive the optimal minimum risk estimator and the minimax estimator, and show t…
Obtaining more accurate equity value estimates is the starting point for stock selection, value-based indexing in a noisy market, and beating benchmark indices through tactical style rotation. Unfortunately, discounted cash flow, method of comparables, and fundamental analysis typically yield discrepant valuation estim…
The maximum mean discrepancy (MMD) is a kernel-based distance between probability distributions useful in many applications (Gretton et al. 2012), bearing a simple estimator with pleasing computational and statistical properties. Being able to efficiently estimate the variance of this estimator is very helpful to vario…
Stochastic volatility modelling of financial processes has become increasingly popular. The proposed models usually contain a stationary volatility process. We will motivate and review several nonparametric methods for estimation of the density of the volatility process. Both models based on discretely sampled continuo…
A new copula estimation method using classification.
problem Estimating copula density from joint and marginal distributions.
method Train a classifier to distinguish joint density from product of marginals.
result Empirically outperforms existing copula estimators.
This paper reviews SDR methods for multivariate response regression.
problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.
Density ratio estimation is a vital tool in both machine learning and statistical community. However, due to the unbounded nature of density ratio, the estimation procedure can be vulnerable to corrupted data points, which often pushes the estimated ratio toward infinity. In this paper, we present a robust estimator wh…
TAKDE optimizes kernel density estimation for real-time dynamic processes.
problem Real-time density estimation in applications like computer vision and signal processing.
method Derives asymptotic mean integrated squared error (AMISE) upper bound for 'sliding window' kernel density estimator and proposes TAKDE as a novel, theoretically optimal estimator.
result TAKDE outperforms other dynamic density estimators in terms of test log-likelihood and runtime.
We introduce two new estimators of the bivariate Hurst exponent in the power-law cross-correlations setting -- the cross-periodogram and local X-Whittle estimators -- as generalizations of their univariate counterparts. As the spectrum-based estimators are dependent on a part of the spectrum taken into consideration …
Paper bridges score estimation to parameter and density estimation in DDPMs.
problem Efficiently estimating scores for generative models.
method Introduces a framework linking score estimation to parameter and density estimation.
result Denoising score-matching in DDPMs is asymptotically efficient for parameter estimation.
New method for fast volatility estimation robust to change points.
problem Robust high-frequency volatility estimation with change points.
method ℓ1-regularized power variation estimators using LARS for sparse estimation and dynamic programming for change point refinement.
result Minimax rates achieved for volatility estimators, providing accurate and smooth forecasts.
ROME improves density estimation for multi-modal, non-normal data.
problem Robust multi-modal density estimation in non-normal, highly correlated distributions.
method ROME uses clustering to segment multi-modal data into uni-modal clusters, then combines KDE estimates for each cluster.
result ROME outperforms state-of-the-art methods and is more robust to various distributions.
Paper introduces VDE, a variance-reduced determinant estimator.
problem Estimating determinants with low variance and efficiency.
method Combines variational inference and spherical normalizing flows.
result VDE achieves zero variance in ideal cases, requiring only one sample.