rescuing an endangered species with monte carlo ai
DESCRIPTION
Rescuing an Endangered Species with Monte Carlo AI. Tom Dietterich based on work by Dan Sheldon et al. Overview. Collaborative project to develop optimal conservation strategies for Red-Cockaded Woodpecker (RCW) - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/1.jpg)
1
Rescuing an Endangered Species with Monte Carlo AI
Tom Dietterichbased on work by Dan Sheldon et al.
![Page 2: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/2.jpg)
2
Overview• Collaborative project to develop optimal conservation
strategies for Red-Cockaded Woodpecker (RCW)– Institute for Computational Sustainability (Cornell and
OSU):Daniel Sheldon, Bistra Dilkina, Adam Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David Shmoys
– The Conservation Fund: Will Allen, Ole Amundsen, Buck Vaughan
• Recent paper: Maximizing the Spread of Cascades Using Network Design, UAI 2010
![Page 3: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/3.jpg)
3
Red-Cockaded Woodpecker
• Originally wide-spread species in S. US• Population now shrunken to 1% of original
size5000 breeding groups~12,000 birdsFederally-listed endangered species
• Lifestyle:– nests in holes in 80yo+ Longleaf pine trees– sap from the trees defends the nest– takes several years to excavate the hole
• Will colonize man-made holesWikipedia
![Page 4: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/4.jpg)
4
Spatial Conservation Planning• What is the best land acquisition and management strategy to
support the recovery of the Red-Cockaded Woodpecker (RCW)?
![Page 5: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/5.jpg)
5
Problem Setup
• Given limited budget, what parcels should we conserve to maximize the expected number of occupied patches in T years?
Conserved parcels
Available parcels
Currentpatches
Potentialpatches
![Page 6: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/6.jpg)
6
Metapopulation Model
• Population dynamics in fragmented landscape
• Stochastic patch occupancy model (SPOM)– Patches = occupied /
unoccupied– Colonization– Local extinction
![Page 7: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/7.jpg)
SPOM: Stochastic Patch Occupancy Model– Patches are either occupied or unoccupied– Two types of stochastic events:
• Local extinction: occupied unoccupied• Colonization: unoccupied occupied (from neighbor)
– Independence among all events
Time 1 Time 2
7
![Page 8: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/8.jpg)
8
Network Cascades
• Models for diffusion in (social) networks– Spread of information, behavior, disease, etc.– E.g.: suppose each individual passes rumor to
friends independently with probability ½
Note: “activated” nodes are those reachable by red edges
![Page 9: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/9.jpg)
SPOM Probability Model
k
j
i
j
pij
1-βj
plj
𝑡−1 𝑡l
i
k
l
9
• To determine occupancy of patch at time – For each occupied patch from time , flip
coin with probability to see if colonizes – If is occupied at time , flip a coin with
probability to determine survival (non-extinction)
– If any of these events occurs, is occupied
• Parameters:– : colonization probability– : extinction probability– Simple parametric functions of patch-size,
inter-patch distance, etc.
![Page 10: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/10.jpg)
10
Monte Carlo Simulation of a SPOM• Key idea: a metapopulation model is a cascade in the
layered graph representing patches over time
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e1 2 3 4 5
Colonization
Non-extinction
Patches
Time
![Page 11: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/11.jpg)
11
Metapopulation = Cascade• Key idea: a metapopulation model is a cascade in the
layered graph representing patches over time
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e1 2 3 4 5
Patches
Time
![Page 12: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/12.jpg)
12
Metapopulation = Cascade• Key idea: a metapopulation model is a cascade in the
layered graph representing patches over time
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e1 2 3 4 5
Patches
Time
![Page 13: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/13.jpg)
13
Metapopulation = Cascade• Key idea: a metapopulation model is a cascade in the
layered graph representing patches over time
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e1 2 3 4 5
Patches
Time
![Page 14: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/14.jpg)
14
Metapopulation = Cascade• Key idea: a metapopulation model is a cascade in the
layered graph representing patches over time
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e1 2 3 4 5
Patches
![Page 15: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/15.jpg)
15
Monte Carlo Simulations• Each simulation can produce a different cascade
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e
a
b
c
d
e1 2 3 4 5
Patches
![Page 16: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/16.jpg)
Insight #1: Objective as Network Connectivity
• Conservation objective: maximize expected # occupied patches at time T
• Cascade objective: maximize expected # of target nodes reachable by live edges
i
j
k
l
m
i
j
k
l
m
i
j
k
l
m
i
j
k
l
m
i
j
k
l
m targets
Live edges
16
![Page 17: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/17.jpg)
Insight #2: Management as Network Building
• Conserving parcels adds nodes and (stochastic) edges to the network
Parcel 1
Parcel 2
Initial network
17
![Page 18: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/18.jpg)
Insight #2: Management as Network Building
• Conserving parcels adds nodes to the network
Parcel 1
Parcel 2
Initial network
18
![Page 19: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/19.jpg)
Insight #2: Management as Network Building
• Conserving parcels adds nodes to the network
Parcel 1
Parcel 2
Initial network
19
![Page 20: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/20.jpg)
20
Monte Carlo Evaluation of a Proposed Purchase Plan
set of reachable nodes at time • Goal is to maximize , where is our purchasing
plan• Run multiple simulations. Count the number
of occupied parcels at time . Compute the average:
![Page 21: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/21.jpg)
21
Research Question
• How many samples do we need to get a good estimate?
• Answer: We can use basic statistical methods (confidence intervals and hypothesis tests) to measure the accuracy of our estimate.95% confidence interval for the mean is our estimate; is the true value
• We can increase until the accuracy is high enough
![Page 22: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/22.jpg)
22
Evaluating a Purchase Plan• Plan 1: Purchase nothing
Initial network
Parcel 1
Parcel 2
![Page 23: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/23.jpg)
23
Plan 2: Purchase Parcel #1
Initial network
Parcel 1
Parcel 2
![Page 24: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/24.jpg)
24
Plan 3: Purchase Parcels 1 and 2
Initial network
Parcel 1
Parcel 2
![Page 25: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/25.jpg)
25
How many different purchasing plans are there for parcels?
• We can’t afford to evaluate them all
![Page 26: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/26.jpg)
Solution Strategy(aka Sample Average Approximation)
26
1. Assume we own all parcels. Run multiple simulations of bird propagation
2. Join all of those simulations into a single giant graph– Goal of maximizing expected # of
occupied patches at time is approximated by # of reachable patches in the giant graph
3. Define a set of variables , one for each parcel that we can buy
4. Solve a mixed integer program to decide which variables are and which are
𝑥1
𝑥1
𝑥1
𝑥2
𝑥2
𝑥2
![Page 27: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/27.jpg)
27
Solving the Deterministic Problem
• CPLEX commercial optimization package (sold by IBM; free to universities)
• Applies a method known as Branch and Bound• NP-Hard, so can take a long time but often
finds a solution if the problem isn’t too big or too hard
![Page 28: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/28.jpg)
28
Experiments
• 443 available parcels• 2500 territories• 63 initially occupied• 100 years
• Population model is parameterized based (loosely) on RCW ecology
• Short-range colonizations (<3km) within the foraging radius of the RCW are much more likely than long-range colonizations
![Page 29: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/29.jpg)
29
Greedy Baselines• Adapted from previous work on influence
maximization
• Start with empty set, add actions until exhaust budget– Greedy-uc – choose action that results in biggest immediate
increase in objective [Kempe et al. 2003]– Greedy-cb – use ratio of benefit to cost [Leskovec et al.
2007]
• These heuristics lack performance guarantees!
![Page 30: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/30.jpg)
30
Results
M = 50, N = 10, Ntest = 500
Upper bound!
![Page 31: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/31.jpg)
31
Results
M = 50, N = 10, Ntest = 500
Upper bound!
![Page 32: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/32.jpg)
32
Results
Conservation Reservoir
Initial population
M = 50, N = 10, Ntest = 500
Upper bound!
![Page 33: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/33.jpg)
Conservation Strategies
33
• Both approaches build outward from source– Greedy buys best
patches next to currently-owned patches
– Optimal solution builds toward areas of high conservation potential
• In this case, the two strategies are very similar
Conservation Reservoir
Source population
![Page 34: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/34.jpg)
34
A Harder Instance
Move the conservation reservoir so it is more remote.
![Page 35: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/35.jpg)
35
Conservation Strategies
Greedy Baseline
SAA Optimum (our approach)
$150M $260M $320M
Build outward from sources
Path-building (goal-setting)
![Page 36: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/36.jpg)
36
Shortcomings of the Method
• All parcels are purchased at time – Reality: money arrives incrementally
• All parcels are assumed to be for sale at – Reality: parcel availability and price can vary from year to
year• How about an MDP? Each year we can see where the
birds actually spread to and then update our purchase plans accordingly– This is a very hard MDP, no known solution method
• Current method is very slow
![Page 37: Rescuing an Endangered Species with Monte Carlo AI](https://reader035.vdocuments.mx/reader035/viewer/2022062813/568165ef550346895dd9141a/html5/thumbnails/37.jpg)
37
Status
• The Conservation Fund is making purchasing decisions based (partially) on the plans computed using this model
• Alan Fern, Shan Xue, and Dan Sheldon have developed an extension that proposes a schedule for purchasing the parcels