Pith. sign in

REVIEW 2 cited by

Divide, Reweight, and Conquer: A Logit Arithmetic Approach for In-Context Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.10074 v1 pith:BO4DN7WV submitted 2024-10-14 cs.LG cs.AIcs.CL

Divide, Reweight, and Conquer: A Logit Arithmetic Approach for In-Context Learning

classification cs.LG cs.AIcs.CL
keywords approachlarademonstrationsexamplesmemoryarithmeticb-larabinary
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In-Context Learning (ICL) emerges as a key feature for Large Language Models (LLMs), allowing them to adapt to new tasks by leveraging task-specific examples without updating model parameters. However, ICL faces challenges with increasing numbers of examples due to performance degradation and quadratic computational costs. In this paper, we propose Logit Arithmetic Reweighting Approach (LARA), a novel framework that enhances ICL by using logit-based ensembling of multiple demonstrations. Our approach divides long input demonstrations into parallelizable shorter inputs to significantly reduce memory requirements, and then effectively aggregate the information by reweighting logits of each group via a non-gradient optimization approach. We further introduce Binary LARA (B-LARA), a variant that constrains weights to binary values to simplify the search space and reduces memory usage by filtering out less informative demonstration groups. Experiments on BBH and MMLU demonstrate that LARA and B-LARA outperform all baseline methods in both accuracy and memory efficiency. We also conduct extensive analysis to show that LARA generalizes well to scenarios of varying numbers of examples from limited to many-shot demonstrations.

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. Parallel-R1: Towards Parallel Thinking via Reinforcement Learning

    cs.CL 2025-09 conditional novelty 6.0

    Parallel-R1 uses SFT cold-start on easy math plus GRPO on hard math to instill parallel thinking in Qwen3-4B, reporting 8.4% average accuracy gains and a 42.9% AIME25 gain from a parallel-exploration scaffold.

  2. CGES: Confidence-Guided Early Stopping for Efficient and Accurate Self-Consistency

    cs.CL 2025-11 conditional novelty 5.0

    Confidence-Guided Early Stopping stops querying an LLM once one candidate answer accumulates enough Bayesian posterior mass, cutting average calls from 16 to 4.9 on five reasoning benchmarks with negligible average ac...