Provenance Guided Incremental Learning Under Evolving Concept Definitions
研究通过谱系引导的增量学习方法解决规则定义变更导致的概念漂移问题,自动重标记并局部重新评估以修复预测器。
研究通过谱系引导的增量学习方法解决规则定义变更导致的概念漂移问题,自动重标记并局部重新评估以修复预测器。
本文提出SemReWrite框架,解决视觉学习中语义概念演变问题,通过选择性更新过时的视觉-语义映射同时保留有效知识。
This work addresses a critical limitation in existing neural network compression methods: their neglect of cross-layer redundancy arising from functional symmetries, such as permutation invariance among hidden units and attention heads. To overcome this, the authors propose a novel framework that aligns symmetric blocks across layers via motion compensation, transforming weight sequences into predictable structures. The approach introduces a lightweight per-layer predictor, a rate–distortion-optimized entropy model, and a keyframe scheduling mechanism to efficiently encode quantized residuals. During decoding, inverse alignment enables rapid weight reconstruction. By explicitly modeling cross-layer alignment for the first time, the method achieves substantial improvements over state-of-the-art quantization and learned compression techniques on Transformer-based language modeling and vision classification tasks, significantly advancing the rate–accuracy Pareto frontier while preserving inference speed.
This work addresses the tension between low-bit quantization and algorithmic recourse, showing that aggressive quantization—while preserving predictive accuracy—can severely undermine counterfactual explainability by invalidating or drastically inflating the cost of recourse. The paper formally characterizes this trade-off through three criteria for counterfactual sensitivity: validity, cost, and directional stability, and introduces two novel metrics, Validity Drop (VD) and Counterfactual Recourse Gap (CRG), to quantify recourse degradation. To reconcile efficiency with explainability, the authors propose Counterfactually Faithful Quantization (CFQ), a method that jointly optimizes prediction accuracy and recourse fidelity under a global bit budget via teacher-guided target constraints, mixed-precision bit allocation, and boundary perturbation theory. Experiments on Adult, German Credit, and COMPAS datasets demonstrate that CFQ significantly outperforms baselines, achieving comparable accuracy while markedly improving both VD and CRG.
This work addresses the lack of safe and controllable response mechanisms in machine learning systems under distribution shift by proposing a monitoring framework grounded in constrained safe decision-making. The approach identifies shift types at the perception layer and, for the first time, introduces an online risk certificate mechanism that provides a valid, anytime upper bound on current risk, thereby triggering tiered intervention strategies. Key technical components include unlabeled signal modeling, delayed label querying, test-time adaptation, and active abstention. Experiments on WILDS Camelyon17, DomainNet, and synthetic data streams demonstrate that the method achieves near-zero safety violations and rapid recovery, significantly outperforming existing baselines.
研究通过谱系引导的增量学习方法解决规则定义变更导致的概念漂移问题,自动重标记并局部重新评估以修复预测器。
本文提出SemReWrite框架,解决视觉学习中语义概念演变问题,通过选择性更新过时的视觉-语义映射同时保留有效知识。
This work addresses a critical limitation in existing neural network compression methods: their neglect of cross-layer redundancy arising from functional symmetries, such as permutation invariance among hidden units and attention heads. To overcome this, the authors propose a novel framework that aligns symmetric blocks across layers via motion compensation, transforming weight sequences into predictable structures. The approach introduces a lightweight per-layer predictor, a rate–distortion-optimized entropy model, and a keyframe scheduling mechanism to efficiently encode quantized residuals. During decoding, inverse alignment enables rapid weight reconstruction. By explicitly modeling cross-layer alignment for the first time, the method achieves substantial improvements over state-of-the-art quantization and learned compression techniques on Transformer-based language modeling and vision classification tasks, significantly advancing the rate–accuracy Pareto frontier while preserving inference speed.
This work addresses the tension between low-bit quantization and algorithmic recourse, showing that aggressive quantization—while preserving predictive accuracy—can severely undermine counterfactual explainability by invalidating or drastically inflating the cost of recourse. The paper formally characterizes this trade-off through three criteria for counterfactual sensitivity: validity, cost, and directional stability, and introduces two novel metrics, Validity Drop (VD) and Counterfactual Recourse Gap (CRG), to quantify recourse degradation. To reconcile efficiency with explainability, the authors propose Counterfactually Faithful Quantization (CFQ), a method that jointly optimizes prediction accuracy and recourse fidelity under a global bit budget via teacher-guided target constraints, mixed-precision bit allocation, and boundary perturbation theory. Experiments on Adult, German Credit, and COMPAS datasets demonstrate that CFQ significantly outperforms baselines, achieving comparable accuracy while markedly improving both VD and CRG.
This work addresses the lack of safe and controllable response mechanisms in machine learning systems under distribution shift by proposing a monitoring framework grounded in constrained safe decision-making. The approach identifies shift types at the perception layer and, for the first time, introduces an online risk certificate mechanism that provides a valid, anytime upper bound on current risk, thereby triggering tiered intervention strategies. Key technical components include unlabeled signal modeling, delayed label querying, test-time adaptation, and active abstention. Experiments on WILDS Camelyon17, DomainNet, and synthetic data streams demonstrate that the method achieves near-zero safety violations and rapid recovery, significantly outperforming existing baselines.