Decoders Laugh as Loud as Encoders

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Borodach, Eli, Dandekar, Raj, Dandekar, Rajat, Panat, Sreedath
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908520249556992
author Borodach, Eli
Dandekar, Raj
Dandekar, Rajat
Panat, Sreedath
author_facet Borodach, Eli
Dandekar, Raj
Dandekar, Rajat
Panat, Sreedath
contents From the dawn of the computer, Allen Turing dreamed of a robot that could communicate using language as a human being. The recent advances in the field of Large Language Models (LLMs) shocked the scientific community when a single model can apply for various natural language processing (NLP) tasks, while the output results are sometimes even better than most human communication skills. Models such as GPT, Claude, Grok, etc. have left their mark on the scientific community. However, it is unclear how much these models understand what they produce, especially in a nuanced theme such as humor. The question of whether computers understand humor is still open (among the decoders, the latest to be checked was GPT-2). We addressed this issue in this paper; we have showed that a fine-tuned decoder (GPT-4o) performed (Mean F1-macro score of 0.85) as well as the best fine-tuned encoder (RoBERTa with a Mean of F1-score 0.86)
format Preprint
id arxiv_https___arxiv_org_abs_2509_04779
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Decoders Laugh as Loud as Encoders
Borodach, Eli
Dandekar, Raj
Dandekar, Rajat
Panat, Sreedath
Computation and Language
Artificial Intelligence
From the dawn of the computer, Allen Turing dreamed of a robot that could communicate using language as a human being. The recent advances in the field of Large Language Models (LLMs) shocked the scientific community when a single model can apply for various natural language processing (NLP) tasks, while the output results are sometimes even better than most human communication skills. Models such as GPT, Claude, Grok, etc. have left their mark on the scientific community. However, it is unclear how much these models understand what they produce, especially in a nuanced theme such as humor. The question of whether computers understand humor is still open (among the decoders, the latest to be checked was GPT-2). We addressed this issue in this paper; we have showed that a fine-tuned decoder (GPT-4o) performed (Mean F1-macro score of 0.85) as well as the best fine-tuned encoder (RoBERTa with a Mean of F1-score 0.86)
title Decoders Laugh as Loud as Encoders
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2509.04779