This paper prioritizes experience replay in robotics using energy-based principles.
problem Randomly replaying experience in HER leads to inefficient learning.
method Developed an energy-based framework to prioritize hindsight experience in robotic manipulation tasks.
result EBP outperforms state-of-the-art approaches in robotic manipulation tasks.
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.
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.
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.
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.
System automatically searches for scientific features in Mars rover images.
problem Manual task planning for Mars rover images is time-consuming and error-prone.
method Deep image captioning network and automated task prioritization.
result System can prioritize images for transmission based on search tasks.
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.
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.
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.
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.
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.
Q-CurL optimizes quantum learning with a curriculum design.
problem Efficiently training quantum models with limited resources.
method Quantum curriculum learning framework.
result Q-CurL enhances training convergence and generalization.
New approach to continual learning prioritizes adaptation over retention.
problem Catastrophic forgetting in lifelong learning models.
method Formalized CL as an online optimization problem, introduced Transfer Efficiency, and derived a Critical Task Duration.
result Retention can hinder real-time adaptation in non-stationary environments.
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…
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 adopts the very successful distributional perspective on reinforcement learning and adapts it to the continuous control setting. We combine this within a distributed framework for off-policy learning in order to develop what we call the Distributed Distributional Deep Deterministic Policy Gradient algorithm, …
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.
Model improves adversarial robustness and standard accuracy with feature prioritization and regularization.
problem Inherent trade-off between adversarial robustness and standard accuracy in machine learning models.
method Feature prioritization through a nonlinear attention module and L2 feature regularization. result Improves adversarial robustness and standard accuracy compared to adversarial training.
Two new undersampling methods improve classification accuracy for imbalanced datasets.
problem Class imbalance and distributional differences in large datasets lead to biased models and poor predictive performance.
method Mutual information-based stratified simple random sampling and support points optimization.
result Empirical results show higher balanced classification accuracy compared to traditional techniques.
LLMs fail to match statistical ground truth despite stable run-to-run performance.
problem LLMs lack validation against statistical ground truth in automated scientific workflows.
method Introduced a behavioral evaluation framework for LLMs, separating four decision-making dimensions.
result LLMs can exhibit near-perfect stability but diverge from statistical ground truth.
SCROLLS benchmarks long text NLP tasks, improving existing models.
problem Short NLP benchmarks ignore long texts; SCROLLS addresses this.
method Handpicked long-text datasets for summarization, QA, and inference tasks.
result Improvement potential on SCROLLS tasks, as indicated by initial baselines.
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.
AMBER method selects features efficiently using autoencoders and model-based elimination.
problem Efficiently selecting relevant features for classification.
method Greedy backward elimination using a ranker model and autoencoders.
result AMBER outperforms other feature selection methods in classification accuracy.
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.
Proposes a computational framework for real-time risk assessment and prioritization.
problem Real-time risk assessment and prioritization for uncertain outcomes.
method Develops a computational framework based on satisficing measure for real-time risk assessment and prioritization. Applies sample average approximation and primal-dual stochastic approximation algorithms.
result Demonstrates the effectiveness of the proposed framework in real-time risk assessment and prioritization.
Enhances cooperative multi-task SemCom for distributed users.
problem Performance degradation in cooperative multi-tasking due to negative information transfer.
method Federated learning (FL) with semantic-aware task clustering.
result Constructive cooperation across distributed users with semantic-aware task clustering.
Optimizes reinforcement learning by prioritizing sets of samples over individual ones.
problem Limits exploration and improvement on harder examples due to focusing on isolated samples.
method Proposes Pass@K Policy Optimization (PKPO) to optimize for sets of samples that maximize reward when considered jointly.
result Optimization with novel low variance unbiased estimators for pass@k and its gradient leads to significant pass@k gains.
PDTS improves robustness in sequential decision-making.
problem Robust active task sampling for efficient and reliable decision-making.
method Characterizes robust active task sampling as a Markov decision process, proposes PDTS method.
result Significantly improves zero-shot and few-shot adaptation robustness.
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.
LEWIS merges LLMs without training, improving performance on specific tasks.
problem Limited performance improvement of merged models on specific benchmarks.
method Guided model merging using layer-wise sparsity and task-vector pruning.
result Improved model performance by up to 11.3% on math-solving tasks.
New binary loss functions improve density ratio estimation accuracy.
problem Improving accuracy of density ratio estimators using binary classifiers.
method Characterized loss functions based on prescribed error measures in Bregman divergences.
result Novel loss functions prioritize accurate estimation of large density ratio values.
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.
Gradient-based meta-RL fails with incorrect task distributions, leading to instability and poor performance.
problem Gradient-based meta-RL's sensitivity to task distributions causes instability and poor performance.
method Proposes meta Active Domain Randomization (meta-ADR) to learn task distributions for gradient-based meta-RL.
result Meta-ADR improves stability and generalization of MAML on simulated locomotion and navigation tasks.
This work improves Hindsight Learning for goal-directed tasks in reinforcement learning.
problem Sparse reward problems in reinforcement learning, especially goal-directed tasks.
method Improves Hindsight Experience Replay and Hindsight Policy Gradients for robotic tasks.
result Improved learning in Hindsight Experience Replay and Hindsight Policy Gradients.
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.
A method for setting up an automatic curriculum for reinforcement learning tasks.
problem Improving sample efficiency in multi-task reinforcement learning.
method Propose a goal proposal module that prioritizes goals maximizing epistemic uncertainty of the Q-function.
result Significant performance gains over current methods in 13 multi-goal robotic tasks and 5 navigation tasks.
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.
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.
New MAML variant prioritizes hardest tasks, improving robustness.
problem Meta-learning's focus on average performance, ignoring worst-case.
method Reformulate MAML to minimize max loss over observed tasks.
result Task-robust model performs well across various task distributions.
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.
This paper defines resource-constrained classifier performance and its impact on algorithm choice.
problem Classification tasks in resource-constrained settings where actions are limited.
method Defines resource-constrained classifier performance and discusses gains and lift.
result Gains and lift metrics can lead to different algorithm choices.
MiM-StocR combines momentum indicators and adaptive ranking loss for better stock recommendation.
problem Lack of simultaneous short-term trend and ranking prediction in stock recommendation models.
method Integrates momentum indicators and proposes Adaptive-k ApproxNDCG for ranking optimization.
result MiM-StocR outperforms state-of-the-art MTL baselines in stock recommendation.
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.
Modern reinforcement learning algorithms reach super-human performance on many board and video games, but they are sample inefficient, i.e. they typically require significantly more playing experience than humans to reach an equal performance level. To improve sample efficiency, an agent may build a model of the enviro…