On the Informativeness of the DNA Promoter Sequences Domain Theory
J. Ortega
Abstract
The DNA promoter sequences domain theory and database have become popular for testing systems that integrate empirical and analytical learning. This note reports a simple change and reinterpretation of the domain theory in terms of M-of-N concepts, involving no learning, that results in an accuracy of 93.4% on the 106 items of the database. Moreover, an exhaustive search of the space of M-of-N domain theory interpretations indicates that the expected accuracy of a randomly chosen interpretation is 76.5%, and that a maximum accuracy of 97.2% is achieved in 12 cases. This demonstrates the informativeness of the domain theory, without the complications of understanding the interactions between various learning algorithms and the theory. In addition, our results help characterize the difficulty of learning using the DNA promoters theory.
Create a lesson
Related papers
Can Language Models Play the Wikipedia Game?
Alexander Hickey, Joanna Knight, James Bishop
RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics
Weiliang Chen, Song Liao
X-AgentRed: Red-Teaming Personal Agents in Evolving Multi-Service Ecosystems
Yeonsung Jung, Zhiyuan Wang, Zifan Wang et al.
Studying Comics at Scale with Artificial Intelligence: The PAGE Framework and Three Studies of American Comics and Japanese Manga
Emilio Ferrara
UkrMeme: Multimodal Explainable Persuasion Detection in Ukrainian Memes
Nazar Andrushko, Vera Schmitt, Veronika Solopova
A Privileged Teacher That Only Scores Cannot Search: Critique-Conditioned On-Policy Self-Distillation for Reasoning
Mayug Maniparambil, Ayush Rai, Ekansh Verma et al.