MetaPS: Adaptive Programmatic Strategy Selection for Market Agents

• URL: http://arxiv.org/abs/2606.22385v1
• Date: Sun, 21 Jun 2026 08:22:23 GMT
• Title: MetaPS: Adaptive Programmatic Strategy Selection for Market Agents
• Abstract summary: We propose textbfMetaPS, a simulation-guided framework for adaptive programmatic strategy selection.<n> MetaPS rolls out candidate strategies in simulated or backtested markets, identifies states where particular strategies lead to better future outcomes, and converts these state--strategy pairs into supervised fine-tuning data.<n>Experiments on multi-stock trading and a controlled goods-exchange sandbox show that MetaPS consistently improves across model scales from 0.8B to 9B parameters.
• Score: 29.0862253154432
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: No single market strategy always wins: momentum, mean reversion, risk control,and event-driven rules can each succeed or fail as market conditions change.Rather than asking large language models to directly generate market actions,we study an executable decision paradigm where an agent selects from a library of programmatic strategies, each implemented as a code module mapping market observations to actions.We propose \textbf{MetaPS}, a simulation-guided framework for adaptive programmatic strategy selection. MetaPS rolls out candidate strategies in simulated or backtested markets, identifies states where particular strategies lead to better future outcomes, and converts these state--strategy pairs into supervised fine-tuning data. During inference, the simulator is no longer queried: MetaPS observes only the current market state and candidate strategy context, selects a suitable strategy program, and the selected program produces the final action. Experiments on multi-stock trading and a controlled goods-exchange sandbox show that MetaPS consistently improves across model scales from 0.8B to 9B parameters. It outperforms fixed-strategy baselines, direct decision-making agents, and prompted API-based LLM agents; in several settings, compact fine-tuned models even surpass stronger API models. These results demonstrate that market simulations can provide scalable and targeted supervision for learning adaptive, interpretable, and executable strategy selection.

Related papers

• EVOQUANT: Self-Evolving Verifier-Guided Strategy Optimization for Robust Quantitative Trading [24.38446478098508]
  EVOQUANT is a self-Evolving Verifier-guided framework for strategy optimization in Quantitative trading.<n>Our method generates semantically controlled candidate edits, selects the best strategy through a multi-stage verification pipeline.<n> Experimental results show that our method significantly improves the Sharpe ratio across all tested strategies.
  arXiv  Detail & Related papers  (2026-07-14T07:34:01Z)
• Beyond Trajectory Imitation: Strategy-Guided Policy Optimization for LLM Reasoning [76.93011742289768]
  Distilling reasoning capabilities from strong to weak language models typically involves imitating specific solution trajectories.<n>This trajectory-level imitation encourages memorization of instance-specific steps rather than acquisition of transferable problem-solving skills.<n>We propose Strategy-Guided Policy Optimization, which replaces instance-level trajectory imitation with reusable strategy distillation.
  arXiv  Detail & Related papers  (2026-06-23T02:14:12Z)
• Strategy Executability in Mathematical Reasoning: Leveraging Human-Model Differences for Effective Guidance [86.46794021499511]
  We show a previously underexplored gap between strategy usage and strategy executability.<n>We propose Selective Strategy Retrieval (SSR), a test-time framework that explicitly models executability.<n> SSR yields reliable and consistent improvements over direct solving, in-context learning, and single-source guidance.
  arXiv  Detail & Related papers  (2026-02-26T03:34:23Z)
• Experience-Guided Adaptation of Inference-Time Reasoning Strategies [49.954515048847874]
  Experience-Guided Reasoner (EGuR) generates tailored strategies at inference time based on accumulated experience.<n>EGuR achieves up to 14% accuracy improvements over the strongest baselines while reducing computational costs by up to 111x.
  arXiv  Detail & Related papers  (2025-11-14T17:45:28Z)
• Plan before Solving: Problem-Aware Strategy Routing for Mathematical Reasoning with LLMs [49.995906301946]
  Existing methods usually leverage a fixed strategy to guide Large Language Models (LLMs) to perform mathematical reasoning.<n>Our analysis reveals that the single strategy cannot adapt to problem-specific requirements and thus overlooks the trade-off between effectiveness and efficiency.<n>We propose Planning and Routing through Instance-Specific Modeling (PRISM), a novel framework that decouples mathematical reasoning into two stages: strategy planning and targeted execution.
  arXiv  Detail & Related papers  (2025-09-29T07:22:41Z)
• Counterfactual Strategies for Markov Decision Processes [3.42834279186368]
  We introduce counterfactual strategies for Markov Decision Processes (MDPs)<n>During MDP execution, a strategy decides which of the enabled actions to execute next.<n>We identify minimal changes to the initial strategy to reduce that probability below the limit.
  arXiv  Detail & Related papers  (2025-05-14T14:07:27Z)
• SPIO: Ensemble and Selective Strategies via LLM-Based Multi-Agent Planning in Automated Data Science [1.1343849658875087]
  Large Language Models (LLMs) have revolutionized automated data analytics and machine learning by enabling dynamic reasoning and adaptability.<n>We propose SPIO, a novel framework that orchestrates multi-agent planning across four key modules.<n>In each module, dedicated planning agents independently generate candidate strategies that cascade into subsequent stages, fostering comprehensive exploration.
  arXiv  Detail & Related papers  (2025-03-30T04:45:32Z)
• EPO: Explicit Policy Optimization for Strategic Reasoning in LLMs via Reinforcement Learning [69.55982246413046]
  We propose explicit policy optimization (EPO) for strategic reasoning.<n>We train the strategic reasoning model via multi-turn reinforcement learning (RL),utilizing process rewards and iterative self-play.<n>Our findings reveal various collaborative reasoning mechanisms emergent in EPO and its effectiveness in generating novel strategies.
  arXiv  Detail & Related papers  (2025-02-18T03:15:55Z)
• Optimal Execution with Reinforcement Learning [0.15469452301122175]
  This study investigates the development of an optimal execution strategy through reinforcement learning.<n>We present a custom MDP formulation followed by the results of our methodology and benchmark the performance against standard execution strategies.<n>Results show that the reinforcement learning agent outperforms standard strategies and offers a practical foundation for real-world trading applications.
  arXiv  Detail & Related papers  (2024-11-10T08:21:03Z)
• SMART: Self-learning Meta-strategy Agent for Reasoning Tasks [44.45037694899524]
  We introduce SMART (Self-learning Meta-strategy Agent for Reasoning Tasks), a novel framework that enables LMs to learn and select the most effective strategies for various reasoning tasks. We model the strategy selection process as a Markov Decision Process and leverage reinforcement learning-driven continuous self-improvement. Our experiments demonstrate that SMART significantly enhances the ability of models to choose optimal strategies without external guidance.
  arXiv  Detail & Related papers  (2024-10-21T15:55:04Z)
• Universal Trading for Order Execution with Oracle Policy Distillation [99.57416828489568]
  We propose a novel universal trading policy optimization framework to bridge the gap between the noisy yet imperfect market states and the optimal action sequences for order execution. We show that our framework can better guide the learning of the common policy towards practically optimal execution by an oracle teacher with perfect information.
  arXiv  Detail & Related papers  (2021-01-28T05:52:18Z)
• Improved active output selection strategy for noisy environments [0.0]
  The test bench time needed for model-based calibration can be reduced with active learning methods for test design. This paper presents an improved strategy for active output selection.
  arXiv  Detail & Related papers  (2021-01-10T08:27:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.