Searcharxiv⌕ Search

arXiv subjects

Yang Qiu

Publications and source records attributed to Yang Qiu.

At least 37 records · Page 2Linked to original sources

PAGE: Parametric Generative Explainer for Graph Neural Network

This article introduces PAGE, a parameterized generative interpretive framework. PAGE is capable of providing faithful explanations for any graph neural network without necessitating prior knowledge or internal details. Specifically, we train the auto-encoder to generate explanatory substructures by designing appropriate training strategy. Due to the dimensionality reduction of features in the latent space of the auto-encoder, it becomes easier to extract causal features leading to the model's output, which can be easily employed to generate explanations. To accomplish this, we introduce an additional discriminator to capture the causality between latent causal features and the model's output. By designing appropriate optimization objectives, the well-trained discriminator can be employed to constrain the encoder in generating enhanced causal features. Finally, these features are mapped to substructures of the input graph through the decoder to serve as explanations. Compared to existing methods, PAGE operates at the sample scale rather than nodes or edges, eliminating the need for perturbation or encoding processes as seen in previous methods. Experimental results on both artificially synthesized and real-world datasets demonstrate that our approach not only exhibits the highest faithfulness and accuracy but also significantly outperforms baseline models in terms of efficiency.

cs.LG↗

Silicon-integrated scandium-doped aluminum nitride electro-optic modulator

Scandium-doped aluminum nitride (AlScN) with an asymmetric hexagonal wurtzite structure exhibits enhanced second-order nonlinear and piezoelectric properties compared to aluminum nitride (AlN), while maintaining a relatively large bandgap. It provides a promising platform for photonic integration and facilitates the seamless integration of passive and active functional devices. Here, we present the design, fabrication, and characterization of AlScN EO micro-ring modulators, introducing active functionalities to the chip-scale AlScN platform. These waveguide-integrated EO modulators employ sputtered AlScN thin films as the light-guiding medium, and the entire fabrication process is compatible with complementary metal oxide semiconductor (CMOS) technology. We characterize the high-frequency performance of an AlScN modulator for the first time, extracting a maximum in-device effective EO coefficient of 2.86 pm/V at 12 GHz. The devices show a minimum half-wave voltage-length product of 3.12 V*cm and a 3-dB modulation bandwidth of approximately 22 GHz. Our work provides a promising modulation scheme for cost-effective silicon-integrated photonics systems.

physics.app-ph↗

Wasserstein Distortion: Unifying Fidelity and Realism

We introduce a distortion measure for images, Wasserstein distortion, that simultaneously generalizes pixel-level fidelity on the one hand and realism or perceptual quality on the other. We show how Wasserstein distortion reduces to a pure fidelity constraint or a pure realism constraint under different parameter choices and discuss its metric properties. Pairs of images that are close under Wasserstein distortion illustrate its utility. In particular, we generate random textures that have high fidelity to a reference texture in one location of the image and smoothly transition to an independent realization of the texture as one moves away from this point. Wasserstein distortion attempts to generalize and unify prior work on texture generation, image realism and distortion, and models of the early human visual system, in the form of an optimizable metric in the mathematical sense.

cs.IT↗

Low-Rate, Low-Distortion Compression with Wasserstein Distortion

Wasserstein distortion is a one-parameter family of distortion measures that was recently proposed to unify fidelity and realism constraints. After establishing continuity results for Wasserstein in the extreme cases of pure fidelity and pure realism, we prove the first coding theorems for compression under Wasserstein distortion focusing on the regime in which both the rate and the distortion are small.

cs.IT↗

D-Separation for Causal Self-Explanation

Rationalization is a self-explaining framework for NLP models. Conventional work typically uses the maximum mutual information (MMI) criterion to find the rationale that is most indicative of the target label. However, this criterion can be influenced by spurious features that correlate with the causal rationale or the target label. Instead of attempting to rectify the issues of the MMI criterion, we propose a novel criterion to uncover the causal rationale, termed the Minimum Conditional Dependence (MCD) criterion, which is grounded on our finding that the non-causal features and the target label are \emph{d-separated} by the causal rationale. By minimizing the dependence between the unselected parts of the input and the target label conditioned on the selected rationale candidate, all the causes of the label are compelled to be selected. In this study, we employ a simple and practical measure of dependence, specifically the KL-divergence, to validate our proposed MCD criterion. Empirically, we demonstrate that MCD improves the F1 score by up to $13.7\%$ compared to previous state-of-the-art MMI-based methods. Our code is available at: \url{https://github.com/jugechengzi/Rationalization-MCD}.

cs.AI↗

Boosting Generalization with Adaptive Style Techniques for Fingerprint Liveness Detection

We introduce a high-performance fingerprint liveness feature extraction technique that secured first place in LivDet 2023 Fingerprint Representation Challenge. Additionally, we developed a practical fingerprint recognition system with 94.68% accuracy, earning second place in LivDet 2023 Liveness Detection in Action. By investigating various methods, particularly style transfer, we demonstrate improvements in accuracy and generalization when faced with limited training data. As a result, our approach achieved state-of-the-art performance in LivDet 2023 Challenges.

cs.CV↗

AdSEE: Investigating the Impact of Image Style Editing on Advertisement Attractiveness

Online advertisements are important elements in e-commerce sites, social media platforms, and search engines. With the increasing popularity of mobile browsing, many online ads are displayed with visual information in the form of a cover image in addition to text descriptions to grab the attention of users. Various recent studies have focused on predicting the click rates of online advertisements aware of visual features or composing optimal advertisement elements to enhance visibility. In this paper, we propose Advertisement Style Editing and Attractiveness Enhancement (AdSEE), which explores whether semantic editing to ads images can affect or alter the popularity of online advertisements. We introduce StyleGAN-based facial semantic editing and inversion to ads images and train a click rate predictor attributing GAN-based face latent representations in addition to traditional visual and textual features to click rates. Through a large collected dataset named QQ-AD, containing 20,527 online ads, we perform extensive offline tests to study how different semantic directions and their edit coefficients may impact click rates. We further design a Genetic Advertisement Editor to efficiently search for the optimal edit directions and intensity given an input ad cover image to enhance its projected click rates. Online A/B tests performed over a period of 5 days have verified the increased click-through rates of AdSEE-edited samples as compared to a control group of original ads, verifying the relation between image styles and ad popularity. We open source the code for AdSEE research at https://github.com/LiyaoJiang1998/adsee.

cs.CV↗

MGR: Multi-generator Based Rationalization

Rationalization is to employ a generator and a predictor to construct a self-explaining NLP model in which the generator selects a subset of human-intelligible pieces of the input text to the following predictor. However, rationalization suffers from two key challenges, i.e., spurious correlation and degeneration, where the predictor overfits the spurious or meaningless pieces solely selected by the not-yet well-trained generator and in turn deteriorates the generator. Although many studies have been proposed to address the two challenges, they are usually designed separately and do not take both of them into account. In this paper, we propose a simple yet effective method named MGR to simultaneously solve the two problems. The key idea of MGR is to employ multiple generators such that the occurrence stability of real pieces is improved and more meaningful pieces are delivered to the predictor. Empirically, we show that MGR improves the F1 score by up to 20.9% as compared to state-of-the-art methods. Codes are available at https://github.com/jugechengzi/Rationalization-MGR .

cs.LG↗

Decoupled Rationalization with Asymmetric Learning Rates: A Flexible Lipschitz Restraint

A self-explaining rationalization model is generally constructed by a cooperative game where a generator selects the most human-intelligible pieces from the input text as rationales, followed by a predictor that makes predictions based on the selected rationales. However, such a cooperative game may incur the degeneration problem where the predictor overfits to the uninformative pieces generated by a not yet well-trained generator and in turn, leads the generator to converge to a sub-optimal model that tends to select senseless pieces. In this paper, we theoretically bridge degeneration with the predictor's Lipschitz continuity. Then, we empirically propose a simple but effective method named DR, which can naturally and flexibly restrain the Lipschitz constant of the predictor, to address the problem of degeneration. The main idea of DR is to decouple the generator and predictor to allocate them with asymmetric learning rates. A series of experiments conducted on two widely used benchmarks have verified the effectiveness of the proposed method. Codes: \href{https://github.com/jugechengzi/Rationalization-DR}{https://github.com/jugechengzi/Rationalization-DR}.

cs.LG↗

Preferential bond formation and interstitial/vacancy annihilation rate drive atomic clustering in gallium ion sputtered compound materials

The investigation of chemical reactions during the ion irradiation is a frontier for the study of the ion-material interaction. In order to derive the contribution of bond formation to chemistry of ion produced nanoclusters, the valence electron energy loss spectroscopy (VEELS) was exploited to investigate the Ga$^+$ ion damage in Al$_2$O$_3$, InP and InGaAs, where each target material has been shown to yield different process for altering the clustering of recoil atoms: metallic Ga, metallic In and InGaP clusters in Al$_2$O$_3$, InP and InGaAs respectively. Supporting simulations based on Monte Carlo and crystal orbital Hamiltonianindicate that the chemical constitution of cascade induced nano-precipitates is a result of a competition between interstitial/vacancy consumption rate and preferential bond formation.

cond-mat.mtrl-sci↗

From Torus Bundles to Particle-Hole Equivariantization

We continue the program of constructing (pre)modular tensor categories from 3-manifolds first initiated by Cho-Gang-Kim using $M$ theory in physics and then mathematically studied by Cui-Qiu-Wang. An important structure involved is a collection of certain $\text{SL}(2, \mathbb{C})$ characters on a given manifold which serve as the simple object types in the corresponding category. Chern-Simons invariants and adjoint Reidemeister torsions play a key role in the construction, and they are related to topological twists and quantum dimensions, respectively, of simple objects. The modular $S$-matrix is computed from local operators and follows a trial-and-error procedure. It is currently unknown how to produce data beyond the modular $S$- and $T$-matrices. There are also a number of subtleties in the construction which remain to be solved. In this paper, we consider an infinite family of 3-manifolds, that is, torus bundles over the circle. We show that the modular data produced by such manifolds are realized by the $\mathbb{Z}_2$-equivariantization of certain pointed premodular categories. Here the equivariantization is performed for the $\mathbb{Z}_2$-action sending a simple (invertible) object to its inverse, also called the particle-hole symmetry. It is our hope that this extensive class of examples will shed light on how to improve the program to recover the full data of a premodular category.

math.QA↗

From Three Dimensional Manifolds to Modular Tensor Categories

Using M-theory in physics, Cho, Gang, and Kim (JHEP 2020, 115 (2020) ) recently outlined a program that connects two parallel subjects of three dimensional manifolds, namely, geometric topology and quantum topology. They suggest that classical topological invariants such as Chern-Simons invariants of $\text{SL}(2,\mathbb{C})$-flat connections and adjoint Reidemeister torsions of a three manifold can be packaged together to produce a $(2+1)$-topological quantum field theory, which is essentially equivalent to a modular tensor category. It is further conjectured that every modular tensor category can be obtained from a three manifold and a semi-simple Lie group. In this paper, we study this program mathematically, and provide strong support for the feasibility of such a program. The program produces an algorithm to generate the potential modular $T$-matrix and the quantum dimensions of a candidate modular data. The modular $S$-matrix follows from essentially a trial-and-error procedure. We find modular tensor categories that realize candidate modular data constructed from Seifert fibered spaces and torus bundles over the circle that reveal many subtleties in the program. We make a number of improvements to the program based on our computations. Our main result is a mathematical construction of a premodular category from each Seifert fibered space with three singular fibers and a family of torus bundles over the circle with Thurston SOL geometry. The premodular categories from Seifert fibered spaces are related to Temperley-Lieb-Jones categories and the ones from torus bundles over the circle are related to metaplectic categories. We conjecture that a resulting premodular category is modular if and only if the three manifold is a $\mathbb{Z}_2$-homology sphere and condensation of bosons in premodular categories leads to either modular or super-modular categories.

math.QA↗

FedOCR: Communication-Efficient Federated Learning for Scene Text Recognition

While scene text recognition techniques have been widely used in commercial applications, data privacy has rarely been taken into account by this research community. Most existing algorithms have assumed a set of shared or centralized training data. However, in practice, data may be distributed on different local devices that can not be centralized to share due to the privacy restrictions. In this paper, we study how to make use of decentralized datasets for training a robust scene text recognizer while keeping them stay on local devices. To the best of our knowledge, we propose the first framework leveraging federated learning for scene text recognition, which is trained with decentralized datasets collaboratively. Hence we name it FedOCR. To make FedCOR fairly suitable to be deployed on end devices, we make two improvements including using lightweight models and hashing techniques. We argue that both are crucial for FedOCR in terms of the communication efficiency of federated learning. The simulations on decentralized datasets show that the proposed FedOCR achieves competitive results to the models that are trained with centralized data, with fewer communication costs and higher-level privacy-preserving.

cs.CV↗

AutoDebias: Learning to Debias for Recommendation

Recommender systems rely on user behavior data like ratings and clicks to build personalization model. However, the collected data is observational rather than experimental, causing various biases in the data which significantly affect the learned model. Most existing work for recommendation debiasing, such as the inverse propensity scoring and imputation approaches, focuses on one or two specific biases, lacking the universal capacity that can account for mixed or even unknown biases in the data. Towards this research gap, we first analyze the origin of biases from the perspective of \textit{risk discrepancy} that represents the difference between the expectation empirical risk and the true risk. Remarkably, we derive a general learning framework that well summarizes most existing debiasing strategies by specifying some parameters of the general framework. This provides a valuable opportunity to develop a universal solution for debiasing, e.g., by learning the debiasing parameters from data. However, the training data lacks important signal of how the data is biased and what the unbiased data looks like. To move this idea forward, we propose \textit{AotoDebias} that leverages another (small) set of uniform data to optimize the debiasing parameters by solving the bi-level optimization problem with meta-learning. Through theoretical analyses, we derive the generalization bound for AutoDebias and prove its ability to acquire the appropriate debiasing strategy. Extensive experiments on two real datasets and a simulated dataset demonstrated effectiveness of AutoDebias. The code is available at \url{https://github.com/DongHande/AutoDebias}.

cs.LG↗

Alternating Direction Method of Multiplier-Based Distributed Planning Model for Natural Gas, Electricity Network, and Regional Integrated Energy Systems

Regional integrated energy system coupling with multienergy devices, energy storage devices, and renewable energy devices has been regarded as one of the most promising solutions for future energy systems. Planning for existing natural gas and electricity network expansion, regional integrated energy system locations, or system equipment types and capacities are urgent problems in infrastructure development. This article employs a joint planning model to address these; however, the joint planning model ignores the potential ownerships by three agents, for which investment decisions are generally made by different investors. In this work, the joint planning model is decomposed into three distributed planning subproblems related to the corresponding stakeholders, and the alternating direction method of multipliers is adopted to solve the tripartite distributed planning problem. The effectiveness of the planning model is verified on an updated version of the Institute of Electrical and Electronics Engineers (IEEE) 24-bus electric system, the Belgian 20-node natural gas system, and three assumed integrated energy systems. Simulation results illustrate that a distributed planning model is more sensitive to individual load differences, which is precisely the defect of the joint planning model. Moreover, the algorithm performance considering rates of convergence and the impacts of penalty parameters is further analyzed

eess.SY↗

Scene Text Detection with Scribble Lines

Scene text detection, which is one of the most popular topics in both academia and industry, can achieve remarkable performance with sufficient training data. However, the annotation costs of scene text detection are huge with traditional labeling methods due to the various shapes of texts. Thus, it is practical and insightful to study simpler labeling methods without harming the detection performance. In this paper, we propose to annotate the texts by scribble lines instead of polygons for text detection. It is a general labeling method for texts with various shapes and requires low labeling costs. Furthermore, a weakly-supervised scene text detection framework is proposed to use the scribble lines for text detection. The experiments on several benchmarks show that the proposed method bridges the performance gap between the weakly labeling method and the original polygon-based labeling methods, with even better performance. We will release the weak annotations of the benchmarks in our experiments and hope it will benefit the field of scene text detection to achieve better performance with simpler annotations.

cs.CV↗

Representations of Motion Groups of Links via Dimension Reduction of TQFTs

Motion groups of links in the three sphere $\mathbb{S}^3$ are generalizations of the braid groups, which are motion groups of points in the disk $\mathbb{D}^2$. Representations of motion groups can be used to model statistics of extended objects such as closed strings in physics. Each $1$-extended $(3+1)$-topological quantum field theory (TQFT) will provide representations of motion groups, but it is difficult to compute such representations explicitly in general. In this paper, we compute representations of the motion groups of links in $\mathbb{S}^3$ with generalized axes from Dijkgraaf-Witten (DW) TQFTs inspired by dimension reduction. A succinct way to state our result is as a step toward a twisted generalization (Conjecture \ref{mainconjecture}) of a conjecture for DW theories of dimension reduction from $(3+1)$ to $(2+1)$: $\textrm{DW}^{3+1}_G \cong \oplus_{[g]\in [G]} \textrm{DW}^{2+1}_{C(g)}$, where the sum runs over all conjugacy classes $[g]\in [G]$ of $G$ and $C(g)$ the centralizer of any element $g\in [g]$. We prove a version of Conjecture \ref{mainconjecture} for the mapping class groups of closed manifolds and the case of torus links labeled by pure fluxes.

math.QA↗

Ground Subspaces of Topological Phases of Matter as Error Correcting Codes

Topological quantum computing is believed to be inherently fault-tolerant. One mathematical justification would be to prove that ground subspaces or ground state manifolds of topological phases of matter behave as error correction codes with macroscopic distance. While this is widely assumed and used as a definition of topological phases of matter in the physics literature, besides the doubled abelian anyon models in Kitaev's seminal paper, no non-abelian models are proven to be so mathematically until recently. Cui et al extended the theorem from doubled abelian anyon models to all Kitaev models based on any finite group. Those proofs are very explicit using detailed knowledge of the Hamiltonians, so it seems to be hard to further extend the proof to cover other models such as the Levin-Wen. We pursue a totally different approach based on topological quantum field theories (TQFTs), and prove that a lattice implementation of the disk axiom and annulus axiom in TQFTs as essentially the equivalence of TQO1 and TQO2 conditions. We confirm the error correcting properties of ground subspaces for topological lattice Hamiltonian schemas of the Levin-Wen model and Dijkgraaf-Witten TQFTs by providing a lattice version of the disk axiom and annulus of the underlying TQFTs. The error correcting property of ground subspaces is also shared by gapped fracton models such as the Haah codes. We propose to characterize topological phases of matter via error correcting properties, and refer to gapped fracton models as lax-topological.

quant-ph↗