CORTEXA
← Browse
arxivcs.LGcs.AIcs.ITmath.PR2026-07-20

One-step lowest-variance selection in a Gaussian random-field model motivated by masked diffusion: Total correlation and a square root collision threshold

Linjun Li

Motivated by confidence-guided parallel unmasking in masked discrete diffusion, we study a single selection step in a stylized Gaussian random-field model. A locally dependent nonnegative score field represents position wise uncertainty, and the scheduler selects the K positions with the smallest scores. Dependence among the selected positions is measured through a distance-dependent Gaussian correlation model. This separation provides a tractable framework for quantifying how the geometry of low-score locations affects the dependence cost of factorized parallel decoding. We establish two complementary results. In a conservative sub-square-root regime, the conditional Gaussian total correlation of the selected block vanishes in probability. At the square-root scale, it remains non-negligible with positive asymptotic probability and admits a strictly positive expectation lower bound. Synthetic experiments support the predicted finite-size behavior. These results provide a rigorous stochastic-geometry baseline for understanding how budget size, score dependence, and spatial correlation jointly shape one-step confidence-based selection in masked discrete diffusion.

View free PDFSource page

Related papers

arxivcs.LGcs.AIcs.CLcs.ITstat.ML2026-07-06

What Does a Discrete Diffusion Model Learn?

Rodrigo Casado Noguerales, Bernhard Schölkopf, Thomas Hofmann, Aran Raoufi

What does a discrete diffusion model learn: a denoiser, a score ratio, or a bridge plug-in predictor? At the level of jump rates, these are one object in different coordinates, and reading a neural network in the wrong coordinate changes the process being trained and sampled. Sta…

View free PDFSource page
arxivcs.LGcs.AImath.PRstat.ML2026-06-29

A Stationary-Distribution Theory for Triplet-Based Plateau Search in Random Forest Ensemble-Size Selection

Andrey A. Dukhovny, Andrey M. Lange

The number of trees is a central computational parameter in Random Forests: increasing it reduces finite-ensemble variability but increases training and prediction cost. Plateau-based tuning adapts this parameter through local comparisons of out-of-bag scores at a geometric tripl…

View free PDFSource page
arxivcs.LGcs.AIcs.CVcs.ITstat.ML2026-07-03

CuBAS: Information Geometric Curvature-Based Adaptive Sampling for Supervised Classification

Alexandre L. M. Levada

The informativeness of a training set is as consequential as its size, yet most sampling strategies remain agnostic to the intrinsic geometry of the data distribution. We introduce CuBAS (Curvature-Based Adaptive Sampling), an information-geometric framework for adaptive data sel…

View free PDFSource page
arxivcs.LGcs.AIcs.IT2026-07-17

Capacity and Redundancy Trade-offs in Multi-Task Learning

Asif Khan

In multi-task learning (MTL) negative transfer is often considered as an optimization artifact, but it can also be viewed as a consequence of limited shared capacity and weak task redundancy. We investigate this effect through a Capacity--Redundancy (CR) identity that decomposes…

View free PDFSource page
arxivcs.ITcs.AIcs.LG2026-07-07

AirPASS: Over-the-Air Federated Learning via Pinching Antenna Systems

Seyed Mohammad Azimi-Abarghouyi, Christopher G. Brinton

This paper investigates over-the-air federated learning (AirFL) in wireless systems where the access point is equipped with a multi-waveguide pinching antenna system (PASS). We adopt the widely studied learning-oriented AirFL formulation, which seeks to maximize the number of sel…

View free PDFSource page