Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maya Kruse

dblp:395/2158 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 44% Information extraction and text analysis · 44% Language models and text generation · 13%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge graphs
knowledge graph retrieval
1.012026
LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval · ACL (1) 2026
Natural language and speech › Information extraction and text analysis
named entity recognition
0.912025
OpenNER 1.0: Standardized Open-Access Named Entity Recognition Datasets in 50+ Languages · EMNLP 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Simple Yet Effective: An Information-Theoretic Approach to Multi-LLM Uncertainty Quantification · EMNLP 2025
Natural language and speech › Language models and text generation › chain-of-thought reasoning
chain-of-thought distillation
0.312025
Simple Yet Effective: An Information-Theoretic Approach to Multi-LLM Uncertainty Quantification · EMNLP 2025

Methods — techniques the papers use, named apart from their topics

on-demand caching · 2.0degree-aware partitioning · 2.0cross-graph routing · 2.0subset ensembles · 0.9multilingual language model · 0.9large language model · 0.9jensen-shannon divergence · 0.9information theory · 0.9
YearPublicationVenuePosition
2026 LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval
abstract
-hop retrieval on large KGs by building on symbolic KG formulations and executing traversal as hardware-efficient operations over decomposed subject, object, and relation representations. To scale to billion-edge graphs, LogosKG integrates degree-aware partitioning, cross-graph routing, and on-demand caching. Experiments show substantial efficiency gains over CPU and GPU baselines without loss of retrieval fidelity. With proven performance in KG retrieval, a downstream two-round KG-LLM interaction demonstrates how LogosKG enables large-scale, evidence-grounded analysis of how KG topology, such as hop distribution and connectivity, shapes the alignment between structured biomedical knowledge and LLM diagnostic reasoning, thereby opening the door for next-generation KG-LLM integration. The source code is publicly available at https://github.com/LARK-NLP-Lab/LogosKG, and an online demo is available at https://lark-nlp-lab-logoskg.hf.space/.
He Cheng, Yifu Wu, Saksham Khatwani, Maya Kruse, Dmitriy Dligach, Timothy A. Miller, Majid Afshar, Yanjun Gao
ACL (1)4
2025 Simple Yet Effective: An Information-Theoretic Approach to Multi-LLM Uncertainty Quantification
abstract
Large language models (LLMs) often behave inconsistently across inputs, indicating uncertainty and motivating the need for its quantification in high-stakes settings. Prior work on calibration and uncertainty quantification often focuses on individual models, overlooking the potential of model diversity. We hypothesize that LLMs make complementary predictions due to differences in training and the Zipfian nature of language, and that aggregating their outputs leads to more reliable uncertainty estimates. To leverage this, we propose MUSE (Multi-LLM Uncertainty via Subset Ensembles), a simple information-theoretic method that uses Jensen-Shannon Divergence to identify and aggregate well-calibrated subsets of LLMs. Experiments on binary prediction tasks demonstrate improved calibration and predictive performance compared to single-model and naïve ensemble baselines. In addition, we explore using MUSE as guided signals with chain-of-thought distillation to fine-tune LLMs for calibration. MUSE is available at:https://github.com/LARK-NLP-Lab/MUSE.
Maya Kruse, Majid Afshar, Saksham Khatwani, Anoop M. Mayampurath, Yanjun Gao
EMNLP1
2025 OpenNER 1.0: Standardized Open-Access Named Entity Recognition Datasets in 50+ Languages
abstract
We present OpenNER 1.0, a standardized collection of openly-available named entity recognition (NER) datasets.OpenNER contains 36 NER corpora that span 52 languages, humanannotated in varying named entity ontologies.We correct annotation format issues, standardize the original datasets into a uniform representation with consistent entity type names across corpora, and provide the collection in a structure that enables research in multilingual and multi-ontology NER.We provide baseline results using three pretrained multilingual language models and two large language models to compare the performance of recent models and facilitate future research in NER.We find that no single model is best in all languages and that significant work remains to obtain high performance from LLMs on the NER task.OpenNER is released at https://github.com/bltlab/open-ner.
Chester Palen-Michel, Maxwell Pickering, Maya Kruse, Jonne Sälevä, Constantine Lignos
EMNLP3