Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Abhinav Arabelly

dblp:413/6775 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 70% Language models and text generation · 30%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
data-efficient learning
0.912025
Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs · EMNLP 2025
Machine learning › Efficient and distributed learning › data selection
data selection for fine-tuning
0.912025
Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs · EMNLP 2025
Natural language and speech › Language models and text generation
instruction tuning
0.912025
Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs · EMNLP 2025
Machine learning › Efficient and distributed learning › data-efficient learning
label-efficient learning
0.912025
Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs · EMNLP 2025
Natural language and speech › Language models and text generation
large language model evaluation
0.312025
Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs · EMNLP 2025

Methods — techniques the papers use, named apart from their topics

inverse confidence weighting · 0.9active sampling · 0.9
YearPublicationVenuePosition
2025 Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs
abstract
Large Language Models (LLMs) have demonstrated remarkable capabilities across diverse domains, but developing high-performing models for specialized applications often requires substantial human annotation -a process that is time-consuming, labor-intensive, and expensive.In this paper, we address the labelefficient learning problem for supervised finetuning (SFT) by leveraging task-diversity as a fundamental principle for effective data selection.This is markedly different from existing methods based on the prompt-diversity.Our approach is based on two key observations: 1) task labels for different prompts are often readily available; 2) pre-trained models have significantly varying levels of confidence across tasks.We combine these facts to devise a simple yet effective sampling strategy: we select examples across tasks using an inverse confidence weighting strategy.This produces models comparable to or better than those trained with more complex sampling procedures, while being significantly easier to implement and less computationally intensive.Notably, our experimental results demonstrate that this method can achieve better accuracy than training on the complete dataset (a 4% increase in MMLU score).Across various annotation budgets and two instruction finetuning datasets, our algorithm performs at or above the level of the best existing methods, while reducing annotation costs by up to 80%.
Abhinav Arabelly, Jagrut Nemade, Robert D. Nowak, Jifan Zhang
EMNLP1