6 papers
Every pooling rule has its world: matching probability combination rules to situations and stakes
Tanel Tammet, Priit Järv, Dirk Draheim
Systems often need to combine two numerical assessments of the same yes/no question. The appropriate formula depends on what the numbers represent and on how the sources are relate…
Structure-Preserving Uncertainty Propagation in First-Order Proof Search
Tanel Tammet
GK is a query-directed first-order prover that extends ordinary resolution-based proof search with explicit positive and negative claims, numerical confidence values, and prioritiz…
Beyond the Linear Separability Ceiling: Aligning Representations in VLMs
Enrico Vompa, Tanel Tammet, Mohit Vaishnav
A challenge in advancing Visual-Language Models (VLMs) is determining whether their failures on abstract reasoning tasks, such as Bongard problems, stem from flawed perception or f…
The Scaling Properties of Implicit Deductive Reasoning in Transformers
Enrico Vompa, Tanel Tammet
We investigate the scaling properties of implicit deductive reasoning over Horn clauses in depth-bounded Transformers. By systematically decorrelating provability from spurious fea…
Symbolic Grounding Reveals Representational Bottlenecks in Abstract Visual Reasoning
Mohit Vaishnav, Tanel Tammet
Vision--language models (VLMs) often fail on abstract visual reasoning benchmarks such as Bongard problems, raising the question of whether the main bottleneck lies in reasoning or…
A Cognitive Paradigm Approach to Probe the Perception-Reasoning Interface in VLMs
Mohit Vaishnav, Tanel Tammet
A fundamental challenge in artificial intelligence involves understanding the cognitive mechanisms underlying visual reasoning in sophisticated models like Vision-Language Models (…