SearcharxivSearch

arXiv subjects

Alvin Moon

Publications and source records attributed to Alvin Moon.

10 recordsLinked to original sources

When Models Disagree: Rethinking LLM Evaluation for Public Comment Analysis

Federal agencies are deploying large language models (LLMs) to categorize public comment corpora, where the model's organization of the record shapes what policymakers see and which arguments register. Standard evaluation, anchored on stance accuracy against a small validated set, cannot detect when different models produce materially different categorizations of the same public input. We propose an Interpretive Audit Pipeline that treats multi-model disagreement as diagnostic of interpretive complexity and directs human review toward genuinely ambiguous public input. Analyzing 1,260 public comments on a federal USDA docket across four LLMs, we find that inter-model thematic divergence exceeds within-model prompt variation, and that an expert rubric suppresses deep interpretive disagreement without resolving it. In a two-stage labeling study on a stratified 40-comment subsample, four LLMs and a human annotator labeled independently and then revised after seeing the others' labels. Revision behavior varied across labelers, and the human annotator's revisions frequently introduced framings absent from the ensemble's collective output. We argue disagreement-based evaluation is a necessary complement to accuracy metrics for LLM-assisted interpretive coding.

cs.AI

Assessing the Practical Feasibility of the Clader-Jacobs-Sprouse Quantum Algorithm for Calculating Radar Cross Sections

In 2013, Clader, Jacobs, and Sprouse developed a quantum computing algorithm that solves electromagnetic scattering problems exponentially faster than the best known classical algorithm for that problem. We examine this quantum algorithm's potential practical feasibility for modeling a target's radar cross section. Doing so could be important for modeling and predicting radar behavior against emerging targets.

quant-ph

Randomized Zero Forcing

We introduce randomized zero forcing (RZF), a stochastic color-change process on directed graphs in which a white vertex turns blue with probability equal to the fraction of its incoming neighbors that are blue. Unlike probabilistic zero forcing, RZF is governed by in-neighborhood structure and can fail to propagate globally due to directionality. The model extends naturally to weighted directed graphs by replacing neighbor counts with incoming weight proportions. We study the expected propagation time of RZF, establishing monotonicity properties with respect to enlarging the initial blue set and increasing weights on edges out of initially blue vertices, as well as invariances that relate weighted and unweighted dynamics. Exact values and sharp asymptotics are obtained for several families of directed graphs, including arborescences, stars, paths, cycles, and spiders, and we derive tight extremal bounds for unweighted directed graphs in terms of basic parameters such as order, degree, and radius. We conclude with an application to an empirical input-output network, illustrating how expected propagation time under RZF yields a dynamic, process-based notion of centrality in directed weighted systems.

math.CO

Estimating systemic importance with missing data in input-output graphs

In the context of the Cobb-Douglas productivity model we consider the $N \times N$ input-output linkage matrix $W$ for a network of $N$ firms $f_1, f_2, \cdots, f_N$. The associated influence vector $v_w$ of $W$ is defined in terms of the Leontief inverse $L_W$ of $W$ as $v_W = \frac{\alpha}{N} L_W \vec{\mathbf{1}}$ where $L_W = (I - (1-\alpha) W')^{-1}$, $W'$ denotes the transpose of $W$ and $I$ is the identity matrix. Here $\vec{\mathbf{1}}$ is the $N \times 1$ vector whose entries are all one. The influence vector is a metric of the importance for the firms in the production network. Under the realistic assumption that the data to compute the influence vector is incomplete, we prove bounds on the worst-case error for the influence vector that are sharp up to a constant factor. We also consider the situation where the missing data is binomially distributed and contextualize the bound on the influence vector accordingly. We also investigate how far off the influence vector can be when we only have data on nodes and connections that are within distance $k$ of some source node. A comparison of our results is juxtaposed against PageRank analogues. We close with a discussion on a possible extension beyond Cobb-Douglas to the Constant Elasticity of Substitution model, as well as the possibility of considering other probability distributions for missing data.

cs.DM

The double semion state in infinite volume

We describe in a simple setting how to extract a unitary braided fusion category from a collection of superselection sectors of a two-dimensional quantum spin system, corresponding to abelian anyons. The structure of the unitary braided fusion category is given by F and R-symbols, which describe fusion and braiding of the anyons. We then construct the double semion state in infinite volume and extract the unitary braided fusion category describing its semion, anti-semion, and bound state excitations. We verify that this category corresponds to the representation category of the twisted quantum double of Z_2.

math-ph

A Lieb-Robinson bound for quantum spin chains with strong on-site impurities

We consider a quantum spin chain with nearest neighbor interactions and sparsely distributed on-site impurities. We prove commutator bounds for its Heisenberg dynamics which incorporate the coupling strengths of the impurities. The impurities are assumed to satisfy a minimum spacing, and each impurity has a non-degenerate spectrum. Our results are proven in a broadly applicable setting, both in finite volume and in thermodynamic limit. We apply our results to improve Lieb-Robinson bounds for the Heisenberg spin chain with a random, sparse transverse field drawn from a heavy-tailed distribution.

math-ph

Automorphic equivalence preserves the split property

We prove that the split property is a stable feature for spin chain states which are related by composition with *-automorphisms generated by power-law decaying interactions. We apply this to the theory of the $\mathbb{Z}_2$-index for gapped ground states of symmetry protected topological phases to show that the $\mathbb{Z}_2$-index is an invariant of gapped classification of phases containing fast-decaying interactions.

math-ph

Automorphic equivalence within gapped phases in the bulk

We develop a new adiabatic theorem for unique gapped ground states which does not require the gap for local Hamiltonians. We instead require a gap in the bulk and a smoothness of expectation values of sub-exponentially localized observables in the unique gapped ground state $φ_s(A)$. This requirement is weaker than the requirement of the gap of the local Hamiltonians, since a uniform spectral gap for finite dimensional ground states implies a gap in the bulk for unique gapped ground states, as well as the smoothness.

math-ph

Stability of Gapped Ground State Phases of Spins and Fermions in One Dimension

We investigate the persistence of spectral gaps of one-dimensional frustration free quantum lattice systems under weak perturbations and with open boundary conditions. Assuming the interactions of the system satisfy a form of local topological quantum order, we prove explicit lower bounds on the ground state spectral gap and higher gaps for spin and fermion chains. By adapting previous methods using the spectral flow, we analyze the bulk and edge dependence of lower bounds on spectral gaps.

math-ph