Papers by Cheng Han

52 papers
Recyclable Tuning for Continual Pre-training (2023.findings-acl)

Copied to clipboard

Challenge: Continual pre-training is the paradigm where pre-trained language models acquire fresh knowledge and gradually get upgraded.
Approach: They propose to use adapted weights to recycle old PLMs for continual pre-training . they propose to combine initialization and distillation methods to achieve better performance .
Outcome: The proposed method improves the convergence and performance of the upgraded PLM.
Adaptive Spatial and Temporal Redundancy Optimization for Efficient Reasoning in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing research to improve CoT efficiency falls into three categories, each with distinct limitations.
Approach: They propose a training-free framework that addresses both dimensions of CoT reasoning by applying a progressive precision reduction strategy coupled with an entropy-based confidence mechanism for adaptive termination.
Outcome: Empirical results show that the proposed framework achieves 11.3 efficiency gain without compromising accuracy.
SafeSwitch: Steering Unsafe LLM Behavior via Internal Activation Signals (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing safety mechanisms for large language models (LLMs) are inadequate to fully leverage their internal cognitive processes.
Approach: They propose a framework that regulates unsafe outputs by utilizing the prober-based internal state monitor that actively detects harmful intentions.
Outcome: The proposed framework reduces harmful outputs by approximately 80% while maintaining strong utility.
CollabKG: A Learnable Human-Machine-Cooperative Information Extraction Toolkit for (Event) Knowledge Graph Construction (2024.lrec-main)

Copied to clipboard

Challenge: Existing IE tools lack multi-task support and automatic updates for KG and EKG construction.
Approach: They propose a human-machine-cooperative IE toolkit for KG and EKG construction that unifies different IE subtasks and integrates LLMs as the assistant machine.
Outcome: The proposed tool improves annotation quality, efficiency, and stability simultaneously.
All Languages Matter: Understanding and Mitigating Language Bias in Multilingual RAG (2026.acl-long)

Copied to clipboard

Challenge: Existing mRAG systems suffer from a language bias during reranking, systematically favoring English and the query’s native language.
Approach: They propose a language-agnostic utility-driven reranker alignment technique to mitigate language bias during re-ranking.
Outcome: The proposed approach mitigates language bias and consistently improves mRAG performance across languages.
CPT-Agent: A Cognitive Process Theory-driven Framework for Student Simulation in Writing Development (2026.acl-long)

Copied to clipboard

Challenge: Existing LLMs model overly capable learners who over-apply feedback, resulting in pedagogically implausible behavior.
Approach: They propose a framework that decouples cognitive ability from writing proficiency and models their interaction during writing and revision.
Outcome: The proposed model produces distinguishable proficiency levels and is consistent with instructional theories.
Depression Detection on Social Media with Large Language Models (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for analyzing social media data lack a systematic integration of medical knowledge, causing a critical treatment gap.
Approach: They propose a framework that leverages Large Language Models to integrate medical knowledge into social media data.
Outcome: The proposed framework can be used to distinguish depression from transient mood changes.
Learning Slice-Aware Representations with Mixture of Attentions (2021.findings-acl)

Copied to clipboard

Challenge: Real-world machine learning systems are achieving excellent performance in terms of coarse-grained metrics like overall accuracy and F-1 score.
Approach: They extend slice-based learning (SBL) with a mixture of attentions to learn slice-aware dual attentive representations.
Outcome: The proposed approach outperforms the baseline method and the original SBL approach on monitored slices with two natural language understanding tasks.
Exploring Mode Connectivity for Pre-trained Language Models (2022.emnlp-main)

Copied to clipboard

Challenge: Recent years have witnessed the prevalent application of pre-trained language models (PLMs) in NLP. From the perspective of parameter space, PLMs provide generic initialization, starting from which high-performance minima could be found.
Approach: They investigate the geometric connections of different minima through the lens of mode connectivity, which measures whether two minima can be connected with a low-loss path.
Outcome: The proposed model can be used to find low-loss paths between two minima, and to understand how their mode connectivity affects their task knowledge.
Neo-Classic: A Benchmark for Evaluating Linguistic-Aesthetic Reasoning in Classical Chinese Poetry (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) achieve high accuracy on established Classical Chinese Poetry benchmarks, but it remains challenging to distinguish transferable Linguistic-Aesthetic Reasoning from reliance on familiar pre-training patterns.
Approach: They propose a benchmark that combines a constructionist Out-of-Sample dataset with reverse understanding probes to evaluate large-scale large-format models.
Outcome: The proposed model performs well on classical Chinese poetry benchmarks, but a performance gap persists . the model can complete famous couplets and can be used to understand a variety of texts.
Seq1F1B: Efficient Sequence-Level Pipeline Parallelism for Large Language Model Training (2025.naacl-long)

Copied to clipboard

Challenge: Current PP methods face severe bottlenecks, including pipeline bubbles and memory footprint.
Approach: They propose a sequence-level one-forward-one-backward (1F1B) PP method for training LLMs on long sequences with high throughput and memory efficiency.
Outcome: The proposed method achieves 1.14X training throughput with half memory footprint compared to baseline methods . it trains an LLM with 30B parameters on sequences up to 64k tokens using 64X NVIDIA A100 GPUs .
PaCoRe: Learning to Scale Test-Time Compute with Parallel Coordinated Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Parallel Coordinated Reasoning (PaCoRe) overcomes a central limitation of contemporary language models: their inability to scale test-time compute (TTC) far beyond sequential reasoning under a fixed context window.
Approach: They propose a training-and-inference framework to overcome a central limitation of language models: their inability to scale test-time compute (TTC) under a fixed context window.
Outcome: The proposed model scales to multi-million-token effective TTC without exceeding context limits.
Multi-Agent Collaboration via Cross-Team Orchestration (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have significantly impacted various domains, especially through organized LLM-driven autonomous agents.
Approach: They propose a framework that enables orchestrated teams to jointly propose various task-oriented solutions and interact with their insights in a self-independence while cross-team collaboration environment for superior solutions generation.
Outcome: Experiments show that the framework can generate better software quality compared to state-of-the-art frameworks.
LASA: Language-Agnostic Semantic Alignment at the Semantic Bottleneck for LLM Safety (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated better safety performance in high-resource languages than in low-resourced languages.
Approach: They propose language-agnostic semantic alignment (LASA) which anchors safety alignment directly in semantic bottlenecks.
Outcome: The proposed approach significantly improves safety across all languages: average attack success rate drops from 24.7% to 2.8% on LLaMA-3.1-8B-Instruct and remains within 3–4% across Qwen2.5 and Qwend3 Instruct models (7B–32B).
GEAR: Graph-based Evidence Aggregating and Reasoning for Fact Verification (P19-1)

Copied to clipboard

Challenge: Existing methods to extract information from evidence are unable to grasp relational and logical information among the evidence.
Approach: They propose a graph-based evidence aggregating and reasoning framework to integrate evidence from multiple pieces of evidence.
Outcome: The proposed framework achieves significant performance improvements on a large-scale benchmark dataset.
TencentPretrain: A Scalable and Flexible Toolkit for Pre-training Models of Different Modalities (2023.acl-demo)

Copied to clipboard

Challenge: Several pre-training models of different modalities are showing a rising trend of homogeneity in their model structures.
Approach: They propose a toolkit that supports pre-training models of different modalities.
Outcome: The proposed toolkit can match the performance of the original implementations on text, vision, and audio benchmarks.
Agent-in-the-Loop: A Data Flywheel for Continuous Improvement in LLM-based Customer Support (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing offline approaches to improve an LLM-based customer support system rely on batch annotations.
Approach: They propose an agent-in-the-loop framework that integrates four key types of annotations directly into live customer operations: (1) pairwise response preferences, (2) agent adoption and rationales, (3) knowledge relevance checks, and (4) identification of missing knowledge.
Outcome: The proposed framework reduces retraining cycles from months to weeks by integrating four key types of annotations directly into live customer operations.
EscapeBench: Towards Advancing Creative Intelligence of Language Model Agents (2025.acl-long)

Copied to clipboard

Challenge: Existing language model agents excel in planning and reasoning, but lack creativity in unfamiliar environments.
Approach: They propose a benchmark suite of room escape game environments to challenge agents with creative reasoning, unconventional tool use and iterative problem-solving to uncover implicit goals.
Outcome: The proposed framework can perform with 40% fewer steps and hints and performs robustly across difficulty levels.
Making Pre-trained Language Models Better Continual Few-Shot Relation Extractors (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to learn new relations with limited labeled data are prone to catastrophic forgetting and overfitting.
Approach: They propose a framework that uses prompts to acquire more generalized knowledge . they propose CFRE to continuously learn new relations while retaining knowledge of old ones .
Outcome: The proposed method outperforms state-of-the-art methods by a large margin and significantly mitigates catastrophic forgetting and overfitting in low-resource scenarios.
Beyond Quantity: Trajectory Diversity Scaling for Code Agents (2026.findings-acl)

Copied to clipboard

Challenge: Code large language models (LLMs) are becoming tool-interactive agents . quantity-centric scaling exhibits an early bottleneck that underutilizes trajectory data . et al.: a new approach to scale trajectory diversity improves tool-use generalization .
Approach: They propose a Trajectory Diversity Scaling-based data synthesis framework for code agents that scales performance through diversity rather than raw volume.
Outcome: Experiments on general tool-use benchmarks and code agent tasks show that TDScaling improves tool-user generalization and inherent coding proficiency.
Probing Audio-Visual Reasoning in Multimodal Language Models through the Lens of Audio (2026.acl-long)

Copied to clipboard

Challenge: Recent multimodal large language models lack robust audio-visual integration ability and performance on DeafTest is highly correlated with AV-Odyssey accuracy.
Approach: They propose a benchmarking tool that integrates audio-visual reasoning with audio-video cues to infer solutions.
Outcome: The proposed model performs well on DeafTest, but lacks audio perception in simple audio tasks.
MEIC-DT: Memory-Efficient Incremental Clustering for Long-Text Coreference Resolution with Dual-Threshold Constraints (2026.findings-acl)

Copied to clipboard

Challenge: Existing supervised neural methods are underexplored for coreference resolution, especially in incremental clustering.
Approach: They propose a dual-threshold incremental clustering approach based on a lightweight Transformer.
Outcome: Experiments on common benchmarks show that MEIC-DT achieves highly competitive coreference performance under stringent memory constraints.
High-Order Semantic Alignment for Unsupervised Fine-Grained Image-Text Retrieval (2024.lrec-main)

Copied to clipboard

Challenge: Existing studies focus on learning global or local correspondence, but lack fine-grained local-global alignment.
Approach: They propose a High Order Semantic Alignment (HOSA) model that can provide complementary and comprehensive semantic clues to infer correlation scores.
Outcome: The proposed model outperforms state-of-the-art models in retrieving the most relevant results.
MEPT: Mixture of Expert Prompt Tuning as a Manifold Mapper (2025.emnlp-main)

Copied to clipboard

Challenge: Empirical evaluations show that Mixture of Expert Prompt Tuning outperforms state-of-the-art parameter efficient baselines on SuperGLUE.
Approach: They propose a pretrain-then-fine-tune paradigm for manifold mapping using multiple prompt experts.
Outcome: Empirical results show that the proposed approach outperforms state-of-the-art methods on SuperGLUE while reducing activated prompts by 79.25%.
VideoQA-TA: Temporal-Aware Multi-Modal Video Question Answering (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for video question answering align visual or textual features directly with large language models, limiting the deep semantic association between modalities and hindering a comprehensive understanding of interactions within spatial and temporal contexts.
Approach: They propose a temporal-aware framework for multi-modal video question answering that aligns videos and questions at fine-grained levels.
Outcome: The proposed framework improves reasoning ability and accuracy of videoQA by aligning videos and questions at fine-grained levels.
M2PT: Multimodal Prompt Tuning for Zero-shot Instruction Learning (2024.emnlp-main)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) exhibit remarkable performance across a wide range of domains.
Approach: They propose a multimodal prompt tuning approach for efficient instruction tuning of MLLMs.
Outcome: The proposed approach shows superior performance on multimodal evaluation datasets compared to state-of-the-art methods.
TaCube: Pre-computing Data Cubes for Answering Numerical-Reasoning Questions over Tabular Data (2022.emnlp-main)

Copied to clipboard

Challenge: Existing auto-regressive pre-trained language models are challenged by recent emerging numerical reasoning datasets due to the error-prone implicit calculation.
Approach: They propose a pre-computation tool to pre-compute aggregation/arithmetic results for the table in advance, so they are handy and readily available for PLMs to answer numerical reasoning questions.
Outcome: The proposed model improves on TAT-QA and T5 and BART-large on multiple benchmarks.
GLTW: Joint Improved Graph Transformer and LLM via Three-Word Language for Knowledge Graph Completion (2025.findings-acl)

Copied to clipboard

Challenge: Existing knowledge graphs lack the ability to integrate structural information into LLMs and output predictions deterministically.
Approach: They propose a method which encodes structural information of KGs and merges it with LLMs to enhance KGC performance.
Outcome: The proposed method improves the performance of KG Completion datasets on KGs by integrating structural information with LLMs.
ImCoref-CeS: An Improved Lightweight Pipeline for Coreference Resolution with LLM-based Checker-Splitter Refinement (2026.acl-long)

Copied to clipboard

Challenge: Existing supervised neural methods for coreference resolution are underexplored . current methods rely on small language models, but their potential is underexploited .
Approach: They propose a framework that integrates an enhanced supervised model with LLM-based reasoning.
Outcome: The proposed method surpasses existing state-of-the-art methods in coreference resolution.
HiTab: A Hierarchical Table Dataset for Question Answering and Natural Language Generation (2022.acl-long)

Copied to clipboard

Challenge: Existing studies on table reasoning focus on flat tables and hierarchical tables . a new dataset, HiTab, aims to examine numerical reasoning over hierarchic tables based on hierarchically structured tables - a strong challenge for existing baselines and a valuable benchmark for future research.
Approach: They propose a hierarchical question answering and natural language generation dataset to study hierarchic tables.
Outcome: The proposed model shows that it is effective in QA and natural language generation over hierarchical tables.
When Audio and Text Disagree: Revealing Text Bias in Large Audio-Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Large Audio-Language Models (LALMs) are augmented with the ability to perceive audio, but their reliability when faced with conflicting inputs remains largely unexplored.
Approach: They examine how LALMs prioritize information when presented with inconsistent audio-text pairs.
Outcome: The proposed models display a significant bias toward textual input when presented with inconsistent audio-text pairs.
AMR-RE: Abstract Meaning Representations for Retrieval-Based In-Context Learning in Relation Extraction (2025.naacl-srw)

Copied to clipboard

Challenge: Existing in-context learning methods for relation extraction often overlook entity relationships . Existing methods for RE prioritize language similarity over structural similarity .
Approach: They propose an AMR-enhanced retrieval-based ICL method for relation extraction . their method retrieves in-context examples based on semantic structure similarity .
Outcome: The proposed method outperforms baselines on four English RE datasets and in the more demanding unsupervised setting.
DecisionFlow: Advancing Large Language Model as Principled Decision Maker (2025.findings-emnlp)

Copied to clipboard

Challenge: Current language models lack the structured deliberation needed for high-stakes tasks such as healthcare and finance.
Approach: They propose a decision-making framework that guides models to reason over structured representations of actions, attributes, and constraints.
Outcome: The proposed framework achieves up to 30% accuracy gains over strong prompting baselines and enhances alignment in outcomes.
CLAIMCHECK: How Grounded are LLM Critiques of Scientific Papers? (2025.findings-emnlp)

Copied to clipboard

Challenge: CLAIMCHECK is an annotated dataset of NeurIPS 2023 and 2024 submissions and reviews from OpenReview.
Approach: They annotate NeurIPS 2023 and 2024 submissions and reviews for weaknesses and dispute them for fine-grained labels of validity, objectivity, and type of the identified weaknesses.
Outcome: The proposed dataset is richly annotated by ML experts for weaknesses statements in the reviews and the claims that they dispute, as well as fine-grained labels of validity, objectivity, and type of the identified weaknesses.
On-the-Fly VLA Adaptation via Test-Time Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Existing vision-language-action models are unsuitable for simulated or physical-world deployments . current methods fail when confronted with inherent real-world dynamic variability.
Approach: They propose a test-time reinforcement learning framework that enables on-the-fly policy adaptation during inference.
Outcome: Empirical results show that the proposed framework improves adaptability, stability and task success in dynamic, previously unseen scenarios.
Modelling Long-distance Node Relations for KBQA with Global Dynamic Graph (2020.coling-main)

Copied to clipboard

Challenge: Existing studies rely on deep graph neural networks (GNNs) to capture rich structural information, but they lack the structural information needed for QA.
Approach: They propose a framework which captures structural information from KBs and models long-distance node relations from two perspectives.
Outcome: The proposed framework models long-distance node relations from two perspectives . it is based on two widely used multi-hop KBQA datasets .
QuantumQA: Enhancing Scientific Reasoning via Physics-Consistent Dataset and Verification-Aware Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Large language models lack reliability in scientific domains that require strict adherence to physical constraints.
Approach: They propose a large-scale dataset constructed via a task-adaptive strategy and a hybrid verification protocol that combines deterministic solvers with semantic auditing to guarantee scientific rigor.
Outcome: The proposed model outperforms baselines and general-purpose preference models and is competitive with proprietary models.
LLMBox: A Comprehensive Library for Large Language Models (2024.acl-demos)

Copied to clipboard

Challenge: a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented.
Approach: They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs).
Outcome: The proposed library is based on extensive experiments in a variety of evaluation settings.
Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) scales capacity via conditional computation, but lacks knowledge lookup primitive.
Approach: They propose a conditional memory instantiated via Deep Sparse Embedding (DSE) they propose 'u-shaped scaling law' that identifies optimal balance between MoE experts and DSE memory .
Outcome: The proposed model outperforms an iso-parameter and isoFLOPs MoE baseline across knowledge and reasoning benchmarks and is infrastructure-efficient.
FORTAP: Using Formulas for Numerical-Reasoning-Aware Table Pretraining (2022.acl-long)

Copied to clipboard

Challenge: Tables store rich numerical data, but numerical reasoning over tables is still a challenge.
Approach: They propose a spreadsheet formula is a valuable supervision for numerical reasoning in tables.
Outcome: The proposed method outperforms state-of-the-art methods on three representative datasets of formula prediction, question answering, and cell type classification.
Chinese Metaphorical Relation Extraction: Dataset and Models (2023.findings-emnlp)

Copied to clipboard

Challenge: Metaphor identification is a core task in metaphor processing, which involves recognizing and analyzing metaphorical expressions in text.
Approach: They propose a new formulation of metaphor identification as a relation extraction problem . they use a dataset to analyze metaphorical relations between two spans, a target and a source .
Outcome: The proposed model can capture the properties of the target and source in Chinese sentences.
The Law of Knowledge Overshadowing: Towards Understanding, Predicting and Preventing LLM Hallucination (2025.findings-acl)

Copied to clipboard

Challenge: Hallucination is a persistent challenge in large language models where even with rigorous quality control, models often generate distorted facts.
Approach: They propose a new framework to quantify factual hallucinations by modeling knowledge overshadowing.
Outcome: The proposed framework improves model factuality on Overshadow (27.9%), MemoTrap (13.1%) and NQ-Swap (18.3%).
Beyond A Fixed Seal: Adaptive Stealing Watermark in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing detection methods for large language models rely on fixed strategies to steal watermarks.
Approach: They propose a novel steal-based watermark algorithm that derives watermark information from watermarked texts to craft highly targeted adversarial attacks.
Outcome: The proposed system significantly increases steal efficiency against target watermarks under identical conditions.
Explain-Analyze-Generate: A Sequential Multi-Agent Collaboration Method for Complex Reasoning (2025.coling-main)

Copied to clipboard

Challenge: Multiagent debate (MAD) is a popular approach for large language models . however, the performance of LLMs is suboptimal in complex reasoning scenarios .
Approach: They propose a sequential collaboration framework to enable agents to provide constructive assistance to peers by decomposing complex tasks into essential subtasks.
Outcome: The proposed framework achieves the highest performance on 19 out of 23 tasks and lower costs compared to MAD.
Exploring Task Difficulty for Few-Shot Relation Extraction (2021.emnlp-main)

Copied to clipboard

Challenge: Existing models do not distinguish hard tasks from easy ones in the learning process.
Approach: They propose a novel approach that exploits relation label information to learn better representations by focusing on hard tasks.
Outcome: Experiments on two standard datasets show the proposed approach performs better than previous methods.
CM-TTS: Enhancing Real Time Text-to-Speech Synthesis Efficiency through Weighted Samplers and Consistency Models (2024.findings-naacl)

Copied to clipboard

Challenge: Neural Text-to-Speech systems are a promising approach for high-fidelity speech synthesis . but the efficiency of multi-step sampling in Diffusion Models presents challenges .
Approach: They propose a novel architecture grounded in consistency models to improve model convergence.
Outcome: The proposed architecture achieves top-quality speech synthesis in fewer steps without adversarial training or pre-trained model dependencies.
RankAdaptor: Hierarchical Rank Allocation for Efficient Fine-Tuning Pruned LLMs via Performance Model (2025.findings-naacl)

Copied to clipboard

Challenge: Current compression techniques entail structural pruning and a recovery phase that leverages the Low-Rank Adaptation algorithm.
Approach: They propose a hierarchical rank allocation method that enables efficient fine-tuning of pruned LLMs according to layerwise specific recovery requirements.
Outcome: The proposed algorithm outperforms state-of-the-art methods across pruning settings and LLM architectures with improvements ranging from 0.7% to 5.5%.
Open Domain Question Answering based on Text Enhanced Knowledge Graph with Hyperedge Infusion (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to improve knowledge base are incomplete and difficult to understand.
Approach: They propose a novel QA method by leveraging text information to enhance the incomplete KB.
Outcome: Extensive experiments on the WebQuestionsSP benchmark prove the effectiveness of the proposed model.
BvSP: Broad-view Soft Prompting for Few-Shot Aspect Sentiment Quad Prediction (2024.acl-long)

Copied to clipboard

Challenge: Aspect sentiment quad prediction aims to predict aspects due to distinct data distribution.
Approach: They propose a method that aggregates multiple templates with a broader view . they first construct a few-shot ASQP dataset that contains richer categories .
Outcome: The proposed method outperforms the state-of-the-art methods under four few-shot settings and other public datasets.
Generative Prompt Tuning for Relation Classification (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing prompt tuning methods for RC are limited by label spaces and rigid prompt restrictions.
Approach: They propose a generative prompt tuning method to reformulate relation classification as an infilling problem by adding cloze-style phrases to masked language modeling problems.
Outcome: The proposed method exploits rich semantics of entity and relation types and can predict label verbalizations with varying lengths at multiple predicted positions.
ACE-Router: Generalizing History-Aware Routing from MCP Tools to the Agent Web (2026.acl-long)

Copied to clipboard

Challenge: Existing routers that use hardcoded tools are limited by scalability and generality bottlenecks.
Approach: They propose a pipeline for training history-aware routers to empower precise navigation in large-scale ecosystems.
Outcome: The proposed pipeline can train routers with dynamic context understanding to create the plug-and-play Light Routing Agent.
CREATOR: Tool Creation for Disentangling Abstract and Concrete Reasoning of Large Language Models (2023.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) have made significant progress in utilizing tools, but their ability is limited by API availability and the instability of implicit reasoning.
Approach: They propose a framework that enables LLMs to create their own tools using documentation and code realization.
Outcome: The proposed framework outperforms existing chain-of-thought, program-of thought, and tool-using baselines on MATH and TabMWP benchmarks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations