2 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.CL2024★ 2 cited
Extracting Paragraphs from LLM Token Activations
Nicholas Pochinkov, Angelo Benoit, Lovkush Agarwal +2
Generative large language models (LLMs) excel in natural language processing tasks, yet their inner workings remain underexplored beyond token-level predictions. This study investi…
math.LO2015★ 2 cited
pairwise non-isomorphic maximal-closed subgroups of Sym via the classification of the reducts of the Henson digraphs
Lovkush Agarwal, Michael Kompatscher
Given two structures and on the same domain, we say that is a reduct of if all -definable relations of $\mathcal{…
math.LO2014★ 1 cited
Reducts of the Generic Digraph
Lovkush Agarwal
The generic digraph is the unique countable homogeneous digraph that embeds all finite digraphs. In this paper, we determine the lattice of reducts of , where a stru…