SearcharxivSearch

arXiv subjects

Noah Solomon

Publications and source records attributed to Noah Solomon.

4 recordsLinked to original sources

LLMscope: Extracting LLM Assets from Edge AI Chips via Optical Probing

The move of LLM inference to edge AI accelerators introduces new physical vulnerabilities. During execution, model parameters and intermediate inference states are repeatedly loaded into and processed on the chip, making them suscep- tible to physical side-channel attacks. In this work, by deploying laser voltage imaging, we show that one can extract LLM assets during inference, namely embeddings, attention, and quantized MLP weights, activations, and other inference states, from localized memories and compute subcircuits. To validate our claims, we perform an attack on an FPGA-based LLM accelerator. Since such accelerators reuse the same buffers and compute subcircuits across addresses, tiles, modules, and layers, reading asset values comes down to probing different memories during inference. We demonstrate full recovery of the targeted values; however, we also establish a methodology to recover asset values even if some weights or bits remain unread. We further derive lower bounds that relate imaging effort to asset dimensions and show that even direct recovery scales linearly with the size of the targeted asset

cs.CR

Matroid correspondence

Motivated by algebraic correspondences and linear operators associated with volume and Lorentzian polynomials, we introduce matroid correspondences and their polymatroid analogues. A matroid correspondence defines a functor between poset categories of matroids whose morphisms are matroid quotients, and various standard functors, including deletion, contraction, free extension, truncation, intersection, union, and pullback, arise in this way. We show that these correspondences preserve representability and algebraicity under natural hypotheses. In the polymatroid setting, we establish compatibility with multisymmetric lifts. Finally, we relate this construction to the supports of linear operators with Lorentzian symbols.

math.CO

Twice-Marked Banana Graphs & Brill-Noether Generality

We analyze a family of graphs known as banana graphs, with two marked vertices, through the lens of Hurwitz-Brill-Noether theory. As an application, we construct explicit new examples of finite graphs which are Brill-Noether general. These are the first such examples since the analysis of chains of loops by Cools, Draisma, Payne and Robeva. The graphs constructed are chains of loops and "theta graphs," which are banana graphs of genus 2. We also demonstrate that almost all banana graphs of genus at least 3 cannot be used for this purpose, due either to failure of a submodularity condition or to the presence of far too many inversions in certain permutations associated to divisors called transmission permutations.

math.CO

On some notions of rank for matrices over tracts

Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of matrices that one finds scattered throughout the literature.

math.CO