The reviewed record of science sign in
Pith

arxiv: 2503.17211 · v2 · pith:7VEJ2TPO · submitted 2025-03-21 · cs.CL · cs.CV· cs.LG

A Language Anchor-Guided Method for Robust Noisy Domain Generalization

Reviewed by Pithpith:7VEJ2TPOopen to challenge →

classification cs.CL cs.CVcs.LG
keywords domainfeatureslanguagenoisenoisyanchordatadatasets
0
0 comments X
read the original abstract

Real-world machine learning applications often struggle with two major challenges: distribution shift and label noise. Models tend to overfit by focusing on redundant and uninformative features in the training data, which makes it hard for them to generalize to the target domain. Noisy data worsens this problem by causing further overfitting to the noise, meaning that existing methods often fail to tell the difference between true, invariant features and misleading, spurious ones. To tackle these issues, we introduce Anchor Alignment and Adaptive Weighting (A3W). This new algorithm uses sample reweighting guided by natural language processing (NLP) anchors to extract more representative features. In simple terms, A3W leverages semantic representations from natural language models as a source of domain-invariant prior knowledge. Additionally, it employs a weighted loss function that adjusts each sample's contribution based on its similarity to the corresponding NLP anchor. This adjustment makes the model more robust to noisy labels. Extensive experiments on standard benchmark datasets show that A3W consistently outperforms state-of-the-art domain generalization methods, offering significant improvements in both accuracy and robustness across different datasets and noise levels.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning

    cs.AI 2026-05 unverdicted novelty 7.0

    CAPS is a four-stage inference-only cascade that adapts how much of each solution the verifier sees and how comparisons are distributed, halving per-candidate verifier tokens while outperforming uniform pairwise verif...

  2. PathCal: State-Aware Reflection-Marker Calibration for Efficient Reasoning

    cs.AI 2026-05 unverdicted novelty 6.0

    PathCal calibrates reasoning paths by type-aware soft rebalancing of reflection-marker logits at uncertain states, yielding better efficiency-performance trade-offs on six benchmarks.