Search Results for author:
Found 8 papers, 3 papers with code
Tiny Transformers Excel at Sentence Compression
It is staggering that words of the English language, which are on average represented by 5--6 bytes of ASCII, require as much as 24 kilobytes when served to large language models.
Exponentially Faster Language Modelling
Language models only really need to use an exponential fraction of their neurons for individual inferences.
Fast Feedforward Networks
We break the linear link between the layer size and its inference cost by introducing the fast feedforward (FFF) architecture, a log-time alternative to feedforward networks.
Examining the Emergence of Deductive Reasoning in Generative Language Models
We conduct a preliminary inquiry into the ability of generative transformer models to deductively reason from premises provided.
Neural Combinatorial Logic Circuit Synthesis from Input-Output Examples
We propose a novel, fully explainable neural approach to synthesis of combinatorial logic circuits from input-output examples.
Deterministic Graph-Walking Program Mining
These programs characterise linear long-distance relationships between the given two vertex sets in the context of the whole graph.
The LL(finite) strategy for optimal LL(k) parsing
The LL(finite) parsing strategy for parsing of LL(k) grammars where k needs not to be known is presented.
Fast Agent-Based Simulation Framework with Applications to Reinforcement Learning and the Study of Trading Latency Effects
As a simple illustration, we employ our toolbox to investigate the role of the order processing delay in normal trading and for the scenario of a significant price change.
