Xuebo Liu, Min Zhang, Xinyu Ma
We lifted 1 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| ecoli-hit/PseudoFamily | — | 0 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| KL | Not yet run | ecoli-hit/PseudoFamily/compute_similarity.py pointer only (licence: NONE) · get_code("97a19b856eb43ec9") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In multilingual translation research, the comprehension and utilization of language families are of paramount importance. Nevertheless, clustering languages based solely on their ancestral families can yield suboptimal results due to variations in the datasets employed during the model's training phase. To mitigate this challenge, we introduce an innovative method that leverages the fisher information matrix (FIM) to cluster language families, anchored on the multilingual translation model's characteristics. We hypothesize that language pairs with similar effects on model parameters exhibit a considerable degree of linguistic congruence and should thus be grouped cohesively. This concept has led us to define pseudo language families. We provide an in-depth discussion regarding the inception and application of these pseudo language families. Empirical evaluations reveal that employing these pseudo language families enhances performance over conventional language families in adapting a multilingual translation model to unfamiliar language pairs. The proposed methodology may also be extended to scenarios requiring language similarity measurements. The source code and associated scripts can be accessed at https://github.com/ecoli-hit/PseudoFamily.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2312.02820")
get_code_for_paper("2312.02820")
have("2312.02820")
Connect an agent — have() is free.