Searcharxiv⌕ Search

arXiv subjects

Ying Wang

Publications and source records attributed to Ying Wang.

At least 325 records · Page 18Linked to original sources

AdPE: Adversarial Positional Embeddings for Pretraining Vision Transformers via MAE+

Unsupervised learning of vision transformers seeks to pretrain an encoder via pretext tasks without labels. Among them is the Masked Image Modeling (MIM) aligned with pretraining of language transformers by predicting masked patches as a pretext task. A criterion in unsupervised pretraining is the pretext task needs to be sufficiently hard to prevent the transformer encoder from learning trivial low-level features not generalizable well to downstream tasks. For this purpose, we propose an Adversarial Positional Embedding (AdPE) approach -- It distorts the local visual structures by perturbing the position encodings so that the learned transformer cannot simply use the locally correlated patches to predict the missing ones. We hypothesize that it forces the transformer encoder to learn more discriminative features in a global context with stronger generalizability to downstream tasks. We will consider both absolute and relative positional encodings, where adversarial positions can be imposed both in the embedding mode and the coordinate mode. We will also present a new MAE+ baseline that brings the performance of the MIM pretraining to a new level with the AdPE. The experiments demonstrate that our approach can improve the fine-tuning accuracy of MAE by $0.8\%$ and $0.4\%$ over 1600 epochs of pretraining ViT-B and ViT-L on Imagenet1K. For the transfer learning task, it outperforms the MAE with the ViT-B backbone by $2.6\%$ in mIoU on ADE20K, and by $3.2\%$ in AP$^{bbox}$ and $1.6\%$ in AP$^{mask}$ on COCO, respectively. These results are obtained with the AdPE being a pure MIM approach that does not use any extra models or external datasets for pretraining. The code is available at https://github.com/maple-research-lab/AdPE.

cs.CV↗

Variants of normality and steadfastness deform

The cancellation problem asks whether $A[X_1,X_2,\ldots,X_n] \cong B[Y_1,Y_2,\ldots,Y_n]$ implies $A \cong B$. Hamann introduced the class of steadfast rings as the rings for which a version of the cancellation problem considered by Abhyankar, Eakin, and Heinzer holds. By work of Asanuma, Hamann, and Swan, steadfastness can be characterized in terms of $p$-seminormality, which is a variant of normality introduced by Swan. We prove that $p$-seminormality and steadfastness deform for reduced Noetherian local rings. We also prove that $p$-seminormality and steadfastness are stable under adjoining formal power series variables for reduced (not necessarily Noetherian) rings. Our methods also give new proofs of the facts that normality and weak normality deform, which are of independent interest.

math.AC↗

Liouville Theorem for semilinear elliptic inequalities with the fractional Hardy operators

In this paper, we give a full classification of the nonexistence of positive weak solutions to the semilinear elliptic inequality involving the fractional Hardy potential in punctured and in exterior domains. Our methods are self-contained and new. The main ideas and key ingredients will be discussed in the next section after Theorem 1.1 for punctured domains, and after Theorem 1.4 for exterior domains. We will also explain why all the previous methods and techniques do not apply to our general setting. Let us give here a foretaste of our line of attack: Based on the imbalance between the Hardy operator and the nonlinearity, we can obtain an initial asymptotic behavior rate at the origin ( for punctured domains) or at infinity ( exterior domains).We then improve this rate by using the interaction with the nonlinearity. By repeating this process finite number of times, a contradiction will be deduced from the nonexistence for the related non-homogeneous fractional Hardy problem. This process allows us to obtain the nonexistence for the fractional Hardy problem with larger ranges . Our study covers all possible ranges, and our results are optimal.

math.AP↗

SGMFQP:An Ontology-based Swine Gut Microbiota Federated Query Platform

Gut microbiota plays a crucial role in modulating pig development and health, and gut microbiota characteristics are associated with differences in feed efficiency. To answer open questions in feed efficiency analysis, biologists seek to retrieve information across multiple heterogeneous data sources. However, this is error-prone and time-consuming work since the queries can involve a sequence of multiple sub-queries over several databases. We present an implementation of an ontology-based Swine Gut Microbiota Federated Query Platform (SGMFQP) that provides a convenient, automated, and efficient query service about swine feeding and gut microbiota. The system is constructed based on a domain-specific Swine Gut Microbiota Ontology (SGMO), which facilitates the construction of queries independent of the actual organization of the data in the individual sources. This process is supported by a template-based query interface. A Datalog+-based federated query engine transforms the queries into sub-queries tailored for each individual data source, and an automated workflow orchestration mechanism executes the queries in each source database and consolidates the results. The efficiency of the system is demonstrated on several swine feeding scenarios.

cs.DB↗

Variation Enhanced Attacks Against RRAM-based Neuromorphic Computing System

The RRAM-based neuromorphic computing system has amassed explosive interests for its superior data processing capability and energy efficiency than traditional architectures, and thus being widely used in many data-centric applications. The reliability and security issues of the NCS therefore become an essential problem. In this paper, we systematically investigated the adversarial threats to the RRAM-based NCS and observed that the RRAM hardware feature can be leveraged to strengthen the attack effect, which has not been granted sufficient attention by previous algorithmic attack methods. Thus, we proposed two types of hardware-aware attack methods with respect to different attack scenarios and objectives. The first is adversarial attack, VADER, which perturbs the input samples to mislead the prediction of neural networks. The second is fault injection attack, EFI, which perturbs the network parameter space such that a specified sample will be classified to a target label, while maintaining the prediction accuracy on other samples. Both attack methods leverage the RRAM properties to improve the performance compared with the conventional attack methods. Experimental results show that our hardware-aware attack methods can achieve nearly 100% attack success rate with extremely low operational cost, while maintaining the attack stealthiness.

cs.CR↗

Deterministic photon source interfaced with a programmable silicon-nitride integrated circuit

We develop a quantum photonic platform that interconnects a high-quality quantum dot single-photon source and a low-loss photonic integrated circuit made in silicon nitride. The platform is characterized and programmed to demonstrate various multiphoton applications, including bosonic suppression laws and photonic entanglement generation. The results show a promising technological route forward to scale-up photonic quantum hardware.

quant-ph↗

Shear thinning of non-Brownian suspensions and its variation at different ambient conditions

Immiscible contaminants are commonly involved in naturally occurring suspensions. The resulting variations of their flow behavior has rarely been evaluated. Here, we investigate the variation of the viscosity of the oil-based two-phase suspension over a period of two years, which is exposed to the ambient air at the production stage. We find that the air's absolute humidity, which strongly varies with the seasons, causes exchanges of water droplets with the suspension, substantially altering its shear-thinning behavior. Only in winter, when the humidity is low, is the latter close to that of ideal two-phase suspensions. Our measurements suggest that, when the surface roughness of the suspended solid particles is sufficiently low, immersed droplets remain in a free state, effectively increasing repulsion between particles, weakening shear thinning. In contrast, when the roughness is sufficiently high, immersed droplets become trapped on the particle surfaces, inducing an attractive particle interaction via water bridging, enhancing shear thinning.

physics.flu-dyn↗

Collective super- and subradiant dynamics between distant optical quantum emitters

Photon emission is the hallmark of light-matter interaction and the foundation of photonic quantum science, enabling advanced sources for quantum communication and computing. Although single-emitter radiation can be tailored by the photonic environment, the introduction of multiple emitters extends this picture. A fundamental challenge, however, is that the radiative dipole-dipole coupling rapidly decays with spatial separation, typically within a fraction of the optical wavelength. We realize distant dipole-dipole radiative coupling with pairs of solid-state optical quantum emitters embedded in a nanophotonic waveguide. We dynamically probe the collective response and identify both super- and subradiant emission as well as means to control the dynamics by proper excitation techniques. Our work constitutes a foundational step toward multiemitter applications for scalable quantum-information processing.

quant-ph↗

Opinion-aware Influence Maximization in Online Social Networks

Influence maximization (IM) aims to find seed users on an online social network to maximize the spread of information about a target product through word-of-mouth propagation among all users. Prior IM methods mostly focus on maximizing the overall influence spread, which assumes that all users are potential customers of the product and that more exposure leads to higher benefits. However, in real-world scenarios, some users who dislike the product may express and spread negative opinions, damaging the product's reputation and lowering its profit. This paper investigates the opinion-aware influence maximization (OIM) problem, which finds a set of seed users to maximize the positive opinions toward the product while minimizing the negative opinions. We propose a novel algorithm for the OIM problem. Specifically, after obtaining the users with positive and negative opinions towards the product from historical data, we design a reverse reachable set-based method for opinion-aware influence estimation and a sandwich approximation algorithm for seed set selection. Despite the NP-hardness and non-submodularity of OIM, our algorithm achieves a data-dependent approximation factor for OIM. Experimental results on three real-world datasets demonstrate that our algorithm improves the spread of positive opinions while reducing the spread of negative opinions compared to existing methods.

cs.SI↗

A Node-collaboration-informed Graph Convolutional Network for Precise Representation to Undirected Weighted Graphs

An undirected weighted graph (UWG) is frequently adopted to describe the interactions among a solo set of nodes from real applications, such as the user contact frequency from a social network services system. A graph convolutional network (GCN) is widely adopted to perform representation learning to a UWG for subsequent pattern analysis tasks such as clustering or missing data estimation. However, existing GCNs mostly neglects the latent collaborative information hidden in its connected node pairs. To address this issue, this study proposes to model the node collaborations via a symmetric latent factor analysis model, and then regards it as a node-collaboration module for supplementing the collaboration loss in a GCN. Based on this idea, a Node-collaboration-informed Graph Convolutional Network (NGCN) is proposed with three-fold ideas: a) Learning latent collaborative information from the interaction of node pairs via a node-collaboration module; b) Building the residual connection and weighted representation propagation to obtain high representation capacity; and c) Implementing the model optimization in an end-to-end fashion to achieve precise representation to the target UWG. Empirical studies on UWGs emerging from real applications demonstrate that owing to its efficient incorporation of node-collaborations, the proposed NGCN significantly outperforms state-of-the-art GCNs in addressing the task of missing weight estimation. Meanwhile, its good scalability ensures its compatibility with more advanced GCN extensions, which will be further investigated in our future studies.

cs.LG↗

Representation Learning for Continuous Action Spaces is Beneficial for Efficient Policy Learning

Deep reinforcement learning (DRL) breaks through the bottlenecks of traditional reinforcement learning (RL) with the help of the perception capability of deep learning and has been widely applied in real-world problems.While model-free RL, as a class of efficient DRL methods, performs the learning of state representations simultaneously with policy learning in an end-to-end manner when facing large-scale continuous state and action spaces. However, training such a large policy model requires a large number of trajectory samples and training time. On the other hand, the learned policy often fails to generalize to large-scale action spaces, especially for the continuous action spaces. To address this issue, in this paper we propose an efficient policy learning method in latent state and action spaces. More specifically, we extend the idea of state representations to action representations for better policy generalization capability. Meanwhile, we divide the whole learning task into learning with the large-scale representation models in an unsupervised manner and learning with the small-scale policy model in the RL manner.The small policy model facilitates policy learning, while not sacrificing generalization and expressiveness via the large representation model. Finally,the effectiveness of the proposed method is demonstrated by MountainCar,CarRacing and Cheetah experiments.

cs.LG↗

High-speed thin-film lithium niobate quantum processor driven by a solid-state quantum emitter

Scalable photonic quantum computing architectures pose stringent requirements on photonic processing devices. The need for low-loss high-speed reconfigurable circuits and near-deterministic resource state generators are some of the most challenging requirements. Here we develop an integrated photonic platform based on thin-film lithium niobate and interface it with deterministic solid-state single-photon sources based on quantum dots in nanophotonic waveguides. The generated photons are processed with low-loss circuits programmable at speeds of several GHz. We realize a variety of key photonic quantum information processing functionalities with the high-speed circuits, including on-chip quantum interference, photon demultiplexing, and reprogrammability of a four-mode universal photonic circuit. These results show a promising path forward for scalable photonic quantum technologies by merging integrated photonics with solid-state deterministic photon sources in a heterogeneous approach to scaling up.

quant-ph↗

Sybil-Proof Diffusion Auction in Social Networks

A diffusion auction is a market to sell commodities over a social network, where the challenge is to incentivize existing buyers to invite their neighbors in the network to join the market. Existing mechanisms have been designed to solve the challenge in various settings, aiming at desirable properties such as non-deficiency, incentive compatibility and social welfare maximization. Since the mechanisms are employed in dynamic networks with ever-changing structures, buyers could easily generate fake nodes in the network to manipulate the mechanisms for their own benefits, which is commonly known as the Sybil attack. We observe that strategic agents may gain an unfair advantage in existing mechanisms through such attacks. To resist this potential attack, we propose two diffusion auction mechanisms, the Sybil tax mechanism (STM) and the Sybil cluster mechanism (SCM), to achieve both Sybil-proofness and incentive compatibility in the single-item setting. Our proposal provides the first mechanisms to protect the interests of buyers against Sybil attacks with a mild sacrifice of social welfare and revenue.

cs.GT↗

Discovery of a high-temperature antiferromagnetic state and transport signatures of exchange interactions in a Bi2Se3/EuSe heterostructure

Spatial confinement of electronic topological surface states (TSS) in topological insulators poses a formidable challenge because TSS are protected by time-reversal symmetry. In previous works formation of a gap in the electronic spectrum of TSS has been successfully demonstrated in topological insulator/magnetic material heterostructures, where ferromagnetic exchange interactions locally lifts the time-reversal symmetry. Here we report an experimental evidence of exchange interaction between a topological insulator Bi2Se3 and a magnetic insulator EuSe. Spin-polarized neutron reflectometry reveals a reduction of the in-plane magnetic susceptibility within a 2 nm interfacial layer of EuSe, and the combination of SQUID magnetometry and Hall measurements points to the formation of an antiferromagnetic layer with at least five-fold enhancement of Néel's temperature. Abrupt resistance changes in high magnetic fields indicate interfacial exchange coupling that affects transport in a TSS. High temperature local control of TSS with zero net magnetization unlocks new opportunities for the design of electronic, spintronic and quantum computation devices, ranging from quantization of Hall conductance in zero fields to spatial localization of non-Abelian excitations in superconducting topological qubits.

cond-mat.mes-hall↗

Identification of oscillatory brain networks with Hidden Gaussian Graphical Spectral models of EEG/MEG

Identifying the functional networks underpinning indirectly observed processes poses an inverse problem for neurosciences or other fields. A solution of such inverse problems estimates as a first step the activity emerging within functional networks from EEG or MEG data. These EEG or MEG estimates are a direct reflect functional brain network activity with a temporal resolution that no other in vivo neuroimage may provide. A second step estimating functional connectivity from such activity pseudodata unveil the oscillatory brain networks that strongly correlate with all cognition and behavior. Simulations of such MEG or EEG inverse problem also reveal estimation errors of the functional connectivity determined by any of the state-of-the-art inverse solutions. We disclose a significant cause of estimation errors originating from misspecification of the functional network model incorporated into either inverse solution steps. We introduce the Bayesian identification of a Hidden Gaussian Graphical Spectral (HIGGS) model specifying such oscillatory brain networks model. In human EEG alpha rhythm simulations estimation errors measured as ROC performance do not surpass 2% in our HIGGS inverse solution and reach 20% in state-of-the-art methods. Macaque simultaneous EEG/ECoG recordings provide experimental confirmation for our inverse-solution with 1/3 more congruence according to Riemannian distances than state-of-the-art methods.

stat.ME↗

Explicit symplectic methods in black hole spacetimes

Many Hamiltonian problems in the Solar System are separable or separate into two analytically solvable parts, and thus give a great chance to the development and application of explicit symplectic integrators based on operator splitting and composing. However, such constructions cannot in general be available for curved spacetimes in general relativity and modified theories of gravity, because these curved spacetimes correspond to nonseparable Hamiltonians without the two part splits. Recently, several black hole spacetimes such as the Schwarzschild black hole were found to allow the construction of explicit symplectic integrators, since their corresponding Hamiltonians are separable into more than two explicitly integrable pieces. Although some other curved spacetimes including the Kerr black hole do not exist such multi part splits, their corresponding appropriate time transformation Hamiltonians do. In fact, the key problem for the obtainment of symplectic analytically integrable decomposition algorithms is how to split these Hamiltonians or time transformation Hamiltonians. Considering this idea, we develop explicit sympelcetic schemes in curved spacetimes. We introduce a class of spacetimes whose Hamiltonians are directly split into several explicitly integrable terms. For example, the Hamiltonian of rotating black ring has a 13 part split. We also present two sets of spacetimes whose appropriate time transformation Hamiltonians have the desirable splits. For instance, an 8 part split exists in a time-transformed Hamiltonian of Kerr-Newman solution with disformal parameter. In this way, the proposed symplectic splitting methods will be used widely for long-term integrations of orbits in most curved spacetimes we have known.

gr-qc↗

Edge and corner superconductivity in a 2D topological model

We consider a two-dimensional generalization of the Su-Schrieffer-Heeger model which is known to possess a non-trivial topological band structure. For this model, which is characterized by a single parameter, the hopping ratio $0 \leq r\leq 1$, the inhomogeneous superconducting phases induced by an attractive $U$ Hubbard interaction are studied using mean field theory. We show, analytically and by numerical diagonalization, that in lattices with open boundaries, phases with enhanced superconducting order on the corners or the edges can appear, depending on the filling. For finite samples at half filling, the corner site superconducting transition temperature can be much larger than that of the bulk. A novel proximity effect thus arises for $T_{c,bulk} < T<T_{c,corner}$, in which the corner site creates a nonzero tail of the superconducting order in the bulk. We show that such tails should be observable for a range of $r$ and $U$ values.

cond-mat.supr-con↗

Statistical Modeling of Soft Error Influence on Neural Networks

Soft errors in large VLSI circuits pose dramatic influence on computing- and memory-intensive neural network (NN) processing. Understanding the influence of soft errors on NNs is critical to protect against soft errors for reliable NN processing. Prior work mainly rely on fault simulation to analyze the influence of soft errors on NN processing. They are accurate but usually specific to limited configurations of errors and NN models due to the prohibitively slow simulation speed especially for large NN models and datasets. With the observation that the influence of soft errors propagates across a large number of neurons and accumulates as well, we propose to characterize the soft error induced data disturbance on each neuron with normal distribution model according to central limit theorem and develop a series of statistical models to analyze the behavior of NN models under soft errors in general. The statistical models reveal not only the correlation between soft errors and NN model accuracy, but also how NN parameters such as quantization and architecture affect the reliability of NNs. The proposed models are compared with fault simulation and verified comprehensively. In addition, we observe that the statistical models that characterize the soft error influence can also be utilized to predict fault simulation results in many cases and we explore the use of the proposed statistical models to accelerate fault simulations of NNs. According to our experiments, the accelerated fault simulation shows almost two orders of magnitude speedup with negligible simulation accuracy loss over the baseline fault simulations.

cs.LG↗