SearcharxivSearch

arXiv subjects

James Mitchell

Publications and source records attributed to James Mitchell.

10 recordsLinked to original sources

LadderTeam: Dual-Agent Laddering Elicitation Framework

Eliciting detailed and actionable software requirements from end-users is a critical phase in the iterative development of a software product or application. To ensure the feedback collected is detailed and actionable, software teams can leverage the laddering interview technique. While effective for ensuring granular and actionable items from the software feedback, these interviews are subject to several limitations. They are traditionally a manual process associated with a time and financial burden, limiting scalability; interviewers must balance probing for depth while managing interviewee behavioral and cultural constraints. To address these limitations, we present \textbf{LadderTeam}, an open, reproducible framework that automates UX wireframe interviews using a dual-agent Large Language Model (LLM) architecture. An active interviewer agent executes one of three probing strategies (ACV, 5-Whys, and JTBD) to elicit actionable software requirements from usability feedback comments, while a concurrent background Judge agent evaluates probe-response pairs and triggers real-time guardrails to prevent topic drift. To rigorously evaluate LLM laddering without participant variance confounds, we introduce a controlled simulation methodology utilizing scripted ground-truth transcripts to isolate probe quality as the sole experimental variable. Across 216 interviews, \textbf{LadderTeam} achieved 99.1\% chain convergence and an 81.0\% ground-truth actionable response match (86.1\% reluctant personality, 75.9\% terse personality) with zero drift across all runs. All evaluation code, all transcripts, inputs, and a live demonstration platform will be open-sourced upon acceptance.

cs.SE

PLACID: Privacy-preserving Large language models for Acronym Clinical Inference and Disambiguation

Large Language Models (LLMs) offer transformative solutions across many domains, but healthcare integration is hindered by strict data privacy constraints. Clinical narratives are dense with ambiguous acronyms, misinterpretation these abbreviations can precipitate severe outcomes like life-threatening medication errors. While cloud-dependent LLMs excel at Acronym Disambiguation, transmitting Protected Health Information to external servers violates privacy frameworks. To bridge this gap, this study pioneers the evaluation of small-parameter models deployed entirely on-device to ensure privacy preservation. We introduce a privacy-preserving cascaded pipeline leveraging general-purpose local models to detect clinical acronyms, routing them to domain-specific biomedical models for context-relevant expansions. Results reveal that while general instruction-following models achieve high detection accuracy (~0.988), their expansion capabilities plummet (~0.655). Our cascaded approach utilizes domain-specific medical models to increase expansion accuracy to (~0.81). This novel work demonstrates that privacy-preserving, on-device (2B-10B) models deliver high-fidelity clinical acronym disambiguation support.

cs.CL

Monthly GDP Growth Estimates for the U.S. States

This paper develops a mixed frequency vector autoregressive (MF-VAR) model to produce nowcasts and historical estimates of monthly real state-level GDP for the 50 U.S. states, plus Washington DC, from 1964 through the present day. The MF-VAR model incorporates state and U.S. data at the monthly, quarterly, and annual frequencies. Temporal and cross-sectional constraints are imposed to ensure that the monthly state-level estimates are consistent with official estimates of quarterly GDP at the U.S. and state-levels. We illustrate the utility of the historical estimates in better understanding state business cycles and cross-state dependencies. We show how the model produces accurate nowcasts of state GDP three months ahead of the BEA's quarterly estimates, after conditioning on the latest estimates of U.S. GDP.

econ.EM

E-disjunctive inverse semigroups

In this paper we provide an overview of the class of inverse semigroups $S$ such that every congruence on $S$ relates at least one idempotent to a non-idempotent; such inverse semigroups are called $E$-disjunctive. This overview includes the study of the inverse semigroup theoretic structure of $E$-disjunctive semigroups; a large number of natural examples; some asymptotic results establishing the rarity of such inverse semigroups; and a general structure theorem for all inverse semigroups where the building blocks are $E$-disjunctive.

math.GR

Classifying the Polish semigroup topologies on the symmetric inverse monoid

We classify all Polish semigroup topologies on the symmetric inverse monoid on the natural numbers. This result answers a question of Elliott et al. There are countably infinitely many such topologies. Under containment, these Polish semigroup topologies form a join-semilattice with infinite descending chains, no infinite ascending chains, and arbitrarily large finite anti-chains. Also, we show that the monoid endowed with any second countable T_1 semigroup topology is homeomorphic to the Baire space.

math.RA

Predictive Density Combination Using a Tree-Based Synthesis Function

Bayesian predictive synthesis (BPS) provides a method for combining multiple predictive distributions based on agent/expert opinion analysis theory and encompasses a range of existing density forecast pooling methods. The key ingredient in BPS is a ``synthesis'' function. This is typically specified parametrically as a dynamic linear regression. In this paper, we develop a nonparametric treatment of the synthesis function using regression trees. We show the advantages of our tree-based approach in two macroeconomic forecasting applications. The first uses density forecasts for GDP growth from the euro area's Survey of Professional Forecasters. The second combines density forecasts of US inflation produced by many regression models involving different predictors. Both applications demonstrate the benefits -- in terms of improved forecast accuracy and interpretability -- of modeling the synthesis function nonparametrically.

econ.EM

Deep Neural Network Estimation in Panel Data Models

In this paper we study neural networks and their approximating power in panel data models. We provide asymptotic guarantees on deep feed-forward neural network estimation of the conditional mean, building on the work of Farrell et al. (2021), and explore latent patterns in the cross-section. We use the proposed estimators to forecast the progression of new COVID-19 cases across the G7 countries during the pandemic. We find significant forecasting gains over both linear panel and nonlinear time series models. Containment or lockdown policies, as instigated at the national-level by governments, are found to have out-of-sample predictive power for new COVID-19 cases. We illustrate how the use of partial derivatives can help open the "black-box" of neural networks and facilitate semi-structural analysis: school and workplace closures are found to have been effective policies at restricting the progression of the pandemic across the G7 countries. But our methods illustrate significant heterogeneity and time-variation in the effectiveness of specific containment policies.

econ.EM

Bayesian Modeling of TVP-VARs Using Regression Trees

In light of widespread evidence of parameter instability in macroeconomic models, many time-varying parameter (TVP) models have been proposed. This paper proposes a nonparametric TVP-VAR model using Bayesian additive regression trees (BART) that models the TVPs as an unknown function of effect modifiers. The novelty of this model arises from the fact that the law of motion driving the parameters is treated nonparametrically. This leads to great flexibility in the nature and extent of parameter change, both in the conditional mean and in the conditional variance. Parsimony is achieved through adopting nonparametric factor structures and use of shrinkage priors. In an application to US macroeconomic data, we illustrate the use of our model in tracking both the evolving nature of the Phillips curve and how the effects of business cycle shocks on inflation measures vary nonlinearly with changes in the effect modifiers.

econ.EM

Enumeration of idempotents in planar diagram monoids

We classify and enumerate the idempotents in several planar diagram monoids: namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The classification is in terms of certain vertex- and edge-coloured graphs associated to Motzkin diagrams. The enumeration is necessarily algorithmic in nature, and is based on parameters associated to cycle components of these graphs. We compare our algorithms to existing algorithms for enumerating idempotents in arbitrary (regular *-) semigroups, and give several tables of calculated values.

math.CO

The classification of normalizing groups

Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing if $$ \setminus G= .$$ If $G$ is $a$-normalizing for all $a\in \trans\setminus \sym$, then we say that $G$ is normalizing. The goal of this paper is to classify normalizing groups and hence answer a question posed elsewhere. The paper ends with a number of problems for experts in groups, semigroups and matrix theory.

math.GR