Maximizing Nature-based Solutions using Artificial Intelligence to align global biodiversity, climate, and water targets [dataset]
Bibliographic record
Abstract
Here, you will find the code and data produced for the manucript titled: "Maximizing Nature-based Solutions using Artificial Intelligence to align global biodiversity, climate, and water targets." You may download the project folder and run the code for Steps 1 and 2 in Python, Step 3 in R, and Step 4 in R and Python. The four main steps of this study are summarized in the flowchart (~/Code – NbS and RL/flowchart.pdf). The file named “code_data_explanation.xlsx” explains each code in detail. Below, we provide a general explanation of each methodological step. Step 1 simulates training data, and Step 2 trains an optimization model based on the training data in Python and the Reinforcement Learning algorithm CAPTAIN. The output trained model is found in: '~/steps1_2_Trained_model/full_monitor_protect_at_once_can.log'. Step 3 creates an empirical environment, i.e., 10X10 km Planning Units spatial fishnet grid in Canada with information about threatened biodiversity, ecological integrity, carbon, water, ecozones, provinces, and land tenure in Canada. The empirical environment is available at: ~/Code – NbS and RL/puInputs/10x10kmGridCan3347.gpkg. All the input data used to create this empirical environment were obtained from public data sources (Supplemental Information Table S1) and must be downloaded or requested (e.g., IUCN and BirdLife species data) from their original sources. However, we provide demonstration data for mammals to show how the Species Habitat Index, a proxy of ecological integrity, was calculated (Steps 3A to 3E). In Steps 4A to 4F, we prepared in R the data inputs for running the Reinforcement Learning algorithm CAPTAIN. These inputs include data displaying the presence of species across 10x10Km Planning Units (PUs) that were suitable for conservation (~/Code – NbS and RL/cpInputsOutputs/pusSpeciesDbCon_V20.csv) or restoration (~/Code – NbS and RL/ cpInputsOutputs/pusSpeciesDbRes_V20.csv) based on Step 3 processes. In turn, these inputs and data from the empirical environment are used for each conservation or restoration scenario. For example, Conservation Scenario 1 (~/Code – NbS and RL/ cpInputsOutputs/conSc1) contains a specific file for species occurrence (puvsp_...V20.csv), costs based on ecological Integrity values (pu_conSc....V20.csv), and the spatial location of 10x10Km Planning Units (Planning_Units_....V20.csv). Steps 4G to 4L use the data produced in Steps 4A to 4F to obtain Conservation and Restoration Priority Scenarios using the Reinforcement Learning agent trained in Step 2. In each scenario, the Reinforcement Agent will maximize species occurrence (puvsp_...V20.csv), while avoiding high costs (pu_conSc....V20.csv) across 10x10Km Planning Units (Planning_Units_....V20.csv'). Additionally, in each scenario, the agent is provided a total sum of costs or a budget to cost-effectively prioritize a desired number of Planning Units to either achieve a conservation or restoration area target. For example, in Conservation Scenario 1, the Reinforcement Learning agent maximizes species occurrence in areas suitable for conservation along with ecological integrity. As the agent is trained to avoid areas with high costs, this environmental variable was rescaled so that high Species Habitat Index values (i.e., a proxy for ecological integrity) represented a low cost. After ten iterations of the scenario, the summary of the areas prioritized by the Reinforcement Learning agent can be found in a file named “pusPriorityConSc1_V20.csv” inside the scenario folder (~/Code – NbS and RL/ cpInputsOutputs/conSc1). The results of this scenario and other scenarios can be visualized in Steps 4M and 4N.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.051 | 0.033 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".