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

Adding SCORE, DAS and NoGAM algorithms to gCastle #146

Open
AlxndrMlk opened this issue Jan 4, 2024 · 1 comment
Open

Adding SCORE, DAS and NoGAM algorithms to gCastle #146

AlxndrMlk opened this issue Jan 4, 2024 · 1 comment

Comments

@AlxndrMlk
Copy link
Contributor

AlxndrMlk commented Jan 4, 2024

Hi team,

As recently demonstrated by Montagna et al. (2023), score matching algorithms like SCORE, DAS and NoGAM might overperform other algorithms under certain assumption violations.

This makes them attractive candidates for practical applications, especially under some relatively mild assumptions regarding the data generating process.

I believe they would be a great extension of gCastle's unique algorithm arsenal.

Curious to hear your thoughts.

@shaido987
Copy link
Collaborator

Hi @AlxndrMlk,

After taking a quick look, these algorithms seem like they could be worthwhile to include. There are what appear to be complete implementations of the algorithms available at https://github.com/py-why/dodiscover under an MIT license which should be possible to adapt to Castle. We will look further into it but I can't give any timeline as we are all quite busy these days. If you want to take a shot at integrating the algorithms you are more than welcome :)

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

No branches or pull requests

2 participants