paper-with-me

Papers

Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing

2026-04-30 · Max Lovig arxiv

In modern parametric model training, full-batch gradient descent (and its variants) suffers due to progressively stronger biasing towards the exact realization of training data; this drives the systematic ``generalization gap'', where the train error becomes an unreliable proxy for test error. Existing approaches either argue this gap is benign through complex analysis or sacrifice data to a validation set. In contrast, we introduce decoupled descent (DD), a novel theory-based training algorithm that satisfies a train-test identity -- enforcing the train error to asymptotically track the test error for stylized Gaussian mixture models. Within this specific regime, leveraging approximate message passing theory, DD iteratively cancels the biases due to data reuse, rigorously demonstrating the feasibility of zero-cost validation and $100\%$ data utilization. Moreover, DD is governed by a low-dimensional state evolution recursion, rendering the dynamics of the algorithm transparent and tractable. We validate DD on XOR classification, yielding superior performance compared to GD; additionally, we implement noisy MNIST and non-linear probing of CIFAR-10, demonstrating that even when our stylized assumptions are relaxed, DD narrows the generalization gap compared to GD.

📄 PDF Abstract BibTeX arXiv:2604.27883

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

PuTR: A Pure Transformer for Decoupled and Online Multi-Object Tracking

2024-05-23 · Chongwei Liu, Haojie Li, Zhihui Wang, Rui Xu

Recent advances in Multi-Object Tracking (MOT) have achieved remarkable success in short-term association within the decoupled tracking-by-detection online paradigm. However, long-term tracking still remains a challengin…

Multi-Object TrackingObjectObject TrackingOnline Multi-Object Tracking

Asymmetric Nash Seeking via Best Response Maps: Global Linear Convergence and Robustness to Inexact Reaction Models

2026-03-17 · Mahdis Rabbani, Navid Mojahed, Shima Nazari arxiv

Nash equilibria provide a principled framework for modeling interactions in multi-agent decision-making and control. However, many equilibrium-seeking methods implicitly assume that each agent has access to the other age…

Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent

2020-06-22 · ICML 2020 1 · Surbhi Goel, Aravind Gollakota, Zhihan Jin, Sushrut Karmalkar 외

We prove the first superpolynomial lower bounds for learning one-layer neural networks with respect to the Gaussian distribution using gradient descent. We show that any classifier trained using gradient descent with res…

A Regret Perspective on Online Multiple Testing

2026-05-13 · Qingyang Hao, Kongchang Zhou, Fang Kong, Hongxin Wei arxiv

Online Multiple Testing (OMT), a fundamental pillar of sequential statistical inference, traditionally evaluates the False Discovery Rate (FDR) and statistical power in isolation, obscuring the highly asymmetric costs of…

Training Data Size Induced Double Descent For Denoising Neural Networks and the Role of Training Noise Level

2021-09-29 · Rishi Sonthalia, Raj Rao Nadakuditi

When training a denoising neural network, we show that more data isn’t more beneficial. In fact the generalization error versus number of of training data points is a double descent curve. Training a network to denoise n…

Denoising