Artificial IntelligencearXiv — cs.LGWed, May 27, 2026, 4:00 AMPositive

TailedCore: Few-Shot Sampling for Unsupervised Long-Tail Noisy Anomaly Detection

A new study introduces TailedCore, a memory-based model designed for unsupervised anomaly detection in environments where normal datasets are contaminated and class distributions are unknown. The model addresses the tail-versus-noise trade-off by independently handling tail class and noise samples, utilizing a novel class size predictor called TailSampler.

WPN Brief

  • What Happened

    A new study introduces TailedCore, a memory-based model designed for unsupervised anomaly detection in environments where normal datasets are contaminated and class distributions are unknown. The model addresses the tail-versus-noise trade-off by independently handling tail class and noise samples, utilizing a novel class size predictor called TailSampler.

  • Why It Matters

    This development is significant as it enhances the ability to detect anomalies in challenging datasets, potentially improving the reliability of systems that depend on accurate anomaly detection, such as industrial monitoring and security applications.

  • The Bigger Picture

    The introduction of TailedCore aligns with ongoing advancements in machine learning, particularly in anomaly detection, where researchers are increasingly focusing on robust methods that can adapt to complex data distributions and noise. This reflects a broader trend in AI towards improving model resilience and accuracy in real-world applications.

Ask WPN AI

Related Reports

More coverage on this story

10 reports across the wire

arXiv — cs.LG
Jun 2

Rethinking Weak Supervision in Anomaly Detection: A Comprehensive Benchmark

A new benchmark called WSADBench has been introduced to unify the evaluation of weakly supervised anomaly detection (WSAD) methods, addressing the challenges of incomplete, inexact, and inaccurate supervision. This benchmark evaluates 36 algorithms across four modalities, revealing critical insights about the intrinsic correlations between different weak supervision scenarios.

Artificial Intelligenceneutral
arXiv — cs.LG
May 27

TSFMAudit: Data Contamination Auditing in Forecasting Time Series Foundation Models

The introduction of TSFMAudit marks a significant advancement in the auditing of data contamination in Time Series Foundation Models (TSFMs), addressing concerns that evaluation datasets may have been inadvertently exposed during pretraining. This study formalizes the auditing process and proposes a method based on probe adaptation dynamics to identify contamination in TSFMs.

Artificial Intelligenceneutral
arXiv — cs.CV
May 27

GS-CLIP: Zero-shot 3D Anomaly Detection by Geometry-Aware Prompt and Synergistic View Representation Learning

The GS-CLIP framework has been introduced for zero-shot 3D anomaly detection, allowing the identification of anomalies in datasets without the need for target training data. This innovative approach utilizes a two-stage learning process, incorporating geometry-aware prompts and synergistic view representation learning to enhance the detection of geometric anomalies.

Artificial Intelligencepositive
arXiv — cs.LG
May 27

When Rule Violations Are Rare: Chimera Training for Logical Anomaly Detection

A recent study published on arXiv introduces Chimera Training for logical anomaly detection, focusing on the challenges of detecting rare rule violations in structured data. The proposed neural rule evaluator compiles constraints into a directed acyclic graph, learning to map features to rule-satisfaction probabilities, addressing the limitations of traditional training data that often lacks informative configurations.

Artificial Intelligenceneutral
arXiv — cs.CV
May 27

Respecting Modality Gap in Post-hoc Out-of-distribution Detection with Pre-trained Vision-Language Models

A recent study published on arXiv introduces a novel approach to out-of-distribution (OOD) detection using pre-trained vision-language models (VLMs). The research highlights an intrinsic modality gap between textual and visual prototypes, which existing methods fail to address adequately. An online pseudo-supervised framework is proposed to learn class prototypes directly from visual feature spaces using unlabeled data streams.

Artificial Intelligencepositive
arXiv — cs.CV
May 27

CRoFT: Robust Fine-Tuning with Concurrent Optimization for OOD Generalization and Open-Set OOD Detection

A new study titled 'CRoFT: Robust Fine-Tuning with Concurrent Optimization for OOD Generalization and Open-Set OOD Detection' addresses the challenges faced by vision-language pre-trained models (VL-PTMs) in maintaining their general knowledge during fine-tuning, particularly in scenarios involving covariate and semantic shifts. The research proposes a novel objective function aimed at enhancing out-of-distribution (OOD) generalization while effectively detecting unseen classes.

Artificial Intelligenceneutral
arXiv — stat.ML
Jun 2

Agile Online Model Selection: Resolving Adaptation Lag via Safeguarded Large Learning Rates

A new study introduces an optimistic online mirror descent algorithm designed to enhance online model selection in non-stationary environments. This approach addresses the adaptation lag caused by existing tuning-free algorithms, which limit learning rates to small constants, thus hindering responsiveness to abrupt changes in data distribution. The proposed method allows for larger learning rates while dynamically penalizing excessive regret, improving predictive accuracy.

Artificial Intelligencepositive
arXiv — cs.LG
May 27

Structure-Adaptive Conformal Inference for Large-Scale Out-of-Distribution Testing

A new study presents a structure-adaptive conformal inference method for large-scale out-of-distribution (OOD) testing in machine learning, addressing the limitations of traditional conformal methods that struggle with joint exchangeability and auxiliary information integration. The proposed structure-adaptive conformal q-value (SCQ) and pseudo-score-guided transductive automated model selection (P-TAMS) aim to enhance error-rate control and interpretability in high-stakes applications.

Artificial Intelligenceneutral
arXiv — stat.ML
May 27

Assessing Per-Sample Membership Inference Vulnerability without Retraining

Recent research has highlighted the vulnerabilities associated with membership inference attacks (MIAs) on individual training samples in machine learning models, proposing a method to assess these vulnerabilities without the need for retraining shadow models. The study reveals that the exposure of a sample to MIAs is influenced by both its loss and a geometric measure dependent on the data. This approach allows for a more efficient evaluation of privacy risks in deep networks.

Artificial Intelligenceneutral
arXiv — cs.CV
May 27

Semi-Supervised Gaze Estimation via Disentangled Subspace Contrastive Learning

A new study presents a semi-supervised learning architecture for gaze estimation, addressing the challenges of limited annotated samples and dataset diversity. By leveraging unlabeled data and employing Jacobian regularization, the model aims to enhance domain generalization and reduce the need for extensive manual annotations. This approach focuses on disentangling feature representations into specific gaze components, such as pitch and yaw angles, to improve accuracy.

Artificial Intelligenceneutral

Articles

Continue Reading

arXiv — cs.LGArtificial Intelligence2 days ago

Gibbs randomness-compression proposition

A new proposition has been introduced that connects randomness and compression through Gibbs entropy, focusing on measurement vectors linked to compression processes. This approach utilizes the performance of learning tasks as a metric for assessing compression across multiple cycles, suggesting that lossy compression can be viewed as directed randomness that retains information within specific Gibbs entropy limits.

arXiv — cs.LGArtificial Intelligence2 days ago

Similarity as Reward Alignment: Robust and Versatile Preference-based Reinforcement Learning

A new framework called Similarity as Reward Alignment (SARA) has been introduced in preference-based reinforcement learning (PbRL), addressing the challenges of labeler errors and adapting to various feedback formats. SARA computes rewards based on the similarity of learned latent representations of preferred samples, demonstrating improved stability and performance in offline reinforcement learning benchmarks.

arXiv — cs.LGArtificial Intelligence2 days ago

Contrastive Conformal Sets

A recent study introduces Contrastive Conformal Sets, enhancing contrastive learning by constructing geometric sets in the semantic feature space, ensuring user-specified coverage of positive samples while maximizing the exclusion of negative samples. This method extends conformal prediction principles to improve the reliability of machine learning models.

arXiv — cs.LGArtificial Intelligence2 days ago

Data Driven Block Replacement Scheduling

A new study has introduced data-driven algorithms for managing independent identical machines under a block replacement policy, focusing on determining the optimal replacement interval based on operational data. The research formulates this challenge as a stochastic multi-armed bandit problem, proposing algorithms that achieve regret matching the Lai–Robbins lower bound.

arXiv — cs.LGArtificial Intelligence2 days ago

Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces

A recent study has introduced a framework for distributionally robust optimization (DRO) in continuous probability spaces, addressing the computational challenges associated with infinite-dimensional optimization problems. The research leverages Brenier's theorem to define the least favorable distribution as a pushforward of a transport map, leading to a minimax problem in Wasserstein space and proposing an iterative algorithmic framework with global convergence guarantees.

arXiv — cs.LGArtificial Intelligence2 days ago

To Grok Grokking: Provable Grokking in Ridge Regression

A recent study published on arXiv explores the phenomenon of grokking within the context of ridge regression, demonstrating that models can overfit training data initially, yet later achieve significant generalization. The research provides rigorous quantitative bounds on the delay of generalization, termed 'grokking time', and emphasizes the role of hyperparameter tuning in influencing this process.

arXiv — cs.LGArtificial Intelligence2 days ago

Generalized Neural Distributional Regression

The Generalized Neural Distributional Regression (GNDR) framework has been introduced, integrating deep neural networks with classical probability distributions to enhance statistical modeling. This framework employs a semi-parametric estimation procedure to address the non-identifiability of deep architectures, allowing for the extraction of analytical Fisher Information matrices and facilitating rigorous uncertainty quantification.

arXiv — cs.LGArtificial Intelligence2 days ago

Selecting Hyperparameters for Tree-Boosting

A recent study published on arXiv explores various methods for hyperparameter optimization in tree-boosting, a prevalent machine learning technique for tabular data. The research empirically compares methods such as random grid search, SMAC, and Gaussian-process-based Bayesian optimization across 59 datasets, revealing that SMAC consistently outperforms others under a fixed tuning budget.