arXiv:2405. 07780v3 Announce Type: replace-cross Abstract: This paper explores test-agnostic long-tail recognition, a challenging long-tail task where the test label distributions are unknown and arbitrarily imbalanced.
arXiv:2606. 25450v1 Announce Type: new Abstract: Traditional evaluations measure a learning algorithm's final performance on an i.
arXiv:2607. 18088v1 Announce Type: new Abstract: Standard evaluation of many recognition systems contains distribution shift by construction, since benchmarks place disjoint conditions in the training and test splits.
The paper introduces query‑conditioned hypernetworks that predict distributions over LoRA weight updates for large language models. By learning a distribution rather than a single point estimate, the method allows sampling multiple adapted models for the same query, improving performance over deterministic hypernetworks and token‑sampling baselines. The study also shows that these learned updates can transfer across different queries, indicating reusable adaptation patterns.
Hypernetworks have recently shown success in dynamically adapting the parameters of Large Language Models (LLMs) at runtime based on signals such as task descriptions or additional demostrations. Here...
RoBell-RVFL is a lightweight, quality‑aware generalized bell random vector functional link network designed to address class imbalance and noisy data in real‑world datasets. It uses a dual‑strategy sample‑level weighting: unit weights preserve minority class information, while a probability‑weighted generalized bell membership function suppresses noisy majority samples in a kernel‑induced feature space. Experiments on UCI and KEEL benchmarks, including tests with up to 40% label noise, show that RoBell‑RVFL consistently outperforms recent RVFL variants, demonstrating the importance of adaptive, quality‑aware sample weighting for robust learning.
VICAL is a framework for long‑tailed visual recognition that focuses on reducing prediction variance rather than increasing expert diversity. It combines Self‑Consistency Learning, which smooths the loss landscape and mitigates overfitting on tail classes, with Deep Ensemble Distillation, which encourages low‑frequency semantic agreement across experts. Experiments on CIFAR‑LT, ImageNet‑LT, and iNaturalist 2018 demonstrate that VICAL consistently outperforms state‑of‑the‑art methods.
arXiv:2510. 01163v2 Announce Type: replace Abstract: The factors driving the performance of in-context learning (ICL) in large language models (LLMs) remain poorly understood despite ICL's surprising effectiveness, enabling models to adapt to new tasks from only a handful of examples.
arXiv:2509. 17314v4 Announce Type: replace-cross Abstract: Software increasingly relies on the emergent capabilities of Large Language Models (LLMs), from natural language understanding to program analysis and generation.
Training-free few-shot adaptation methods have gained significant attention recently in the context of Vision-language Models (VLMs). Yet, current benchmarks rely on strong assumptions about the statistics of the adaptation data, e.
arXiv:2606. 08460v1 Announce Type: cross Abstract: Data-adaptive two-sample testing assesses if two samples come from the same distribution, using a discrepancy learned from the data (e.
arXiv:2606. 28598v1 Announce Type: cross Abstract: Prediction sets should have high coverage to be useful, but some coverage notions are more practically relevant than others.
arXiv:2503. 08038v2 Announce Type: replace-cross Abstract: In this paper, we delve deeper into the Kullback-Leibler (KL) Divergence loss and mathematically prove that it is equivalent to the Decoupled Kullback-Leibler (DKL) Divergence loss that consists of (1) a weighted Mean Square Error (wMSE) loss and (2) a Cross-Entropy loss incorporating soft labels.