Paper develops a model to predict kidney transplant success.
problem Mismatched deceased donor-recipient kidney leads to post-transplant death.
method Data analysis of 584 imported kidneys from 12 transplant centers.
result Predicting model reduces mortality rate due to kidney mismatch.
New method classifies patients with kidney transplant based on many features.
problem Classifying patients with many features (ultrahigh-dimensional data).
method Multivariate screening and classification method leveraging feature correlations.
result Achieves optimal misclassification rates and more powerful discovery.
Paper proposes efficient method for automatic renal segmentation in DCE-MRI.
problem Automatic segmentation of renal parenchyma in DCE-MRI images.
method Cascaded application of two 3D CNNs for localization and segmentation.
result Achieved high segmentation accuracy with mean dice coefficients of 91.4 and 83.6 for normal and abnormal kidneys, respectively.
Paper compares traditional and ML models for renal failure, quantifying bias.
problem Measuring bias in ML models for healthcare applications.
method Compare Tangri risk score with ML model on 1.6M patient data.
result ML model shows better performance and potential bias.
A tool simplifies neural network training for medical image analysis.
problem Difficulties in training neural networks for medical image analysis.
method Intuitive interface for WSI annotation and display, human-in-the-loop strategy.
result Improved network performance through iterative annotation.
Estimation of response functions is an important task in dynamic medical imaging. This task arises for example in dynamic renal scintigraphy, where impulse response or retention functions are estimated, or in functional magnetic resonance imaging where hemodynamic response functions are required. These functions can no…
New fair regression method improves fairness in chronic kidney disease classification.
problem Mitigating societal bias in health care for multiple groups.
method Penalized fair regression framework for multiple groups, with penalties for true positive rate disparity.
result Achieves fairness-accuracy frontier beyond existing methods in simulations and real-world data.
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.
RENAL test evaluates generative models for time series data.
problem Evaluating generative models for time series data is challenging.
method RENAL test uses recurrent neural networks to transform time series into conditionally independent data pairs for goodness-of-fit testing.
result RENAL test outperforms existing methods in evaluating generative models for time series data.
Introduction. Case Based Reasoning (CBR) is an emerg- ing decision making paradigm in medical research where new cases are solved relying on previously solved similar cases. Usually, a database of solved cases is provided, and every case is described through a set of attributes (inputs) and a label (output). Extracting…
New CNN architecture improves pediatric image segmentation by homogenizing pose and size.
problem Challenges in segmenting pediatric images due to pose and size heterogeneity.
method Spatial Transformer Network (STN) for pose and scale invariance, combined with UNet for segmentation.
result Improved pediatric segmentation, especially renal tumor delineation, with accelerated processing.
Novel framework detects CKD in diabetic patients using sparse EHR representations.
problem Early detection of CKD in diabetic patients.
method Sparse longitudinal representations of EHR data.
result Proposed model achieves higher predictive performance than baselines.
Accurate and robust cell nuclei classification is the cornerstone for a wider range of tasks in digital and Computational Pathology. However, most machine learning systems require extensive labeling from expert pathologists for each individual problem at hand, with no or limited abilities for knowledge transfer between…
Deep Rule Forests identifies drug-drug and drug-disease interactions causing AKI.
problem Identifying drug-drug and drug-disease interactions leading to AKI.
method Deep Rule Forests (DRF) algorithm discovering rules from multilayer tree models.
result DRF model outperforms other algorithms in prediction accuracy and interpretability.
Estimates prediction error for non-uniform samples.
problem Account for non-uniform sampling in prediction model evaluation.
method Extends Efron's estimator with Horvitz-Thompson weights for complex samples.
result Consistent estimator of generalized prediction error for complex samples.
We present a novel method for extracting cancer signatures by applying statistical risk models (http://ssrn.com/abstract=2732453) from quantitative finance to cancer genome data. Using 1389 whole genome sequenced samples from 14 cancers, we identify an "overall" mode of somatic mutational noise. We give a prescription …
New *K-means method finds cancer signatures without NMF.
problem Identifying cancer signatures from genome data.
method Applying *K-means clustering to 1,389 cancer samples.
result 3 cancers lack cluster-like structures, 2 have high correlations.
Study uses machine learning and survival analysis to predict CKD progression.
problem Early detection and management of CKD to reduce ESRD risk.
method Combines machine learning and classical statistical models to identify novel CKD progression predictors.
result Deep learning models outperform other methods in predicting CKD progression.
Deep learning predicts ICD codes with high accuracy for patient phenotyping.
problem Variability in ICD code assignment by coders.
method Deep learning model trained on demographics, lab results, and medications.
result Model predictions outperform coder assigned ICD codes in accuracy.
Models predict patients at risk of uncontrolled hypertension.
problem Identifying patients at risk of uncontrolled hypertension.
method Developed machine learning models (logistic regression and recurrent neural networks) using EHR data.
result Best model achieved AUROC of 0.719, outperforming baseline.
Unsupervised method selects genes for tumor subtype discovery.
problem High-dimensional tumor gene expression data with noisy variables and heterogeneity.
method Autoencoders for latent space learning, Multiple Kernel Learning for feature selection, clustering.
result Lower redundancy and better clustering performance compared to benchmarks.
Novel deep learning model improves AUC prediction for tacrolimus dosing.
problem Model misspecification in current pharmacokinetic models.
method Latent Neural-ODE for learning individualized pharmacokinetic dynamics.
result Latent ODE model outperforms standard methods in AUC prediction accuracy.
AI identifies patient clusters for diabetes case management.
problem Diabetes complications and mental health comorbidities drive high healthcare costs.
method Combined AI techniques with diverse data sources for prediction and clustering.
result 83.5% accuracy in predicting diabetes complications and meaningful patient clusters.
Study describes severe dengue ICU patients in Brazil, 2012-2024.
problem Characterize severe dengue ICU patients and identify risk factors.
method Prospective study, descriptive statistics, logistic regression, machine learning.
result Advanced age, comorbidities, leukocytes, and platelets are significant risk factors for complications.
New neural network models for complex functional data analysis.
problem Complex relations between functional predictors and responses.
method Function-on-Function regression models using neural networks with continuous hidden layers.
result Demonstrated power and flexibility in handling complex functional models.
Knot signature function defined and conditions for its existence are given.
problem Defining and characterizing the signature function of knots.
method Presentation of necessary and sufficient conditions for a function to be a knot signature function.
result Conditions for a function to be the signature function of a knot are established.
Distance function to a finite set is a topological Morse function.
problem Characterizing the topological Morse function of a finite set.
method Analyzing the distance function to a finite set in \(\mathbb{R}^n\).
result Distance function is a topological Morse function, with precise critical points and indices.
Introduces new weighted floating functions and affine surface areas.
problem Developing new mathematical concepts for convex bodies.
method Introducing weighted floating functions and weighted functional affine surface areas.
result New relations to traditional and classical affine surface areas.
Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.
problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.
The paper introduces geodesic φ-convex functions and their properties.
problem Generalizing geodesic functions to φ-convex functions.
method Introducing geodesic φ-convex functions and investigating their properties.
result Characterization of geodesic φ-convex functions via their φ-epigraphs.
Neural networks can approximate functionals on RKHS with error bounds.
problem Approximating functionals on RKHS using neural networks.
method Interpolating orthogonal projections in RKHS using point evaluations.
result Explicit error bounds for various kernels (inverse multiquadric, Gaussian, Sobolev).
FFBO optimizes functions as inputs and outputs, improving on existing BO methods.
problem Optimizing functions as both inputs and outputs in complex systems.
method Function-on-function Gaussian process (FFGP) model with a separable operator-valued kernel, scalar upper confidence bound (UCB) acquisition function, and scalable functional gradient ascent algorithm (FGA).
result FFBO outperforms existing methods in synthetic and real-world data.
Analyzes properties of transnormal Finsler functions on compact manifolds.
problem Properties of transnormal Finsler functions on compact manifolds.
method Analyzes critical level sets and partition properties of transnormal functions.
result Critical level sets of an analytic transnormal function are submanifolds, and the partition of M into level sets is a Finsler partition. The study explores the Dehn functions of Kähler groups and their properties.
problem Which functions can arise as Dehn functions of Kähler groups?
method Analyzes examples of Kähler groups with various Dehn functions and proves the existence of a Kähler group with a cubic bounded Dehn function.
result There exists a Kähler group with a cubic bounded Dehn function and an exponential upper bound.
Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…
The Fridman function is bounded by the injectivity radius for certain hyperbolic manifolds.
problem Bounding the Fridman function for hyperbolic manifolds.
method Analyzing the relationship between the Fridman function and the injectivity radius function.
result The Fridman function is bounded above by the injectivity radius function for certain hyperbolic manifolds.
Optimally estimates a functional using nuisance function tuning and sample splitting.
problem Estimating optimal rates for a doubly robust functional.
method Combines nuisance function tuning and sample splitting strategies.
result Shows optimal rates of convergence for various estimators.
The paper extends mixability theory to function-valued forecasts, proving various loss functions are mixable.
problem Efficient aggregation of functional and probabilistic forecasts in online prediction games.
method Adapting mixable and exponentially concave loss functions to function-valued forecasts.
result Various loss functions used for probabilistic forecasting are mixable (exp-concave).
The paper proves isoparametric functions on Finsler space forms under specific conditions.
problem Understanding isoparametric functions in Finsler space forms.
method Proving transnormal functions as isoparametric functions and constructing global and local isoparametric functions using the distance function.
result Generalization of Theorem B to Finsler space forms.
Paper introduces a nonparametric functional graphical model for random functions.
problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.
Robustifies elicitable functionals to handle small distribution misspecifications.
problem Determining uniquely optimal forecasts under distributional misspecification.
method Integrates statistical robustness into elicitable functionals using Kullback-Leibler divergence.
result Robust elicitable functionals admit unique solutions at the boundary of uncertainty regions.
Deep neural networks with various activation functions can approximate Hölder smooth functions.
problem Expressivity of deep neural networks with general activation functions.
method Investigates approximation ability of deep neural networks with a broad class of activation functions, including Hölder smooth functions.
result Derives the required depth, width, and sparsity of deep neural networks to approximate Hölder smooth functions.
The paper characterizes strong Hamel functions using symmetries and proves their preservation properties.
problem Characterizing strong Hamel functions and their symmetries in Finsler spaces.
method Analyzing geodesic spray, strong dual symmetries, and strong dynamical symmetries.
result Strong Hamel functions can be characterized in terms of strong dual symmetries and strong dynamical symmetries.
This paper introduces the concept of functional current as a mathematical framework to represent and treat functional shapes, i.e. sub-manifold supported signals. It is motivated by the growing occurrence, in medical imaging and computational anatomy, of what can be described as geometrico-functional data, that is a da…
Two new methods improve forecasting of functional time series data.
problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.
Study biharmonic functions on vector bundles with spherical symmetry.
problem Investigate biharmonic functions on vector bundles with spherically symmetric metrics.
method Analyze vertical lifts and radial functions of functions on vector bundle manifolds.
result Construct an infinite two-parameter family of proper biharmonic functions.
The paper connects convex functions to p-subharmonic functions and proves their equivalence.
problem Understanding the relationship between convex functions and p-subharmonic functions.
method Average principle, variational methods, and PDE techniques.
result Convex functions on R^n are p-subharmonic for every p > 1.
A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.
problem Nonlinear functional regression in infinite-dimensional functional data analysis.
method Functional deep neural network with adaptive kernel embedding and projection steps.
result Explicit rates of approximating nonlinear smooth functionals are derived, and the network is shown to be effective in both simulated and real datasets.