pith. sign in

hub Mixed citations

emnlp-main.308/

Mixed citation behavior. Most common role is background (57%).

38 Pith papers citing it
Background 57% of classified citations

hub tools

citation-role summary

background 4 baseline 1 dataset 1 method 1

citation-polarity summary

clear filters

representative citing papers

GS-QA: A Benchmark for Geospatial Question Answering

cs.DB · 2026-05-21 · unverdicted · novelty 7.0

GS-QA is a new benchmark of 2,800 QA pairs on 28 templates using OSM and Wikipedia data to evaluate LLMs on spatial predicates, multi-source reasoning, and diverse answer types including distances and counts.

ProMQA-Assembly: Multimodal Procedural QA Dataset on Assembly

cs.CL · 2025-09-03 · unverdicted · novelty 7.0

ProMQA-Assembly is a new multimodal procedural QA dataset with 646 pairs on assembly activities, built via LLM-generated candidates verified by humans plus 81 task graphs, and used to benchmark multimodal models.

On the Position Bias of On-Policy Distillation

cs.LG · 2026-06-21 · unverdicted · novelty 6.0 · 2 refs

Position bias in on-policy distillation degrades later-token supervision; IW-OPD weights tokens by accumulated discrepancy, yielding faster convergence and up to 6.9 point gains on AIME-2025.

Temporal Preference Optimization for Unsupervised Retrieval

cs.IR · 2026-06-16 · unverdicted · novelty 6.0

TPOUR uses a novel TRPO method to improve unsupervised retrievers for temporal relevance, outperforming baselines including a much larger model on nDCG@5 for explicit and implicit time queries.

Sparsely gated tiny linear experts

cs.LG · 2026-06-05 · unverdicted · novelty 6.0

Sgatlin replaces transformer FF layers with sparse single linear neurons, improving perplexity across compute budgets and enabling direct interpretation of semantically clustered circuits for factual recall.

Latent-GRPO: Group Relative Policy Optimization for Latent Reasoning

cs.LG · 2026-04-30 · unverdicted · novelty 6.0

Latent-GRPO stabilizes reinforcement learning in latent space, delivering 7.86 Pass@1 gains on low-difficulty tasks over latent baselines and 4.27 points over explicit GRPO on high-difficulty tasks with 3-4x shorter reasoning chains.

CodeT5+: Open Code Large Language Models for Code Understanding and Generation

cs.CL · 2023-05-13 · conditional · novelty 6.0

CodeT5+ is a flexible encoder-decoder LLM family for code pretrained with diverse objectives on multilingual corpora and initialized from existing LLMs, achieving state-of-the-art results on code generation, completion, math programming, and retrieval tasks including new SoTA on HumanEval with the 1

citing papers explorer

Showing 7 of 7 citing papers after filters.

  • How Much Is One Recurrence Worth? Iso-Depth Scaling Laws for Looped Language Models cs.LG · 2026-04-22 · unverdicted · none · ref 49

    A fitted iso-depth scaling law measures that one recurrence in looped transformers is worth r^0.46 unique blocks in validation loss.

  • On the Position Bias of On-Policy Distillation cs.LG · 2026-06-21 · unverdicted · none · ref 20 · 2 links

    Position bias in on-policy distillation degrades later-token supervision; IW-OPD weights tokens by accumulated discrepancy, yielding faster convergence and up to 6.9 point gains on AIME-2025.

  • Sparsely gated tiny linear experts cs.LG · 2026-06-05 · unverdicted · none · ref 56

    Sgatlin replaces transformer FF layers with sparse single linear neurons, improving perplexity across compute budgets and enabling direct interpretation of semantically clustered circuits for factual recall.

  • An Assessment of Human vs. Model Uncertainty in Soft-Label Learning and Calibration cs.LG · 2026-05-18 · unverdicted · none · ref 48

    Controlled experiments on MNIST show human soft-labels act as a regularizer that improves calibration on hard samples and aligns model uncertainty with humans, beyond accuracy gains from correcting mislabels.

  • Polaris: Coupled Orbital Polar Embeddings for Hierarchical Concept Learning cs.LG · 2026-04-30 · unverdicted · none · ref 4

    Polaris separates semantic meaning from hierarchical structure in embeddings via angular geometry and radius on a hypersphere, yielding up to 19-point gains in taxonomy expansion retrieval over baselines.

  • Latent-GRPO: Group Relative Policy Optimization for Latent Reasoning cs.LG · 2026-04-30 · unverdicted · none · ref 16

    Latent-GRPO stabilizes reinforcement learning in latent space, delivering 7.86 Pass@1 gains on low-difficulty tasks over latent baselines and 4.27 points over explicit GRPO on high-difficulty tasks with 3-4x shorter reasoning chains.

  • Are Latent Reasoning Models Easily Interpretable? cs.LG · 2026-04-06 · unverdicted · none · ref 1

    Latent reasoning models often ignore their latent tokens for predictions and their correct outputs can be decoded into natural language reasoning traces more reliably than incorrect outputs.