Local learning algorithms can reshape resource requirements of artificial intelligence. The memory bottleneck of standard end-to-end backpropagation lies in the need to store all network activations until the loss gradient has been propagated back through. Local learning avoids this, but typically at a cost in accuracy...
Wu-Zi S. Han, Brian A. Yuan, G. Bellec· 0 citations
Graph Convolutional Networks (GCNs) have demonstrated exceptional performance on graph-structured data. However, their success heavily relies on the availability of clean labels, an assumption that often fails in real-world scenarios. The learnability of GCNs is intrinsically linked to the neighborhood structure of nod...
Results identify reward-preserving training structure as a practical route to lower per-step cost in short-window RLVR, and single-problem evaluations provide supporting evidence of retained reasoning quality.
Bang Yang, Hong-Bo Ma, Rui-Han Guo et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Classifier-free guidance (CFG) is a standard component of conditional diffusion models, and guided generation performance has become the \textit{de facto} measure of state-of-the-art models. Recent work on latent diffusion models seeks to learn latent spaces that are easier to model with diffusion. However, under CFG,...
Haoming Liu, Junhao Zhu, Shaoyi Zheng et al.· 0 citations
Standard autoregressive decoding advances one token at a time, even when several upcoming tokens can be predicted together. We propose CADENCE (Context-Adaptive DEcoding), a generation method that learns both what to draft and how far to draft. Gaussian prediction heads represent future spans as continuous latent vecto...
Sai Sreenivas Chintha, Chidera Biringa, Rishab Sharma et al.· 0 citations
Findings support incorporating price geometry and volume into generative modeling, with field accuracy and predictive uncertainty evaluated together, in a full-field evaluation framework that combines a transport cost sensitive to price placement and total volume with proper scoring rules and calibration diagnostics.
Forecasting an unresolved event requires finding relevant evidence and deciding how strongly it supports each outcome. Yet outcome-based training of Large Language Model (LLM) forecasters often begins with preassembled evidence at a single prediction date, leaving evidence acquisition outside the learning loop. We intr...
Li-Qin Ye, Rong-Zhi Zhang, Xin Liu et al.· 0 citations
Most freeway agencies have fixed detectors on only part of their network but need speeds for all of it. This paper compares methods for estimating current and next-hour speeds on every link from such sparse detectors, using historical probe data for training. The test network is the Dallas--Fort Worth freeway system: 4...
This work evaluates how accurately large Language Models predict the impact of self-generated ML experiment ideas before these are put into training runs to show that current LLMs have useful but limited intuition about which ML ideas will work.
Ayush Bansal, Aldo Pareja, S. Klein et al.· 0 citations
This paper observes that when a safe model is recursively self-distilled on its own (safe) generations while receiving an additional non-harmful cue, it becomes increasingly misaligned across a diverse set of harmful queries; it is called Progressive Misalignment.
Karim Abdel Sadek, F. Di Gennaro, Fanny Yang· 0 citations
This work introduces Sparse Autoencoder Geometric Anchoring (SAGA), which converts a Sparse Autoencoder (SAE) trained at each task boundary into local, low-rank constraints on representation drift, and establishes its local relation to latent code matching, define its spectral truncation error, and derive a conditional...