arXiv AI June 9, 2026 By Minwei Kong, Ao Qu, Xiaotong Guo, Wenbin Ouyang, Chonghe Jiang, Han Zheng, Yining Ma, Dingyi Zhuang, Yuhan Tang, Junyi Li, Shenhao Wang, Haris Koutsopoulos, Hai Wang, Cathy Wu, Jinhua Zhao

AlphaOPT: Formulating Optimization Programs with Self-Improving LLM Experience Library

Read the original on arXiv AI →

arXiv:2510. 18428v4 Announce Type: replace Abstract: Optimization modeling underlies critical decision-making across industries, yet remains difficult to automate: natural-language problem descriptions must be translated into precise mathematical formulations and executable solver code.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.

arXiv Machine Learning

Jun 17

Continual Self-Improvement with Lightweight Experiential Latent Memories

arXiv:2606. 17803v1 Announce Type: new Abstract: Large language models achieve strong reasoning performance by scaling inference-time compute, yet remain fundamentally stateless, discarding the rich, self-produced reasoning traces generated during this process.

By Vaggelis Dorovatas, Nancy Kalaj, Rahaf Aljundi

llms reinforcement-learning benchmarks

arXiv Machine Learning

Jul 9

MILES: Modular Instruction Memory with Learnable Selection for Self-Improving LLM Reasoning

arXiv:2607. 06974v1 Announce Type: cross Abstract: Large language models (LLMs) increasingly improve their reasoning at test time via additional computation, yet most existing works treat each problem in isolation.

By Ruilin Tong, Dong Gong

llms rag

arXiv AI

Jun 11

GPO: Learning from Critical Steps to Improve LLM Reasoning

arXiv:2509. 16456v3 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used in various domains, showing impressive potential on different tasks.

By Jiahao Yu, Zelei Cheng, Xian Wu, Xinyu Xing

llms fine-tuning benchmarks

arXiv AI

Jun 6

ReTreVal: Reasoning Tree with Validation and Cross-Problem Memory for Large Language Models

arXiv:2601. 02880v2 Announce Type: replace Abstract: Every existing inference-time reasoning framework discards all failure context at problem boundaries, leaving a model solving problem 500 no wiser than it was on problem 1.

By Abhishek HS, Pavan C Shekar, Arpit Jain, Ashwanth Krishnan

llms fine-tuning benchmarks

arXiv AI

Jun 12

LLMs as ASP Programmers: Self-Correction Enables Task-Agnostic Nonmonotonic Reasoning

arXiv:2604. 27960v2 Announce Type: replace Abstract: Recent large language models (LLMs) have achieved impressive reasoning milestones but continue to struggle with high computational costs, logical inconsistencies, and sharp performance degradation on high-complexity problems.

By Adam Ishay, Joohyung Lee

llms benchmarks

Hugging Face Trending Papers

Jul 8

MILES: Modular Instruction Memory with Learnable Selection for Self-Improving LLM Reasoning

Large language models (LLMs) increasingly improve their reasoning at test time via additional computation, yet most existing works treat each problem in isolation. When problems arrive sequentially, accumulating reusable experience across them can further improve performance.

llms rag

Related stories

Continual Self-Improvement with Lightweight Experiential Latent Memories

MILES: Modular Instruction Memory with Learnable Selection for Self-Improving LLM Reasoning

GPO: Learning from Critical Steps to Improve LLM Reasoning

ReTreVal: Reasoning Tree with Validation and Cross-Problem Memory for Large Language Models

LLMs as ASP Programmers: Self-Correction Enables Task-Agnostic Nonmonotonic Reasoning

MILES: Modular Instruction Memory with Learnable Selection for Self-Improving LLM Reasoning