Skip to content

Version 7.6.6

Latest
Latest
Compare
Choose a tag to compare
@jdramsey jdramsey released this 11 Dec 13:34
v7.6.6
72ba5aa
This commit was created on GitHub.com and signed with GitHub’s verified signature.
GPG key ID: B5690EEEBB952194
Learn about vigilant mode.

Changes for Version 7.6.6

Main changes.

  1. Made some corrections to implementing the final FCI orientation rules in response to a review from Peter Spirtes.
  2. Updated the discriminating path rule to make it more efficient.
  3. Refactored FciOrient to always use the discriminating path rule.
  4. Reimplemented R8, R9, R10 in final FCI orientation rules for efficiency.
  5. Revised the AD Tree class implementation and incorporated it into the Chi-Square and G-Square discrete independence tests as an alternative to sample counting.
  6. Revised DiscreteBicScore to ignore unattested categories for variables.
  7. Removed several "experimental" designations for algorithms.
  8. Added an implementation of CellTable using AD Trees for space-savings and switched discrete ChiSquare to use it.
  9. Improved AdTree for efficiency and clarity.
  10. Improved MvpBicScore.
  11. Added InterruptedException to MarkovCheck and handling for it in several classes.
  12. Added an IDA editor to calculate IDA and IDA-like average distances of parameter values from true values.
  13. Added CpdagParentDistancesFromTrue class.
  14. I added a column to the bootstrap table to show edge properties.
  15. Refacted all sepset finding methods into a new class, SepsetFinder, and added several new new methods.
  16. Improved logging consistency across LV algorithms.
  17. Improved LvLite.
  18. Added "recursive msep" and "noncolliders only" options to MarkovCheckEditor.
  19. Added selection bias option to nodes in the graph editor.
  20. Adjusted DagToPag to account correctly for selection bias.
  21. Added method to produce data with selection nodes conditioned to > 0 as a new DataBox item.
  22. Refactored logic to find unshielded colliders and to R4 discriminating path orientations into a separate interface.
  23. Implemented the R0R0 methods for both test-based and DagToPag contexts.
  24. Added logic in R4 to handle the case of multiple discriminating paths between two nodes for the test-based implementation (using the msep path blocking method).
  25. Removed independence test caching for the IndTestFisherZ class, which was causing errors in places.
  26. Added nodewise Markov check methods.
  27. Did several optimizations for PAG-related functions to improve speed of interface, aiming at PAGs with 100 nodes plus 10 latent common causes, with an average degree of 10.
    • Cached some types of paths in the graph class.
    • Replaced some depth-first methods with breadth-first equivalents.
    • For looking for latent common causes, limited length of treks (correctly) to 3.
    • Introduced the PagCache class to store calculated PAGs for DAGs and DAGs for their calculated PAGs, for speed of lookup, so DagToPag only needs to be called once per DAG and that statistics that require a DAG can get one.
  28. Added missing Javadocs and corrected some errors.
  29. Made repairs to testwise deletion and optimized it.
  30. For the Markov check, made the ordered local Markov the default.
  31. Added Polynomial Basis BIC Score (PC-BIC). This adds columns for a truncated polynomial basis (x, x^2,...,x^p) to the data and adjusts the Degenerate Gaussian BIC Score (DB-BIC) to treat these per variable as an ensemble. Discrete variables are handled as in DG, so this will work for mixed data.
  32. Simplified, updated, and tuned the Conditional Correlation Test for general additive models.
  33. Added (experimental) BasisFunctionBicScore, allowing score-based algorithms to handle nonlinear models.
  34. Optimized KCI using the EMJL matrix library.
  35. Added graph saving menu items to the Search box (user request).
  36. Adjusted the Markov Checker interface for KCI so that new samples aren't calculated until clicking the Sample button.
  37. A checkbox was added in the Markov Checker interface so the user can request that the dependent distribution be calculated.
  38. To accommodate KCI and large searches, threading in the FAS algorithm (used by PC and FCI) was adjusted to allow the algorithm to stop properly with an interrupt signal.

Selected Minutiae.

  1. Made table counting classes for the chi-square and g-square tests immutable to be safe in multi-threaded environments in response to a worry discovered when moving to JDK 21.1.
  2. The block real matrix was replaced with MatrixUtils where used.
  3. Corrected pseudoinverse calculation.
  4. Improved fast adjacency search.
  5. Improved KCI implementation. (Still needs work.)
  6. Removed the Meek verbose flag where used.
  7. In MultiDimensionalIntTable and CellTable, Longs with Integers to save space.
  8. Added "no rows" check to ChiSquareTable for efficiency.
  9. Improved MnlrLilklihood and MvpLikelihood.
  10. In AdTree, the Subdivision class was refactored to use the Java record.
  11. Added validation checks to AdTree.
  12. Bootstrap row sampling was added to MarkovCheck and AdTree.
  13. Handled empty total effects in various methods.
  14. Corrected some edge marking logic in AbstractWorkbench.
  15. Refactored compareTo() method in IndependenceFact for efficiency.
  16. Added menu items to the Search box to save graphs in various formats.
Assets 2
Loading