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,738 papers · 148 categories

Trend · papers per month

591418 · Feb 202019922001200920172026
48 results for non-adaptive trial

New study shows non-adaptive trials can be outperformed by adaptive designs in treatment selection.

problem Determining the best allocation of resources in clinical trials.
method Analysis of batched arm elimination designs and comparison with completely randomized trials.
result Simple adaptive designs universally and strictly dominate non-adaptive completely randomized trials for at least three treatment arms.

New protocols show 1-bit mean estimation can be order-optimal without interaction.

problem Can 1-bit mean estimation be optimal without interaction?
method Adaptive and non-adaptive threshold and interval queries, with one adaptive transition.
result Arbitrary non-adaptive quantizers can match the adaptive rate, suggesting interaction is not necessary.

Study shows rates for Laplacian-eigenmap methods in nonparametric regression.

problem Minimizing error in nonparametric regression using Laplacian-eigenmap.
method Adaptive and non-adaptive minimax rates using Sobolev space constraints.
result Extends minimax rates to various weighted Laplacian matrices.

Reward-poisoning attacks can force RL agents to learn bad policies, and we categorize and quantify their feasibility.

problem Reward-poisoning attacks can manipulate RL agents to learn undesirable policies.
method Categorize attacks by infinity-norm constraint, provide thresholds for feasibility, and develop adaptive attack strategies.
result Adaptive reward-poisoning attacks can achieve the nefarious policy in polynomial steps, while non-adaptive attacks require exponential steps.

In practice, the data distribution at test time often differs, to a smaller or larger extent, from that of the original training data. Consequentially, the so-called source classifier, trained on the available labelled data, deteriorates on the test, or target, data. Domain adaptive classifiers aim to combat this probl…

2018-06-21abs ↗pdf ↗

New algorithm reduces interventional strategy complexity for causal graph discovery.

problem Designing efficient interventional strategies for causal graph discovery.
method Developed an r-adaptive algorithm for causal graph discovery that minimizes the number of interventions.
result Achieved an approximation of O(min{r, log n} * n^{1/min{r, log n}}) for the verification number.

New algorithm solves stochastic optimization problems with unknown gradients.

problem Solving nonlinear optimization problems with stochastic objectives and deterministic constraints.
method Adaptive SQP with differentiable exact augmented Lagrangian and stochastic line search.
result Global convergence established for both non-adaptive and adaptive SQP methods.

MILCCI integrates labels across categories for better understanding of multi-trial data.

problem Understanding how labels encode multi-trial observations and disentangling their effects.
method Sparse per-trial decomposition leveraging label similarities within each category.
result MILCCI identifies interpretable components and integrates label information.

The paper compares methods for estimating heterogeneous treatment effects using multiple randomized trials.

problem Estimating heterogeneous treatment effects reliably and precisely with a single dataset is challenging.
method Non-parametric approaches for estimating heterogeneous treatment effects using data from multiple trials.
result Methods that directly allow for heterogeneity of the treatment effect across trials perform better than those that do not.

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.

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 ↗

QR-learner estimates individual treatment effects using external data.

problem Limited power to detect individual treatment effects in randomized trials.
method Model-agnostic learner that estimates conditional average treatment effects (CATE) using external data.
result QR-learner reduces mean squared error and can recover true CATE.

Bayesian BIC for multi-trial data improves VAR model order selection.

problem Optimal VAR model order selection for multi-trial event-based data.
method Derive and apply Bayesian Information Criterion (BIC) for multi-trial ensemble data.
result Multi-trial BIC successfully recovers real model order and estimates small model order.

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.

Clinical trials in the medical domain are constrained by budgets. The number of patients that can be recruited is therefore limited. When a patient population is heterogeneous, this creates difficulties in learning subgroup specific responses to a particular drug and especially for a variety of dosages. In addition, pa…

2020-01-08abs ↗pdf ↗

Adaptive data analysis is frequently criticized for its pessimistic generalization guarantees. The source of these pessimistic bounds is a model that permits arbitrary, possibly adversarial analysts that optimally use information to bias results. While being a central issue in the field, still lacking are notions of na…

2019-01-30abs ↗pdf ↗

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.

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.

We show that for the problem of testing if a matrix AFn×nA \in F^{n \times n} has rank at most dd, or requires changing an εε-fraction of entries to have rank at most dd, there is a non-adaptive query algorithm making O~(d2/ε)\widetilde{O}(d^2/ε) queries. Our algorithm works for any field FF. This improves upon the previous…

2018-10-18abs ↗pdf ↗

Adaptive networks improve model robustness through conditional normalization.

problem Limited robustness of adversarial-trained networks due to network capacity and training samples.
method Proposes a conditional normalization module to adapt networks during adversarial training.
result Adaptive networks outperform both clean validation accuracy and robustness compared to non-adaptive counterparts.

Machine learning improves trial analysis precision by adjusting for prognostic variables.

problem Improving precision in randomized trial analyses using covariate adjustment.
method Targeted machine learning estimation (TMLE) with adaptive pre-specification.
result Maximized empirical efficiency through cross-validated variance minimization.

In domain adaptation, classifiers with information from a source domain adapt to generalize to a target domain. However, an adaptive classifier can perform worse than a non-adaptive classifier due to invalid assumptions, increased sensitivity to estimation errors or model misspecification. Our goal is to develop a doma…

2017-06-25abs ↗pdf ↗

New methods improve causal inference generalization using trial and observational data.

problem Limited trial data makes generalizing causal inferences to target populations statistically infeasible.
method Develops algorithms that combine trial and observational data to estimate complex nuisance functions.
result Improves generalization of causal inferences when the additional observational study is high-quality.

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.

New algorithm improves source separation with multi-trial supervision.

problem Non-convex optimization and interpretability of independent components.
method Proximal gradient-type algorithm in invertible matrices with backpropagation for joint learning.
result Increased success rate of non-convex optimization and improved interpretability.

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.

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.

Automated machine learning aims to automate the whole process of machine learning, including model configuration. In this paper, we focus on automated hyperparameter optimization (HPO) based on sequential model-based optimization (SMBO). Though conventional SMBO algorithms work well when abundant HPO trials are availab…

2019-09-07abs ↗pdf ↗

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 ↗

Causal ML methods failed to validate their personalized treatment effects in two large trials.

problem Validating causal machine learning methods for personalized treatment effects in precision medicine.
method Assessed 17 mainstream causal heterogeneity ML methods using two large randomized controlled trials.
result None of the ML methods reliably validated their performance, internal or external, showing significant discrepancies between training and test data.