T-Norms Driven Loss Functions for Machine Learning
원문 초록
Neural-symbolic approaches have recently gained popularity to inject prior knowledge into a learner without requiring it to induce this knowledge from data. These approaches can potentially learn competitive solutions with a significant reduction of the amount of supervised data. A large class of neural-symbolic approaches is based on First-Order Logic to represent prior knowledge, relaxed to a differentiable form using fuzzy logic. This paper shows that the loss function expressing these neural-symbolic learning tasks can be unambiguously determined given the selection of a t-norm generator. When restricted to supervised learning, the presented theoretical apparatus provides a clean justification to the popular cross-entropy loss, which has been shown to provide faster convergence and to reduce the vanishing gradient problem in very deep structures. However, the proposed learning formulation extends the advantages of the cross-entropy loss to the general knowledge that can be represented by a neural-symbolic method. Therefore, the methodology allows the development of a novel class of loss functions, which are shown in the experimental results to lead to faster convergence rates than the approaches previously proposed in the literature.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Unveiling Causal Reasoning in Large Language Models: Reality or Mirage?
TaxoAdapt: Aligning LLM-Based Multidimensional Taxonomy Construction to Evolving Research Corpora
Improving Personalized Search with Regularized Low-Rank Parameter Updates
HSSBench: Benchmarking Humanities and Social Sciences Ability for Multimodal Large Language Models
HELM: Hyperbolic Large Language Models via Mixture-of-Curvature Experts
BnMMLU: Measuring Massive Multitask Language Understanding in Bengali
토론
이 논문과 연결된 포럼 글이 아직 없습니다.