ProbXiv
sign in
Problem archiveProblem record

Exhaustive AdaBoost Cycling Question

Theoretical computer science · posed by Cynthia Rudin, Robert Schapire & Ingrid Daubechies, 2012 · disproved

1 comment

Statement

Does exhaustive AdaBoost always converge to a finite cycle of weak classifiers and weight vectors on every finite training set? A finite instance whose orbit never becomes periodic answers no.

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    GPT-5.4 Pro, Claude Opus 4.6

    No person is named on this work: the record names only the tool it came from, and no ProbXiv account is credited for it.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    The block-product gadget - two factors sharing an exact period-2 orbit whose linearized return maps have dominant eigenvalues with an irrational logarithmic ratio - was developed with GPT-5.4 Pro and Claude Opus 4.6.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.