Skip to main content
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

96

datasets available to search

ShareScore release 0.7.1

Reset

Dataset results

96 results for “Reinforcement Learning”

Learn how ShareScore rates datasets ↗
OpenNeuro44/100

EEG: Reinforcement Learning in Parkinson's

Open the record for dataset details and reuse information.

openCC0Jan 2021View details →
zenodo44/100

Deep reinforcement learning for the control of microbial co-cultures in bioreactors

<p>Data for the figures in the paper:<br> <a href="https://www.biorxiv.org/content/10.1101/457366v2">https://www.biorxiv.org/content/10.1101/457366v2</a><br> (in press PLoS Comp Biol.)</p> <p>Abstract:<br> Multi-species microbial communities are widespread in natural ecosystems. When employed for biomanufacturing, engineered synthetic communities have shown increased productivity in comparison with monocultures and allow for the reduction of metabolic load by compartmentalising bioprocesses between multiple sub-populations. Despite these benefits, co-cultures are rarely used in practice because control over the constituent species of an assembled community has proven challenging. Here we demonstrate, in silico, the efficacy of an approach from artificial intelligence &ndash; reinforcement learning &ndash; for the control of co-cultures within continuous bioreactors. We confirm that feedback via reinforcement learning can be used to maintain populations at target levels, and that model-free performance with bang-bang control can outperform a traditional proportional integral controller with continuous control, when faced with infrequent sampling. Further, we demonstrate that a satisfactory control policy can be learned in one twenty-four hour experiment by running five bioreactors in parallel. Finally, we show that reinforcement learning can directly optimise the output of a co-culture bioprocess. Overall, reinforcement learning is a promising technique for the control of microbial communities.</p>

opencc-by-4.0Mar 2020View details →
zenodo44/100

Dataset: Reinforcing Cybersecurity Hands-on Training With Adaptive Learning

<p>This repository contains supplementary materials for the following conference paper:<br> <br> Pavel Seda, Jan Vykopal, Valdemar &Scaron;v&aacute;bensk&yacute;, Pavel Čeleda.<em><br> Reinforcing Cybersecurity Hands-on Training With Adaptive Learning. </em><br> In Proceedings of the 51st IEEE Frontiers in Education Conference (FIE&nbsp;2021).<br> <a href="https://doi.org/10.1109/FIE49875.2021.9637252">https://doi.org/10.1109/FIE49875.2021.9637252</a><br> <br> Preprint available at: <a href="https://arxiv.org/abs/2201.01574">https://arxiv.org/abs/2201.01574</a></p> <p><strong>How to cite</strong></p> <p>If you use or build upon the materials,&nbsp;please use the BibTeX entry below to cite the original paper (not only this web link).</p> <p>Some of the linked repositories have their separate citation entry; please use that one as well, if possible.</p> <pre><code>@inproceedings{Seda2021reinforcing, author = {Seda, Pavel and Vykopal, Jan and \v{S}v\'{a}bensk\'{y}, Valdemar and \v{C}eleda, Pavel}, title = {{Reinforcing Cybersecurity Hands-on Training With Adaptive Learning}}, booktitle = {Proceedings of the 51st IEEE Frontiers in Education Conference}, series = {FIE '21}, location = {Lincoln, NE, USA}, publisher = {IEEE}, address = {New York, NY, USA}, month = {10}, year = {2021}, pages = {1--9}, numpages = {9}, isbn = {978-1-6654-3851-3}, url = {https://doi.org/10.1109/FIE49875.2021.9637252}, doi = {10.1109/FIE49875.2021.9637252}, }</code></pre> <p>&nbsp;</p>

opencc-by-4.0Jun 2021View details →
zenodo44/100

Inverse design of metal-organic frameworks for direct air capture of CO2 via deep reinforcement learning

<p>The combination of several interesting characteristics makes metal-organic frameworks (MOFs) a highly sought-after class of nanomaterials for a broad range of applications like gas storage and separation, catalysis, drug delivery, and so on. However, the ever-expanding and nearly infinite chemical space of MOFs makes it extremely challenging to identify the most optimal materials for a given application. In this work, we present a novel approach using deep reinforcement learning for the inverse design of MOFs, our motivation being designing promising materials for the important environmental application of direct air capture of CO2&nbsp;(DAC). We demonstrate that the reinforcement learning framework can successfully design MOFs with critical characteristics important for DAC. Our top-performing structures populate two separate subspaces of the MOF chemical space: the subspace with high CO2&nbsp;heat of adsorption and the subspace with preferential adsorption of CO2&nbsp;from humid air, with few structures having both characteristics. Our model can thus serve as an essential tool for the rational design and discovery of materials for different target properties and applications.</p>

opencc-by-4.0Apr 2023View details →
zenodo44/100

lilGym: Natural Language Visual Reasoning with Reinforcement Learning, model files

<p>Baselines models&nbsp;for the paper <a href="https://lil.nlp.cornell.edu/lilgym"><em>lil</em>Gym: Natural Language Visual Reasoning with Reinforcement Learning</a>.</p>

openmit-licenseJul 2023View details →
zenodo44/100

Enhanced Westermo dataset - Transformed and Modified for Test case Selection and Priorotization in the context of Continuous Integration and Reinforcement Learning.

<p><strong>Overview</strong></p> <p>This repository contains a modified version of the existing, recently published dataset, Westermo. The initial dataset was gathered at Westermo Network Technologies AB, located in V&auml;ster&aring;s, Sweden. It encompasses over <strong>1 Million verdicts</strong> obtained from testing embedded systems, collected over a span of more than <strong>500 consecutive days</strong> of nightly testing. The dataset has been transformed and tailored specifically to cater to the research community, particularly for addressing challenges such as regression test selection, identification of flaky tests, and visualization of test results. The original dataset can be accessed through the reference provided in <strong>[1]</strong>.</p> <p>The Westermo dataset offers valuable historical information regarding the execution of test cases and their corresponding results. It serves as a valuable resource for evaluating and comparing different Test case Selection and Prioritization (TSP) techniques, enabling researchers to identify test cases that are more likely to fail during subsequent executions. Test cases in the dataset are characterized by attributes such as execution duration, previous last execution time, and the results of their recent executions.</p> <p>This dataset offers valuable historical information regarding the execution of test cases and their corresponding results. It serves as a valuable resource for evaluating and comparing different test case prioritization and selection techniques, enabling researchers to identify test cases that are more likely to fail during subsequent executions. Test cases in the dataset are characterized by attributes such as execution duration, previous last execution time, and the results of their recent executions.</p> <table align="left"> <caption><strong>Table 1:&nbsp;Dataset Overview</strong></caption> <tbody> <tr> <td>Test Cases</td> <td>1855</td> </tr> <tr> <td>CI Cycles</td> <td>15,197</td> </tr> <tr> <td>Verdict</td> <td>1,036,818</td> </tr> <tr> <td>Failed</td> <td>5.03%</td> </tr> </tbody> </table> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>However, the diversity and multitude of the features in the dataset can be irrelevant to some TSP approaches. This led us to perform a dataset conversion, where we customized Westermo to have the same features from Paint Control and IOF/ROL, two widely used datasets in Reinforcement Learning based TSP approaches.</p> <p>This conversion required the combination of multiple variables and generating the target ones. When it comes to generating the &ldquo;LastResults&rdquo; and &ldquo;Cycle&rdquo; values, further analysis was required and the data handling needed an in-depth understanding of how the nightly testing was conducted. This led us to investigate what a CI cycle is in their context, and we followed their definition of a session, stating that &ldquo;a session is when we run a suite of tests on one test system with a certain software version and testware version&rdquo;. When splitting the data according to the 9 different systems used, we were able to generate 9 different sub-sets that fit the CI context.</p> <p>&nbsp;</p> <p><strong>File Format</strong></p> <p>The compressed .zip file contains 9 files, each one corresponding to each of the 9 systems. The datasets are available in CSV format, with the semicolon (;) serving as the delimiter. The columns included are represented in the table below along with their descriptions.</p> <table> <caption><strong>Table 2: Parameters of the dataset</strong></caption> <thead> <tr> <th scope="col">Column Name</th> <th scope="col">Content</th> </tr> </thead> <tbody> <tr> <td>Id</td> <td>Unique numeric identifier of the test execution&nbsp;</td> </tr> <tr> <td>Name</td> <td>Unique numeric identifier of the test case</td> </tr> <tr> <td>Duration</td> <td>Approximated runtime of the test case</td> </tr> <tr> <td>CalcPrio</td> <td>Priority of the test case, calculated by the prioritization algorithm (output column, initially 0)</td> </tr> <tr> <td>LastRun</td> <td>Previous last execution of the test case as date-time-string (Format: <em>YYYY-MM-DD HH:ii&nbsp;</em>)</td> </tr> <tr> <td>LastResults</td> <td>List of previous test results (Failed: 1, Passed: 0), ordered by ascending age. Lists are delimited by [ ].</td> </tr> <tr> <td>Verdict</td> <td> <p>Test verdict of this test execution (Failed: 1, Passed: 0)</p> </td> </tr> <tr> <td>Cycle</td> <td>The number of the CI cycle this test execution belongs to.</td> </tr> </tbody> </table> <p>&nbsp;</p> <p>The implications of this conversion are important as it can help the previous works to re-assess their approaches and have more data for training and testing, as well as opening a broader data spectrum for future researchers in this field to find ready-to-use, rich datasets, on which they could evaluate their approaches and contribute to the TSP community. This also addresses the limitations in the field discussed in the systematic literature review <strong>[2]</strong>, stating that future research on TSP techniques should focus on collecting data from more recent subjects in a CI context with varying failure rates and larger execution times, as reproducible studies with appropriate datasets are needed to develop a usable body of knowledge regarding TSP over time. We believe that this conversion of the Westermo dataset is our contribution to alleviating the gap for the RL-based approaches.</p> <p>The original dataset can be found&nbsp;<a href="https://sites.mdu.se/aidoart/results/open-source/test-results-dataset-westermo">here.</a></p>

opencc-by-4.0May 2023View details →
zenodo40/100

Reinforcement Learning Control of a Biomechanical Model of the Upper Extremity

<p>This dataset contains evaluation data of the paper &quot;Reinforcement Learning Control of a Biomechanical Model of the Upper Extremity&quot;.</p> <p><strong>Motivation</strong></p> <p>We address the question whether the assumptions of signal-dependent and constant motor noise in a full skeletal model of the human upper body, together with the objective of movement time minimization, can predict reaching movements.</p> <p>For evaluation of the learned policy, two tasks are defined in the paper: a Fitts&#39; Law type task and an elliptic via-point task.</p> <p><strong>General description of the dataset</strong></p> <ul> <li><strong>Fitts&#39; Law Type Task</strong> <ul> <li>This dataset incorporates detailed information of all 6500 synthesized movements generated in the Fitts&#39; Law type task (following the ISO 9241-9 standard).</li> <li> <p>For each of the 10 task conditions differing in distance between targets (&quot;dist&lt;xxx&gt;&quot; in filename)<br> and ID (&#39;ID&lt;xxx&gt;&#39; in filename), there are two .csv-files:<br> - one with detailed trajectory information on a sample-to-sample basis (&quot;ISO_SAMPLES&quot; in filename), and<br> - one with aggregated movement information on an episode basis (&quot;ISO_METRICS&quot; in filename).</p> </li> <li> <p>In addition, for each task condition and each of the 13 movement directions in the Fitts&#39; Law type task,<br> we include 6 figures: Position, Velocity, and Acceleration Profiles, as well as 3D movement path, Phasespace, and Hooke plots.<br> Apart from the 3D plots, all figures use centroid projections of the respective trajectory onto the vector between initial and target position.<br> The first integer in the file name denotes the movement direction number, starting with &quot;0&quot; for movements between the targets 1 and 2, &quot;1&quot; for movements between the targets 2 and 3 etc.<br> The file &quot;6_distance0.35_ID2_policy2100000_phasespace.png&quot;, e.g., shows velocity plotted againt position for all 50 movements between the targets 7 and 8 in the task condition with ID 2 and 35cm diameter of the target circle (see Fig 2 in Paper).</p> </li> </ul> </li> <li> <p><strong>Elliptic Task</strong></p> <ul> <li> <p>This dataset also contains two CSV-files with data of the trajectory generated by the final policy in the elliptic task:<br> - one with detailed trajectory information on a sample-to-sample basis (&quot;ELLIPSE_SAMPLES&quot; in filename), and<br> - one with aggregated movement information on an episode basis, where a new episode starts<br> whenever the target on the ellipse given to the policy switches (&quot;ELLIPSE_METRICS&quot; in filename).</p> </li> </ul> </li> </ul> <p><strong>Description of the .csv-files</strong></p> <ul> <li><em>SAMPLES </em>Files <ul> <li>&quot;time&quot;: time after reaching the initial target (target 1 in Fig 2) for the first time (in seconds)</li> <li>&quot;elv_angle_pos&quot; - &quot;flexion_pos&quot;: angle of respective independent DOF (in radians) *</li> <li>&quot;elv_angle_vel&quot; - &quot;flexion_vel&quot;: angular velocity of respective independent DOF (in radians/s) *</li> <li>&quot;end-effector_xpos_x&quot; - &quot;end-effector_xpos_z&quot;: 3D position of end-effector in global coordinates (in meters) *</li> <li>&quot;target_xpos_x&quot; - &quot;target_xpos_z&quot;: 3D position of target sphere in global coordinates (in meters) *</li> <li>&quot;end-effector_xvelp_x&quot; - &quot;end-effector_xvelp_z&quot;: positional velocities of end-effector (in meters/s) *</li> <li>&quot;target_xvelp_x&quot; - &quot;target_xvelp_z&quot;: positional velocities of target sphere (in meters/s) *</li> <li>&quot;accsensor_end-effector_x&quot; - &quot;accsensor_end-effector_z&quot;: positional acceleration of end-effector (in meters/s^2) *</li> <li>&quot;E_elv_angle&quot; - &quot;E_flexion&quot;: activation of respective independent DOF *</li> <li>&quot;E_elv_angle_derivative&quot; - &quot;E_flexion_derivative&quot;: derivative of activation of respective independent DOF *</li> <li>&quot;difference_vec_x&quot; - &quot;difference_vec_z&quot;: vector between the end-effector attached to the index finger and the target, pointing towards the target (in meters) *</li> <li>&quot;centroid_vel_projection&quot;: projection of end-effector velocity towards target (in meters/s) *</li> <li>&quot;target_width&quot;: radius (!) of the target sphere (in meters) *</li> <li>&quot;A_elv_angle&quot; - &quot;A_flexion&quot;: action vector</li> <li>&quot;thorax_tx_frc&quot; - &quot;wrist_hand_r3_frc&quot;: net external force at respective DOF (including dependent and fixed DOFs such as &quot;thorax_tx&quot; (thorax translation))</li> <li>&quot;reward&quot;: reward obtained in this step</li> <li>&quot;step_type&quot;: 0=initial step of episode, 1=intermediate step of episode, 2=terminal step of episode</li> <li>&quot;target_switch&quot;: whether the target switched in this step</li> <li>&quot;discount&quot;: internal value of tf-agents (does not correspond to the discount factor gamma, which is additionally applied!)</li> <li>&quot;thorax_tx_pos&quot; - &quot;wrist_hand_r3_pos&quot;: angle of respective dependent DOF (in radians)</li> <li>&quot;thorax_tx_vel&quot; - &quot;wrist_hand_r3_vel&quot;: angular velocity of respective dependent DOF (in radians)</li> </ul> </li> <li><em>METRICS </em>Files <ul> <li>Index: episode ID</li> <li>&quot;Init_X&quot; - &quot;Init_Z&quot;: initial position in global coordinates (in meters)</li> <li>&quot;Init_X&quot; - &quot;Init_Z&quot;: target position in global coordinates (in meters)</li> <li>&quot;Init_Distance&quot;: distance between last target (i.e., desired initial position) and current target (in meters)</li> <li>&quot;Target_Width_Diameter&quot;: target width diameter (in meters)</li> <li>&quot;Movement_ID&quot;: Index of Difficulty of current movement (using the Shannon Formulation) (in bits)</li> <li>&quot;target_accuracy&quot;: 1 - (&lt;remaining distance to target center at the end of the episode&gt;/&lt;target radius&gt;) if end-effector is inside target, 0 else</li> <li>&quot;movement_time&quot;: duration of the episode (in seconds)</li> <li>&quot;episode_successful&quot;: whether episode terminated successfully within the permitted 1.5 seconds</li> <li>&quot;dist2target&quot;: remaining distance to target center at the end of the episode (in meters)</li> </ul> </li> </ul> <p>-------------------------------------<br> * included in state space</p>

opencc-by-4.0Nov 2020View details →
zenodo40/100

Datasets: Enhancing Anger Management via Reinforcement Learning: A Comparative Analysis of the PPO Algorithm with Optimised Hyperparameters

Open the record for dataset details and reuse information.

opencc-by-4.0Dec 2023View details →
zenodo40/100

Reproduction code and data for the plot of "Synthesizing survival robot behavior through reinforcement learning for homeostasis"

<pre># Reproduction code and data for the plot of "Synthesizing survival robot behavior through reinforcement learning for homeostasis"<br>Author: Naoto Yoshida<br><br>How to use:<br>1. Clone https://github.com/ugo-nama-kun/journalpaper_robot_2024 from github.<br>2. Extract data_20241119.zip in the cloned repository.<br>3. Run each plot_Fig*.py</pre>

opencc-by-4.0Nov 2024View details →
zenodo40/100

Source codes and datasets for the paper "DRLComplex: Reconstruction of protein quaternary structures using deep reinforcement learning"

<p>This contains the<strong> reproducible&nbsp;source code and dataset </strong>for the paper &quot;DRLComplex&nbsp;: Reconstruction of protein quaternary structures using deep reinforcement learning paper&quot;</p>

opencc-by-4.0Aug 2022View details →
zenodo40/100

Acquiring musculoskeletal skills with curriculum-based reinforcement learning - model weights

<p><strong>Acquiring musculoskeletal skills with curriculum-based reinforcement learning, Neuron 2024</strong></p> <p>Here we provide the weights of the neural network policies used for the analysis presented in our article.</p> <p>The archives whose names start with a number (01 - 32) correspond to the 32 curriculum steps to train the Baoding Balls policy which ranked first at the MyoChallenge 2022. The code used for the training and which can be used to test the policies can be found at https://github.com/amathislab/myochallenge.</p> <p>The archives <em>hand_pose, hand_reach, pen </em>and <em>reorient</em> correspond to the other policies used in the article. They were developed in the paper <em>Latent exploration for reinforcement learning</em>, Chiappa et al., NeurIPS 2023. They can be loaded and tested with the code at https://github.com/amathislab/lattice.</p> <p>The archive&nbsp;<em>datasets</em> includes three subfolders:&nbsp;<em>rollouts, umap</em> and&nbsp;<em>csi</em>.</p> <ul> <li>The files in <em>rollouts&nbsp;</em>are the datasets of transitions resulting from the interaction between a policy and the environment.&nbsp;</li> <li>The files in&nbsp;<em>umap</em> are the pre-computed projections of specific subsets fo the datasets included in&nbsp;<em>rollouts</em> using UMAP.</li> <li>The files in&nbsp;<em>csi</em> report the performance of the policies described in our paper when applying Control Subspace Inactivation (CSI).</li> </ul> <p>These datasets are necessary to run the notebooks to reproduce the paper's figures and main results, with the code at https://github.com/amathislab/MyoChallengeAnalysis</p> <p>If you find these weights useful, please cite:</p> <div> <div>@article{chiappa2024acquiring,<br>title = {Acquiring musculoskeletal skills with curriculum-based reinforcement learning},<br>journal = {Neuron},<br>volume = {112},<br>number = {23},<br>pages = {3969-3983.e5},<br>year = {2024},<br>issn = {0896-6273},<br>doi = {https://doi.org/10.1016/j.neuron.2024.09.002},<br>url = {https://www.sciencedirect.com/science/article/pii/S0896627324006500},<br>author = {Alberto Silvio Chiappa and Pablo Tano and Nisheet Patel and Abiga&iuml;l Ingster and Alexandre Pouget and Alexander Mathis},<br>keywords = {motor control, motor learning, reinforcement learning, curriculum learning, motor skills, musculoskeletal control, muscle synergies},<br>}</div> <div>&nbsp;</div> <div>@article{chiappa2024latent,</div> <div>title={Latent exploration for reinforcement learning},</div> <div>author={Chiappa, Alberto Silvio and Marin Vargas, Alessandro and Huang, Ann and Mathis, Alexander},</div> <div>journal={Advances in Neural Information Processing Systems},</div> <div>volume={36},</div> <div>year={2024}</div> <div>}</div> </div>

opencc-by-4.0Aug 2024View details →
zenodo40/100

Dataset for "Deep reinforcement learning for the olfactory search POMDP: a quantitative benchmark"

<p>Dataset containing the results shown in Fig. 6 of &quot;Deep reinforcement learning for the olfactory search POMDP: a quantitative benchmark&quot;.</p>

opencc-by-4.0Jan 2023View details →
zenodo40/100

Deep Reinforcement Learning for Data-Driven Adaptive Scanning in Ptychography

<p>These are the data sets used for the publication https://arxiv.org/abs/2203.15413.</p> <p>In more detail, the DataFile.pkl files in the training_data and testing_data folders are the actual data, including diffraction patterns, the corresponding reconstructions and the used illumination probe. The folders dwcnt_training_data and dwcnt_testing_data include the data sets of the simulated double-walled carbon nanotube.</p> <p>The reconstruction folder includes the source code of the reconstruction algorithm ROP and the used parameter files.</p> <p>The results folder includes the updated weights of the network model and the reconstructed potentials for the 25 test data sets used in the comparison of the publication.</p> <p>The sequence_grid.npy file stores the sparse grid scanning sequence used for initialization and comparison as described in the publication. The dwcnt_sequence_grid.npy file is the corresponding file for the double-walled carbon nanotube data.</p> <p>If you want more information, please contact the corresponding author of the publication, at schlozma@hu-berlin.de.&nbsp;</p>

opencc-by-4.0Sep 2022View details →
zenodo40/100

Deep Reinforcement Learning Enables Better Bias Control in Benchmark for Virtual Screening

<p>This compressed file contains all datasets made for the validation of MUBDsyn.</p><ul><li>datasets_int_val: 17 cases in this folder are derived from&nbsp;<a href="https://github.com/jwxia2014/ULS-UDS">MUBD for GPCRs</a>. MUBDreal was made by <a href="https://github.com/jwxia2014/MUBD-DecoyMaker2.0">MUBD-DecoyMaker2.0</a> and MUBDsyn&nbsp;was made by <a href="https://github.com/taoshen99/MUBDsyn">MUBD-DecoyMakersyn</a>.</li><li>datasets_ext_val_classical_VS: Five&nbsp;cases in this folder are derived from the shared cases of MUV and DUD-E. The active sets of MUV were taken as the input to make corresponding MUBD datasets. Files in SBVS are raw molecular docking results by smina.</li><li>datasets_ext_val_SI_classical_VS: DeepCoy and TocoDecoy were used to make the datasets corresponding to the same five cases above. The data of&nbsp;DeepCoy was directly&nbsp;retrieved from&nbsp;<a href="https://opig.stats.ox.ac.uk/resources">DeepCoy resources at OPIG</a>&nbsp;while topology decoys of TocoDecoy_9W were&nbsp;made based on the scripts provided at&nbsp;<a href="https://github.com/5AGE-zhang/TocoDecoy">TocoDecoy GitHub Repository</a>. Files in SBVS are raw molecular docking results by smina.</li><li>datasets_ext_val_ML_VS: Ten&nbsp;cases in this folder are derived from <a href="http://nrlist.drugdesign.fr/">NRLiSt-BDB</a>. Corresponding MUBD datasets were made as described above.</li></ul><p>All these datasets can be used for the reproduction of validation performed in the manuscript or to benchmark various virtual screening methods.</p>

openapache2.0May 2023View details →
zenodo40/100

Learning to Do or Learning While Doing: Reinforcement Learning and Bayesian Optimisation for Online Continuous Tuning

<p>Dataset of optimisation runs performed for a study comparing reinforcement learning and Bayesian optimisation for online continuous tuning at the example of a linear particle accelerator tuning task.</p> <p>&nbsp;</p> <p><strong>Abstract of the Paper on the Study</strong></p> <p>Online tuning of real-world plants is a complex optimisation problem that continues to require manual intervention by experienced human operators. Autonomous tuning is a rapidly expanding field of research, where learning-based methods, such as Reinforcement Learning-trained Optimisation (RLO) and Bayesian optimisation (BO), hold great promise for achieving outstanding plant performance and reducing tuning times. Which algorithm to choose in different scenarios, however, remains an open question. Here we present a comparative study at the example of a routine task on a real particle accelerator, showing that RLO generally outperforms BO, but is not always the best choice. Based on the study&rsquo;s results, we provide a clear set of criteria to guide the choice of algorithm for a given tuning task. These can ease the adoption of learning-based autonomous tuning solutions to the operation of complex real-world plants, ultimately improving the availability and pushing the limits of operability of these facilities, thereby enabling scientific and engineering<br> advancements.</p>

opencc-by-4.0Dec 2022View details →
dryad40/100

Dynamic robotic tracking of underwater targets using reinforcement learning

To realize the potential of autonomous underwater robots that scale up our observational capacity in the ocean, new approaches and techniques are needed. Fleets of autonomous robots could be used to study complex marine systems and animals with either new imaging configurations or by tracking tagged animals to study their behavior. These activities can then inform and create new policies for community conservation. The role of animal connectivity via active movement of animals represents a major knowledge gap related to the distribution of deep ocean populations. Tracking underwater targets represents a major challenge for observing biological processes in situ, and methods to robustly respond to a changing environment during monitoring missions are needed. Analytical techniques for optimal sensor placement and path planning to locate underwater targets are not straightforward in such cases. The aim of this study is to investigate the use of deep reinforcement learning as a tool for range-only underwater target tracking optimization, whose promising capabilities have been demonstrated in terrestrial scenarios. To evaluate its usefulness, a reinforcement learning method was implemented as a path planning system for an autonomous surface vehicle while tracking an underwater mobile target. A complete description of an open-source model, performance metrics in simulated environments, and evaluated algorithms based on more than 15 hours of at-sea field experiments are presented. These efforts demonstrate that deep reinforcement learning is a powerful approach that enhances the abilities of autonomous robots in the ocean and encourages the deployment of algorithms like these for monitoring marine biological systems in the future.

opencc-zeroJul 2023View details →
dryad40/100

Data from: An opponent striatal circuit for distributional reinforcement learning

Open the record for dataset details and reuse information.

publicDec 2024View details →
dryad40/100

Robotic manipulation datasets for offline compositional reinforcement learning

Open the record for dataset details and reuse information.

publicJun 2024View details →
dryad40/100

Dynamic robotic tracking of underwater targets using reinforcement learning

Open the record for dataset details and reuse information.

publicJul 2023View details →
dryad40/100

Learning contact-rich whole-body manipulation with example-guided reinforcement learning

Open the record for dataset details and reuse information.

publicAug 2025View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record