SearcharxivSearch

arXiv subjects

Stephen D. Smith

Publications and source records attributed to Stephen D. Smith.

4 recordsLinked to original sources

Differentiable Logic Gate Networks for Low-Latency EEG Classification on Edge Devices

Real-time EEG classification on edge devices is bottlenecked by the floating-point arithmetic of conventional neural networks. We investigated Differentiable Logic Gate Networks (Diff-Logic) as a hardware-native alternative that compiles models into pure Boolean circuits executable via bitwise CPU operations. Through rigorous iso-parameter experiments across four EEG datasets spanning two classification tasks, binary dementia detection and 3-class emotion recognition, we compared Diff-Logic against matched-capacity Multi-Layer Perceptron (MLP) and Binarized Neural Network (BNN) baselines at four complexity tiers (50k-500k parameters). On dementia screening, Diff-Logic achieved 80.2% Macro F1, outperforming the MLP baseline by 6.8%. On emotion recognition, the MLP retained a moderate performance advantage but incurred a 2.3$\times$ higher latency and 14$\times$ larger model size when deployed on a power-constrained (7W) Nvidia Jetson Orin Nano CPU (Single-core). Critically, Diff-Logic inference time remained nearly constant across a 10$\times$ increase in model scale, achieving a peak speedup of 2.9$\times$ over MLPs at the largest complexity tier. Our results establish logic-based neural architectures as a practical paradigm for resource-constrained brain-computer interfaces, achieving competitive or superior performance while natively satisfying the latency and memory constraints of portable edge deployment. Code is available on GitHub: https://github.com/Shyamal-Dharia/eeg-difflogic

cs.LG

Some results on Quillen's Conjecture via equivalent-poset techniques

We extend the Main Theorem of Aschbacher and Smith on Quillen's Conjecture from $p>5$ to the remaining odd primes $p = 3,5$. In the process, we develop further combinatorial and homotopical methods for studying the poset of nontrivial elementary abelian $p$-subgroups of a finite group. The techniques lead to a number of further results on the Conjecture, often reducing dependence on the CFSG; in particular, we also provide some partial results toward the case of $p=2$.

math.GR

Eliminating components in Quillen's Conjecture

We generalize an earlier result of Segev, which shows that {\em some\/} component in a minimal counterexample to Quillen's conjecture must admit an outer automorphism. We show in fact that {\em every\/} component must admit an outer automorphism. Thus we transform his restriction-result on components to an elimination-result: namely one which excludes any component which does not admit an outer automorphism. Indeed we show that the outer automorphisms admitted must include $p$-outers: that is, outer automorphisms of order divisible by $p$. This gives stronger, concrete eliminations: for example if $p$ is odd, it eliminates sporadic and alternating components -- thus reducing to Lie-type components (and typically forcing $p$-outers of field type). For $p = 2$, we obtain similar but less restrictive results. We also provide some tools to help eliminate suitable components that do admit $p$-outers in a minimal counterexample.

math.GR

Propagating sharp group homology decompositions

A collection C of subgroups of a finite group G can give rise to three different standard formulas for the cohomology of G in terms of either: the subgroups in C; or their centralizers; or their normalizers. We give a short but systematic study of the relationship among such formulas for nine standard collections C of p-subgroups, obtaining some new formulas in the process. To do this, we exhibit some sufficient conditions on the poset C which imply comparison results.

math.AT