We lifted 4 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| andruekonst/ecbl | canonical | 3 of 4 |
| Function | Status | Where it lives |
|---|---|---|
| cnf_to_constraints | Ran | andruekonst/ecbl/ecbl/constraints/conversions.py pointer only (licence: NONE) · get_code("34559de90fd9eb12") |
| expand_eq_ne | Ran | andruekonst/ecbl/ecbl/constraints/conversions.py pointer only (licence: NONE) · get_code("b5855593f9c5918d") |
| expand_ne_in_cnf | Ran | andruekonst/ecbl/ecbl/constraints/conversions.py pointer only (licence: NONE) · get_code("df6009555fbdee11") |
| linear_inequalities_to_vertex_repr | Not yet run | andruekonst/ecbl/ecbl/constraints/polytope_conversions.py pointer only (licence: NONE) · get_code("4b701bc03b9b053e") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A problem of incorporating the expert rules into machine learning models for extending the concept-based learning is formulated in the paper. It is proposed how to combine logical rules and neural networks predicting the concept probabilities. The first idea behind the combination is to form constraints for a joint probability distribution over all combinations of concept values to satisfy the expert rules. The second idea is to represent a feasible set of probability distributions in the form of a convex polytope and to use its vertices or faces. We provide several approaches for solving the stated problem and for training neural networks which guarantee that the output probabilities of concepts would not violate the expert rules. The solution of the problem can be viewed as a way for combining the inductive and deductive learning. Expert rules are used in a broader sense when any logical function that connects concepts and class labels or just concepts with each other can be regarded as a rule. This feature significantly expands the class of the proposed results. Numerical examples illustrate the approaches. The code of proposed algorithms is publicly available.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.14726")
get_code_for_paper("2402.14726")
have("2402.14726")
Connect an agent — have() is free.