Search

We construct a family of chiral symmetry-protected third-order topological insulators by stacking Su-Schrieffer-Heeger (SSH) chains and provide a unified topological characterization by a series of Bott indices. Our approach is informed by the analytical solution of corner states for the model Hamiltonians written as a summation of the extended SSH model along three orthogonal directions. By utilizing the generalized Pauli matrices, an enumeration of the constructed model Hamiltonians generates ten distinct models, including the well-studied three-dimensional Benalcazar-Bernevig-Hughes model. By performing a boundary projection analysis for the ten models, we find that certain surfaces and hinges of the systems can exhibit, respectively, nontrivial second-order and first-order topology in the phase of the third-order topological insulators. Furthermore, we analyze the phase diagram for one of the predicted models and reveal a rich set of topological phases, including the third-order topological insulators, second-order weak topological insulators, and second-order nodal semimetals., Comment: 12 pages, 6 figures

Large-scale "pre-train and prompt learning" paradigms have demonstrated remarkable adaptability, enabling broad applications across diverse domains such as question answering, image recognition, and multimodal retrieval. This approach fully leverages the potential of large-scale pre-trained models, reducing downstream data requirements and computational costs while enhancing model applicability across various tasks. Graphs, as versatile data structures that capture relationships between entities, play pivotal roles in fields such as social network analysis, recommender systems, and biological graphs. Despite the success of pre-train and prompt learning paradigms in Natural Language Processing (NLP) and Computer Vision (CV), their application in graph domains remains nascent. In graph-structured data, not only do the node and edge features often have disparate distributions, but the topological structures also differ significantly. This diversity in graph data can lead to incompatible patterns or gaps between pre-training and fine-tuning on downstream graphs. We aim to bridge this gap by summarizing methods for alleviating these disparities. This includes exploring prompt design methodologies, comparing related techniques, assessing application scenarios and datasets, and identifying unresolved problems and challenges. This survey categorizes over 100 relevant works in this field, summarizing general design principles and the latest applications, including text-attributed graphs, molecules, proteins, and recommendation systems. Through this extensive review, we provide a foundational understanding of graph prompt learning, aiming to impact not only the graph mining community but also the broader Artificial General Intelligence (AGI) community., Comment: I have decided to temporarily withdraw this draft as I am in the process of making further revisions to improve its content

Non-Hermitian systems and their topological singularities, such as exceptional points (EPs), lines, and surfaces, have recently attracted intense interest. The investigation of these exceptional constituents has led to fruitful applications. The responsivity of the eigenvalue diverges at EPs, and chiral state transfer occurs when encircling an EP. Traditionally, it was believed that these exceptional features were unique to non-Hermitian systems requiring gain, loss, or nonreciprocal hopping. Here, we show that these exceptional features are also present in nonlinear Hermitian systems. We consider two coupled resonators with Kerr nonlinearity in one resonator, and no non-Hermitian terms. We identify EP-like points (ELPs) on the eigenspectra where the critical behaviors are the same as those of typical EPs. Additionally, this nonlinear Hermitian system can be mapped to linear non-Hermitian systems, with ELPs corresponding to EPs. We also demonstrate that encirclement around an ELP in the parameter space leads to unique chiral state transfer behavior., Comment: 15 pages, 3 figures and 43 references

The question-answering system for Life science research, which is characterized by the rapid pace of discovery, evolving insights, and complex interactions among knowledge entities, presents unique challenges in maintaining a comprehensive knowledge warehouse and accurate information retrieval. To address these issues, we introduce BioRAG, a novel Retrieval-Augmented Generation (RAG) with the Large Language Models (LLMs) framework. Our approach starts with parsing, indexing, and segmenting an extensive collection of 22 million scientific papers as the basic knowledge, followed by training a specialized embedding model tailored to this domain. Additionally, we enhance the vector retrieval process by incorporating a domain-specific knowledge hierarchy, which aids in modeling the intricate interrelationships among each query and context. For queries requiring the most current information, BioRAG deconstructs the question and employs an iterative retrieval process incorporated with the search engine for step-by-step reasoning. Rigorous experiments have demonstrated that our model outperforms fine-tuned LLM, LLM with search engines, and other scientific RAG frameworks across multiple life science question-answering tasks., Comment: 12 pages, 7 figures

The abundance of bulk and boundary topologies in higher-order topological phases offer remarkable tunability and diversity to boundary states but also pose a challenge to their unified topological characterization. In this work, we propose a theoretical framework to characterize time-reversal invariant topological superconductors hosting Majorana Kramers pairs (MKP) of corner states by using a series of spin Bott indices, which capture both bulk and boundary states topology. The developed invariants can characterize MKP in arbitrarily shaped systems and all distinct spatial distribution patterns of MKP. As an illustrative example, we apply our theory to analyze the Kane-Mele model with sublattice-dependent superconducting pairing potentials. In this representative model, various patterns of MKP can be engineered through edge cleavage, and despite their high sensitivity to boundary terminations, MKP can be faithfully characterized by the proposed topological invariants., Comment: 19 pages, 7 figures

Multimodal recommendation systems (MMRS) have received considerable attention from the research community due to their ability to jointly utilize information from user behavior and product images and text. Previous research has two main issues. First, many long-tail items in recommendation systems have limited interaction data, making it difficult to learn comprehensive and informative representations. However, past MMRS studies have overlooked this issue. Secondly, users' modality preferences are crucial to their behavior. However, previous research has primarily focused on learning item modality representations, while user modality representations have remained relatively simplistic.To address these challenges, we propose a novel Graphs and User Modalities Enhancement (GUME) for long-tail multimodal recommendation. Specifically, we first enhance the user-item graph using multimodal similarity between items. This improves the connectivity of long-tail items and helps them learn high-quality representations through graph propagation. Then, we construct two types of user modalities: explicit interaction features and extended interest features. By using the user modality enhancement strategy to maximize mutual information between these two features, we improve the generalization ability of user modality representations. Additionally, we design an alignment strategy for modality data to remove noise from both internal and external perspectives. Extensive experiments on four publicly available datasets demonstrate the effectiveness of our approach., Comment: 11 pages, accepted by CIKM 2024

M-type stars are the ones that flare most frequently, but how big their maximum flare energy can reach is still unknown. We present 163 flares from 162 individual M2 through L1-type stars that triggered the GWAC, with flare energies ranging from $10^{32.2}$ to $10^{36.4}$ erg . The flare amplitudes range from $\triangle G = 0.84$ to $\sim 10$ mag. Flare energy increases with stellar surface temperature ($T_{\rm eff}$) but both $\triangle G$ and equivalent duration $\log_{10}(ED)$ seem to be independent of $T_{\rm eff}$. Combining periods detected from light curves of TESS and K2, spectra from LAMOST, SDSS and the 2.16 m Telescope, and the Gaia DR3 data, we found that these GWAC flare stars are young. For the stars that have spectra, we found that these stars are in or very near to the saturation region, and $\log_{10}(L_{\rm H\alpha}/L_{\rm bol})$ is lower for M7-L1 stars than for M2-M6 stars. We also studied the relation between GWAC flare bolometric energy $E_{\rm bol}$ and stellar hemispherical area $S$, and found that $\log_{10}E_{\rm bol}$ (in erg) increases with increasing $S$ (in cm$^2$), and the maximum flare energy $\log_{10}E_{\rm bol, max} \geqslant \log_{10}S + 14.25$. For M7-L1 stars, there seem to be other factors limiting their maximum flare energies in addition to stellar hemispherical area., Comment: 18 pages, 11 figures, 4 tables

Quasi-parametric amplification (QPA) is a nonlinear interaction in which the idler wave is depleted through some loss mechanism. QPA plays an important role in signal amplification in ultrafast photonics and quantum light generation. The QPA process has a number of features characterized by the non-Hermitian parity-time ($\mathcal{PT}$) symmetry. In this report, we explore new interaction regimes and uncover multiple $\mathcal{PT}$-symmetry phase transitions in such QPA process where transitions are particularly sensitive to external parameters. In particular, we demonstrate the feasibility of detection of $10^{-11}$ inhomogeneities of the doped absorber, which is order of magnitude more sensitive than similar measurements performed in a linear absorption regime. In doing so, we reveal a family of $\mathcal{PT}$-symmetry phase transitions appearing in the QPA process and provide a novel nonlinear optical sensing mechanism for precise optical measurements., Comment: 17 pages, 6 figures

The prospected sensitivity in $\alpha_\mathrm{S}$ determination using an event shape observable, ratio of energy correlators at future electron-positron collider is presented. The study focuses on the collinear region which has suffered from large theoretical and hadronization uncertainty in the past. The ratio effectively reduces the impacts of the uncertainties. With the amount of data that future electron-positron collider could produce in 1 minute (40 $\text{pb}^{-1}$) and 0.5 hour (1 $\text{fb}^{-1}$), a 1% and 0.2% precision of $\alpha_\mathrm{S}$ could be reached., Comment: 10 pages, 4 figures

Higher-order topological insulators, as a novel family of topological phases, are a hot frontier in condensed matter physics due to their adherence to unconventional bulk-boundary correspondence. A three-dimensional second-order topological insulator can support one-dimensional modes along its hinges (dubbed as hinge states). Here, we present a simple and direct method to construct chiral hinge modes based on a Chern-insulator stack. We analyze the existence of the hinge modes through the nontrivial quadrupole indices, and then design a photonic crystal to realize the specific flowing pattern of the hinge mode in our model. The experimental results align well with full-wave simulations, clearly demonstrating the existence of chiral hinge states. We also verify the robustness of these hinge states against defects in our photonic system.

Recent advancements in single-cell genomics necessitate precision in gene panel selection to interpret complex biological data effectively. Those methods aim to streamline the analysis of scRNA-seq data by focusing on the most informative genes that contribute significantly to the specific analysis task. Traditional selection methods, which often rely on expert domain knowledge, embedded machine learning models, or heuristic-based iterative optimization, are prone to biases and inefficiencies that may obscure critical genomic signals. Recognizing the limitations of traditional methods, we aim to transcend these constraints with a refined strategy. In this study, we introduce an iterative gene panel selection strategy that is applicable to clustering tasks in single-cell genomics. Our method uniquely integrates results from other gene selection algorithms, providing valuable preliminary boundaries or prior knowledge as initial guides in the search space to enhance the efficiency of our framework. Furthermore, we incorporate the stochastic nature of the exploration process in reinforcement learning (RL) and its capability for continuous optimization through reward-based feedback. This combination mitigates the biases inherent in the initial boundaries and harnesses RL's adaptability to refine and target gene panel selection dynamically. To illustrate the effectiveness of our method, we conducted detailed comparative experiments, case studies, and visualization analysis., Comment: 25 pages

This paper addresses the challenge of incremental learning in growing graphs with increasingly complex tasks. The goal is to continually train a graph model to handle new tasks while retaining its inference ability on previous tasks. Existing methods usually neglect the importance of memory diversity, limiting in effectively selecting high-quality memory from previous tasks and remembering broad previous knowledge within the scarce memory on graphs. To address that, we introduce a novel holistic Diversified Memory Selection and Generation (DMSG) framework for incremental learning in graphs, which first introduces a buffer selection strategy that considers both intra-class and inter-class diversities, employing an efficient greedy algorithm for sampling representative training nodes from graphs into memory buffers after learning each new task. Then, to adequately rememorize the knowledge preserved in the memory buffer when learning new tasks, we propose a diversified memory generation replay method. This method first utilizes a variational layer to generate the distribution of buffer node embeddings and sample synthesized ones for replaying. Furthermore, an adversarial variational embedding learning method and a reconstruction-based decoder are proposed to maintain the integrity and consolidate the generalization of the synthesized node embeddings, respectively. Finally, we evaluate our model on node classification tasks involving increasing class numbers. Extensive experimental results on publicly accessible datasets demonstrate the superiority of DMSG over state-of-the-art methods.

Tabular data optimization methods aim to automatically find an optimal feature transformation process that generates high-value features and improves the performance of downstream machine learning tasks. Current frameworks for automated feature transformation rely on iterative sequence generation tasks, optimizing decision strategies through performance feedback from downstream tasks. However, these approaches fail to effectively utilize historical decision-making experiences and overlook potential relationships among generated features, thus limiting the depth of knowledge extraction. Moreover, the granularity of the decision-making process lacks dynamic backtracking capabilities for individual features, leading to insufficient adaptability when encountering inefficient pathways, adversely affecting overall robustness and exploration efficiency. To address the limitations observed in current automatic feature engineering frameworks, we introduce a novel method that utilizes a feature-state transformation graph to effectively preserve the entire feature transformation journey, where each node represents a specific transformation state. During exploration, three cascading agents iteratively select nodes and idea mathematical operations to generate new transformation states. This strategy leverages the inherent properties of the graph structure, allowing for the preservation and reuse of valuable transformations. It also enables backtracking capabilities through graph pruning techniques, which can rectify inefficient transformation paths. To validate the efficacy and flexibility of our approach, we conducted comprehensive experiments and detailed case studies, demonstrating superior performance in diverse scenarios., Comment: 17 pages

Reaching a high precision of the top quark mass is an important task of the Large Hadron Collider. We perform a feasibility study of measuring the top quark mass through the three-point energy correlator. The expected sensitivity of the top quark mass in the boosted regime is presented. We further introduce its application to the low top $p_\text{T}$ regime and demonstrate that both the W boson and the top quark masses could be extracted from this single observable. Compared to traditional observables, the energy correlator shows robustness to uncertainties that usually dominate experimental measurements and provides a promising way to improve experimental precision., Comment: 10 pages, 6 figures, matches published version

We present photometric and spectroscopic observations and analysis of the type IIb supernova (SN) SN 2019tua, which exhibits multiple bumps in its declining light curves between 40 and 65 days after discovery. SN 2019tua shows a time to peak of about 25 days similar to other type IIb SNe. Our observations indicate a decrease in its brightness of about 1 magnitude in the 60 days after the peak. At about days 50, and 60, its multiband light curves exhibit bumpy behavior. The complex luminosity evolution of SN 2019tua could not be well modeled with a single currently popular energy source model, e.g., radioactive decay of $^{56}$Ni, magnetar, interaction between the ejecta and a circumstellar shell. Even though the magnetar model has a smaller $\chi^2 / \text{dof}$ value, the complex changes in SN 2019tua's brightness suggest that more than one physical process might be involved. We propose a hybrid CSM interaction plus $^{56}$Ni model to explain the bolometric light curve (LC) of SN 2019tua. The fitting results show that the ejecta mass $M_{\rm ej} \approx 2.4~M_\odot$, the total CSM mass $M_{\rm CSM} \approx 1.0~M_\odot$, and the $^{56}$Ni mass $M_{\rm Ni} \approx 0.4~M_\odot$. The total kinetic energy of the ejecta is $E_k\approx 0.5 \times 10^{51}\rm~erg$. Pre-existing multiple shells suggest that the progenitor of SN 2019tua experienced mass ejections within approximately $\sim6 - 44$ years prior to the explosion., Comment: Accepted for publication in ApJ. 24 pages, 17 figures, 6 tables

Federated Learning faces significant challenges in statistical and system heterogeneity, along with high energy consumption, necessitating efficient client selection strategies. Traditional approaches, including heuristic and learning-based methods, fall short of addressing these complexities holistically. In response, we propose FedGCS, a novel generative client selection framework that innovatively recasts the client selection process as a generative task. Drawing inspiration from the methodologies used in large language models, FedGCS efficiently encodes abundant decision-making knowledge within a continuous representation space, enabling efficient gradient-based optimization to search for optimal client selection that will be finally output via generation. The framework comprises four steps: (1) automatic collection of diverse "selection-score" pair data using classical client selection methods; (2) training an encoder-evaluator-decoder framework on this data to construct a continuous representation space; (3) employing gradient-based optimization in this space for optimal client selection; (4) generating the final optimal client selection via using beam search for the well-trained decoder. FedGCS outperforms traditional methods by being more comprehensive, generalizable, and efficient, simultaneously optimizing for model performance, latency, and energy consumption. The effectiveness of FedGCS is proven through extensive experimental analyses., Comment: Accepted by IJCAI-2024

Utilizing a series of Bott indices formulated through polynomials of position operators, we establish a comprehensive framework for characterizing topological zero-energy corner states in systems with chiral symmetry. Our framework covers systems with arbitrary shape, including topological phases that are not characterizable by previously proposed invariants such as multipole moments or multipole chiral numbers. A key feature of our framework is its ability to capture the real-space pattern of zero-energy corner states. We provide a rigorous analytical proof of its higher-order correspondence. To demonstrate the effectiveness of our theory, we examine several model systems with representative patterns of zero-energy corner states that previous frameworks fail to classify., Comment: 16 pages, 3 figures

Single-cell RNA sequencing (scRNA-seq) is essential for unraveling cellular heterogeneity and diversity, offering invaluable insights for bioinformatics advancements. Despite its potential, traditional clustering methods in scRNA-seq data analysis often neglect the structural information embedded in gene expression profiles, crucial for understanding cellular correlations and dependencies. Existing strategies, including graph neural networks, face challenges in handling the inefficiency due to scRNA-seq data's intrinsic high-dimension and high-sparsity. Addressing these limitations, we introduce scCDCG (single-cell RNA-seq Clustering via Deep Cut-informed Graph), a novel framework designed for efficient and accurate clustering of scRNA-seq data that simultaneously utilizes intercellular high-order structural information. scCDCG comprises three main components: (i) A graph embedding module utilizing deep cut-informed techniques, which effectively captures intercellular high-order structural information, overcoming the over-smoothing and inefficiency issues prevalent in prior graph neural network methods. (ii) A self-supervised learning module guided by optimal transport, tailored to accommodate the unique complexities of scRNA-seq data, specifically its high-dimension and high-sparsity. (iii) An autoencoder-based feature learning module that simplifies model complexity through effective dimension reduction and feature extraction. Our extensive experiments on 6 datasets demonstrate scCDCG's superior performance and efficiency compared to 7 established models, underscoring scCDCG's potential as a transformative tool in scRNA-seq data analysis. Our code is available at: https://github.com/XPgogogo/scCDCG., Comment: Accepted as a long paper for the research track at DASFAA 2024

The scale and quality of a dataset significantly impact the performance of deep models. However, acquiring large-scale annotated datasets is both a costly and time-consuming endeavor. To address this challenge, dataset expansion technologies aim to automatically augment datasets, unlocking the full potential of deep models. Current data expansion techniques include image transformation and image synthesis methods. Transformation-based methods introduce only local variations, leading to limited diversity. In contrast, synthesis-based methods generate entirely new content, greatly enhancing informativeness. However, existing synthesis methods carry the risk of distribution deviations, potentially degrading model performance with out-of-distribution samples. In this paper, we propose DistDiff, a training-free data expansion framework based on the distribution-aware diffusion model. DistDiff constructs hierarchical prototypes to approximate the real data distribution, optimizing latent data points within diffusion models with hierarchical energy guidance. We demonstrate its capability to generate distribution-consistent samples, significantly improving data expansion tasks. DistDiff consistently enhances accuracy across a diverse range of datasets compared to models trained solely on original data. Furthermore, our approach consistently outperforms existing synthesis-based techniques and demonstrates compatibility with widely adopted transformation-based augmentation methods. Additionally, the expanded dataset exhibits robustness across various architectural frameworks. Our code is available at https://github.com/haoweiz23/DistDiff, Comment: Project: https://github.com/haoweiz23/DistDiff

Continuous Relation Extraction (CRE) aims to incrementally learn relation knowledge from a non-stationary stream of data. Since the introduction of new relational tasks can overshadow previously learned information, catastrophic forgetting becomes a significant challenge in this domain. Current replay-based training paradigms prioritize all data uniformly and train memory samples through multiple rounds, which would result in overfitting old tasks and pronounced bias towards new tasks because of the imbalances of the replay set. To handle the problem, we introduce the DecouPled CRE (DP-CRE) framework that decouples the process of prior information preservation and new knowledge acquisition. This framework examines alterations in the embedding space as new relation classes emerge, distinctly managing the preservation and acquisition of knowledge. Extensive experiments show that DP-CRE significantly outperforms other CRE baselines across two datasets., Comment: Accepted By LREC-Coling-2024, 10 pages with 2 pages of appendix

Zero-shot hashing (ZSH) has shown excellent success owing to its efficiency and generalization in large-scale retrieval scenarios. While considerable success has been achieved, there still exist urgent limitations. Existing works ignore the locality relationships of representations and attributes, which have effective transferability between seeable classes and unseeable classes. Also, the continuous-value attributes are not fully harnessed. In response, we conduct a COMprehensive Attribute Exploration for ZSH, named COMAE, which depicts the relationships from seen classes to unseen ones through three meticulously designed explorations, i.e., point-wise, pair-wise and class-wise consistency constraints. By regressing attributes from the proposed attribute prototype network, COMAE learns the local features that are relevant to the visual attributes. Then COMAE utilizes contrastive learning to comprehensively depict the context of attributes, rather than instance-independent optimization. Finally, the class-wise constraint is designed to cohesively learn the hash code, image representation, and visual attributes more effectively. Experimental results on the popular ZSH datasets demonstrate that COMAE outperforms state-of-the-art hashing techniques, especially in scenarios with a larger number of unseen label classes., Comment: 18 pages, 7 figures

We propose a novel topological defect called Janus bound states in the continuum (BICs), featuring asymmetric topological charges in upward and downward radiation channels. Our approach involves a photonic crystal slab (PCS) that initially exhibits both out-of-plane and in-plane mirror symmetry, and this PCS possesses one BIC at the $\Gamma$ point and two BICs off the $\Gamma$ point. By introducing perturbations that break the out-of-plane mirror symmetry, the two off-$\Gamma$ BICs decompose into four circularly polarized states (C points) with identical topological charges. Then, we selectively manipulate the four C points associated with downward radiation channel to converge at the at-$\Gamma$ BIC, forming a Janus BIC with Janus topological charges. By further introducing in-plane mirror symmetry perturbation, we can bring two of the C points with the same handedness and identical topological charges for upward radiation to merge into the Janus BIC. This process results in a Janus chiral BIC which exhibits large intrinsic chirality and an infinite Q factor. Janus BICs can induce distinct Pancharatnam-Berry phase singularities in momentum space for different incident channels, providing a new approach to control optical angular momentum. Janus chiral BICs hold promise in enhancing direction-dependent and spin-dependent asymmetric light-matter interaction, opening new pathways for improving chirality-dependent operation for on-chip devices.

Despite the inherent limitations of existing Large Language Models in directly reading and interpreting single-cell omics data, they demonstrate significant potential and flexibility as the Foundation Model. This research focuses on how to train and adapt the Large Language Model with the capability to interpret and distinguish cell types in single-cell RNA sequencing data. Our preliminary research results indicate that these foundational models excel in accurately categorizing known cell types, demonstrating the potential of the Large Language Models as effective tools for uncovering new biological insights., Comment: 4 pages, submitted to FCS

Topological modes (TMs) are typically localized at boundaries, interfaces and dislocations, and exponentially decay into the bulk of a large enough lattice. Recently, the non-Hermitian skin effect has been leveraged to delocalize the wavefunctions of TMs from the boundary and thus to increase the capacity of TMs dramatically. Here, we explore the capability of nonlinearity in designing and reconfiguring the wavefunctions of TMs. With growing intensity, wavefunctions of these in-gap nonlinear TMs undergo an initial deviation from exponential decay, gradually merge into arbitrarily designable plateaus, then encompass the entire nonlinear domain, and eventually concentrate at the nonlinear boundary. Intriguingly, such extended nonlinear TMs are still robust against defects and disorders, and stable in dynamics under external excitation. Advancing the conceptual understanding of the nonlinear TMs, our results open new avenues for increasing the capacity of TMs and developing compact and reconfigurable topological devices., Comment: 3 figures in the main text

In addressing the imbalanced issue of data within the realm of Natural Language Processing, text data augmentation methods have emerged as pivotal solutions. This data imbalance is prevalent in the research proposals submitted during the funding application process. Such imbalances, resulting from the varying popularity of disciplines or the emergence of interdisciplinary studies, significantly impede the precision of downstream topic models that deduce the affiliated disciplines of these proposals. At the data level, proposals penned by experts and scientists are inherently complex technological texts, replete with intricate terminologies, which augmenting such specialized text data poses unique challenges. At the system level, this, in turn, compromises the fairness of AI-assisted reviewer assignment systems, which raises a spotlight on solving this issue. This study leverages large language models (Llama V1) as data generators to augment research proposals categorized within intricate disciplinary hierarchies, aiming to rectify data imbalances and enhance the equity of expert assignments. We first sample within the hierarchical structure to find the under-represented class. Then we designed a prompt for keyword-based research proposal generation. Our experiments attests to the efficacy of the generated data, demonstrating that research proposals produced using the prompts can effectively address the aforementioned issues and generate high quality scientific text data, thus help the model overcome the imbalanced issue., Comment: 6 pages, accepted by ICDM 2023

Degeneracy points in non-Hermitian systems are of great interest. While a homotopic framework exists for understanding their behavior in the absence of symmetry, it does not apply to symmetry-protected degeneracy points with reduced codimension. In this work, utilizing algebraic topology, we provide a systematic classification of these symmetry-protected degenerate points and investigate the braid conservation rule followed by them. Using a model Hamiltonian and circuit simulation, we discover that, contrary to simple annihilation, pairwise-created symmetry-protected degeneracy points merge into a higher-order degeneracy point, which goes beyond the abelian picture. Our findings empower researchers across diverse fields to uncover new phenomena and applications harnessing symmetry-protected non-Hermitian degeneracy points., Comment: 17 pages, 7 figures

Feature transformation aims to generate new pattern-discriminative feature space from original features to improve downstream machine learning (ML) task performances. However, the discrete search space for the optimal feature explosively grows on the basis of combinations of features and operations from low-order forms to high-order forms. Existing methods, such as exhaustive search, expansion reduction, evolutionary algorithms, reinforcement learning, and iterative greedy, suffer from large search space. Overly emphasizing efficiency in algorithm design usually sacrifices stability or robustness. To fundamentally fill this gap, we reformulate discrete feature transformation as a continuous space optimization task and develop an embedding-optimization-reconstruction framework. This framework includes four steps: 1) reinforcement-enhanced data preparation, aiming to prepare high-quality transformation-accuracy training data; 2) feature transformation operation sequence embedding, intending to encapsulate the knowledge of prepared training data within a continuous space; 3) gradient-steered optimal embedding search, dedicating to uncover potentially superior embeddings within the learned space; 4) transformation operation sequence reconstruction, striving to reproduce the feature transformation solution to pinpoint the optimal feature space., Comment: Accepted by NeurIPS 2023

As a specific case of graph transfer learning, unsupervised domain adaptation on graphs aims for knowledge transfer from label-rich source graphs to unlabeled target graphs. However, graphs with topology and attributes usually have considerable cross-domain disparity and there are numerous real-world scenarios where merely a subset of nodes are labeled in the source graph. This imposes critical challenges on graph transfer learning due to serious domain shifts and label scarcity. To address these challenges, we propose a method named Semi-supervised Graph Domain Adaptation (SGDA). To deal with the domain shift, we add adaptive shift parameters to each of the source nodes, which are trained in an adversarial manner to align the cross-domain distributions of node embedding, thus the node classifier trained on labeled source nodes can be transferred to the target nodes. Moreover, to address the label scarcity, we propose pseudo-labeling on unlabeled nodes, which improves classification on the target graph via measuring the posterior influence of nodes based on their relative position to the class centroids. Finally, extensive experiments on a range of publicly accessible datasets validate the effectiveness of our proposed SGDA in different experimental settings., Comment: Accepted by IJCAI 2023

Thouless charge pumping protocol provides an effective route for realizing topological particle transport. To date, the first-order and higher-order topological pumps, exhibiting transitions of edge-bulk-edge and corner-bulk-corner states, respectively, are observed in a variety of experimental platforms. Here, we propose a concept of hybrid-order topological pump, which involves a transition of bulk, edge, and corner states simultaneously. More specifically, we consider a Kekul\'e-textured graphene lattice that features a tunable phase parameter. The finite sample of zigzag boundaries, where the corner configuration is abnormal and inaccessible by repeating unit cells, hosts topological responses at both the edges and corners. The former is protected by a nonzero winding number, while the latter can be explained by a nontrivial vector Chern number. Using our skillful acoustic experiments, we verify those nontrivial boundary landmarks and visualize the consequent hybrid-order topological pump process directly. This work deepens our understanding to higher-order topological phases and broadens the scope of topological pumps., Comment: 5 figures

Temporal Knowledge Graph (TKG) is an extension of traditional Knowledge Graph (KG) that incorporates the dimension of time. Reasoning on TKGs is a crucial task that aims to predict future facts based on historical occurrences. The key challenge lies in uncovering structural dependencies within historical subgraphs and temporal patterns. Most existing approaches model TKGs relying on entity modeling, as nodes in the graph play a crucial role in knowledge representation. However, the real-world scenario often involves an extensive number of entities, with new entities emerging over time. This makes it challenging for entity-dependent methods to cope with extensive volumes of entities, and effectively handling newly emerging entities also becomes a significant challenge. Therefore, we propose Temporal Inductive Path Neural Network (TiPNN), which models historical information in an entity-independent perspective. Specifically, TiPNN adopts a unified graph, namely history temporal graph, to comprehensively capture and encapsulate information from history. Subsequently, we utilize the defined query-aware temporal paths on a history temporal graph to model historical path information related to queries for reasoning. Extensive experiments illustrate that the proposed model not only attains significant performance enhancements but also handles inductive settings, while additionally facilitating the provision of reasoning evidence through history temporal graphs., Comment: Accepted to Artificial Intelligence

The objective of topic inference in research proposals aims to obtain the most suitable disciplinary division from the discipline system defined by a funding agency. The agency will subsequently find appropriate peer review experts from their database based on this division. Automated topic inference can reduce human errors caused by manual topic filling, bridge the knowledge gap between funding agencies and project applicants, and improve system efficiency. Existing methods focus on modeling this as a hierarchical multi-label classification problem, using generative models to iteratively infer the most appropriate topic information. However, these methods overlook the gap in scale between interdisciplinary research proposals and non-interdisciplinary ones, leading to an unjust phenomenon where the automated inference system categorizes interdisciplinary proposals as non-interdisciplinary, causing unfairness during the expert assignment. How can we address this data imbalance issue under a complex discipline system and hence resolve this unfairness? In this paper, we implement a topic label inference system based on a Transformer encoder-decoder architecture. Furthermore, we utilize interpolation techniques to create a series of pseudo-interdisciplinary proposals from non-interdisciplinary ones during training based on non-parametric indicators such as cross-topic probabilities and topic occurrence probabilities. This approach aims to reduce the bias of the system during model training. Finally, we conduct extensive experiments on a real-world dataset to verify the effectiveness of the proposed method. The experimental results demonstrate that our training strategy can significantly mitigate the unfairness generated in the topic inference task., Comment: 21 pages, accepted by ACM Transactions on Knowledge Discovery from Data