Benchmarking Quality-Diversity Algorithms on Neuroevolution for Reinforcement Learning

• URL: http://arxiv.org/abs/2211.02193v1
• Date: Fri, 4 Nov 2022 00:14:42 GMT
• Title: Benchmarking Quality-Diversity Algorithms on Neuroevolution for Reinforcement Learning
• Authors: Manon Flageat, Bryan Lim, Luca Grillotti, Maxime Allard, Sim\'on C. Smith, Antoine Cully
• Abstract summary: We present a Quality-Diversity benchmark suite for Deep Neuroevolution in Reinforcement Learning domains for robot control. The benchmark uses standard Quality-Diversity metrics, including coverage, QD-score, maximum fitness, and an archive profile metric.
• Score: 3.6350564275444173
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a Quality-Diversity benchmark suite for Deep Neuroevolution in Reinforcement Learning domains for robot control. The suite includes the definition of tasks, environments, behavioral descriptors, and fitness. We specify different benchmarks based on the complexity of both the task and the agent controlled by a deep neural network. The benchmark uses standard Quality-Diversity metrics, including coverage, QD-score, maximum fitness, and an archive profile metric to quantify the relation between coverage and fitness. We also present how to quantify the robustness of the solutions with respect to environmental stochasticity by introducing corrected versions of the same metrics. We believe that our benchmark is a valuable tool for the community to compare and improve their findings. The source code is available online: https://github.com/adaptive-intelligent-robotics/QDax

Related papers

• OGBench: Benchmarking Offline Goal-Conditioned RL [72.00291801676684]
  offline goal-conditioned reinforcement learning (GCRL) is a major problem in reinforcement learning. We propose OGBench, a new, high-quality benchmark for algorithms research in offline goal-conditioned RL.
  arXiv  Detail & Related papers  (2024-10-26T06:06:08Z)
• Benchmark tasks for Quality-Diversity applied to Uncertain domains [1.5469452301122175]
  We introduce a set of 8 easy-to-implement and lightweight tasks, split into 3 main categories. We identify the key uncertainty properties to easily define UQD benchmark tasks. All our tasks build on the Redundant Arm: a common QD environment that is lightweight and easily replicable.
  arXiv  Detail & Related papers  (2023-04-24T21:23:26Z)
• Efficient Quality-Diversity Optimization through Diverse Quality Species [3.428706362109921]
  We show that a diverse population of solutions can be found without the limitation of needing an archive or defining the range of behaviors in advance. We propose Diverse Quality Species (DQS) as an alternative to archive-based Quality-Diversity (QD) algorithms.
  arXiv  Detail & Related papers  (2023-04-14T23:15:51Z)
• LogGENE: A smooth alternative to check loss for Deep Healthcare Inference Tasks [0.0]
  In our work, we develop methods for Deep neural networks based inferences in such datasets like the Gene Expression. We adopt the Quantile Regression framework to predict full conditional quantiles for a given set of housekeeping gene expressions. We propose log-cosh as a smooth-alternative to the check loss to drive the estimation process.
  arXiv  Detail & Related papers  (2022-06-19T06:46:39Z)
• Towards QD-suite: developing a set of benchmarks for Quality-Diversity algorithms [0.0]
  Existing benchmarks are not standardized, and there is currently no MNIST equivalent for Quality-Diversity (QD) We argue that the identification of challenges faced by QD methods and the development of targeted, challenging, scalable benchmarks is an important step.
  arXiv  Detail & Related papers  (2022-05-06T13:33:50Z)
• LCS: Learning Compressible Subspaces for Adaptive Network Compression at Inference Time [57.52251547365967]
  We propose a method for training a "compressible subspace" of neural networks that contains a fine-grained spectrum of models. We present results for achieving arbitrarily fine-grained accuracy-efficiency trade-offs at inference time for structured and unstructured sparsity. Our algorithm extends to quantization at variable bit widths, achieving accuracy on par with individually trained networks.
  arXiv  Detail & Related papers  (2021-10-08T17:03:34Z)
• COM2SENSE: A Commonsense Reasoning Benchmark with Complementary Sentences [21.11065466376105]
  Commonsense reasoning is intuitive for humans but has been a long-term challenge for artificial intelligence (AI) Recent advancements in pretrained language models have shown promising results on several commonsense benchmark datasets. We introduce a new commonsense reasoning benchmark dataset comprising natural language true/false statements.
  arXiv  Detail & Related papers  (2021-06-02T06:31:55Z)
• A New Score for Adaptive Tests in Bayesian and Credal Networks [64.80185026979883]
  A test is adaptive when its sequence and number of questions is dynamically tuned on the basis of the estimated skills of the taker. We present an alternative family of scores, based on the mode of the posterior probabilities, and hence easier to explain.
  arXiv  Detail & Related papers  (2021-05-25T20:35:42Z)
• GO FIGURE: A Meta Evaluation of Factuality in Summarization [131.1087461486504]
  We introduce GO FIGURE, a meta-evaluation framework for evaluating factuality evaluation metrics. Our benchmark analysis on ten factuality metrics reveals that our framework provides a robust and efficient evaluation. It also reveals that while QA metrics generally improve over standard metrics that measure factuality across domains, performance is highly dependent on the way in which questions are generated.
  arXiv  Detail & Related papers  (2020-10-24T08:30:20Z)
• Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks [133.93803565077337]
  retrieval-augmented generation models combine pre-trained parametric and non-parametric memory for language generation. We show that RAG models generate more specific, diverse and factual language than a state-of-the-art parametric-only seq2seq baseline.
  arXiv  Detail & Related papers  (2020-05-22T21:34:34Z)
• Uncertainty Quantification for Deep Context-Aware Mobile Activity Recognition and Unknown Context Discovery [85.36948722680822]
  We develop a context-aware mixture of deep models termed the alpha-beta network. We improve accuracy and F score by 10% by identifying high-level contexts. In order to ensure training stability, we have used a clustering-based pre-training in both public and in-house datasets.
  arXiv  Detail & Related papers  (2020-03-03T19:35:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.