Assimilation and Accommodation: Task-Adaptive Hierarchical Abstraction for Solving Web Tasks (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods focus on summarizing workflows, i.e., common sub-routines, which introduce excessive low-level details that distract models. |
| Approach: | They propose a framework that derives task-adaptive hierarchical abstraction from experience to enhance web task reasoning. |
| Outcome: | The proposed framework improves performance with competitive cost-efficiency on Mind2web and Webarena. |
Similar Papers
Efficient Strategies for Hierarchical Text Classification: External Knowledge and Auxiliary Tasks (2020.acl-main)
Copied to clipboard
| Challenge: | Hierarchical text classification is a complex task that requires extended training time and a large number of parameters. |
| Approach: | They propose a top-up-classification task using dictionaries and auxiliary task from external dictionary definitions. |
| Outcome: | The proposed method outperforms previous studies using a reduced number of parameters in two well-known English datasets. |
Tempo-Lexical Context Driven Word Embedding for Cross-Session Search Task Extraction (N18-1)
Copied to clipboard
| Challenge: | Existing work on task extraction has focused on identifying tasks within a single session . but, we aim to identify tasks that span across multiple sessions. |
| Approach: | They propose to embed query words into query vectors to capture task semantics . they propose to use query vector embedding to predict whether a session is a part of a broader search task . |
| Outcome: | The proposed method improves task extraction efficiency over existing methods . it can predict whether a session is part of a broader complex search task . |
Low-Resource Domain Adaptation for Compositional Task-Oriented Semantic Parsing (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in deep learning have enabled several approaches to successfully parse more complex queries, but these models require a large amount of annotated training data to parser on new domains (e.g. reminder, music). |
| Approach: | They propose a method that adapts task-oriented semantic parsers to low-resource domains and outperforms a supervised neural model at a 10-fold data reduction. |
| Outcome: | The proposed method outperforms baseline methods on a newly collected multi-domain task-oriented semantic parsing dataset (TOPv2) . |
HTML: Hierarchical Topology Multi-task Learning for Semantic Parsing in Knowledge Base Question Answering (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches struggle with mapping questions to precise logical forms . Existing frameworks struggle with complex mapping of questions to logical form . |
| Approach: | They propose a framework that leverages a hierarchical multi-task learning paradigm to enhance the performance of logical form generation. |
| Outcome: | The proposed framework outperforms supervised fine-tuning methods and training-free ones on large language models. |
Balancing Knowledge Breadth and Task Depth for Effective Domain Adaptation Fine-Tuning (2026.findings-acl)
Copied to clipboard
| Challenge: | a lack of knowledge breadth and task depth can hinder curriculum learning in domains such as medicine and finance. |
| Approach: | They propose a two-dimensional curriculum learning framework that coordinates model training along two orthogonal axes: the knowledge dimension and the task dimension. |
| Outcome: | The proposed framework improves accuracy on medical evaluations by 2.49% and on financial evaluations 1.2% compared with the second-best method. |
Learning to Decompose and Organize Complex Tasks (2021.naacl-main)
Copied to clipboard
| Challenge: | Using a novel end-to-end pipeline, we propose a solution that consumes a complex task and induces 'dependency graphs' from unstructured text to represent sub-tasks and their relationships. |
| Approach: | They propose a pipeline that consumes a complex task and induces 'dependency graphs' from unstructured text to represent sub-tasks and their relationships. |
| Outcome: | The proposed pipeline outperforms state-of-the-art graph induction pipelines in a dataset of complex tasks with their sub-task graphs. |
Hierarchical Task Learning from Language Instructions with Unified Transformers and Self-Monitoring (2021.findings-acl)
Copied to clipboard
| Challenge: | despite recent progress, learning new tasks through language instructions remains a challenging problem. |
| Approach: | They propose a hierarchical task learning approach that decomposes task learning into three sub-problems and a model that addresses each sub-probability in a unified manner. |
| Outcome: | The proposed model achieves the state-of-the-art performance on the AL-FRED benchmark . it decomposes task learning into three sub-problems and addresses them in a unified manner . |
ADaPT: As-Needed Decomposition and Planning with Language Models (2024.findings-naacl)
Copied to clipboard
Archiki Prasad, Alexander Koller, Mareike Hartmann, Peter Clark, Ashish Sabharwal, Mohit Bansal, Tushar Khot
| Challenge: | Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment. |
| Approach: | They propose an approach that explicitly plans and decomposes complex sub-tasks when the LLM is unable to execute them. |
| Outcome: | The proposed approach significantly outperforms established strong baselines, achieving success rates up to 28.3% higher in ALFWorld, 27% in WebShop, and 33% in TextCraft. |
Eliciting and Understanding Cross-task Skills with Task-level Mixture-of-Experts (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained transformer models are capable of multitasking on diverse NLP tasks, but little is known about how multitaskability and cross-task generalization is achieved. |
| Approach: | They propose to use a transformer-based mixture-of-expert model with a router component to choose among experts dynamically and flexibly. |
| Outcome: | The proposed models improve the average performance gain (ARG) metric by 2.6% when adapting to unseen tasks, and by 5.6% in zero-shot generalization settings. |
TELL-TALE: Task Efficient LLMs with Task Aware Layer Elimination (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models typically come with a fixed architecture, but not all layers contribute equally to every downstream task. |
| Approach: | They propose an inference-time method that selectively removes irrelevant or detrimental layers . the method is hardware-agnostic, requires no retraining, and operates entirely at inference time . |
| Outcome: | The proposed method matches or surpasses baseline performance while reducing computational costs. |