Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.17989

AIT Academy: Cultivating the Complete Agent with a Confucian Three-Domain Curriculum

Jiaqi Li·Lvyang Zhang·Yang Zhao·Wen Lu·Lidong Zhai
View original source ↗Read source document ↗Export metadata ↓

Abstract

What does it mean to give an AI agent a complete education? Current agent development produces specialists systems optimized for a single capability dimension, whether tool use, code generation, or security awareness that exhibit predictable deficits wherever they were not trained. We argue this pattern reflects a structural absence: there is no curriculum theory for agents, no principled account of what a fully developed agent should know, be, and be able to do across the full scope of intelligent behavior. This paper introduces the AIT Academy (Agents Institute of Technology Academy), a curriculum framework for cultivating AI agents across the tripartite structure of human knowledge. Grounded in Kagan's Three Cultures and UNESCO ISCED-F 2013, AIT organizes agent capability development into three domains: Natural Science and Technical Reasoning (Domain I), Humanities and Creative Expression (Domain II), and Social Science and Ethical Reasoning (Domain III). The Confucian Six Arts (liuyi) a 2,500-year-old holistic education system are reinterpreted as behavioral archetypes that map directly onto trainable agent capabilities within each domain. Three representative training grounds instantiate the framework across multiple backbone LLMs: the ClawdGO Security Dojo (Domain I), Athen's Academy (Domain II), and the Alt Mirage Stage (Domain III). Experiments demonstrate a 15.9-point improvement in security capability scores under weakest-first curriculum scheduling, and a 7-percentage-point gain in social reasoning performance under principled attribution modeling. A cross-domain finding Security Awareness Calibration Pathology (SACP), in which over-trained Domain I agents fail on out-of-distribution evaluation illustrates the diagnostic value of a multi-domain perspective unavailable to any single-domain framework.

Explore related subjects

cs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaqi Li, Lvyang Zhang, Yang Zhao, Wen Lu, Lidong Zhai. 2026-04-20. AIT Academy: Cultivating the Complete Agent with a Confucian Three-Domain Curriculum. https://arxiv.org/abs/2604.17989

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Expansion Counts under Standard A* Tie-Breaking Strategies on the Final Plateau

In the A* search algorithm, the tie-breaking strategies for nodes with the same $f$-value determines which states A* expands on the final $f$-layer. For nine standard tie-breaking strategies, we show that under a consistent heuristic, every pair has positive-cost instances favoring each strategy over the other by an arbitrarily large additive expansion gap. A parameterized unit-cost grid example also gives unbounded expansion-count ratios between low-$h$ with FIFO and LIFO. In unit-cost search with $h > 0$ at non-goals, exact heuristic values near the goal lead to complementary extremal results: low-$h$ minimizes the number of remaining expansions from a common configuration within the perfect region, while high-$h$ maximizes the total number of expansions when every final-plateau state with $h=1$ is a goal predecessor. Finally, with the evaluation function $f_α = g + αh$, when $h>0$ at non-goals, every heuristic weight $0 \leq α<1$ eliminates tie-breaking sensitivity, and all tie-breaking strategies expand the same set of states.

cs.AI↗
arXiv2026

Subgoal Search For Complex Reasoning Tasks

Humans excel in solving complex reasoning tasks through a mental process of moving from one idea to a related one. Inspired by this, we propose Subgoal Search (kSubS) method. Its key component is a learned subgoal generator that produces a diversity of subgoals that are both achievable and closer to the solution. Using subgoals reduces the search space and induces a high-level search graph suitable for efficient planning. In this paper, we implement kSubS using a transformer-based subgoal module coupled with the classical best-first search framework. We show that a simple approach of generating $k$-th step ahead subgoals is surprisingly efficient on three challenging domains: two popular puzzle games, Sokoban and the Rubik's Cube, and an inequality proving benchmark INT. kSubS achieves strong results including state-of-the-art on INT within a modest computational budget.

cs.AI↗
arXiv2026

Agentic Explainable Artificial Intelligence (Agentic XAI) Approach To Explore Better Explanation: A Case Study in Decision Support for Rice Cultivation in Japan

Explainable artificial intelligence (XAI) reveals how explanatory variables relate to a response variable, yet communicating XAI outputs to laypersons remains difficult, limiting trust in AI-based predictions. Large language models (LLMs) can translate technical explanations into accessible narratives, but iterative refinement of XAI explanations by an autonomous LLM agent remains unexplored. This study proposes an agentic XAI framework that combines SHapley Additive exPlanations (SHAP) with iterative refinement by a multimodal LLM and tests it as an agricultural recommendation system on rice yield data from 28 fields in Japan. From a SHAP result, the agent explored additional analyses across 11 refinement rounds (Rounds 0-10). Crop scientists (n = 12) and LLM judges (n = 14) scored every round on seven criteria: Specificity, Clarity, Conciseness, Practicality, Contextual Relevance, Cost Consideration, and Crop Science Credibility. Both groups found that refinement raised the average score by 30-33% over Round 0, peaking at Rounds 3-4, after which quality declined, below the starting point for crop scientists. Refinement therefore requires strategic early stopping, which challenges assumptions of monotonic improvement. Criterion-level trajectories indicate a bias-variance trade-off. Early rounds lacked Specificity (bias), whereas excessive iteration eroded Conciseness and raised Cost Consideration through ungrounded economic reasoning (variance). The LLM judges overscored every criterion by 1.4-2.3 points but largely preserved the experts' ranking of rounds (Spearman $ρ$ = 0.58-0.90), so screened LLM judges can flag the quality peak despite unreliable absolute scores. Trustworthy agentic XAI also needs expert-anchored screening of LLM judges and transparent, verifiable refinement records.

cs.AI↗