๐ฎ
๐ฎ
The Ethereal
Towards Logical Specification of Statistical Machine Learning
July 24, 2019 ยท The Ethereal ยท ๐ IEEE International Conference on Software Engineering and Formal Methods
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Yusuke Kawamoto
arXiv ID
1907.10327
Category
cs.LO: Logic in CS
Cross-listed
cs.AI,
cs.CR,
cs.LG,
cs.SE
Citations
7
Venue
IEEE International Conference on Software Engineering and Formal Methods
Last Checked
1 month ago
Abstract
We introduce a logical approach to formalizing statistical properties of machine learning. Specifically, we propose a formal model for statistical classification based on a Kripke model, and formalize various notions of classification performance, robustness, and fairness of classifiers by using epistemic logic. Then we show some relationships among properties of classifiers and those between classification performance and robustness, which suggests robustness-related properties that have not been formalized in the literature as far as we know. To formalize fairness properties, we define a notion of counterfactual knowledge and show techniques to formalize conditional indistinguishability by using counterfactual epistemic operators. As far as we know, this is the first work that uses logical formulas to express statistical properties of machine learning, and that provides epistemic (resp. counterfactually epistemic) views on robustness (resp. fairness) of classifiers.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal