Jonathan Larson

Jonathan Larson

Auto-generated profile, based on publicly available information

Jonathan Larson

Microsoft Research, Redmond, WA, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2025
Verified
Conference Paper
Open access
PDF file
DMDasha Metropolitansky
Dasha Metropolitansky
JLJonathan Larson
Jonathan Larson
Dasha Metropolitansky, Jonathan Larson. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.

29 November 2023 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
CSCencheng Shen
Cencheng Shen
JLJonathan Larson
Jonathan Larson
HTHa Trinh
Ha Trinh
XQXihan Qin
Xihan Qin
YPYoungser Park
Youngser Park
CPCarey E. Priebe
Carey E. Priebe
Analyzing large-scale time-series network data, such as social media and email communications, poses a significant challenge in understanding social dynamics, detecting anomalies, and predicting trends. In particular, the scalability of graph analysis is a critical hurdle impeding progress in large-scale downstream inference. To address this challenge, we introduce a temporal encoder embedding method. This approach leverages ground-truth or estimated vertex labels, enabling an efficient embedding of large-scale graph data and the processing of billions of edges within minutes. Furthermore, this embedding unveils a temporal dynamic statistic capable of detecting communication pattern shifts across all levels, ranging from individual vertices to vertex communities and the overall graph structure. We provide theoretical support to confirm its soundness under random graph models, and demonstrate its numerical advantages in capturing evolving communities and identifying outliers. Finally, we showcase the practical application of our approach by analyzing an anonymized time-series communication network from a large organization spanning 2019–2020, enabling us to assess the impact of Covid-19 on workplace communication patterns.

22 June 2025
Verified
Conference Paper
Open access
JCJoyce Cahoon
Joyce Cahoon
PSPrerna Singh
Prerna Singh
NLNick Litombe
Nick Litombe
JLJonathan Larson
Jonathan Larson
HTHa Trinh
Ha Trinh
CCCarlo Curino
Carlo Curino

30 June 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
CSCencheng Shen
Cencheng Shen
YDYuexiao Dong
Yuexiao Dong
CPCarey E. Priebe
Carey E. Priebe
JLJonathan Larson
Jonathan Larson
HTHa Trinh
Ha Trinh
YPYoungser Park
Youngser Park
In this paper, we introduce the concept of principal communities and propose a principal graph encoder embedding method that concurrently detects these communities and achieves vertex embedding. Given a graph adjacency matrix with vertex labels, the method computes a sample community score for each community, ranking them to measure community importance and estimate a set of principal communities. The method then produces a vertex embedding by retaining only the dimensions corresponding to these principal communities. Theoretically, we define the population version of the encoder embedding and the community score based on a random Bernoulli graph distribution. We prove that the population principal graph encoder embedding preserves the conditional density of the vertex labels and that the population community score successfully distinguishes the principal communities. We conduct a variety of simulations to demonstrate the finite-sample accuracy in detecting ground-truth principal communities, as well as the advantages in embedding visualization and subsequent vertex classification. The method is further applied to a set of real-world graphs, showcasing its numerical advantages, including robustness to label noise and computational scalability.

25 September 2023 in arXiv
Verified
Preprint
Open access
PDF file
IMIda Momennejad
Ida Momennejad
HHHosein Hasanbeig
Hosein Hasanbeig
FVFelipe Vieira
Felipe Vieira
HSHiteshi Sharma
Hiteshi Sharma
RNRobert Osazuwa Ness
Robert Osazuwa Ness
JLJonathan Larson
Jonathan Larson
Recently an influx of studies claim emergent cognitive abilities in large language models (LLMs). Yet, most rely on anecdotes, overlook contamination of training sets, or lack systematic Evaluation involving multiple tasks, control conditions, multiple iterations, and statistical robustness tests. Here we make two major contributions. First, we propose CogEval, a cognitive science-inspired protocol for the systematic evaluation of cognitive capacities in Large Language Models. The CogEval protocol can be followed for the evaluation of various abilities. Second, here we follow CogEval to systematically evaluate cognitive maps and planning ability across eight LLMs (OpenAI GPT-4, GPT-3.5-turbo-175B, davinci-003-175B, Google Bard, Cohere-xlarge-52.4B, Anthropic Claude-1-52B, LLaMA-13B, and Alpaca-7B). We base our task prompts on human experiments, which offer both established construct validity for evaluating planning, and are absent from LLM training sets. We find that, while LLMs show apparent competence in a few planning tasks with simpler structures, systematic evaluation reveals striking failure modes in planning tasks, including hallucinations of invalid trajectories and getting trapped in loops. These findings do not support the idea of emergent out-of-the-box planning ability in LLMs. This could be because LLMs do not understand the latent relational structures underlying planning problems, known as cognitive maps, and fail at unrolling goal-directed trajectories based on the underlying structure. Implications for application and future directions are discussed.

4 October 2022 in Pattern Recognition
Verified
Journal Article
Open access
HHHayden S. Helm
Hayden S. Helm
ABAmitabh Basu
Amitabh Basu
AAAvanti Athreya
Avanti Athreya
YPYoungser Park
Youngser Park
JVJoshua T. Vogelstein
Joshua T. Vogelstein
CWChristopher W. White
Christopher W. White