Fix m-LiNGAM bug for small sample size and improve documentation#189
Merged
ikeuchi-screen merged 7 commits intocdt15:masterfrom Mar 2, 2026
Merged
Fix m-LiNGAM bug for small sample size and improve documentation#189ikeuchi-screen merged 7 commits intocdt15:masterfrom
ikeuchi-screen merged 7 commits intocdt15:masterfrom
Conversation
… suppress future warning
Collaborator
|
Thanks for the PR! Really appreciate it. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Good day,
While experimenting with m-LiNGAM, we observed that with small sample sizes and high percentages of missing data, logistic regression can fail when identifying the causes of missingness.
This update introduces a mechanism to increase sample availability in such cases by removing a minimal set of potential parent variables that are partially observed. Similarly, if there are not enough datapoints for the adaptive Lasso procedure (samples < features), the algorithm now attempts the procedure without bias correction (as bias correction reduces the number of available samples). Both procedures preserve the sample-limit properties as they are never executed for large enough samples, while allowing the execution on small datasets with substantial missing data.
Additionally, we:
Please let me know if you have any questions or need further changes.
Best regards,
Matteo Ceriscioli