pith. sign in

Proceedings of the 37th International Conference on Machine Learning , articleno =

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

fields

cs.CL 2 cs.LG 2

years

2026 4

verdicts

UNVERDICTED 4

roles

background 1

polarities

background 1

representative citing papers

DIVE: Embedding Compression via Self-Limiting Gradient Updates

cs.CL · 2026-05-20 · unverdicted · novelty 5.0

DIVE proposes a dimensionality-reduction adapter using self-limiting gradients and implicit view ensembles that outperforms prior adapters on all six BEIR datasets at every tested compression ratio.

Understanding the Prompt Sensitivity

cs.CL · 2026-04-20 · unverdicted · novelty 5.0

LLMs disperse meaning-preserving prompts internally instead of clustering them, which produces an excessively high upper bound on output log-probability differences via Taylor expansion and Cauchy-Schwarz.

citing papers explorer

Showing 4 of 4 citing papers.

  • SAVGO: Learning State-Action Value Geometry with Cosine Similarity for Continuous Control cs.LG · 2026-05-01 · unverdicted · none · ref 7

    SAVGO unifies representation learning, value estimation, and policy optimization by embedding state-action pairs such that cosine similarity reflects action-value similarity, enabling similarity-kernel-guided policy improvement.

  • DIVE: Embedding Compression via Self-Limiting Gradient Updates cs.CL · 2026-05-20 · unverdicted · none · ref 13

    DIVE proposes a dimensionality-reduction adapter using self-limiting gradients and implicit view ensembles that outperforms prior adapters on all six BEIR datasets at every tested compression ratio.

  • Unlocking Compositional Generalization in Continual Few-Shot Learning cs.LG · 2026-05-12 · unverdicted · none · ref 26 · 2 links

    A decoupling strategy optimizes object slots for holistic class identity during training and composes them at inference to achieve better generalization to unseen concepts in continual few-shot settings.

  • Understanding the Prompt Sensitivity cs.CL · 2026-04-20 · unverdicted · none · ref 28

    LLMs disperse meaning-preserving prompts internally instead of clustering them, which produces an excessively high upper bound on output log-probability differences via Taylor expansion and Cauchy-Schwarz.