Nonasymptotic error bounds and strong consistency rates for survival analysis methods.
problem Establishing reliable error bounds and consistency rates for survival analysis methods.
method Nonasymptotic error bounds for Kaplan-Meier-based nearest neighbor and kernel survival probability estimators in metric spaces.
result Rates of strong consistency match existing lower bounds for conditional CDF estimation.
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.
Proposes a privacy-preserving method for survival function estimation.
problem Privacy leakage in survival function estimation using sensitive data.
method Differential privacy framework applied to Kaplan-Meier estimator and related metrics.
result The method provides utility and strong privacy guarantees with real-world data.
Method detects and predicts iceberg orders on CME.
problem Detect and predict iceberg orders on CME.
method Detect native and synthetic iceberg orders using discrepancies and order modifications. Train model with Kaplan--Meier estimator. Predict iceberg sizes.
result Model predicts iceberg sizes with out-of-sample validation.
The paper addresses supervised learning with censored data, proposing a method to estimate risk.
problem Learning from censored data in regression problems.
method Proposes a plug-in estimate of the true risk based on a Kaplan-Meier estimator of the censorship distribution.
result The learning rate of minimizers of the proposed risk functional is of order \(O_{\mathbb{P}}(\sqrt{\log(n)/n})\).
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.
Study predicts colorectal polyp recurrence using medical records and statistical models.
problem Identifying patient characteristics influencing colorectal polyp recurrence.
method Natural language processing for extracting polyp characteristics, Kaplan-Meier curves, Cox proportional hazards modeling, random survival forest models.
result Polyp size, number, location, and patient smoking status significantly influence recurrence risk.
The paper tackles survival analysis with censored data, proposing methods to incorporate incomplete information into models.
problem Survival analysis with censored data, where the target output is often incomplete.
method The paper explores three categories of loss functions: partial likelihood methods, rank methods, and a classification method based on a Wasserstein metric and Kaplan Meier estimate.
result The proposed method optimizes the expected C-index, a common evaluation metric for ranking survival models.
New model improves cancer screening prediction accuracy.
problem Modeling disease progression with heterogeneous populations and irregular data.
method Hierarchical Hidden Markov Jump Processes with piece-wise stationary transitions and scalable EM algorithm.
result Model outperforms state-of-the-art models in prediction accuracy and generating Kaplan-Meier estimators.
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.
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.
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.
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.
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.
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…
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.
KAPLAN-HR models survival data without manual interactions, outperforming existing methods.
problem Survival analysis challenges with complex covariates and time-varying effects.
method Kolmogorov-Arnold Networks (KAN) for nonparametric hazard estimation.
result KAPLAN-HR matches or exceeds existing methods in clinical survival data.
3-manifolds can be made parallelisable via surgery.
problem Making 3-manifolds parallelisable.
method Surgery presentation, refined by Kaplan, contact geometry.
result All closed, orientable 3-manifolds are parallelisable.
This paper introduces tools to predict individual survival probabilities across all times.
problem Lack of tools to provide individual survival probabilities across all time points.
method Develops and evaluates new models including extensions to Cox model, Accelerated Failure Time, Random Survival Forests, and Multi-Task Logistic Regression.
result Introduces D-Calibration for evaluating individual survival distribution models.
We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …
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.
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.
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.
Proves algebraicity of Hodge loci in arithmetic quotients.
problem Proving algebraicity of Hodge loci in arithmetic quotients.
method Real semi-algebraic structure and o-minimal theory.
result Hodge locus is a countable union of algebraic subvarieties.
Reservoir computer dimensions estimated using three methods.
problem Estimating the dimension of reservoir computer signals.
method Used three dimension estimation methods: false nearest neighbor, covariance, and Kaplan-Yorke.
result Signals in reservoir system exist on a low dimensional surface.
Develops a jackknife method for semiparametric inference with improved efficiency and validity.
problem Lack of theoretical properties for modern semiparametric and machine-learning estimators.
method V-fold jackknife for semiparametric inference, using empirical dispersion of jackknife pseudo-values.
result Valid confidence intervals and simultaneous confidence bands for regular and generalized asymptotically linear estimators.
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.
Let X be a connected non-compact 2-dimensional manifold possibly with boundary and Δ be a foliation on X such that each leaf ω∈Δ is homeomorphic to R and has a trivially foliated neighborhood. Such foliations on the plane were studied by W. Kaplan who also gave their topological classification. H…
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 proof confirms 4-manifolds with weakly reducible genus-three trisections are standard.
problem Proving 4-manifolds with weakly reducible genus-three trisections are standard.
method Using weak reducibility from Heegaard theory, the tools and techniques borrowed from 3-manifold topology.
result Proves Meier's conjecture for weakly reducible genus-three trisections.
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.
New Lie groups generalize H-type groups with nondegenerate centers.
problem Generalizing H-type groups with nondegenerate centers.
method Defined and investigated 2-step nilpotent Lie groups.
result Geometric properties of new Lie groups investigated.
A knot K in the 3-sphere is superslice if there is a slice disk D in the 4-ball such that the double of D along K is the unknotted 2-sphere S in S4. Answering a question of Livingston-Meier, we find smoothly slice (in fact doubly slice) knots in the 3-sphere with Alexander polynomial equal to 1 that are not smoothly…
We prove that the braided Thompson's groups Vbr and Fbr are of type F∞, confirming a conjecture by John Meier. The proof involves showing that matching complexes of arcs on surfaces are highly connected. In an appendix, Zaremsky uses these connectivity results to exhibit families of subgroups …
We prove that the uniformizing map of any arithmetic quotient, as well as the period map associated to any pure polarized Z-variation of Hodge structure V on a smooth complex quasi-projective variety S, are topologically tame. As an easy corollary of these results and of Peterzil-Starchenko's o-…
Standard trisection diagrams found for a specific type of knot.
problem Finding standard trisection diagrams for Gluck twists.
method Using a specific method to obtain trisection diagrams for spun (p+1,p)-torus knots. result Standard trisection diagrams were found for the spun (p+1,p)-torus knots. We introduce a special class of nilpotent Lie groups of step 2, that generalizes the so called H(eisenberg)-type groups, defined by A. Kaplan in 1980. We change the presence of inner product to an arbitrary scalar product and relate the construction to the composition of quadratic forms. We present the geodesic equat…
This paper constructs explicit trisection diagrams for elliptic surfaces.
problem Constructing explicit trisection diagrams for elliptic surfaces.
method Using handle diagrams from Lefschetz fibrations to create trisection diagrams.
result Explicit (12n−2,0)-trisection diagrams of elliptic surfaces E(n) are constructed. This paper constructs a Weinstein trisection for a surface bundle.
problem Constructing a trisection for a surface bundle.
method Weinstein trisection approach applied to ΣgimesΣh. result Explicit construction of a Weinstein trisection for S2imesS2. The McCool group, denoted PΣn, is the group of pure symmetric automorphisms of a free group of rank n. The cohomology algebra H∗(PΣn,Q) was determined by Jensen, McCammond and Meier. We prove that H∗(PΣn,Q) is a non-Koszul algebra for n≥4, which answers a question of Cohen and Pr…
Algorithm constructs Grushko decomposition of certain groups.
problem Decomposing fundamental groups of graphs of free groups.
method Analyzing vertex links of CAT(0) square complexes.
result Transforms complex to one with strong connectivity vertex links.
New method finds infinitely many surface knots with specific bridge numbers.
problem Finding numerical invariants for surface links.
method Colorings of surface links by keis to prove bridge number existence.
result Existence of infinitely many surface knots with bridge number n for n ≥ 4.
We begin a systematic study of these spaces, initially following along the lines of Eberlein's comprehensive study of the Riemannian case. In particular, we integrate the geodesic equation, discuss the structure of the isometry group, and make a study of lattices and periodic geodesics. Some major differences from the …
Computes immersions of C2-projective spaces using K-theory.
problem Computing immersions of equivariant projective spaces.
method Geometric filtration and localized slice spectral sequence.
result Obtained equivariant analogue of James periodicity.
We study a generalization of Hodge structures which first appeared in the work of Cecotti and Vafa. It consists of twistors, that is, holomorphic vector bundles on P^1, with additional structure, a flat connection on C^*, a real subbundle and a pairing. We call these objects TERP-structures. We generalize to TERP-struc…
H-type Lie algebras were introduced by Kaplan as a class of real Lie algebras generalizing the familiar Heisenberg Lie algebra h3. The H-type property depends on a choice of inner product on the Lie algebra g. Among the H-type Lie algebras are the complex Heisenberg Lie algebras $\mathfrak{h}…
The paper examines trisection diagrams of spun knots and shows they are standard for certain cases.
problem Whether trisection diagrams induced by the Gluck surgery on specific knots are standard.
method Explicit depiction and analysis of trisection diagrams for spun (2n+1,−2)-torus knots. result Trisection diagrams are standard for spun (2n+1,−2)-torus knots when n=1 and homologically standard for all n.