Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1612.04174

Models of retrieval in sentence comprehension: A computational evaluation using Bayesian hierarchical modeling

Bruno Nicenboim·Shravan Vasishth
View original source ↗Read source document ↗Export metadata ↓

Abstract

Research on interference has provided evidence that the formation of dependencies between non-adjacent words relies on a cue-based retrieval mechanism. Two different models can account for one of the main predictions of interference, i.e., a slowdown at a retrieval site, when several items share a feature associated with a retrieval cue: Lewis and Vasishth's (2005) activation-based model and McElree's (2000) direct access model. Even though these two models have been used almost interchangeably, they are based on different assumptions and predict differences in the relationship between reading times and response accuracy. The activation-based model follows the assumptions of ACT-R, and its retrieval process behaves as a lognormal race between accumulators of evidence with a single variance. Under this model, accuracy of the retrieval is determined by the winner of the race and retrieval time by its rate of accumulation. In contrast, the direct access model assumes a model of memory where only the probability of retrieval varies between items; in this model, differences in latencies are a by-product of the possibility and repairing incorrect retrievals. We implemented both models in a Bayesian hierarchical framework in order to evaluate them and compare them. We show that some aspects of the data are better fit under the direct access model than under the activation-based model. We suggest that this finding does not rule out the possibility that retrieval may be behaving as a race model with assumptions that follow less closely the ones from the ACT-R framework. We show that by introducing a modification of the activation model, i.e, by assuming that the accumulation of evidence for retrieval of incorrect items is not only slower but noisier (i.e., different variances for the correct and incorrect items), the model can provide a fit as good as the one of the direct access model.

Explore related subjects

cs.CLstat.APstat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bruno Nicenboim, Shravan Vasishth. 2017-08-24. Models of retrieval in sentence comprehension: A computational evaluation using Bayesian hierarchical modeling. https://arxiv.org/abs/1612.04174

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hierarchical attention interpretation: an interpretable speech-level transformer for bi-modal depression detection

Depression is a common mental disorder. Automatic depression detection tools using speech, enabled by machine learning, help early screening of depression. This paper addresses two limitations that may hinder the clinical implementations of such tools: noise resulting from segment-level labelling and a lack of model interpretability. We propose a bi-modal speech-level transformer to avoid segment-level labelling and introduce a hierarchical interpretation approach to provide both speech-level and sentence-level interpretations, based on gradient-weighted attention maps derived from all attention layers to track interactions between input features. We show that the proposed model outperforms a model that learns at a segment level ($p$=0.854, $r$=0.947, $F1$=0.897 compared to $p$=0.732, $r$=0.808, $F1$=0.768). For model interpretation, using one true positive sample, we show which sentences within a given speech are most relevant to depression detection; and which text tokens and Mel-spectrogram regions within these sentences are most relevant to depression detection. These interpretations allow clinicians to verify the validity of predictions made by depression detection tools, promoting their clinical implementations.

cs.CL↗
arXiv2026

Cultural Alignment in Large Language Models Using Soft Prompt Tuning

Large Language Model (LLM) alignment is commonly achieved through supervised fine-tuning or reinforcement learning, both of which require labeled or preference data and update model weights. Without targeted cultural adaptation, however, deployed LLMs often exhibit culturally homogeneous behavior that fails to reflect diverse local values. Aligning models to cultural value frameworks such as Hofstede's Value Survey Module (VSM13) presents a distinct challenge: alignment signals are available only as aggregated survey-level scores computed after generating responses to an entire survey, providing no per-token gradient and requiring no preference data by construction. This makes standard gradient-based alignment methods ill-suited to the task. We propose a deployment-friendly approach that encodes cultural behavior in short, tunable soft prompts optimized with Differential Evolution (DE), while keeping model weights frozen and requiring no preference data. At inference, the system inserts the appropriate cultural-specific prompt to adapt model responses for different cultures. Experiments across four countries and four instruction-tuned models show that DE-optimized prompts generally reduce discrepancy with VSM13 reference profiles, improve rank agreement with the World Values Survey (WVS), an independent framework not seen during optimization, and are preferred in blinded pairwise evaluations using majority voting across three LLM judges.

cs.CL↗
arXiv2026

VQ-Logits: Compressing the Output Bottleneck of Large Language Models via Vector Quantized Logits

Large Language Models (LLMs) have achieved remarkable success but face significant computational and memory challenges, particularly due to their extensive output vocabularies. The final linear projection layer, mapping hidden states to vocabulary-sized logits, often constitutes a substantial portion of the model's parameters and computational cost during inference. Existing methods like adaptive softmax or hierarchical softmax introduce structural complexities. In this paper, we propose VQ-Logits, a novel approach that leverages Vector Quantization (VQ) to drastically reduce the parameter count and computational load of the LLM output layer. VQ-Logits replaces the large V * dmodel output embedding matrix with a small, shared codebook of K embedding vectors (K << V ). Each token in the vocabulary is mapped to one of these K codebook vectors. The LLM predicts logits over this compact codebook, which are then efficiently "scattered" to the full vocabulary space using the learned or preassigned mapping. We demonstrate through extensive experiments on standard language modeling benchmarks (e.g., WikiText-103, C4) that VQ-Logits can achieve up to 99% parameter reduction in the output layer and 6x speedup in logit computation, with only a marginal 4% increase in perplexity compared to full softmax baselines. We further provide detailed ablation studies on codebook size, initialization, and learning strategies, showcasing the robustness and effectiveness of our approach.

cs.CL↗