SearcharxivSearch

arXiv subjects

Yizhou Ma

Publications and source records attributed to Yizhou Ma.

3 recordsLinked to original sources

Bulk-boundary correspondence of (1+1)D symmetric gapped phases

We develop an operator-algebraic framework for boundary conditions and bulk-boundary correspondence in one-dimensional gapped phases with categorical symmetry. Working directly in the thermodynamic limit, we construct half-infinite fusion spin chains and commuting-projector boundary Hamiltonians from a unitary fusion category $\mathcal{C}$, an indecomposable semisimple right $\mathcal{C}$-module category $\mathcal{M}$, a Q-system $Q\in\mathcal{C}$ specifying the bulk phase, and a right $Q$-module $K\in\mathcal{M}_{Q}$, regarded as an object of $\mathcal{M}_{Q}^{\mathrm{op}}$, specifying the boundary. We prove that these Hamiltonians have unique ground states and that the resulting realization functor $\mathcal{M}_{Q}^{\mathrm{op}}\to\mathrm{BCond}$ is an equivalence, so simple boundary conditions are classified by simple objects of $\mathcal{M}_{Q}$ and general boundary conditions by their finite direct sums. We also give a microscopic formulation of the boundary symmetry topological field theory using DHR bimodules of the boundary quasi-local algebra. For a half-infinite fusion spin chain, the boundary DHR category is monoidally equivalent to $(\mathcal{C}_{\mathcal{M}}^{\vee})^{\mathrm{rev}}$, and the canonical action of the bulk DHR category on it agrees with the categorical action of $Z_1(\mathcal{C}^{\mathrm{rev}})$. Finally, we identify the action of the boundary DHR category on boundary conditions with the categorical action of $(\mathcal{C}_{\mathcal{M}}^{\vee})^{\mathrm{rev}}$ on $\mathcal{M}_{Q}^{\mathrm{op}}$. This yields a one-dimensional bulk-boundary correspondence: the enriched monoidal category describing the bulk is the enriched center of the enriched category describing the boundary.

math-ph

A MATLAB tutorial on deep feature extraction combined with chemometrics for analytical applications

Background In analytical chemistry, spatial information about materials is commonly captured through imaging techniques, such as traditional color cameras or with advanced hyperspectral cameras and microscopes. However, efficiently extracting and analyzing this spatial information for exploratory and predictive purposes remains a challenge, especially when using traditional chemometric methods. Recent advances in deep learning and artificial intelligence have significantly enhanced image processing capabilities, enabling the extraction of multiscale deep features that are otherwise challenging to capture with conventional image processing techniques. Despite the wide availability of open-source deep learning models, adoption in analytical chemistry remains limited because of the absence of structured, step-by-step guidance for implementing these models. Results This tutorial aims to bridge this gap by providing a step-by-step guide for applying deep learning approaches to extract spatial information from imaging data and integrating it with other data sources, such as spectral information. Importantly, the focus of this work is not on training deep learning models for image processing but on using existing open source models to extract deep features from imaging data. Significance The tutorial provides MATLAB code tutorial demonstrations, showcasing the processing of imaging data from various imaging modalities commonly encountered in analytical chemistry. Readers must run the tutorial steps on their own datasets using the codes presented in this tutorial.

cs.CV

Enhancing Federated Learning with Kolmogorov-Arnold Networks: A Comparative Study Across Diverse Aggregation Strategies

Multilayer Perceptron (MLP), as a simple yet powerful model, continues to be widely used in classification and regression tasks. However, traditional MLPs often struggle to efficiently capture nonlinear relationships in load data when dealing with complex datasets. Kolmogorov-Arnold Networks (KAN), inspired by the Kolmogorov-Arnold representation theorem, have shown promising capabilities in modeling complex nonlinear relationships. In this study, we explore the performance of KANs within federated learning (FL) frameworks and compare them to traditional Multilayer Perceptrons. Our experiments, conducted across four diverse datasets demonstrate that KANs consistently outperform MLPs in terms of accuracy, stability, and convergence efficiency. KANs exhibit remarkable robustness under varying client numbers and non-IID data distributions, maintaining superior performance even as client heterogeneity increases. Notably, KANs require fewer communication rounds to converge compared to MLPs, highlighting their efficiency in FL scenarios. Additionally, we evaluate multiple parameter aggregation strategies, with trimmed mean and FedProx emerging as the most effective for optimizing KAN performance. These findings establish KANs as a robust and scalable alternative to MLPs for federated learning tasks, paving the way for their application in decentralized and privacy-preserving environments.

cs.LG