Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

5.2%10.4%15.6%20.8% · May 202619922001200920182026
48 results for readmission prediction

Categorical Co-Frequency Analysis clusters diagnoses to predict hospital readmissions.

problem Predicting patients' risk of 30-day hospital readmission.
method Categorical Co-Frequency Analysis (CoFA) measures diagnosis similarity using random forests.
result Identified three groups of diagnoses with varying readmission risk.

Neural networks outperform logistic regression for predicting HF readmission.

problem Predicting 30-day all-cause readmission in heart failure patients.
method Used a large administrative claims dataset to compare neural network models (RNNCRF) with logistic regression models (LASSO) for predicting readmission.
result RNNCRF model achieved best performance with 0.642 AUC, while logistic regression with LASSO had equal performance.

We develop a model using deep learning techniques and natural language processing on unstructured text from medical records to predict hospital-wide 3030-day unplanned readmission, with c-statistic .70.70. Our model is constructed to allow physicians to interpret the significant features for prediction.

2017-11-29abs ↗pdf ↗

Natural language processing predicts ICU readmissions with 74.8% accuracy.

problem Early detection of ICU readmissions to improve patient outcomes and reduce costs.
method Natural language processing of discharge summaries, machine learning classifiers, UMLS standardization.
result Best configuration achieved an AUC of 0.748 for predicting ICU readmissions.

Deep learning models predict ICU readmission with varying accuracy.

problem Predicting ICU readmission risk using deep learning architectures.
method Several deep learning architectures including attention-based models, recurrent layers, neural ODEs, and embeddings were trained on MIMIC-III data.
result Attention-based models with neural ODEs achieved highest predictive accuracy.

Paper presents an ensemble model for predicting readmission using clinical notes.

problem Limited use of clinical notes in predicting readmission due to their unstructured nature.
method Ensemble model combining vector space modeling and topic modeling.
result Improves readmission prediction by 0.0211 in c-statistics.

The paper improves SVM for predicting hospital readmissions by clustering patients and personalizing recommendations.

problem Predicting and preventing hospital readmissions.
method Cluster-dependent SVM with personalized prescriptions.
result Personalized recommendations reduce hospital readmissions.

Improved model predicts ICU readmission and mortality with interpretable results.

problem Lack of clinically interpretable predictions from deep learning models on clinical notes.
method Augmented a convolutional model with an attention mechanism for clinical note prediction.
result Attention mechanism improves prediction performance while providing interpretable results.

Model predicts wound and episode-level readmission risk and time to re-admit.

problem Identify patients at high risk of re-admission to prevent wound recurrences and reduce healthcare costs.
method Data-driven analysis of wound care and episode-level patient data.
result Model achieves high recall and precision for predicting re-admission risk and time.

Paper compares methods for predicting early readmission in sickle-cell disease.

problem Comparing methods for early readmission prediction in a high-dimensional, heterogeneous covariates and time-to-event outcome framework.
method 8 statistical methods are compared: logistic regression, SVM, RF, GB, NN, Cox PH, CURE, C-mix models, using Elastic-Net regularization.
result C-mix model yields the best performance in both binary and survival settings.

Proposes inference for DNNs in GNRMs, addressing non-independence issues.

problem Inference for DNN-estimated means in GNRMs under non-independence.
method Develops a DNN estimator and ESM for variance estimation and confidence intervals.
result Demonstrates feasibility of inference under GNRMs with ESM.

Feature engineering remains a major bottleneck when creating predictive systems from electronic medical records. At present, an important missing element is detecting predictive regular clinical motifs from irregular episodic records. We present Deepr (short for Deep record), a new end-to-end deep learning system that …

2016-07-26abs ↗pdf ↗

This research tackles monitoring machine learning algorithms post-deployment, addressing performativity issues.

problem Monitoring machine learning algorithms after deployment, especially when they affect their own data-generating process.
method Uses causal inference techniques to navigate performativity and compares different monitoring criteria and data sources.
result Different monitoring systems have varying operating characteristics and implications for ML monitoring design.

New method reduces variance in subpopulation model performance estimates.

problem High variance in subpopulation performance metrics for small groups.
method Using an evaluation model to form model-based metric (MBM) estimates.
result MBMs produce more accurate and lower variance estimates for small subpopulations.

Study evaluates approaches to improve worst-case model performance across patient subpopulations.

problem Improving model accuracy for specific patient subpopulations.
method Comparison of distributionally robust optimization (DRO) and standard learning procedures.
result Standard learning procedures generally outperform DRO approaches for improving model performance across subpopulations.

MetaPred uses meta-learning to improve clinical risk prediction from limited EHR data.

problem Clinical risk prediction from sparse patient EHR data.
method Meta-learning approach to train a meta-learner from related tasks, then fine-tune for target risk prediction.
result MetaPred achieves better performance for target risk prediction with limited data.

Unsupervised learning summarizes EHR data into a patient status vector.

problem Challenges in modeling electronic health records due to irregularities and varying procedures/diagnoses.
method Two-step unsupervised representation learning scheme using auto-encoders and forecasting tasks.
result Improved generalization performance on mortality and readmission tasks.

Improved AI lung ultrasound segmentation using expert confidence values.

problem Label uncertainty in lung ultrasound due to subjective interpretation by radiologists.
method Designing a data annotation protocol capturing expert confidence, training AI on binarized labels with confidence thresholds.
result Improved AI segmentation and better clinical outcomes (e.g., S/F oxygenation ratio estimation, patient readmission prediction).

New scalable method balances hospital profit status and heart attack outcomes.

problem Balancing covariate distributions and minimizing weight dispersion in large datasets.
method Combines kernel basis expansion and convex optimization for efficient and flexible weighting.
result For-profit hospitals use interventional cardiology similarly to other hospitals but have higher mortality and readmission rates.

Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.

problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.

Paper defines predictive multiplicity and measures its severity in classification problems.

problem Challenges in machine learning due to competing models with conflicting predictions.
method Formal measures and integer programming tools for linear classification problems.
result Real-world datasets may admit competing models with wildly conflicting predictions.

A novel continual prediction model outperforms traditional one-time models in predicting AKI.

problem Optimally predicting AKI before it develops during a hospital stay.
method A novel continual prediction model that predicts AKI every time a patient's AKI-relevant variable changes in the EHR.
result The continual prediction model outperformed traditional one-time models, achieving a higher AUC of 0.724 compared to 0.653.

This paper re-examines conformal e-prediction and its advantages over conformal prediction.

problem The relationship between conformal prediction and conformal e-prediction.
method Systematic re-examination of conformal prediction and conformal e-prediction from a modern perspective.
result Conformal e-prediction has advantages such as ease of designing conditional predictors and guaranteed validity of cross-predictors.

Self-calibrating conformal prediction improves interval efficiency and offers a practical alternative.

problem Improving the reliability and uncertainty quantification of machine learning predictions.
method Combines Venn-Abers calibration and conformal prediction for binary and regression problems.
result Improves interval efficiency through model calibration and offers practical alternatives.

Study uses deep learning to predict asset prices, finds complex target processes lead to meaningless predictions.

problem Complexity of successful price prediction models hinders understanding.
method Deep learning models for high-frequency price prediction, focusing on volatility and directional prediction.
result Inadequately defined target price process renders predictions meaningless.

The paper emphasizes the importance of joint predictions over marginal predictions for decision-making.

problem The need for accurate joint predictions in decision-making problems.
method The paper analyzes combinatorial decision problems, sequential predictions, and multi-armed bandits, introducing an approximate Thompson sampling algorithm and new regret bounds.
result Accurate joint predictions are essential for good performance in decision-making problems.

Behavior modification improves prediction accuracy by nudging user behavior.

problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.

Proposes feature conformal prediction for broader application in semantic feature spaces.

problem Establishing valid prediction intervals in semantic feature spaces.
method Extends conformal prediction to semantic feature spaces using deep representation learning.
result Feature conformal prediction outperforms regular conformal prediction under mild assumptions.

AutoCP automates the construction of accurate prediction intervals.

problem Creating valid and accurate prediction intervals for machine learning models.
method AutoML framework that optimizes prediction interval length for better accuracy and less conservatism.
result AutoCP significantly outperforms benchmark algorithms in constructing accurate prediction intervals.

Proposes a method to apply conformal prediction to probabilistic time series forecasting models.

problem Obtaining accurate prediction regions for multi-step time series forecasting with probabilistic models.
method Conformalises conditional normalising flows to generate potentially disjoint prediction regions.
result Improves predictive efficiency in time series forecasting with multimodal distributions.

ICP improves prediction intervals for continuous outcomes at lower computational cost.

problem Systematic bias in point predictions that undermines their use in decision-making.
method Develops Isotonic Conformal Prediction (ICP) framework to decouple calibration from prediction-set construction.
result SICP and TICP procedures match SC-CP coverage at lower computational cost.

Optimizes predictions for specific tasks using parametrized decision analysis.

problem Optimizing predictions for specific decision tasks of interest.
method Designs a class of parametrized actions for Bayesian decision analysis.
result Derives efficient and interpretable solutions for various action parametrizations and loss functions.

New measures for prediction validity and consonant plausibility introduced.

problem Challenges in predicting future observations and quantifying prediction uncertainty.
method Introducing Type-2 validity and using consonant plausibility measures and conformal prediction.
result Achieving both Type-1 and Type-2 validity through consonant plausibility measures and conformal prediction.

RFpredInterval package builds prediction intervals for random forests and boosted forests.

problem Quantifying uncertainty in random forest and boosted forest point predictions.
method 16 methods to build prediction intervals with random forests and boosted forests.
result The proposed method outperforms existing methods in building prediction intervals.

FPPI selectively uses predictions to improve inference efficiency.

problem Improving statistical inference with limited labeled data and heterogeneous prediction quality.
method Filtered Prediction-Powered Inference (FPPI) framework.
result FPPI achieves strictly improved asymptotic efficiency compared to existing methods.