Skip to content
OpenTrain AIFor AI Companies
← Back to explorer

PaT: Planning-after-Trial for Efficient Test-Time Code Generation

Youngsik Yoon, Sungjae Lee, Seockbean Song, Siwei Wang, Wei Chen, Jungseul Ok · May 8, 2026 · Citations: 0

How to use this page

Provisional trust

This page is a lightweight research summary built from the abstract and metadata while deeper extraction catches up.

Best use

Background context only

What to verify

Read the full paper before copying any benchmark, metric, or protocol choices.

Evidence quality

Provisional

Derived from abstract and metadata only.

Abstract

Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs). However, most existing methods adopt a rigid Planning-before-Trial (PbT) policy, which inefficiently allocates test-time compute by incurring planning overhead even on directly solvable problems. We propose Planning-after-Trial (PaT), an adaptive policy for code generation that invokes a planner only upon verification failure. This adaptive policy naturally enables a heterogeneous model configuration: a cost-efficient model handles generation attempts, while a powerful model is reserved for targeted planning interventions. Empirically, across multiple benchmarks and model families, our approach significantly advances the cost-performance Pareto frontier. Notably, our heterogeneous configuration achieves performance comparable to a large homogeneous model while reducing inference cost by approximately 69\%.

Abstract-only analysis — low confidence

All signals on this page are inferred from the abstract only and may be inaccurate. Do not use this page as a primary protocol reference.

  • This page is still relying on abstract and metadata signals, not a fuller protocol read.

Should You Rely On This Paper?

Signal extraction is still processing. This page currently shows metadata-first guidance until structured protocol fields are ready.

Best use

Background context only

Use if you need

A provisional background reference while structured extraction finishes.

Main weakness

This page is still relying on abstract and metadata signals, not a fuller protocol read.

Trust level

Provisional

Usefulness score

Unavailable

Eval-fit score is unavailable until extraction completes.

Human Feedback Signal

Not explicit in abstract metadata

Evaluation Signal

Weak / implicit signal

Usefulness for eval research

Provisional (processing)

Extraction confidence 0%

What We Could Verify

These are the protocol signals we could actually recover from the available paper metadata. Use them to decide whether this paper is worth deeper reading.

Human Feedback Types

provisional (inferred)

None explicit

No explicit feedback protocol extracted.

"Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs)."

Evaluation Modes

provisional (inferred)

None explicit

Validate eval design from full paper text.

"Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs)."

Quality Controls

provisional (inferred)

Not reported

No explicit QC controls found.

"Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs)."

Benchmarks / Datasets

provisional (inferred)

Not extracted

No benchmark anchors detected.

"Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs)."

Reported Metrics

provisional (inferred)

Not extracted

No metric anchors detected.

"Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs)."

Rater Population

provisional (inferred)

Unknown

Rater source not explicitly reported.

"Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs)."

Human Feedback Details

This page is using abstract-level cues only right now. Treat the signals below as provisional.

  • Potential human-data signal: No explicit human-data keywords detected.
  • Potential benchmark anchors: No benchmark names detected in abstract.
  • Abstract highlights: 3 key sentence(s) extracted below.

Evaluation Details

Evaluation fields are inferred from the abstract only.

  • Potential evaluation modes: No explicit eval keywords detected.
  • Potential metric signals: No metric keywords detected.
  • Confidence: Provisional (metadata-only fallback).

Research Brief

Metadata summary

Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs).

Based on abstract + metadata only. Check the source paper before making high-confidence protocol decisions.

Key Takeaways

  • Beyond training-time optimization, scaling test-time computation has emerged as a key paradigm to extend the reasoning capabilities of Large Language Models (LLMs).
  • However, most existing methods adopt a rigid Planning-before-Trial (PbT) policy, which inefficiently allocates test-time compute by incurring planning overhead even on directly solvable problems.
  • We propose Planning-after-Trial (PaT), an adaptive policy for code generation that invokes a planner only upon verification failure.

Researcher Actions

  • Compare this paper against nearby papers in the same arXiv category before using it for protocol decisions.
  • Check the full text for explicit evaluation design choices (raters, protocol, and metrics).
  • Use related-paper links to find stronger protocol-specific references.

Caveats

  • Generated from abstract + metadata only; no PDF parsing.
  • Signals below are heuristic and may miss details reported outside the abstract.

Recommended Queries

Related Papers

Papers are ranked by protocol overlap, extraction signal alignment, and semantic proximity.

No related papers found for this item yet.