pith. sign in

arxiv: 2406.04268 · v1 · pith:GP2F4BISnew · submitted 2024-06-06 · 💻 cs.LG · cs.AI

Open-Endedness is Essential for Artificial Superhuman Intelligence

classification 💻 cs.LG cs.AI
keywords foundationmodelsopen-endednesssystemsartificialessentialintelligenceopen-ended
0
0 comments X
read the original abstract

In recent years there has been a tremendous surge in the general capabilities of AI systems, mainly fuelled by training foundation models on internetscale data. Nevertheless, the creation of openended, ever self-improving AI remains elusive. In this position paper, we argue that the ingredients are now in place to achieve openendedness in AI systems with respect to a human observer. Furthermore, we claim that such open-endedness is an essential property of any artificial superhuman intelligence (ASI). We begin by providing a concrete formal definition of open-endedness through the lens of novelty and learnability. We then illustrate a path towards ASI via open-ended systems built on top of foundation models, capable of making novel, humanrelevant discoveries. We conclude by examining the safety implications of generally-capable openended AI. We expect that open-ended foundation models will prove to be an increasingly fertile and safety-critical area of research in the near future.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. OctoT2I: A Self-Evolving Agentic Text-to-Image Router

    cs.AI 2026-06 unverdicted novelty 7.0

    OctoT2I uses a no-supervision PSEL loop to discover model capability frontiers and route T2I tasks, reaching 0.96 GenEval score with 90.3% speedup over Flow-GRPO.

  2. What Do Evolutionary Coding Agents Evolve?

    cs.NE 2026-05 unverdicted novelty 7.0

    Evolutionary coding agents achieve most benchmark gains through a small subset of edit types and by cycling previously deleted code lines rather than developing new algorithmic structures.

  3. Scale-Dependent Collective Adaptation in Self-Amending LLM Societies: A Cross-Family Study of Emergent Governance

    nlin.AO 2026-05 unverdicted novelty 7.0

    LLM societies in Nomic show non-monotonic collective adaptation peaking at mid-scales, with smaller models rule-inert and larger ones restrictive.

  4. Improving Zero-Shot Offline RL via Behavioral Task Sampling

    cs.AI 2026-04 unverdicted novelty 6.0

    Extracting task vectors from the offline dataset for policy training improves zero-shot offline RL performance by an average of 20% over random sampling baselines.

  5. Improving Zero-Shot Offline RL via Behavioral Task Sampling

    cs.AI 2026-04 unverdicted novelty 5.0

    Extracting task vectors from offline data to define training task distributions improves zero-shot offline RL performance by an average of 20%.

  6. Naturalistic Computational Cognitive Science: Towards generalizable models and theories that capture the full range of natural behavior

    q-bio.NC 2025-02 unverdicted novelty 4.0

    Advocates integrating naturalistic paradigms and AI progress into cognitive science to develop generalizable models of natural behavior while retaining experimental control and theoretical insight.

  7. Naturalistic Computational Cognitive Science: Towards generalizable models and theories that capture the full range of natural behavior

    q-bio.NC 2025-02 unverdicted novelty 3.0

    Position paper advocating integration of naturalistic paradigms and AI models to create generalizable theories of natural human behavior and cognition.