Searcharxiv⌕ Search

arXiv subjects

Jian Liu

Publications and source records attributed to Jian Liu.

At least 325 records · Page 18Linked to original sources

Electrically driven compact hybrid lithium niobate microring laser

We demonstrate an electrically driven compact hybrid lithium niobate microring laser by butt coupling a commercial 980-nm pump laser diode chip with a high quality Er3+-doped lithium niobate microring chip. Single mode lasing emission at 1531 nm wavelength from the Er3+-doped lithium niobate microring can be observed with the integrated 980-nm laser pumping. The compact hybrid lithium niobate microring laser occupies the chip size of 3 mmx4mmx0.5 mm. The threshold pumping laser power is 6 mW and the threshold current is 0.5 A (operating voltage 1.64 V) in the atmospheric temperature. The spectrum featuring single mode lasing with small linewidth of 0.05 nm is observed. This work explores a robust hybrid lithium niobate microring laser source which has potential applications in coherent optical communication and precision metrology.

physics.optics↗

RIBAC: Towards Robust and Imperceptible Backdoor Attack against Compact DNN

Recently backdoor attack has become an emerging threat to the security of deep neural network (DNN) models. To date, most of the existing studies focus on backdoor attack against the uncompressed model; while the vulnerability of compressed DNNs, which are widely used in the practical applications, is little exploited yet. In this paper, we propose to study and develop Robust and Imperceptible Backdoor Attack against Compact DNN models (RIBAC). By performing systematic analysis and exploration on the important design knobs, we propose a framework that can learn the proper trigger patterns, model parameters and pruning masks in an efficient way. Thereby achieving high trigger stealthiness, high attack success rate and high model efficiency simultaneously. Extensive evaluations across different datasets, including the test against the state-of-the-art defense mechanisms, demonstrate the high robustness, stealthiness and model efficiency of RIBAC. Code is available at https://github.com/huyvnphan/ECCV2022-RIBAC

cs.CR↗

On the Cayley-persistence algebra

In this paper, we introduce a persistent (co)homology theory for Cayley digraph grading. We give the algebraic structures of Cayley-persistence object. Specifically, we consider the module structure of persistent (co)homology and show the decomposition of a finitely generated Cayley-persistence module. Moreover, we introduce the persistence-cup product on the Cayley-persistence module and study the twisted structure with respect to the persistence-cup product. As an application on manifolds, we show that the persistent (co)homology is closely related to the persistent map of fundamental classes.

math.AT↗

Multi-Forgery Detection Challenge 2022: Push the Frontier of Unconstrained and Diverse Forgery Detection

In this paper, we present the Multi-Forgery Detection Challenge held concurrently with the IEEE Computer Society Workshop on Biometrics at CVPR 2022. Our Multi-Forgery Detection Challenge aims to detect automatic image manipulations including but not limited to image editing, image synthesis, image generation, image photoshop, etc. Our challenge has attracted 674 teams from all over the world, with about 2000 valid result submission counts. We invited the Top 10 teams to present their solutions to the challenge, from which three teams are awarded prizes in the grand finale. In this paper, we present the solutions from the Top 3 teams, in order to boost the research work in the field of image forgery detection.

cs.CV↗

Multi-parametric Analysis for Mixed Integer Linear Programming: An Application to Transmission Planning and Congestion Control

Enhancing existing transmission lines is a useful tool to combat transmission congestion and guarantee transmission security with increasing demand and boosting the renewable energy source. This study concerns the selection of lines whose capacity should be expanded and by how much from the perspective of independent system operator (ISO) to minimize the system cost with the consideration of transmission line constraints and electricity generation and demand balance conditions, and incorporating ramp-up and startup ramp rates, shutdown ramp rates, ramp-down rate limits and minimum up and minimum down times. For that purpose, we develop the ISO unit commitment and economic dispatch model and show it as a right-hand side uncertainty multiple parametric analysis for the mixed integer linear programming (MILP) problem. We first relax the binary variable to continuous variables and employ the Lagrange method and Karush-Kuhn-Tucker conditions to obtain optimal solutions (optimal decision variables and objective function) and critical regions associated with active and inactive constraints. Further, we extend the traditional branch and bound method for the large-scale MILP problem by determining the upper bound of the problem at each node, then comparing the difference between the upper and lower bounds and reaching the approximate optimal solution within the decision makers' tolerated error range. In additional, the objective function's first derivative on the parameters of each line is used to inform the selection of lines to ease congestion and maximize social welfare. Finally, the amount of capacity upgrade will be chosen by balancing the cost-reduction rate of the objective function on parameters and the cost of the line upgrade. Our findings are supported by numerical simulation and provide transmission line planners with decision-making guidance.

math.OC↗

Watermark Vaccine: Adversarial Attacks to Prevent Watermark Removal

As a common security tool, visible watermarking has been widely applied to protect copyrights of digital images. However, recent works have shown that visible watermarks can be removed by DNNs without damaging their host images. Such watermark-removal techniques pose a great threat to the ownership of images. Inspired by the vulnerability of DNNs on adversarial perturbations, we propose a novel defence mechanism by adversarial machine learning for good. From the perspective of the adversary, blind watermark-removal networks can be posed as our target models; then we actually optimize an imperceptible adversarial perturbation on the host images to proactively attack against watermark-removal networks, dubbed Watermark Vaccine. Specifically, two types of vaccines are proposed. Disrupting Watermark Vaccine (DWV) induces to ruin the host image along with watermark after passing through watermark-removal networks. In contrast, Inerasable Watermark Vaccine (IWV) works in another fashion of trying to keep the watermark not removed and still noticeable. Extensive experiments demonstrate the effectiveness of our DWV/IWV in preventing watermark removal, especially on various watermark removal networks.

cs.CV↗

VPNets: Volume-preserving neural networks for learning source-free dynamics

We propose volume-preserving networks (VPNets) for learning unknown source-free dynamical systems using trajectory data. We propose three modules and combine them to obtain two network architectures, coined R-VPNet and LA-VPNet. The distinct feature of the proposed models is that they are intrinsic volume-preserving. In addition, the corresponding approximation theorems are proved, which theoretically guarantee the expressivity of the proposed VPNets to learn source-free dynamics. The effectiveness, generalization ability and structure-preserving property of the VP-Nets are demonstrated by numerical experiments.

cs.LG↗

Quasi-2D anomalous Hall Mott insulator of topologically engineered Jeff =1/2 electrons

We investigate an experimental toy-model system of a pseudospin-half square-lattice Hubbard Hamiltonian in [(SrIrO3)1/(CaTiO3)1] to include both nontrivial complex hopping and moderate electronic correlation. While the former induces electronic Berry phases as anticipated from the weak-coupling limit, the later stabilizes an antiferromagnetic (AFM) Mott insulator ground state in analogous to the strong-coupling limit. Their combined results in the real system are found to be an anomalous Hall effect with a non-monotonic temperature dependence due to the self-competition of the electron-hole pairing in the Mott state, and an exceptionally large Ising anisotropy that is captured as a giant magnon gap beyond the superexchange approach. The unusual phenomena highlight the rich interplay of electronic topology and electronic correlation in the intermediate-coupling regime that is largely unexplored and challenging in theoretical modelling.

cond-mat.str-el↗

EGR: Equivariant Graph Refinement and Assessment of 3D Protein Complex Structures

Protein complexes are macromolecules essential to the functioning and well-being of all living organisms. As the structure of a protein complex, in particular its region of interaction between multiple protein subunits (i.e., chains), has a notable influence on the biological function of the complex, computational methods that can quickly and effectively be used to refine and assess the quality of a protein complex's 3D structure can directly be used within a drug discovery pipeline to accelerate the development of new therapeutics and improve the efficacy of future vaccines. In this work, we introduce the Equivariant Graph Refiner (EGR), a novel E(3)-equivariant graph neural network (GNN) for multi-task structure refinement and assessment of protein complexes. Our experiments on new, diverse protein complex datasets, all of which we make publicly available in this work, demonstrate the state-of-the-art effectiveness of EGR for atomistic refinement and assessment of protein complexes and outline directions for future work in the field. In doing so, we establish a baseline for future studies in macromolecular refinement and structure analysis.

cs.LG↗

Negative Zero-Point-Energy Parameter in the Meyer-Miller Mapping Model for Nonadiabatic Dynamics

The celebrated Meyer-Miller mapping model has been a useful approach for generating practical trajectory-based nonadiabatic dynamics methods. It is generally assumed that the zero-point-energy (ZPE) parameter is positive. The constraint implied in the conventional Meyer-Miller mapping Hamiltonian for an F-electronic-state system actually requires that parameter γis larger than -1/F for the ZPE parameter for each electronic degree of freedom. Both negative and positive values are possible for such a parameter. We first establish a rigorous formulation to construct exact mapping models in the Cartesian phase space when the constraint is applied. When nuclear dynamics is approximated by the linearized semiclassical initial value representation, a negative ZPE parameter could lead to reasonably good performance in describing dynamic behaviors in typical spin-boson models for condensed-phase two-state systems, even at challenging zero temperature.

quant-ph↗

Unified Formulation of Phase Space Mapping Approaches for Nonadiabatic Quantum Dynamics

Nonadiabatic dynamical processes are one of the most important quantum mechanical phenomena in chemical, materials, biological, and environmental molecular systems, where the coupling between different electronic states is either inherent in the molecular structure or induced by the (intense) external field. The curse of dimensionality indicates the intractable exponential scaling of calculation effort with system size and restricts the implementation of numerically exact approaches for realistic large systems. The phase space formulation of quantum mechanics offers an important theoretical framework for constructing practical approximate trajectory-based methods for quantum dynamics. This Account reviews our recent progress in phase space mapping theory: a unified framework for constructing the mapping Hamiltonian on phase space for coupled F-state systems where the renowned Meyer-Miller Hamiltonian model is a special case, a general phase space formulation of quantum mechanics for nonadiabatic systems where the electronic degrees of freedom are mapped onto constraint space and the nuclear degrees of freedom are mapped onto infinite space, and an isomorphism between the mapping phase space approach for nonadiabatic systems and that for nonequilibrium electron transport processes.

physics.chem-ph↗

DProQ: A Gated-Graph Transformer for Protein Complex Structure Assessment

Proteins interact to form complexes to carry out essential biological functions. Computational methods have been developed to predict the structures of protein complexes. However, an important challenge in protein complex structure prediction is to estimate the quality of predicted protein complex structures without any knowledge of the corresponding native structures. Such estimations can then be used to select high-quality predicted complex structures to facilitate biomedical research such as protein function analysis and drug discovery. We challenge this significant task with DProQ, which introduces a gated neighborhood-modulating Graph Transformer (GGT) designed to predict the quality of 3D protein complex structures. Notably, we incorporate node and edge gates within a novel Graph Transformer framework to control information flow during graph message passing. We train and evaluate DProQ on four newly-developed datasets that we make publicly available in this work. Our rigorous experiments demonstrate that DProQ achieves state-of-the-art performance in ranking protein complex structures.

cs.LG↗

New Phase Space Formulations and Quantum Dynamics Approaches

We report recent progress on the phase space formulation of quantum mechanics with coordinate-momentum variables, focusing more on new theory of (weighted) constraint coordinate-momentum phase space for discrete-variable quantum systems. This leads to a general coordinate-momentum phase space formulation of composite quantum systems, where conventional representations on infinite phase space are employed for continuous variables. It is convenient to utilize (weighted) constraint coordinate-momentum phase space for representing the quantum state and describing nonclassical features. Various numerical tests demonstrate that new trajectory-based quantum dynamics approaches derived from the (weighted) constraint phase space representation are useful and practical for describing dynamical processes of composite quantum systems in gas phase as well as in condensed phase.

quant-ph↗

Exceptional complete intersection maps of local rings

This work concerns surjective maps $φ\colon R\to S$ of commutative noetherian local rings with kernel generated by a regular sequence that is part of a minimal generating set for the maximal ideal of $R$. The main result provides criteria for detecting such exceptional complete intersection maps in terms of the lattices of thick subcategories of the derived category of complexes of finite length homology. A key input is a characterization of such maps in terms of the truncated Atiyah class of $φ$.

math.AC↗

"Adversarial Examples" for Proof-of-Learning

In S&P '21, Jia et al. proposed a new concept/mechanism named proof-of-learning (PoL), which allows a prover to demonstrate ownership of a machine learning model by proving integrity of the training procedure. It guarantees that an adversary cannot construct a valid proof with less cost (in both computation and storage) than that made by the prover in generating the proof. A PoL proof includes a set of intermediate models recorded during training, together with the corresponding data points used to obtain each recorded model. Jia et al. claimed that an adversary merely knowing the final model and training dataset cannot efficiently find a set of intermediate models with correct data points. In this paper, however, we show that PoL is vulnerable to ``adversarial examples''! Specifically, in a similar way as optimizing an adversarial example, we could make an arbitrarily-chosen data point ``generate'' a given model, hence efficiently generating intermediate models with correct data points. We demonstrate, both theoretically and empirically, that we are able to generate a valid proof with significantly less cost than generating a proof by the prover.

cs.CR↗

Auditing Privacy Defenses in Federated Learning via Generative Gradient Leakage

Federated Learning (FL) framework brings privacy benefits to distributed learning systems by allowing multiple clients to participate in a learning task under the coordination of a central server without exchanging their private data. However, recent studies have revealed that private information can still be leaked through shared gradient information. To further protect user's privacy, several defense mechanisms have been proposed to prevent privacy leakage via gradient information degradation methods, such as using additive noise or gradient compression before sharing it with the server. In this work, we validate that the private training data can still be leaked under certain defense settings with a new type of leakage, i.e., Generative Gradient Leakage (GGL). Unlike existing methods that only rely on gradient information to reconstruct data, our method leverages the latent space of generative adversarial networks (GAN) learned from public image datasets as a prior to compensate for the informational loss during gradient degradation. To address the nonlinearity caused by the gradient operator and the GAN model, we explore various gradient-free optimization methods (e.g., evolution strategies and Bayesian optimization) and empirically show their superiority in reconstructing high-quality images from gradients compared to gradient-based optimizers. We hope the proposed method can serve as a tool for empirically measuring the amount of privacy leakage to facilitate the design of more robust defense mechanisms.

cs.CV↗

Reconciling monolayer and bilayer $J_{\rm eff} = 1/2$ square lattices in hybrid oxide superlattice

The number of atomic layers confined in a two-dimensional structure is crucial for the electronic and magnetic properties. Single-layer and bilayer $J_{\rm eff} = 1/2$ square lattices are well-known examples where the presence of the extra layer turns the XY-anisotropy to the $c$-axis anisotropy. We report on experimental realization of a hybrid SrIrO$_3$/SrTiO$_3$ superlattice that integrates monolayer and bilayer square lattices in one layered structure. By synchrotron x-ray diffraction, resonant x-ray magnetic scattering, magnetization, and resistivity measurements, we found that the hybrid superlattice exhibits properties that are distinct from both the single-layer and bilayer systems and cannot be explained by a simple addition of them. In particular, the entire hybrid superlattice orders simultaneously through a single antiferromagnetic transition at temperatures similar to the bilayer system but with all the $J_{\rm eff} = 1/2$ moments mainly pointing in the $ab$-plane similar to the single-layer system. The results show that bringing monolayer and bilayer with orthogonal properties in proximity to each other in a hybrid superlattice structure is a powerful way to stabilize a unique state not obtainable in a uniform structure.

cond-mat.mtrl-sci↗

Conditional Bilingual Mutual Information Based Adaptive Training for Neural Machine Translation

Token-level adaptive training approaches can alleviate the token imbalance problem and thus improve neural machine translation, through re-weighting the losses of different target tokens based on specific statistical metrics (e.g., token frequency or mutual information). Given that standard translation models make predictions on the condition of previous target contexts, we argue that the above statistical metrics ignore target context information and may assign inappropriate weights to target tokens. While one possible solution is to directly take target contexts into these statistical metrics, the target-context-aware statistical computing is extremely expensive, and the corresponding storage overhead is unrealistic. To solve the above issues, we propose a target-context-aware metric, named conditional bilingual mutual information (CBMI), which makes it feasible to supplement target context information for statistical metrics. Particularly, our CBMI can be formalized as the log quotient of the translation model probability and language model probability by decomposing the conditional joint distribution. Thus CBMI can be efficiently calculated during model training without any pre-specific statistical calculations and large storage overhead. Furthermore, we propose an effective adaptive training approach based on both the token- and sentence-level CBMI. Experimental results on WMT14 English-German and WMT19 Chinese-English tasks show our approach can significantly outperform the Transformer baseline and other related methods.

cs.CL↗