SWE-Future: Forecast-Conditioned Data Synthesis for Future-Oriented Software Engineering Agents

• URL: http://arxiv.org/abs/2606.18733v1
• Date: Wed, 17 Jun 2026 06:22:28 GMT
• Title: SWE-Future: Forecast-Conditioned Data Synthesis for Future-Oriented Software Engineering Agents
• Abstract summary: We propose SWE-Future, a forecast-conditioned data synthesis method for future-oriented coding tasks.<n>We show that SWE-Future can guide realistic, future-oriented coding-task synthesis while reducing direct dependence on historical pull-request replay.
• Score: 7.478327602641997
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Realistic coding-agent benchmarks often replay public GitHub issues and pull requests, making them vulnerable to overlap with model pretraining, fine-tuning, synthetic-data generation, or benchmark-driven model selection. Fully synthetic tasks avoid direct historical replay, but can drift away from real repository needs. We propose SWE-Future, a forecast-conditioned data synthesis method for future-oriented coding tasks. Given a forecast snapshot at time $T_0$, the method uses only pre-$T_0$ repository evidence to forecast future feature implementation/enhancement, bugfix, and refactor task families. We first validate this forecasting step retrospectively: after forecasts are fixed, later pull requests are used only to measure whether the predicted task families match future repository work. In an 80-repository study, the forecaster achieves 58.1\% future-work relevance under the main semantic matching metric. We then use validated forecast families as conditioning signals to synthesize a 200-task coding-agent dataset across 61 repositories from a task-generation snapshot, rather than replaying the later pull requests used for validation. SWE-Future shows that repository-evolution forecasts can guide realistic, future-oriented coding-task synthesis while reducing direct dependence on historical pull-request replay.

Related papers

• Model-Based Reinforcement Learning for Heterogeneous Multi-Robot Task Assignment Under Distribution Shifts [7.0997001670112185]
  Heterogeneous multi-robot service systems must assign requests to compatible robots, construct feasible schedules, and adapt as new tasks arrive online.<n>We develop a prediction-aware adaptive rollout framework for heterogeneous multi-robot task assignment with scheduled and real-time requests.
  arXiv  Detail & Related papers  (2026-08-21T18:44:05Z)
• Predicting Acceptance and Review Effort in Human and Agent Pull Requests [6.709069732781736]
  Pull requests (PRs) are a central mechanism for reviewing and integrating code changes in modern software repositories.<n>This paper studies whether outcomes can be estimated at the time a PR is opened, before reviewer discussion, CI feedback, or merge decisions are available.<n>We construct a leakage-aware prediction pipeline for human- and agent-authored PRs.
  arXiv  Detail & Related papers  (2026-07-13T18:18:27Z)
• LEAF: A Living Benchmark for Event-Augmented Forecasting [78.94019460534442]
  LEAF is the first living benchmark for event-augmented forecasting tasks.<n>We evaluate state-of-the-art proprietary and open-weight LLMs.<n>We find that LLMs achieve better performance on equities they confidently identify as more predictable.
  arXiv  Detail & Related papers  (2026-05-09T03:17:59Z)
• Can We Predict Before Executing Machine Learning Agents? [74.39460101251792]
  We formalize the task of Data-centric Solution Preference and construct a comprehensive corpus of 18,438 pairwise comparisons.<n>We demonstrate that LLMs exhibit significant predictive capabilities when primed with a Verified Data Analysis Report.<n>We instantiate this framework in FOREAGENT, an agent that employs a Predict-then-Verify loop, achieving a 6x acceleration in convergence while surpassing execution-based baselines by +6%.
  arXiv  Detail & Related papers  (2026-01-09T16:44:17Z)
• Scaling Open-Ended Reasoning to Predict the Future [56.672065928345525]
  We train language models to make predictions on open-ended forecasting questions.<n>To scale up training data, we synthesize novel forecasting questions from global events reported in daily news.<n>We find calibration improvements from forecasting training generalize across popular benchmarks.
  arXiv  Detail & Related papers  (2025-12-31T18:59:51Z)
• SynDelay: A Synthetic Dataset for Delivery Delay Prediction [50.56729406793283]
  We present SynDelay, a synthetic dataset designed for delivery delay prediction.<n>It is publicly available through the Supply Chain Data Hub, an open initiative promoting dataset sharing and benchmarking in supply chain AI.
  arXiv  Detail & Related papers  (2025-08-30T21:54:37Z)
• Bench to the Future: A Pastcasting Benchmark for Forecasting Agents [0.14980193397844666]
  Bench To the Future is a "pastcasting" benchmark with hundreds of high-quality questions for which the resolution is already known.<n>Results suggest that our pastcasting environment can produce results comparable to those based on forecasts using the internet on at-the-time unresolved questions.<n>We intend this to be a living benchmark, with new questions added continually to account for increasing training data cutoff dates.
  arXiv  Detail & Related papers  (2025-06-11T16:18:40Z)
• Wisdom of the Crowds in Forecasting: Forecast Summarization for Supporting Future Event Prediction [17.021220773165016]
  Future Event Prediction (FEP) is an essential activity whose demand and application range across multiple domains.<n>One forecasting way is to gather and aggregate collective opinions on the future to make predictions as cumulative perspectives carry the potential to help estimating the likelihood of upcoming events.<n>In this work, we organize the existing research and frameworks that aim to support future event prediction based on crowd wisdom through aggregating individual forecasts.
  arXiv  Detail & Related papers  (2025-02-12T08:35:10Z)
• A Predictive Approach To Enhance Time-Series Forecasting [6.377828331013327]
  We introduce Future-Guided Learning, an approach that enhances time-series event forecasting.<n>Our method involves two models: a detection model that analyzes future data to identify critical events and a forecasting model that predicts these events based on current data.<n>We validate our approach on a variety of tasks, demonstrating a 44.8% increase in AUC-ROC for seizure prediction using EEG data, and a 23.4% reduction in MSE for forecasting in nonlinear dynamical systems.
  arXiv  Detail & Related papers  (2024-10-19T21:22:55Z)
• Back2Future: Leveraging Backfill Dynamics for Improving Real-time Predictions in Future [73.03458424369657]
  In real-time forecasting in public health, data collection is a non-trivial and demanding task. 'Backfill' phenomenon and its effect on model performance has been barely studied in the prior literature. We formulate a novel problem and neural framework Back2Future that aims to refine a given model's predictions in real-time.
  arXiv  Detail & Related papers  (2021-06-08T14:48:20Z)
• ForecastQA: A Question Answering Challenge for Event Forecasting with Temporal Text Data [43.400630267599084]
  Event forecasting is a challenging, yet important task, as humans seek to constantly plan for the future. We formulate a task, construct a dataset, and provide benchmarks for developing methods for event forecasting with large volumes of unstructured text data. We present our experiments on ForecastQA using BERT-based models and find that our best model achieves 60.1% accuracy on the dataset, which still lags behind human performance by about 19%.
  arXiv  Detail & Related papers  (2020-05-02T11:03:40Z)
• Ambiguity in Sequential Data: Predicting Uncertain Futures with Recurrent Models [110.82452096672182]
  We propose an extension of the Multiple Hypothesis Prediction (MHP) model to handle ambiguous predictions with sequential data. We also introduce a novel metric for ambiguous problems, which is better suited to account for uncertainties.
  arXiv  Detail & Related papers  (2020-03-10T09:15:42Z)

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.