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.
Paper proposes a machine learning method to predict sale efficacy.
problem Determining the efficacy of online sales from discounts alone.
method Machine learning-based heuristic using Support Vector Machine.
result Predicts sale efficacy with 91.11% accuracy.
Unified framework for optimizing treatment quantiles considering risk and efficacy.
problem Maximizing treatment outcomes while controlling risk in sequential clinical decisions.
method Risk-Aware Quantile Dynamic Treatment Regimes (RQDTR) framework that optimizes a prespecified quantile of the cumulative potential outcome while incorporating treatment-related risk.
result Improves tail-oriented efficacy and achieves more favorable benefit-risk trade-offs compared to existing methods.
Daydream predicts DNN optimization efficacy efficiently.
problem Inefficiency and error in evaluating DNN optimizations.
method Models DNN execution with a dependency graph, predicts runtime based on simulation.
result Accurately predicts performance improvements from DNN optimizations.
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.
New defence against data-poisoning attacks in neural networks.
problem Data-poisoning attacks can evade existing defences and increase model efficacy.
method Proved geometric mechanism and identified near clone regime in input space.
result Regularisation and data augmentation reduce data fitting capacity and prevent poisoning.
RL tackles decision making in unknown environments, focusing on efficiency and efficacy.
problem Efficiency and efficacy in RL algorithms for sample-starved situations.
method Markov Decision Processes, model-based and value-based approaches, policy optimization.
result Enhanced understanding and improvements in sample and computational efficacies of RL algorithms.
This study quantifies uncertainty in comparing treatments using RCTs with before-and-after measures.
problem Uncertainty in comparing treatments using RCTs with before-and-after measures.
method New statistical modeling principle called ETZ enables counterfactual uncertainty quantification (CUQ) in RCTs with Before-and-After Repeated Measures.
result CUQ typically has lower variability than factual uncertainty quantification and can be achieved in RCTs.
Proposes a new interpretation of separable convolutions.
problem Lack of a thorough explanation for the efficacy of separable convolutions.
method Hybrid interpretation combining depthwise and pointwise convolutions.
result Proposes a new model for understanding separable convolutions.
Kalman Filters are one of the most influential models of time-varying phenomena. They admit an intuitive probabilistic interpretation, have a simple functional form, and enjoy widespread adoption in a variety of disciplines. Motivated by recent variational methods for learning deep generative models, we introduce a uni…
Synapse arbitrates TSFMs to improve time series forecasting performance.
problem TSFMs vary in performance across different forecasting tasks, domains, and horizons.
method Synapse dynamically assigns and adjusts predictive weights based on TSFM performance.
result Synapse consistently outperforms other ensembling techniques and individual TSFMs.
Proposes a new method to enhance neural learning by maximizing information gain.
problem Improving neural learning by selecting key variables to maximize information gain.
method Adaptive Ensemble Kalman Filter to quantify uncertainty and maximize information gain.
result The proposed method enables the neural network to learn more effectively from stochastic systems.
CoNCRA uses CNN to find code snippets matching developer intent.
problem Finding relevant code snippets using general search engines.
method Convolutional Neural Network approach to code retrieval.
result Improved code retrieval by 5% on average, top 3 positions 80% of the time.
We use twisted Alexander polynomials to show that certain algebraically slice 2-bridge knots are not topologically slice, even though all prime power Casson-Gordon signatures vanish. We also provide some computations indicating the efficacy of Casson-Gordon signatures in obstructing the smooth sliceness of 2-bridge kno…
The paper proposes a method to identify subgroups with different treatment effects in time-to-event data.
problem Identifying subgroups with differential treatment effects in time-to-event data.
method A mixture model with structured sparsity regularization and novel inference procedure.
result The method effectively recovers sparse phenotypes across real-world clinical studies.
Investigates the number of experiments needed for statistical significance in medication testing.
problem Determining the number of experiments needed for a statistically significant result.
method Examines binomial and general probability distributions, considering placebo efficacy and varying distributions.
result The number of experiments needed can be significantly higher when placebo efficacy is considered.
SliceOut speeds up deep learning training without sacrificing accuracy.
problem Frequent model re-training and large model training workloads in deep learning.
method SliceOut uses dropout-inspired scheme to drop contiguous sets of units at random, leveraging GPU memory layout.
result 10-40% speedups and memory reduction with minimal accuracy loss.
Robots rely on sensors to provide them with information about their surroundings. However, high-quality sensors can be extremely expensive and cost-prohibitive. Thus many robotic systems must make due with lower-quality sensors. Here we demonstrate via a case study how modeling a sensor can improve its efficacy when em…
New dataset tests mental rotation from single images, improving model understanding of 3D scenes.
problem Understanding how a scene looks from a different viewpoint using a single image.
method Created CLEVR-MRT dataset, explored neural architectures for volumetric scene representations.
result Demonstrated the effectiveness of volumetric representations in answering mental rotation questions.
Softmax is found ineffective for NL block, leading to improved performance.
problem Inefficiency of softmax in NL block for global context modeling.
method Empirical analysis and replacement of softmax with scaling factor.
result Improved performance on various datasets with reduced computational cost.
DeepONet accelerates reliability analysis of stochastic nonlinear systems.
problem Time-dependent reliability analysis of systems with stochastic forcing.
method DeepONet, a novel operator network, learns function-to-function mappings.
result DeepONet efficiently and accurately predicts system responses.
BB-FDR boosts power and controls FDR in multi-experiment studies.
problem Analyzing large-scale, multi-experiment studies for statistical significance.
method Empirical-Bayes method using deep neural networks and black box models.
result BB-FDR outperforms competing methods in discovering significant outcomes and selecting key variables.
This paper develops explainable treatment policies for RPM using clinical knowledge.
problem Barriers to adoption of DHIs and lack of interpretability in purely black-box algorithms.
method Developed a pipeline for learning explainable treatment policies using clinician-informed representations.
result Policies learned from clinician-informed representations are more efficacious and efficient than black-box policies.
Study shows DL models trained on healthy subjects perform worse on patients' ECG data.
problem Inefficiency of DL models on heterogeneous datasets for heart beat detection.
method Investigated and evaluated the use of Transfer Learning to adapt DL models to different datasets.
result Transfer Learning improves classification performance on small sample size datasets.
Measures strategy durability through minimum regime performance, revealing trade-offs between efficiency and resilience.
problem Systematic investing strategies are vulnerable to regime changes, affecting their effectiveness and performance.
method Introduces minimum regime performance (MRP) to quantify the durability of systematic strategies, capturing how performance deteriorates under changing market conditions.
result Higher long-term Sharpe ratios do not always correlate with higher MRP, highlighting a new dimension of portfolio fragility.
Develops a machine learning framework for computing most probable paths in stochastic systems.
problem Computing the most probable paths in stochastic dynamical systems.
method Reformulates the boundary value problem of Hamiltonian systems and uses a neural network to solve the Euler-Lagrange equation for the Onsager-Machlup action functional.
result Demonstrates the efficacy and accuracy of the machine learning approach in computing most probable paths for stochastic systems with various types of noise.
The paper introduces sanity tests to detect spurious correlations in AI-guided radiology systems.
problem Detecting when AI systems perform well on development data for the wrong reasons.
method Design and implementation of sanity tests to identify spurious correlations.
result Sanity tests can identify spurious correlations in AI-guided radiology systems.
Paper simplifies concentration inequalities for easier probabilistic analysis.
problem Complexity in probabilistic analysis of random variables.
method Compact notations for concentration inequalities.
result Simplified expressions for typical sizes and tails of random variables.
In this paper we look at the efficacy of different risk measures on energy markets and across several different stock market indices. We use both the Value at Risk and the Tail Conditional Expectation on each of these data sets. We also consider several different durations and levels for historical risk measures. Throu…
This research evaluates and introduces new heuristics for clustering Bitcoin blockchain entities.
problem Efficiently analyzing the vast number of Bitcoin blockchain entities.
method Examined and introduced four new heuristics for clustering Bitcoin blockchain entities.
result Introduced clustering ratio to measure heuristic effectiveness.
DNN policies improve stochastic AC OPF for power grid optimization.
problem Optimizing power grid operations under uncertainty.
method Deep neural network (DNN) policies for real-time generator dispatch decisions.
result DNN policies enforce feasibility constraints and produce near optimal solutions.
Deep neural networks help recover two signals from noisy mixtures.
problem Recovering two signals from noisy subgaussian mixtures with prior structural information.
method Used deep generative neural networks (GNNs) to solve the demixing problem for Lipschitz signals.
result Proved a sample complexity bound for nearly optimal recovery error, extending previous results.
MU-SVM improves multiclass classification accuracy.
problem Multiclass classification problems.
method Proposes MU-SVM for multiclass learning and an analytic span bound for model selection.
result Achieves > 20% improvement in test accuracies compared to multi-class SVM.
Neyman's framework evaluates personalized treatment rules using experiments.
problem Evaluating the efficacy of individualized treatment rules derived by machine learning.
method Neyman's repeated sampling framework applied to cross-fitted ITRs.
result Ex-post evaluation of ITRs can be more efficient than random assignment.
New method interprets neural agent's actions to prevent unwanted outcomes.
problem Blackbox issue in RL where agents learn without foreseeing all outcomes.
method Action-conditional β-VAE for disentangled representation learning.
result Interpretable latent features enable modeling entire state space.
We introduce a new methodology for forecasting which we call Signal Diffusion Mapping. Our approach accommodates features of real world financial data which have been ignored historically in existing forecasting methodologies. Our method builds upon well-established and accepted methods from other areas of statistical …
We use path integrals to calculate hedge parameters and efficacy of hedging in a quantum field theory generalization of the Heath, Jarrow and Morton (HJM) term structure model which parsimoniously describes the evolution of imperfectly correlated forward rates. We also calculate, within the model specification, the eff…
CoPhy-PGNN tackles competing PG losses in neural networks for solving eigenvalue problems.
problem Solving eigenvalue problems with competing physics-guided loss functions.
method Learning generalizable solutions using a novel approach to handle competing PG losses.
result Demonstrates the effectiveness of the approach in quantum mechanics and electromagnetic propagation.
Distillation (Hinton et al., 2015) and privileged information (Vapnik & Izmailov, 2015) are two techniques that enable machines to learn from other machines. This paper unifies these two techniques into generalized distillation, a framework to learn from multiple machines and data representations. We provide theoretica…
Hidden stratification causes machine learning models to fail on rare but important patient subgroups.
problem Machine learning models fail on rare patient subgroups not identified during training or testing.
method Assessed techniques for measuring and describing hidden stratification effects on multiple medical imaging datasets.
result Evidence of hidden stratification leading to over 20% performance differences on clinically important subsets.
Bayesian method classifies shapes in 2D and 3D.
problem Shape classification in 2D and 3D.
method Bayesian framework for modeling and classification.
result Efficiency and efficacy evaluated on Kimia database.
We introduce a new class of nonstationary kernels, which we derive as covariance functions of a novel family of stochastic processes we refer to as string Gaussian processes (string GPs). We construct string GPs to allow for multiple types of local patterns in the data, while ensuring a mild global regularity condition…
New algorithms for batch decision-making with high-dimensional user data.
problem Maximizing treatment efficacy in groups of users.
method Teamwork LASSO Bandit algorithm, switching between teamwork and selfish stages.
result Upper bound on expected cumulative regret for the proposed algorithm.
Study uses EDA data to monitor sleep, finds EDA Magnitude predicts SE changes.
problem Detecting small changes in sleep quality using EDA data.
method Factor analysis, causal model search, structural equation modeling, logistic regression, naive Bayes.
result EDA Magnitude is a strong predictor of self-reported sleep efficiency.
Publish a core-set of data to protect against adversarial use.
problem Protecting datasets from adversarial use.
method Construct a fair core-set for linear and neural models.
result Core-sets improve primary task performance while hindering unwanted tasks.
New learning process for neural classifiers simplifies decision weights.
problem Training decision layer weights in neural classifiers.
method Choosing appropriate loss functions and solving constrained optimization problems.
result A new learning process for pre-decision weights that is simple and effective.
Automated market-making for CBDCs and stable coins on blockchain.
problem Creating fair exchange rates for digital assets on blockchain.
method Developed an innovative approach for generating fair exchange rates.
result Illustrated the approach's efficacy on G-10 currency exchange rates.
Fine-tuned open-source LLMs match or exceed closed-source models in social science research.
problem Limited scalability and high costs of large LLMs in social science research.
method Fine-tuning open-source models for specific tasks, exploring training set size effects, proposing hybrid workflow.
result Small, fine-tuned open-source LLMs achieve equal or superior performance to commercial alternatives.