AISTATS 2026 Batch — Oral & Spotlight Papers
Accepted oral and spotlight papers from AISTATS 2026. Each entry summarizes the core idea and theory and adds a small, self-contained experiment with a companion notebook.
Papers
-
Paper 1
Synthetic-Regularized Kernel Regression
Synthetic-data regularization • bias–variance • kernel methodsA kernel regressor that trades noisy real labels against a synthetic generator $g$ via a penalty $\lambda\|f-g\|_{\mathcal H_K}^2$. Larger $\lambda$ cuts variance but adds bias when $g\neq f_\star$; the best $\lambda$ depends on how well $g$ matches the target — especially in the hard, high-frequency kernel directions. Verified on a 1-D RBF experiment.
Open paper → -
Paper 2
EventFlow — Flow Matching for Temporal Point Processes
temporal point processes • flow matching • generative modelsA non-autoregressive generative model for event sequences. A balanced coupling pairs reference and data sequences of equal length, a linear noisy interpolant defines the flow, and a vector field trained by masked MSE transports a uniform reference TPP onto the data distribution — preserving the event count while pulling event times onto the data clusters. Verified on a clustered synthetic TPP.
Open paper → -
Paper 3
A Proof of Learning Rate Transfer Under μP
μP • learning-rate transfer • infinite-width limitWhy the optimal learning rate stops moving as a network gets wider. Under the maximal-update parametrization, the optimal one-step learning rate of a deep linear net has a closed-form infinite-width limit $\eta_\infty^{(1)}=\frac{m}{L}\,y^\top K y/\|Ky\|^2$ set by the input Gram matrix, and finite widths approach it at rate $O_P(n^{-1/2})$ — the theory behind transferring a tuned learning rate across scales. Verified on a deep linear MLP.
Open paper → -
More to come
Paper y, paper z, …
Additional oral & spotlight papers will be added here as I work through the batch, each with the same idea-summary-plus-experiment treatment.