REVIEW 13 cited by
Robust Learning with Jacobian Regularization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Design of reliable systems must guarantee stability against input perturbations. In machine learning, such guarantee entails preventing overfitting and ensuring robustness of models against corruption of input data. In order to maximize stability, we analyze and develop a computationally efficient implementation of Jacobian regularization that increases classification margins of neural networks. The stabilizing effect of the Jacobian regularizer leads to significant improvements in robustness, as measured against both random and adversarial input perturbations, without severely degrading generalization properties on clean data.
Forward citations
Cited by 13 Pith papers
-
An Adjoint-Sensitivity Framework for Lost-in-the-Middle Phenomena in Causal Residual Transformers
A new adjoint-sensitivity analysis shows that a normalized influence density evolves exactly along gradient flow and that primacy, recency, and lost-in-the-middle arise from distinct channels under checkable conditions.
-
Beyond Objective Expressivity: Geometry Preservation in Multimodal Contrastive Learning
Well-conditioned encoder Jacobians, achieved via residual paths and LeakyReLU activations, improve trimodal contrastive learning retrieval and linear-probe performance across objectives and datasets.
-
On Adversarial Vulnerability of Vision-Language Models through the Lens of Intermediate Spectral Subspaces
Aligning adversarial perturbations with the near-null singular directions of intermediate linear layers in transformer VLMs yields stronger attacks than existing feature- and output-space methods.
-
Semantic Causality-Aware Vision-Based 3D Occupancy Prediction
A class-conditional gradient loss (Causal Loss) plus channel-grouped lifting, learnable camera offsets, and normalized convolution raises Occ3D mIoU by 1.2/0.8 points and cuts the camera-noise mIoU drop from 32% to 7%.
-
Improving Data and Parameter Efficiency of Neural Language Models Using Representation Analysis
Representation smoothness can be used to regularize training, stop early without validation labels, and guide active learning combined with parameter-efficient fine-tuning, reducing data and compute.
-
Loss Landscape Analysis for Reliable Quantized ML Models for Scientific Sensing
Loss landscape flatness and connectivity visually correlate with robustness to noise and bit flips in two quantized scientific sensing models, but the correlation is not quantified and the a priori claim remains unvalidated.
-
Interleaved Noise Injection Improves Clean, Corrupted, and OOD Performance
Interleaving clean and noisy training epochs improves clean, corrupted, and out-of-distribution accuracy on CIFAR-100 and ImageNet for CNNs and ViTs, with impulse noise best for ResNets and Gaussian noise best for ViTs.
-
Modular Foundation Models for Time-Series Perception in Digital Twins
A gated bank of frozen self-supervised time-series encoders, aligned and aggregated by a Transformer, supports competitive multi-task perception for digital twins and hydro-generator virtual sensing.
-
Distance-informed Neural Processes
A neural process with a bi-Lipschitz-regularized local encoder achieves better uncertainty calibration and OOD detection than existing NP variants.
-
GrokAlign: Geometric Characterisation and Acceleration of Grokking
GrokAlign, a Jacobian-norm regularizer, accelerates grokking by aligning Jacobians with training data, and centroid alignment tracks when generalization and robustness emerge.
-
Geometric flow regularization in latent spaces for smooth dynamics with the efficient variations of curvature
Curvature-flow-regularized latent spaces improve mean out-of-distribution errors for Burger's equation relative to a plain autoencoder, but the flows are heuristic and the evidence is limited.
-
Hidden Representation Clustering with Multi-Task Representation Learning towards Robust Online Budget Allocation
Budget allocation by clustering users in a learned hidden representation space and optimizing per cluster improves order volume and gross merchandise volume by up to 0.65% relative to individual-level baselines in Mei...
-
A Bayesian Framework for Regularized Estimation in Multivariate Models Integrating Approximate Computing Concepts
The paper shows that adding Gaussian noise to a parameter is equivalent to inflating its prior variance, and uses this to claim a Bayesian interpretation of quantization and to justify shrinkage in regularized LDA.
Discussion (0). Continue with ORCID to comment.