Negative Ontology of True Target for Machine Learning: Towards Recognition, Evaluation and Learning under Democratic Supervision
This article philosophically examines how a shift in the assumed ontology of the true target (TT) can lead to a new paradigm for machine learning (ML)-based predictive modelling. By systematically analysing the existence assumption of the TT underlying mainstream ML paradigms, we adopt a negative ontology perspective, explicitly positing that the TT does not objectively exist in the real world. On this basis, we define Democratic Supervision as an alternative supervisory principle for ML, in which no single source is assumed to possess an objectively privileged target. We further introduce Multiple Inaccurate True Targets (MIATTs) as an instance-level realization of Democratic Supervision. Building upon MIATTs, we establish the logic-driven generation and assessment for MIATTs construction (recognition with MIATTs), formulate logical assessment formula for evaluation with MIATTs, and develop undefinable true target learning for learning with MIATTs. These components are integrated to formulate the Recognition, Evaluation, Learning with MIATTs (REL-MIATTs) framework. We further characterize REL-MIATTs from the perspective of Cognitive Machine Learning: a single cycle provides an elementary cognitive learning unit, MIATTs introduce complementary supervisory perspectives, and iterative cycles support the evolution of learning through accumulated experience, feedback, and state updating. Extending this process to human-AI interaction provides a basis for human-AI co-cognitive development and, potentially, human-AI co-evolution. A real-world application further demonstrates the potential of the framework for supporting individual education and professional development, providing empirical evidence for the feasibility of Democratic Supervision, REL-MIATTs, and its broader implications for continuous human-AI co-evolution.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Biomedical Knowledge Graph Embeddings with Negative Statements
A knowledge graph is a powerful representation of real-world entities and their relations. The vast majority of these relations are defined as positive statements, but the importance of negative statements is increasingl…
Graph EmbeddingGraph Representation LearningKnowledge Graph EmbeddingKnowledge Graph Embeddings+5Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models
Knowledge Graph Embedding models, representing entities and edges in a low-dimensional space, have been extremely successful at solving tasks related to completing and exploring Knowledge Graphs (KGs). One of the key asp…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsAndroid Malicious Application Classification Using Clustering
Android malware have been growing at an exponential pace and becomes a serious threat to mobile users. It appears that most of the anti-malware still relies on the signature-based detection system which is generally slow…
ClassificationClusteringGeneral ClassificationEnhancing Geometric Ontology Embeddings for $\mathcal{EL}^{++}$ with Negative Sampling and Deductive Closure Filtering
Ontology embeddings map classes, relations, and individuals in ontologies into $\mathbb{R}^n$, and within $\mathbb{R}^n$ similarity between entities can be computed or new axioms inferred. For ontologies in the Descripti…
Ontology EmbeddingDELE: Deductive $\mathcal{EL}^{++} \thinspace $ Embeddings for Knowledge Base Completion
Ontology embeddings map classes, relations, and individuals in ontologies into $\mathbb{R}^n$, and within $\mathbb{R}^n$ similarity between entities can be computed or new axioms inferred. For ontologies in the Descripti…
Knowledge Base CompletionOntology Embedding