Výsledky vyhledávání - "AGARWAL, LOVKUSH"

Report

Extracting Paragraphs from LLM Token Activations

Autor: Pochinkov, Nicholas, Benoit, Angelo, Agarwal, Lovkush, Majid, Zainab Ali, Ter-Minassian, Lucile

Generative large language models (LLMs) excel in natural language processing tasks, yet their inner workings remain underexplored beyond token-level predictions. This study investigates the degree to which these models decide the content of a paragra

Externí odkaz: http://arxiv.org/abs/2409.06328

Zobrazit plný text záznamu

Dissertation/ Thesis

Reducts of aleph_zero-categorical structures

Autor: Agarwal, Lovkush

Given two structures M and N on the same domain, we say that N is a reduct of M if all emptyset-definable relations of N are emptyset-definable in M. In this thesis, the reducts of the generic digraph, the Henson digraphs, the countable vector space

Externí odkaz: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.698265

Zobrazit plný text záznamu

Report

$2^{\aleph_0}$ pairwise non-isomorphic maximal-closed subgroups of Sym$(\mathbb{N})$ via the classification of the reducts of the Henson digraphs

Autor: Agarwal, Lovkush, Kompatscher, Michael

Given two structures $\mathcal{M}$ and $\mathcal{N}$ on the same domain, we say that $\mathcal{N}$ is a reduct of $\mathcal{M}$ if all $\emptyset$-definable relations of $\mathcal{N}$ are $\emptyset$-definable in $\mathcal{M}$. In this article the re

Externí odkaz: http://arxiv.org/abs/1509.07674

Zobrazit plný text záznamu

Report

Reducts of the Generic Digraph

Autor: Agarwal, Lovkush

The generic digraph $(D,E)$ is the unique countable homogeneous digraph that embeds all finite digraphs. In this paper, we determine the lattice of reducts of $(D,E)$, where a structure $\mathcal{M}$ is a reduct of $(D,E)$ if it has domain $D$ and al

Externí odkaz: http://arxiv.org/abs/1411.4820

Zobrazit plný text záznamu