Challenge: a large language model generates high-level restoration plans over a compact catalogue of feasible actions.
Approach: They propose a method that generates restoration plans over a catalogue of feasible actions.
Outcome: The proposed model outperforms a time-capped solver on an IEEE 13-node power distribution feeder by 13% while using less than 1% of its wall-clock runtime.

Similar Papers

Improving the Language Understanding Capabilities of Large Language Models Using Reinforcement Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Instruction-fine-tuned large language models (LLMs) under 14B parameters underperform on NLU tasks . we explore a framework to improve the NLU capabilities of LLMs .
Approach: They propose to use Proximal Policy Optimization to improve NLU capabilities . they frame NLU as a reinforcement learning environment and optimize for reward signals .
Outcome: The proposed framework outperforms supervised fine-tuning on GLUE and superGLUE tasks.
RLAE: Reinforcement Learning-Assisted Ensemble for LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing ensemble methods for ensembling large language models rely on fixed weighting strategies that fail to adapt to dynamic, context-dependent characteristics of LLMs.
Approach: They propose a framework that reformulates LLM ensemble through a Markov Decision Process.
Outcome: The proposed framework outperforms existing methods by 3.3% on a diverse set of tasks while achieving lower time latency.
DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization (2025.acl-long)

Copied to clipboard

Challenge: Structured pruning reduces model size but often causes uneven degradation across domains, leading to biased performance.
Approach: They propose a method that dynamically adjusts the data distribution during training to restore balanced performance across heterogeneous and multi-tasking data.
Outcome: Experiments in monolingual and multilingual settings show that the proposed method surpasses similarly sized models in pruning and continued pretraining over perplexity, downstream tasks, and instruction tuning.
Fixing Distribution Shifts of LLM Self-Critique via On-Policy Self-Play Training (2025.acl-long)

Copied to clipboard

Challenge: Large language models show impressive performance in a wide range of linguistic tasks, but their performance on complex reasoning tasks is still signif-icantly lower than the human level.
Approach: They propose a reinforcement learning framework to synchronize the reasoning and critique capabilities of language models by using Monte Carlo sampling to give appropriate rewards to the model's critique content.
Outcome: The proposed framework improves the model's reasoning and critique capabilities by 5.40 and 3.66 points, respectively, compared to the best baseline approach.
LaCo: Layer-wise Compensation for Pruned Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for predicting performance degradations of Large Language Models (LLMs) neglect the structural distortions caused by sparsity.
Approach: They propose a framework that reorients the recovery paradigm from global adaptation to hierarchical representation alignment by sequentially optimizing each layer to reconstruct the model's hidden states.
Outcome: The proposed framework surpasses parameter-efficient baselines in perplexity reduction and zero-shot reasoning.
ReCoVeR the Target Language: Language Steering without Sacrificing Task Performance (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models exhibit more language confusion as they become multilingual . authors propose a lightweight approach for reducing language confusion based on language-specific steering vectors .
Approach: They propose a lightweight approach to reduce language confusion by using language-specific steering vectors.
Outcome: The proposed approach reduces language confusion in large language models . it leverages language-specific steering vectors for effective LLM steering .
LeLoRA: Learnable Low-Rank Adaptation of Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to fine-tuning large language models (LLMs) rely on manually specified and fixed hyperparameters, resulting in suboptimal performance and low parameter efficiency.
Approach: They propose a framework that allows for dynamically learned adaptive adaptation strategies to be used to fine-tune large language models.
Outcome: The proposed framework outperforms baselines in adapting large language models.
Policy-Guided Stepwise Action Planning for Controllable LLM Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to steering large language model reasoning via high-level reasoning actions fail to outperform standard generation because planners tend to degenerate into repetitive loops or fixed patterns.
Approach: They propose a planner-executor framework that learns to select reasoning actions dynamically while keeping the executor LLM fully frozen.
Outcome: The proposed framework outperforms existing paradigms by preserving the executor LLM frozen . PG-HAP improves accuracy over strong baselines while producing less redundant, more adaptive trajectories.
Reinforcement Learning for Diffusion LLMs via Energy-Based Gibbs Alignment (2026.acl-long)

Copied to clipboard

Challenge: Diffusion Large Language Models (dLLMs) offer parallel decoding and bidirectional context modeling . aligning dLLms with reinforcement learning (RL) remains a challenge .
Approach: They propose a variational framework that reformulates RL for dLLMs as a distribution matching problem.
Outcome: The proposed framework reformulates RL for dLLMs as a distribution matching problem.
Exploiting Tree Structure for Credit Assignment in Reinforcement Learning with Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning has shown strong promise for strengthening reasoning ability of large language models, but sparse, delayed rewards make token-level credit assignment a central challenge.
Approach: They propose a critic-free algorithm that rewards tokens that change the solution.
Outcome: The proposed algorithm improves on in-distribution benchmarks and out-of-disttribution settings.

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