CORTEXA
← Browse
arxivstat.MLcs.LG2026-07-16

Optimal Self-Distillation for Rectified Flow via Linear Probing

Saptarshi Roy, Debepsita Mukherjee, Pratik Patil

Modern generative models are increasingly trained using model-generated signals, creating both opportunities for self-improvement and risks of collapse. We study optimal self-distillation (SD) for rectified flow (RF): given a suboptimal teacher velocity field, can a student trained on a mixture of true RF velocities and teacher velocities provably improve the teacher? For linear RF with ridge regularization on fixed interpolation pairs, we prove an exact affine path identity, derive the optimal mixing coefficient in closed form, and show strict improvement in integrated velocity risk whenever the teacher risk is nonstationary along the regularization path. The optimal coefficient obeys a sign rule: positive mixing corrects under-regularized teachers, while negative mixing corrects over-regularized teachers. We also give one-shot generalized cross-validation (GCV) and validation tuning procedure that avoids grid search over mixing weights and repeated refitting. Combining this theorem with RF Wasserstein convergence bounds, we show that optimal self-distillation improves the velocity estimation terms controlling continuous-time and finite-step generation error. Experiments with Gaussian models, Gaussian mixtures, and image data show that optimal self-distillation improves velocity risk, mode recovery, and finite-step generation relative to both the teacher and pure distillation.

View free PDFSource page

Related papers

arxivmath.OCcs.AIcs.LGstat.ML2026-07-24

Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs

Akira Kitaoka

A data-driven inverse optimization problem (DDIOP) is the problem of estimating the objective-function parameters (weights) that explain observed optimal-solution data, and it arises in many applications, including integer linear programming (ILP). It is known that, by applying g…

View free PDFSource page
arxivcs.LGmath.STstat.ML2026-07-24

Beyond Negative-Ridge Endpoints: Mixed-Sign Spectral Regularization via Negative-Shifted Gradient Descent

Peng Zhao

In overparameterized linear regression, many weak spectral directions act like a ridge penalty on the signal-bearing spectrum; negative ridge is the natural correction, pushing filters above one. The stable negative-ridge endpoint, however, is structurally limited: its pole must…

View free PDFSource page
arxivstat.MLcs.LG2026-07-24

Hopformer: Homogeneity-Pursuit Transformer for Time Series Forecasting

Wan Zhang, Qinjie Lin, Chan Lee, Weijian Li, Han Liu, Kai Zhang

Forecasting multiple time-series with high-dimensional covariates presents a core challenge: unifying common temporal patterns while retaining meaningful series-specific information. We introduce Hopformer (Homogeneity-Pursuit Transformer), a two-stage framework that addresses th…

View free PDFSource page
arxivcs.LGcs.AImath.OCstat.ML2026-07-23

A Defense of the Quadratic Model

Alexandru Meterez, Pranav Ajit Nair, Depen Morwani, Cengiz Pehlevan, Sham Kakade, Alex Damian

Due to the complexity of neural network loss landscapes, optimization theory is forced to rely on idealized models, and there is generally a tradeoff between how theoretically tractable the model is, and how accurately it describes the true optimization dynamics. In this work, we…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.CO2026-07-24

Convergence analysis of a family of Zermelo-type iterations for the Bradley--Terry model

Ruijian Han, Ding Lu, Yiming Xu

Zermelo's algorithm is a classical method for computing the maximum likelihood estimator in the Bradley--Terry (BT) model, but its convergence can be slow in practice. To accelerate computation, Newman introduced a family of Zermelo-type fixed-point iterations parameterized by $α…

View free PDFSource page