arXiv: cs.AI preprintsInternational20 November 2026
JEPA as a Transferable Optimizer: Learning and Understanding Black-Box Optimization from Reward-Agnostic Pretraining
This is an official announcement record
Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2611.23608v1 Announce Type: cross Abstract: Black-box optimization evaluates candidates through simulations, rollouts, or experiments, often without gradients. Learned optimizers are usually judged by whether they outperform existing methods. We ask a complementary question: what information does a learned optimizer use from its search history? We introduce JEPA-PS (JEPA Policy Search), based on a Joint-Embedding Predictive Architecture. It is pretrained on random rollouts using parameter vectors and scalar returns. Its latent-prediction objective predicts the next point in an optimizati
Read the official announcement
Opens arxiv.org
More from arXiv: cs.AI preprints
- Human-AI Mutualism Is Unstable under Capability Asymmetry20 November 2026
- Training Language Models for Introspective Oversight20 November 2026
- Where the Tokens Go: Heat, Entropy and Error in Agentic Coding20 November 2026
- HardwareDx: A Foundational Graph Model System for Datacenter Machine Repairs20 November 2026
- RFBench: A Simulator-Grounded Multimodal Benchmark for Passive RF Layout Design and Understanding20 November 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.