Stephen Lau
Author directory2026
FinLCR: Scaling Financial Long-Context Reasoning via Curriculum Reinforcement Learning
Wenjie Qiu | Yong Xie | Karan Aggarwal | Aitzaz Ahmad | Stephen Lau
Proceedings of the 11th Workshop on Financial Technology and Natural Language Processing
Wenjie Qiu | Yong Xie | Karan Aggarwal | Aitzaz Ahmad | Stephen Lau
Proceedings of the 11th Workshop on Financial Technology and Natural Language Processing
Long-context financial document understanding and reasoning pose significant challenges for small language models (SLMs). In this paper, we scale the financial long-context reasoning capability of SLMs through reinforcement learning. Specifically, we propose an efficient curriculum reinforcement learning recipe that features staged training across context lengths and difficulty-aware data sampling. To support our curriculum recipe, we curate Fin-Ladder, a difficulty-graded financial corpus spanning diverse datasets and context lengths. We apply the proposed corpus and recipe to train Financial Long-Context Reasoner (FinLCR), a 4-billion parameter model with enhanced financial reasoning capabilities. Experiments demonstrate that our curriculum learning recipe yields superior performance on financial numerical reasoning benchmarks.
Learning from Contrastive Prompts: An Automated Prompt Optimization Framework
Mingqi Li | Karan Aggarwal | Yong Xie | Aitzaz Ahmad | Stephen Lau
Findings of the Association for Computational Linguistics: ACL 2026
Mingqi Li | Karan Aggarwal | Yong Xie | Aitzaz Ahmad | Stephen Lau
Findings of the Association for Computational Linguistics: ACL 2026
As large language models (LLMs) continue to advance, significant effort is spent on manually crafting prompts to unlock their full potential. While existing prompt optimization methods automate this process, they often underperform due to their reliance on learning exclusively from incorrect samples. We propose the Learning from Contrastive Prompts (LCP) framework, which leverages contrastive prompts to distinguish between high- and low-performing cases. By identifying and amplifying the differences that make prompts effective, LCP systematically extracts principles underlying successful prompt design. On the Big-Bench Hard benchmark, LCP achieves an 87.5% win rate on Claude-3-Sonnet and 75.7% on Claude-4-Sonnet. Experiments on DeepSeek-R1 (88.2% win rate) and SuperGLUE further confirm that LCP generalizes across both proprietary and open-source models and diverse NLU benchmarks.The framework offers a principled and scalable foundation for automated prompt engineering, reducing manual intervention in adapting LLMs to diverse applications.