Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[GSA] SCT + our screening approach #10

Open
3 of 4 tasks
aleksandra-kim opened this issue Nov 12, 2021 · 2 comments
Open
3 of 4 tasks

[GSA] SCT + our screening approach #10

aleksandra-kim opened this issue Nov 12, 2021 · 2 comments
Assignees
Labels
good first issue Good for newcomers

Comments

@aleksandra-kim
Copy link
Owner

aleksandra-kim commented Nov 12, 2021

  • add std to mean to the heuristic function
  • add var to mean to the heuristic function
  • test both on average hh consumption
  • refactor the code to be easily applicable for archetypes
@aleksandra-kim
Copy link
Owner Author

aleksandra-kim commented Nov 12, 2021

what seems to work for quick GSA:

  1. bio and cf
    • local sa - 10 min max
  1. tech
    • sct with very low cutoff 1-16 for tech - 30 min
    • out of these, select 2k with highest contributions
    • for these 2k run local sa - 30 min, no dask
  1. select 4-5k tech, bio, cf inputs based on local SA

  2. run validation, correlation should be very high, >0.999

  3. compute spearman indices for 5k inputs - 2-3h with 20 dask workers, (can be much faster with more workers)

    • in our case spearman is NOT good enough for ranking
  1. run validation for first 200 inputs

This has been tested on average CH HH, and ecoinvent 3.7.1

@aleksandra-kim aleksandra-kim added the good first issue Good for newcomers label Nov 12, 2021
@aleksandra-kim aleksandra-kim self-assigned this Nov 12, 2021
@aleksandra-kim aleksandra-kim changed the title [GSA] SCT + our screening approach by modifying heuristic function in the graph search algorithm [GSA] SCT + our screening approach Nov 12, 2021
@aleksandra-kim
Copy link
Owner Author

aleksandra-kim commented Nov 12, 2021

Regarding heuristic function in the supply chain traversal (SCT) algorithm:

  1. I tried various measures of uncertainties: std2mean, var2mean, 95% confidence range to mean for all exchanges from SCT with very low threshold (eg 1e-16)
    • normalized all of the them by respective max values
    • most appropriate seems to be std2mean or range2mean (very high correlation between these two, but std2mean is less effort)
    • var2mean was not good, because it's not unitless, so given that amounts of some exchanges are in the order of 1e-5, and the others - 1e+5, this becomes a problem
    • haven't tried using pedigree matrix values, which are specified for all uncertainty types. this could be good, because it allows comparison between different distributions, eg we can compute lognormal std for all of them and it's unitless. Big but: general inputs (parameters) would not have pedigree values
  1. In the end exchanges that showed up as most uncertain were NOT among 200 identified with localSA, they were mostly landfill and waste related, not sure why.
    • if a heuristic function is created as weighted average of uncertainty measures (eg std2mean) and contribution scores, it would first favor those landfill exchanges that are not among influential ones in GSA.
    • unless other uncertainty measure is used, it doesn't make sense to use heuristic function
    • if heuristic function is used, contributions obtained with SCT should also be normalized by max value
  1. TODO later: might be worth trying to sample during SCT

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
good first issue Good for newcomers
Projects
None yet
Development

No branches or pull requests

1 participant