AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Adaptive Random Forests from Online Learning and Testing by Betting

Salim I. Amoukou, Saumitra Mishra, Manuela Veloso

NeurIPS 2026 · Bandits and online learning › Online convex optimization and games · approach: Parameter-free non-stationary online learning

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Revisits Adaptive Random Forests for non-stationary data streams from an online learning view, replacing heuristic drift detectors and reset rules with principled components.

Problem

Adaptive Random Forests rely on heuristic drift detectors and reset rules that lack formal guarantees and need careful tuning when learning from non-stationary data streams.

Approach

Decomposes ARF design into online learning subproblems (aggregating a dynamically evolving set of trees, and deciding when to reset trees), and addresses drift handling via testing by betting, giving formal guarantees instead of heuristics.

Experimental setup

Baselines: Adaptive Random Forests

Builds on: Adaptive Random Forests

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy