2h ago

Researcher Stresses PTB Remains Hard Under Generic Prompt Constraints

0
Original post

@xeophon it depends on *how* PTB gets solved. i think it should still be pretty hard in our original framing, in which the main prompt remains generic, i.e., without hardcoded methods (e.g., "Use SFT and then RL") or datasets (e.g., use OpenThoughts) and where the agent has only 10h.

9:22 AM · May 17, 2026 View on X

@xeophon it depends on *how* PTB gets solved. i think it should still be pretty hard in our original framing, in which the main prompt remains generic, i.e., without hardcoded methods (e.g., "Use SFT and then RL") or datasets (e.g., use OpenThoughts) and where the agent has only 10h.

Florian BrandFlorian Brand@xeophon

@maksym_andr Solving PTB should be rather easy, imo

4:18 PM · May 17, 2026 · 251 Views
4:22 PM · May 17, 2026 · 137 Views

@maksym_andr Yeah I think you can train models to be better at exploration, which means it’ll do those things without being prompted specifically

Maksym AndriushchenkoMaksym Andriushchenko@maksym_andr

@xeophon it depends on *how* PTB gets solved. i think it should still be pretty hard in our original framing, in which the main prompt remains generic, i.e., without hardcoded methods (e.g., "Use SFT and then RL") or datasets (e.g., use OpenThoughts) and where the agent has only 10h.

4:22 PM · May 17, 2026 · 137 Views
4:35 PM · May 17, 2026 · 54 Views
Researcher Stresses PTB Remains Hard Under Generic Prompt Constraints · Digg