Beyond Scaling: Predicting Patent Approval with Domain-specific Fine-grained Claim Dependency Graph

arXiv:2404.14372v1 Announce Type: new
Abstract: Model scaling is becoming the default choice for many language tasks due to the success of large language models (LLMs). However, it can fall short in specific scenarios where simple customized methods excel. In this paper, we delve into the patent approval pre-diction task and unveil that simple domain-specific graph methods outperform enlarging the model, using the intrinsic dependencies within the patent data. Specifically, we first extend the embedding-based state-of-the-art (SOTA) by scaling up its …

arxiv beyond claim cs.ai cs.cl domain fine-grained graph patent scaling type