Opaque decisions
Reasoning paths are rarely accessible in a meaningful form.
We research alternative approaches to artificial intelligence where transparency, transferable representations, and principled computation are built in from the start.
Many high-performing systems arrive at an answer through representations that remain difficult to inspect. This creates practical limits for verification, scientific use, and work across domains.
Reasoning paths are rarely accessible in a meaningful form.
Similarity is encoded without an account of what corresponds.
Knowledge does not always travel cleanly between domains.
Claims can be difficult to trace, test, and contest.
We investigate models where reasoning can be inspected, traced, and explained through explicit structure and correspondence, rather than inferred solely from hidden states.
Systems whose decisions can be examined in context.
Structured, transferable forms of knowledge.
Finding meaningful matches across representations.
Reasoning that carries its structure between fields.
Explicit accounts of search, inference, and comparison.
Embodied systems with inspectable behavior.
Computational tools for interpretable biological inquiry.
Methods that make patterns available to investigation.
Hungarian-based Unified Nearest-neighbor/Embedding Recognition is an original framework for representation matching across domains.
It explores intelligence as a search process: structured representations are decomposed, indexed, and compared through explicit correspondence discovery. Similarity is grounded in identifiable structural matches, not exclusively opaque latent embeddings.
We are developing further frameworks, tools, and computational models for interpretable and trustworthy artificial intelligence.
We share work through research papers, technical reports, open-source software, demonstrations, and collaborations. Scientific rigor and a clear record of methods are central to our practice.