Hadi Alizadeh

2papers

2 Papers

CLJul 17, 2024
Sharif-STR at SemEval-2024 Task 1: Transformer as a Regression Model for Fine-Grained Scoring of Textual Semantic Relations

Seyedeh Fatemeh Ebrahimi, Karim Akhavan Azari, Amirmasoud Iravani et al.

Semantic Textual Relatedness holds significant relevance in Natural Language Processing, finding applications across various domains. Traditionally, approaches to STR have relied on knowledge-based and statistical methods. However, with the emergence of Large Language Models, there has been a paradigm shift, ushering in new methodologies. In this paper, we delve into the investigation of sentence-level STR within Track A (Supervised) by leveraging fine-tuning techniques on the RoBERTa transformer. Our study focuses on assessing the efficacy of this approach across different languages. Notably, our findings indicate promising advancements in STR performance, particularly in Latin languages. Specifically, our results demonstrate notable improvements in English, achieving a correlation of 0.82 and securing a commendable 19th rank. Similarly, in Spanish, we achieved a correlation of 0.67, securing the 15th position. However, our approach encounters challenges in languages like Arabic, where we observed a correlation of only 0.38, resulting in a 20th rank.

8.6COMay 5
Packing chromatic critical graphs with radius at most 2

Aslıhan Gür, Didem Gözüpek, Hadi Alizadeh

For a graph $G$ with vertex set $V(G)$ and a positive integer $i$, an $i$-packing in $G$ is a subset $X$ of $V(G)$ such that the distance between any two distinct vertices of $X$ is greater than $i$. The packing chromatic number of $G$, denoted by $χ_ρ(G)$, is the smallest positive integer $k$ for which there exists a partition $X_1, X_2, \ldots, X_k$ of $V(G)$ such that $X_i$ is an $i$-packing in $G$ for every $i \in [k]$. A graph $G$ is called $χ_ρ$-critical if $χ_ρ(H) < χ_ρ(G)$ holds for every proper subgraph $H$ of $G$. In this paper, we provide a structural characterization of $χ_ρ$-critical graphs with radius $1$, and completely determine the $χ_ρ$-critical cactus graphs with radius $2$ and diameter $2$ or $3$.