arXiv Machine Learning

Training Under Challenge: Executable Certificates and Challenge-Closed Optimality for Neural Networks

arXiv:2608. 12655v1 Announce Type: new Abstract: A flat training curve does not reveal whether a neural network has reached a global optimum, is locally trapped, is representation-limited, or is mismatched to its trainer.

arXiv Machine Learning
Jun 2

Multigrade Neural Network Approximation

arXiv:2601. 16884v3 Announce Type: replace Abstract: We study multigrade deep learning (MGDL) as a principled framework for structured error refinement in deep neural networks.

By Shijun Zhang, Zuowei Shen, Yuesheng Xu
arXiv Machine Learning
Jul 10

Closing the Null Space: Guidance-Aware Quantization for Classifier-Free Diffusion

arXiv:2607. 08241v1 Announce Type: cross Abstract: Deploying classifier-free guidance (CFG) diffusion models under real-world compute budgets requires quantization, yet existing post-training quantization (PTQ) methods treat CFG models as single-branch networks, ignoring the paired conditional/unconditional structure that CFG inference fundamentally relies on.

By Abdullah Al Shafi, Sumaiya Rahim Suma
arXiv AI
Jul 29

CIFNet: An Analytic Neural Learning Framework for Efficient and Calibrated Class-Incremental Learning

arXiv:2509. 11285v2 Announce Type: replace-cross Abstract: Class-Incremental Learning (CIL) in deep neural networks is conventionally framed as an iterative gradient-based optimization problem, incurring high computational cost, hyperparameter sensitivity, and risk of catastrophic forgetting.

By Alejandro Dopico-Castro, Oscar Fontenla-Romero, Bertha Guijarro-Berdi\~nas, Amparo Alonso-Betanzos
arXiv AI
Jul 21

CADENCE: Closing the Reasoning Gap via Coverage-Adaptive On-Policy Distillation

arXiv:2607. 16955v1 Announce Type: cross Abstract: On-policy knowledge distillation transfers reasoning from large teachers to compact students, but existing approaches suffer three compounding failure modes: (i) cold-start collapse, where a fresh student assigns near-zero mass to teacher-preferred tokens; (ii) state-agnostic divergence scheduling, where time-only forward/reverse-KL interpolation ignores the student's coverage state; and (iii) binary reward sparsity, where pass/fail signals discard information from partially correct traces.

By Satyam Kumar, Saurabh Jha