arXiv Machine Learning

Surrogate Graph Partitioning for Spatial Prediction

The paper introduces a method called Surrogate Graph Partitioning for Spatial Prediction, which constructs spatial segments by minimizing within-segment prediction variance. The assignment of points to segments is framed as a mixed‑integer quadratic programming problem, but due to its high computational cost, an approximation scheme based on graph partitioning properties is proposed. Experiments show that this approximation efficiently identifies spatial segments.

arXiv Statistics ML
Oct 9

Twoblock clustering trees with coskewness-based dimension reduction: recovering piecewise multivariate linear regimes

The paper introduces the twoblock clustering tree (TBTREE), a deterministic regression tree designed for multivariate responses that uses local multivariate linear models as leaves and incorporates dense or sparse twoblock dimension reduction both in the leaf models and impurity calculation. TBTREE aims to provide an interpretable, regime‑aligned piecewise‑linear description of data while maintaining predictive performance through a split/leaf decoupling strategy. Additionally, the authors propose a coskewness‑based estimator for the twoblock reduced space to identify non‑normal clusters, demonstrating the method’s ability to recover piecewise linear regimes in simulations and to model complex nonlinear dependencies in real‑world datasets, achieving performance comparable to black‑box techniques such as random forests.

By Sven Serneels
arXiv Machine Learning
Sep 1

Prediction-Powered Conditional Inference

arXiv:2603.05575v2 Announce Type: replace-cross Abstract: We study prediction-powered conditional inference in the setting where labeled data are scarce, unlabeled covariates are abundant, and a blac...

By Yang Sui, Jin Zhou, Hua Zhou, Xiaowu Dai
arXiv Machine Learning
Sep 16

Learned Look-Ahead Splitting Rule for CART

The paper introduces a look‑ahead splitting rule for Classification and Regression Trees (CART) that evaluates candidate splits by the error reduction achieved after growing a conventional CART subtree beneath each split. To keep the method computationally feasible, a smart look‑ahead algorithm is proposed that learns downstream split values from node‑level features. Experiments on simulated data and two real datasets show that both full and smart look‑ahead methods outperform the standard greedy splitting strategy, especially in hierarchical or interaction‑driven scenarios.

By Andrew Gao, Tianlin Liu, Ruichen Han, Lu Tian
arXiv Statistics ML
Oct 21

Divide-and-Conquer Neural Bayes Estimation for Spatial and Spatiotemporal Point Process Models

The paper introduces a divide-and-conquer neural Bayes estimation framework for spatial and spatiotemporal point process models. It uses transformer-based architectures on partitions of the domain and an attention mechanism to combine local summaries, enabling direct inference from raw point pattern data. Simulation studies show reliable inference with better scalability than existing neural and classical likelihood-based methods, and the approach is applied to whale call data in Cape Cod Bay, producing parameter estimates and credible intervals at negligible cost after training.

By Bokgyeong Kang, Andrew Zammit-Mangion, Erin M. Schliep, Robert S. Schick
arXiv Machine Learning
Oct 22

HealthMamba: An Uncertainty-aware Spatiotemporal Graph State Space Model for Effective and Reliable Healthcare Facility Visit Prediction

HealthMamba is an uncertainty‑aware spatiotemporal graph state space model designed to predict healthcare facility visits more accurately and reliably. It integrates a Unified Spatiotemporal Context Encoder, a novel GraphMamba module for hierarchical modeling, and a comprehensive uncertainty quantification component. Evaluated on large‑scale datasets from California, New York, Texas, and Florida, it improves prediction accuracy by about 6.0% and uncertainty quantification by 3.5% over state‑of‑the‑art baselines.

By Dahai Yu, Lin Jiang, Rongchao Xu, Guang Wang