AI-driven sales prioritization boosts renewal bookings by 8.08%.
problem Manual sales account prioritization is inefficient and under-invested.
method Developed an AI-based Account Prioritizer using machine learning and explanation algorithms.
result Generated a +8.08% increase in renewal bookings.
This paper proposes using neural network sentiment measures to prioritize test inputs.
problem High cost of obtaining test oracle data limits testing efficacy of neural networks.
method Proposes using confidence, uncertainty, and surprise measures to prioritize test inputs.
result Sentiment measures can effectively flag inputs revealing DNN weaknesses.
This paper proposes a technique to prioritize examples based on their noise sensitivity for generating adversarial examples.
problem Generating effective adversarial examples requires careful consideration of noise sensitivity.
method The paper introduces a noise-sensitivity-analysis-based test prioritization technique to identify examples sensitive to noise.
result The method effectively picks out examples by their noise sensitivity, improving the effectiveness of adversarial examples.
RATE metrics evaluate treatment prioritization rules, subsuming existing methods.
problem Comparing and testing the quality of treatment prioritization rules.
method Rank-weighted average treatment effect (RATE) metrics.
result RATE metrics enable asymptotically exact inference in various study settings.
Optimizes COVID-19 testing policy using a Multi-Armed Bandit approach.
problem Balancing discovery of positive cases with population surveillance.
method Risk scoring and random sampling based on Multi-Armed Bandit theory.
result Effective prioritization captures 65-92% of positive cases with varying testing capacity.
New framework tests AVs as a black box, prioritizing rare failure modes.
problem Lack of rigorous and scalable testing methods for AVs.
method Developed a simulation testing framework that learns to identify and rank failure scenarios via adaptive importance-sampling methods.
result First independent evaluation of a full-stack commercial AV system (Comma AI's OpenPilot).
Adaptive compute allocation improves model performance by prioritizing harder queries.
problem Inefficiency in allocating test-time compute uniformly across all queries.
method Formulated as a bandit learning problem, proposed adaptive algorithms that estimate query difficulty and allocate compute accordingly.
result Achieved up to 15.29% relative performance improvement on various benchmarks.
Unified framework improves gene prioritization in disease studies.
problem Identifying genes involved in diseases using heterogeneous biological data.
method Network propagation-based gene prioritization with integrated biological information.
result Significant improvements in prioritizing genes not identified by traditional methods.
A new method prioritizes and recycles experiences for better reinforcement learning.
problem Improving reinforcement learning efficiency by prioritizing and recycling experiences.
method Double-prioritized state-recycled (DPSR) experience replay.
result DPSR achieved state-of-the-art results in Atari games, outperforming original and prioritized methods.
The paper improves HER by prioritizing virtual goals and removing misleading samples.
problem Sparse reward functions in reinforcement learning.
method Prioritizing virtual goals based on instructiveness and removing misleading samples.
result Significant improvement in success rate and sample efficiency.
ReaPER improves learning efficiency by prioritizing reliable experiences.
problem Inefficient sampling of past experiences in reinforcement learning.
method Introducing a novel measure of reliability to prioritize experiences in PER.
result ReaPER outperforms PER in various environments, including Atari-10.
Active inference uses machine learning to prioritize data labeling for more efficient statistical inference.
problem Efficiently collecting data points for statistical inference with limited labels.
method A machine learning-assisted approach that identifies uncertain data points for labeling.
result Achieves the same level of accuracy with fewer samples, resulting in smaller confidence intervals and more powerful p-values.
Proposes a modified Morgan-Pitman test for evaluating variances in machine learning models.
problem Limited ability to account for sampling variability in model selection.
method Enhances the classic Morgan-Pitman test for robustness in non-linear models with heavy-tailed distributions or outliers.
result Demonstrates the test's effectiveness and practical utility in model evaluation and selection.
New tools for assessing and correcting bias in AI algorithms.
problem Fairness and bias in AI algorithms, especially when ground truth data is unavailable.
method Three tools: controlled fairness, retraining algorithms, and parameter adjustment algorithms.
result Effective in reducing bias and improving fairness in AI models.
A new method for prioritizing sequences in reinforcement learning improves learning efficiency.
problem Efficient learning in reinforcement learning algorithms.
method Prioritized Sequence Experience Replay (PSER) for prioritizing sequences of experience.
result PSER is guaranteed to converge faster than PER and substantially improves performance.
TCA algorithm saves up to 40% energy in IoT devices.
problem Energy consumption and user comfort trade-off in IoT devices.
method Incremental learning Temporal Clustering Algorithm (TCA) for IoT devices.
result Achieved up to 40% energy savings with high success rate.
Most exact methods for k-nearest neighbour search suffer from the curse of dimensionality; that is, their query times exhibit exponential dependence on either the ambient or the intrinsic dimensionality. Dynamic Continuous Indexing (DCI) offers a promising way of circumventing the curse and successfully reduces the dep…
RIF prioritizes predictive biomarkers for precision medicine.
problem Lack of tools to select and prioritize predictive biomarkers.
method Random Interaction Forest (RIF) method.
result RIF outperformed conventional methods in various simulation scenarios and clinical trials.
Elucidating the genetic basis of human diseases is a central goal of genetics and molecular biology. While traditional linkage analysis and modern high-throughput techniques often provide long lists of tens or hundreds of disease gene candidates, the identification of disease genes among the candidates remains time-con…
The paper optimizes A/B tests by balancing lift and cost in large-scale settings.
problem Balancing lift and cost in A/B tests for large-scale experimentation.
method Empirical Bayes approach using a greedy knapsack algorithm to rank experiments based on lift-to-cost ratio, incorporating local false discovery rate (lfdr).
result The proposed method maximizes expected profit while controlling false discovery rate, demonstrating superior performance in large-scale settings.
This project combines recent advances in experience replay techniques, namely, Combined Experience Replay (CER), Prioritized Experience Replay (PER), and Hindsight Experience Replay (HER). We show the results of combinations of these techniques with DDPG and DQN methods. CER always adds the most recent experience to th…
This study integrates spatial coordinates into pavement maintenance prioritization.
problem Limited consideration of spatial characteristics in pavement maintenance prioritization.
method Introduced a novel spatial clustering algorithm to combine projects within budget and spatial constraints.
result Minimizes crew routing and improves collaboration between maintenance teams.
This work improves MARL exploration efficiency using predictive guidance and prioritized experience replay.
problem Challenges in multi-agent reinforcement learning, especially in exploration efficiency and reward informativeness.
method A predictive network forecasts reward, guiding MARL to accelerate exploration. Improved prioritized experience replay utilizes TD error effectively.
result The proposed algorithm outperforms existing methods in cooperative multi-agent environments.
CDP improves RL performance and sample-efficiency by prioritizing rare goal states.
problem Learning from imbalanced data in RL.
method Curiosity-Driven Prioritization (CDP) framework.
result CDP improves both performance and sample-efficiency of RL agents.
In Hindsight Experience Replay (HER), a reinforcement learning agent is trained by treating whatever it has achieved as virtual goals. However, in previous work, the experience was replayed at random, without considering which episode might be the most valuable for learning. In this paper, we develop an energy-based fr…
A framework uses proxies to prioritize treatment without estimating causal effects.
problem Prioritizing treatment when causal effects are hard to estimate.
method Decision-focused framework identifying conditions for proxy usefulness.
result Proxies can recover correct effect ordering under specific conditions.
Framework detects out-of-distribution inputs in regression and survival analysis.
problem Limited OOD detection for regression and survival analysis.
method Model-aware and subspace-aware variable prioritization.
result Consistent improvements over existing methods in synthetic and real data.
New algorithm learns efficiently in multi-agent settings.
problem Efficient learning in multi-agent Markov decision processes.
method Cooperative Prioritized Sweeping: model-based reinforcement learning with sample efficiency.
result Outperforms state-of-the-art on SysAdmin and randomized environments.
A new approach to cost-sensitive multiclass classification prioritizes certain classes over others.
problem Cost-sensitive multiclass classification where some classes are more important than others.
method Apportioned margin framework that shifts the decision boundary to prioritize certain classes.
result The method improves the error rate for important classes while reducing overall error.
Bayesian method optimizes interventions for causal discovery.
problem Active interventions are needed for causal discovery when observational data is insufficient.
method Bayesian optimization-based approach using observational data and pre-experimental evaluation of interventions.
result Demonstrated effectiveness through various experiments.
LASLA improves multiple testing accuracy with network-structured data.
problem Efficiently incorporating complex side information into multiple testing.
method Locally adaptive structure learning algorithm (LASLA) integrating auxiliary information.
result LASLA asymptotically controls FDR and enhances power with side information.
New method targets vaccines for new variants using Thompson sampling.
problem Deciding how to prioritize vaccines for new variants with delayed feedback.
method Partial likelihood Thompson sampling, updating beliefs with partial likelihood.
result Method effectively prioritizes vaccines based on real-world data.
Introduces PIT-plot for prioritizing projects based on their impact.
problem Optimizing R&D investments in project portfolios.
method Develops a new tool (PIT-plot) focusing on project impact rather than project properties.
result Identifies projects with the largest impact for risk mitigation or value-adding.
The paper proposes a semi-parametric Bayesian network model using Gaussian Processes and Horseshoe priors.
problem Learning semi-parametric relationships in Expert Bayesian Networks with minimal nonlinear components.
method Uses Gaussian Processes and Horseshoe priors to model relationships, prioritizes modifying expert graphs, and generates diverse graphs.
result Models outperform state-of-the-art semi-parametric Bayesian Network models in synthetic and real-world datasets.
A novel RL objective and prioritization framework improve performance and sample-efficiency in multi-goal tasks.
problem Learning diverse goals in multi-goal reinforcement learning.
method Maximum entropy regularization for objective and prioritization framework.
result Promising improvements in performance and sample-efficiency on multi-goal robotic tasks.
Heteroskedasticity biases uplift model rankings, leading to inefficient treatment allocation.
problem Bias in uplift model rankings due to heteroskedasticity.
method Theoretical analysis and simulation on real-world data.
result Heteroskedasticity can cause individuals with high treatment effects to be ranked at the bottom, leading to inefficient treatment allocation.
SAEs struggle with feature consistency across runs, hindering MI reliability.
problem Inconsistency of learned SAE features across different training runs.
method Propose using the Pairwise Dictionary Mean Correlation Coefficient (PW-MCC) to measure feature consistency.
result High levels of feature consistency (0.80 for TopK SAEs on LLM activations) are achievable with appropriate architectural choices.
Predicts hospital patient discharge within 24 hours to optimize resource allocation.
problem Improving hospital resource management and patient care by prioritizing discharge.
method Used eight years of EHR data to train models predicting 24-hour discharge.
result Best models achieved AUROC of 0.85 and AUPRC of 0.53, well calibrated.
A system predicts future malicious behavior of network entities.
problem Prioritizing alert data and understanding attack recurrence.
method Machine learning-based network entity reputation database system.
result It is possible to precisely estimate future attack probabilities.
Agent57 beats human average on all Atari games.
problem Atari game benchmark's poor performance in challenging games.
method Trained neural network with adaptive policy selection and novel architecture.
result First deep RL agent to outperform human average on all 57 Atari games.
Each year, thousands of software vulnerabilities are discovered and reported to the public. Unpatched known vulnerabilities are a significant security risk. It is imperative that software vendors quickly provide patches once vulnerabilities are known and users quickly install those patches as soon as they are available…
New benchmarks focus on LLM risk in finance, not just accuracy.
problem Standard benchmarks ignore LLM financial risks, leading to unsafe deployment.
method Three-level agenda: model, workflow, and system stress-testing.
result Hidden weaknesses in LLMs are missed by traditional benchmarks.
Designs for allocating resources to prioritize needy applicants while estimating treatment effects.
problem Resource allocation under uncertainty with prioritized queues.
method Priority-queue randomization for treatment assignment and estimation of treatment effects.
result Identification of causal effects under different arrival and treatment assignment scenarios.
Extends uplift modeling for multiple cost treatments.
problem Optimizing interventions with multiple treatment groups and varying costs.
method Extended standard uplift models to support multiple treatment groups with different costs.
result Improved performance of models in synthetic and real data.
The central aim in this paper is to address variable selection questions in nonlinear and nonparametric regression. Motivated by statistical genetics, where nonlinear interactions are of particular interest, we introduce a novel and interpretable way to summarize the relative importance of predictor variables. Methodol…
Traditional medicine typically applies one-size-fits-all treatment for the entire patient population whereas precision medicine develops tailored treatment schemes for different patient subgroups. The fact that some factors may be more significant for a specific patient subgroup motivates clinicians and medical researc…
COMMOD debiases models with minimal and interpretable changes.
problem Inconsistent and costly model updates in fair machine learning.
method Introduced COMMOD, a novel algorithm for algorithmic fairness that minimizes changes and makes them interpretable.
result COMMOD achieves comparable performance to state-of-the-art debiasing methods while making minimal and interpretable changes.
New loss function equivalence reveals PER's uniform sampling can be improved.
problem Improving Prioritized Experience Replay (PER) for better learning efficiency.
method Transforming non-uniformly sampled data loss functions into uniformly sampled ones.
result Some environments can replace PER with a new loss function without performance loss.