Picture for Ian Pratt-Hartmann

Ian Pratt-Hartmann

Improving Semantic Control in Discrete Latent Spaces with Transformer Quantized Variational Autoencoders

Add code
Feb 01, 2024
Viaarxiv icon

LlaMaVAE: Guiding Large Language Model Generation via Continuous Latent Sentence Spaces

Add code
Dec 20, 2023
Viaarxiv icon

Graph-Induced Syntactic-Semantic Spaces in Transformer-Based Variational AutoEncoders

Add code
Nov 14, 2023
Viaarxiv icon

Towards Controllable Natural Language Inference through Lexical Inference Types

Add code
Aug 07, 2023
Figure 1 for Towards Controllable Natural Language Inference through Lexical Inference Types
Figure 2 for Towards Controllable Natural Language Inference through Lexical Inference Types
Figure 3 for Towards Controllable Natural Language Inference through Lexical Inference Types
Figure 4 for Towards Controllable Natural Language Inference through Lexical Inference Types
Viaarxiv icon

Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks

Add code
May 02, 2023
Figure 1 for Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks
Figure 2 for Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks
Figure 3 for Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks
Figure 4 for Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks
Viaarxiv icon

Can Transformers Reason in Fragments of Natural Language?

Add code
Nov 10, 2022
Viaarxiv icon

Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination

Add code
Oct 12, 2022
Figure 1 for Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination
Figure 2 for Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination
Figure 3 for Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination
Figure 4 for Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination
Viaarxiv icon

Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards

Add code
May 15, 2021
Figure 1 for Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards
Figure 2 for Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards
Figure 3 for Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards
Figure 4 for Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards
Viaarxiv icon

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

Add code
May 19, 2009
Figure 1 for A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
Figure 2 for A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
Viaarxiv icon

Logics for the Relational Syllogistic

Add code
Aug 04, 2008
Figure 1 for Logics for the Relational Syllogistic
Figure 2 for Logics for the Relational Syllogistic
Figure 3 for Logics for the Relational Syllogistic
Figure 4 for Logics for the Relational Syllogistic
Viaarxiv icon