arXiv: cs.AI preprintsInternational11 November 2026
Minimax Rates and Spectral Distillation for Tree Ensembles
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:2605.11841v3 Announce Type: replace-cross Abstract: Tree ensembles such as random forests (RFs) and gradient boosting machines (GBMs) are among the most widely used supervised learners, yet their theoretical properties remain incompletely understood. We adopt a spectral perspective on these algorithms, with two main contributions. First, we derive minimax-optimal convergence for RF regression, showing that, under mild regularity conditions on tree growth, the eigenvalue decay of the induced kernel operator governs the statistical rate. Second, we exploit this spectral viewpoint to develo
Read the official announcement
Opens arxiv.org
More from arXiv: cs.AI preprints
- Auditable Human-Agent Teams for Autonomous X-ray Experimentation11 November 2026
- EarthRecord: From Pixels to Land Change with Multimodal Agents over Four Decades of Satellite Imagery11 November 2026
- Train on prefill, monitor at decode: Using sparse autoencoders for topic monitoring11 November 2026
- LandslideFM: A Foundation Model Towards Unified Landslide Perception and Understanding11 November 2026
- Tracing Psychometric Inference in Large Language Models11 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.