arXiv Machine Learning

SAM-on-the-Curve: Sharpness-Aware Mode Connectivity for Robust Weight-Space Interpolation

arXiv Machine Learning
Aug 27

Robust CurveMoE: Multi-Norm Adversarial Defense for Mixture-of-Experts Models via Mode Connectivity

Robust CurveMoE is a mixture‑of‑experts framework that protects neural networks against perturbations defined by multiple norm constraints. It connects norm‑specialized models through a low‑loss path, selectively expertises only influential layers, and shares the rest of the parameters across routing paths. The method introduces contribution‑guided partial updating to reduce curve‑construction cost and provides a theoretical bound on the objective gap between partial and full optimization, achieving consistent improvements in clean, norm‑specific, and Union accuracy on CIFAR‑100 and ImageNet‑100.

By Xu Zhang, Ren Wang
arXiv Computer Vision
5d ago

Sparsity-Adaptive Sharpness-Aware Minimization

The paper introduces Sparsity-Adaptive Sharpness-Aware Minimization (SA‑SAM), a method that adjusts the perturbation radius in sharpness-aware training to remain consistent as model sparsity increases. It also evaluates a Magnitude‑Weighted Hessian (MWH) importance metric derived from second‑order analysis. Experiments on CIFAR‑10‑C, CIFAR‑100‑C, and ImageNet‑100‑C show that SA‑SAM improves corruption robustness at 80–90% sparsity while maintaining clean accuracy, and the study reports inference throughput at deployment‑relevant sparsity levels.

By Shiryu Ueno, Yoshikazu Hayashi, Kunihito Kato
arXiv Machine Learning
Jul 10

LiST: Lipschitz Scaling Training for Robust and Calibrated Neural Networks

arXiv:2607. 07745v1 Announce Type: new Abstract: While accuracy, robustness, and calibration are all essential for reliable neural networks, they are often studied separately; developing models that satisfy all three simultaneously remains a central challenge.

By Arthur Chiron (IRIT, EPE UT), Franck Mamalet (IRIT, DTIPG - SNCF, UT3), Thomas Massena (IRIT, DTIPG - SNCF, UT3), Thomas Deltort (IRIT), Mathieu Serrurier (IRIT, UT2J)
arXiv Computer Vision
Aug 24

Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

The paper introduces Difficulty-Calibrated Flow Matching, a method that adapts the noise-to-data interpolation schedule in Conditional Flow Matching based on a pilot run’s loss profile. By setting the schedule to the quantile function of this difficulty profile, the training trajectory spends more time where the velocity is hardest to learn. Experiments on CIFAR-10, MNIST, and Fashion‑MNIST show that this calibrated path achieves the best FID on CIFAR‑10 and outperforms all fixed schedules in large‑batch, few‑update settings, where compute is most limited.

By Airin Akter Tania, Md Raihan Khan