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.

168,742 papers · 148 categories

Trend · papers per month

132265397529 · Jun 202019922001200920172026
48 results for clinical trial predictions

TrialGraph uses graph machine learning to improve clinical trial design and predict side effects.

problem Complexity and cost in clinical trials hinder drug development.
method Curated clinical trial data set converted to graph-structured formats, applied graph machine learning algorithms.
result MetaPath2Vec algorithm performed exceptionally well, improving prediction accuracy.

Predicts stock price changes based on clinical trial announcements.

problem Forecasting the impact of clinical trial results on pharma stock prices.
method BERT for sentiment analysis, Temporal Fusion Transformer for forecasting, graph convolution network for event relationships, gradient boosting for price change prediction.
result Identifies two crucial factors: drug portfolio size and network effect of related events.

New method detects biomarker-treatment interactions in clinical trials.

problem Detecting interactions between high-dimensional biomarkers and treatments in randomized trials.
method Two-stage penalized regression screening using ridge regression for multivariate screening.
result Ridge regression screening provides greater power than traditional methods in correlated data.

C3T-Budget optimizes drug efficacy in dose-finding trials with budget and safety constraints.

problem Heterogeneous patient populations and budget constraints make dose-finding clinical trials challenging.
method Contextual constrained clinical trial algorithm that maximizes drug efficacy while learning subgroup responses.
result Demonstrates efficient budget usage and balanced learning-treatment trade-off in simulated trials.

FRESH combines patient-level and aggregate-level data for better clinical decision making.

problem Combining patient-level and aggregate-level data for clinical decision making.
method FRESH method that re-calibrates a patient-level model to match specified aggregate statistics.
result Unified data-efficient model for clinical decision making.

The paper explores using historical data to improve clinical trial analysis by optimizing covariate weights.

problem Limited covariates in small clinical trials reduce the effectiveness of analysis.
method Leverage historical data to pre-specify covariate weights as a composite covariate.
result A composite covariate improves the cost/benefit ratio and reduces overfitting in small clinical trials.

Improves trial efficiency by adjusting for historical prognostic scores.

problem Reducing statistical uncertainty in randomized trial estimates.
method Linear covariate adjustment using a prognostic model trained on historical data.
result Prognostic covariate adjustment achieves minimum variance and reduces mean-squared error.

SEEDA optimizes dose allocation in clinical trials to balance efficacy and safety.

problem Complex relationships between efficacy and toxicity in new drug trials.
method Adaptive clinical trial methodology that maximizes cumulative efficacy while ensuring safety constraints.
result SEEDA outperforms existing methods in finding optimal doses with higher success rates and fewer patients.

Study develops a new algorithm for assessing clinical trial abstracts.

problem Limited tools for assessing qualitative statements in clinical research.
method Developed a three-class sentiment classification algorithm using BERT model.
result Algorithm achieved 91.3% classification accuracy and 0.92 macro F1-Score.

A novel dose-finding design for cancer clinical trials using level set estimation.

problem Finding the maximum tolerated dose (MTD) in phase I cancer clinical trials.
method Proposes a novel dose-finding design based on level set estimation (LSE) to determine the next dose.
result The proposed LSE design achieves higher accuracy in estimating the MTD and lower risk of overdosing compared to existing designs.

Discusses handling intercurrent events in clinical trials with time-to-event outcomes.

problem Handling intercurrent events in clinical trials with time-to-event outcomes.
method Defines estimands and six ICE handling strategies, including new competing-risk strategy.
result Novel methods for handling intercurrent events in clinical trials with time-to-event outcomes.

The personalization of treatment via bio-markers and other risk categories has drawn increasing interest among clinical scientists. Personalized treatment strategies can be learned using data from clinical trials, but such trials are very costly to run. This paper explores the use of active learning techniques to desig…

2012-02-14abs ↗pdf ↗

Optimum in Convex Hulls (OCH) generalizes clinical trial results to broader populations.

problem Clinical trials exclude confounding but limit recruitment; observational data are more inclusive but suffer from confounding.
method OCH uses convex hulls of conditional expectations or densities to approximate the true treatment effect from both observational and trial data.
result OCH estimates the treatment effect with state-of-the-art accuracy in terms of both expectations and densities.

Detection of interactions between treatment effects and patient descriptors in clinical trials is critical for optimizing the drug development process. The increasing volume of data accumulated in clinical trials provides a unique opportunity to discover new biomarkers and further the goal of personalized medicine, but…

2017-12-21abs ↗pdf ↗

Study adaptive clinical trial methods for identifying patient subpopulations with treatment benefit.

problem Adaptive identification of patient subpopulations with treatment benefit in clinical trials.
method Proposes AdaGGI and AdaGCPI meta-algorithms for subpopulation construction.
result Empirical investigation of AdaGGI and AdaGCPI performance across various simulation scenarios.

G-computation improves clinical trial power with machine learning.

problem Balancing prognostic factors in randomized trials to prevent near-confounders.
method G-computation with penalized models (Lasso, Elasticnet) and algorithm-based methods (neural network, SVM, super learner).
result G-computation with Elasticnet and splines reduces variance and increases power in RCTs.

DWTS uses observational data to improve clinical trial efficiency.

problem Lack of definitive conclusions from randomized clinical trials due to insufficient patient cohorts and confounding biases.
method DWTS combines observational data with randomized clinical trials using Doubly Debiased LASSO (DDL) to identify reliable covariates.
result DWTS reduces cumulative regret in clinical trials compared to standard methods.

Generative AI models improve clinical trial data by generating survival outcomes.

problem Generating valid survival outcomes for clinical trials with synthetic data.
method A variational autoencoder (VAE) that jointly generates mixed-type covariates and survival outcomes.
result The method outperforms GAN baselines on fidelity, utility, and privacy metrics.

New method targets relative risk heterogeneity in clinical trials.

problem Identifying treatment effects across subgroups with absolute risk differences.
method Modified causal forests using a novel node-splitting procedure based on relative risk.
result Relative risk causal forests can capture heterogeneity not detected by absolute risk methods.

Proposes a new Q-learning method for survival outcomes in clinical trials.

problem Incomplete follow-up data and nonlinear covariate effects in clinical trials.
method Combines Buckley-James boosting with flexible base learners for estimating optimal treatment regimes.
result Improves treatment decision accuracy and stability in longitudinal clinical trials.

Proposes a two-stage method for estimating heterogeneous treatment effects using gradient boosting trees.

problem Estimating heterogeneous treatment effects in randomized clinical trials with high-dimensional predictive markers.
method Two-stage statistical learning procedure using gradient boosting trees (XGBoost) to estimate main effects and HTE.
result Improves efficiency in estimating heterogeneous treatment effects through nonparametric function estimation.

Develops a TL framework for estimating RMST difference in clinical trials.

problem Estimating RMST difference in clinical trials with time-to-event outcomes.
method Targeted learning (TL) framework using pseudo-observations and copy reference (CR) approach for sensitivity analysis.
result Demonstrated the effectiveness of the TL framework using real data.

CRBM generates digital twins for MS patients, aiding in disease progression analysis.

problem Characterizing and analyzing disease progression in MS patients.
method Unsupervised machine learning with Conditional Restricted Boltzmann Machines (CRBMs).
result Generated digital twins are statistically indistinguishable from actual subjects.

Proposes dynamic borrowing method for historical data in clinical trials.

problem Insufficient statistical power in rare and pediatric disease clinical trials.
method Dynamic borrowing method based on frequentist approach using similarity measures.
result Demonstrates usefulness of dynamic borrowing in reanalyzing clinical trial data.

Study uses machine learning to optimize antibiotic therapy for MRSA skin infections.

problem Optimizing antibiotic choice for MRSA skin infections due to reduced treatment options and side effects.
method Propensity score matching, machine learning models (SVM, RF, LASSO), counterfactual analysis.
result RF model shows stronger treatment heterogeneity and potential for therapy change.

Digital twins improve single-arm trials by providing robust treatment effect estimates.

problem Lack of control arms in single-arm trials limits their gold-standard evidence.
method Outcome-model-based synthetic controls using machine learning models trained on historical data.
result Digital twins offer more robust treatment effect estimates and principled corrections.

Study compares Cox model and RSF for predicting patient survival, finding RSF superior in certain scenarios.

problem Comparing predictive accuracy of Cox proportional hazards model and Random Survival Forest for patient-specific survival probabilities.
method Conducted a comprehensive comparison study using simulation scenarios and real-world datasets.
result RSF outperforms Cox model in nonproportional hazards settings and with treatment-covariate interactions.

New approach combines semi-supervised learning and bandits for better predictions.

problem Online semi-supervised learning with bandit feedback for applications like clinical trials and ad recommendations.
method Adjusted Graph Convolutional Network (GCN) for contextual bandits, with semi-supervised missing rewards imputation.
result Developed multi-GCN embedded contextual bandit algorithms verified on real-world datasets.

Study uses ML to predict HL survival, outperforming CoxPH.

problem Improving survival prediction for HL patients.
method Compared multiple ML algorithms to CoxPH model.
result ML models outperform CoxPH in predicting HL survival.