Probabilistic Law Discovery (PLD) is a logic based Machine Learning method, which implements a variant of probabilistic rule learning. In several aspects, PLD is close to Decision Tree/Random Forest methods, but it differs significantly in how relevant rules are defined. The learning procedure of PLD solves the optimization problem related to the search for rules (called probabilistic laws), which have a minimal length and relatively high probability. At inference, ensembles of these rules are used for prediction. Probabilistic laws are human-readable and PLD based models are transparent and inherently interpretable. Applications of PLD include classification/clusterization/regression tasks, as well as time series analysis/anomaly detection and adaptive (robotic) control. In this paper, we outline the main principles of PLD, highlight its benefits and limitations and provide some application guidelines.
Probabilistic Phase Labeling and Lattice Refinement for Autonomous Material Research
Department of Materials Science and Engineering, Cornell University(材料科学与工程系,康奈尔大学);Department of Computer Science, Cornell University(计算机科学系,康奈尔大学);Division of Engineering and Applied Science and Liquid Sunlight Alliance, California Institute of Technology(工程与应用科学系及液阳光联盟,加州理工学院)
In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
RelationalAI;Department of Mathematics, Statistics, and Physics(数学、统计学与物理学系);Slippery Rock University(斯利普岩大学);Department of Mathematics and Statistics(数学与统计学系);University of Houston–Downtown(休斯顿-都会大学)