BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Jie Song

Jie Song contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Computer Visionquant-phMachine LearningArtificial Intelligenceeess.SYSystems and ControlBiomoleculesphysics.chem-phDigital Librarieseess.IVInformation Retrievalmath.OCphysics.app-phphysics.opticsRobotics

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
36works
0followers
15topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

36 published item(s)

preprint2026arXiv

OptArgus: A Multi-Agent System to Detect Hallucinations in LLM-based Optimization Modeling

Large language models (LLMs) are increasingly used to translate natural-language optimization problems into mathematical formulations and solver code, but matching the reference objective value is not a reliable test of correctness: an artifact may agree numerically while still changing the underlying optimization semantics. We formulate this issue as \emph{optimization-modeling hallucination detection}, namely structural consistency auditing over the problem description, symbolic model, and solver implementation. We develop, to our knowledge, the first fine-grained hallucination taxonomy specifically for optimization modeling, spanning objective, variable, constraint, and implementation failures. We use this taxonomy to design OptArgus, a multi-agent detector with conductor routing, specialist auditors, and evidence consolidation. To evaluate this setting, we introduce a three-part benchmark suite with $484$ clean artifacts, $1266$ controlled injected artifacts, and $6292$ natural LLM-generated artifacts. Against a matched single-agent baseline, OptArgus produces fewer false alarms on clean artifacts, more accurate top-ranked localization on controlled single-error cases, and stronger detection on natural model outputs. Together, these contributions turn optimization-modeling hallucination detection into a concrete empirical problem and suggest that modular, taxonomy-grounded auditing is a practical route to more reliable optimization modeling.

0 citations0 reviewsNo code linkedOpen access
preprint2024arXiv

Three-state coherent control using narrowband and passband sequences

In this work, we propose a comprehensive design for narrowband and passband composite pulse sequences by involving the dynamics of all states in the three-state system. The design is quite universal as all pulse parameters can be freely employed to modify the coefficients of error terms. Two modulation techniques, the strength and phase modulations, are used to achieve arbitrary population transfer with a desired excitation profile, while the system keeps minimal leakage to the third state. Furthermore, the current sequences are capable of tolerating inaccurate waveforms, detunings errors, and work well when rotating wave approximation is not strictly justified. Therefore, this work provides versatile adaptability for shaping various excitation profiles in both narrowband and passband sequences.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

Recent advances in artificial intelligence for retrosynthesis

Retrosynthesis is the cornerstone of organic chemistry, providing chemists in material and drug manufacturing access to poorly available and brand-new molecules. Conventional rule-based or expert-based computer-aided synthesis has obvious limitations, such as high labor costs and limited search space. In recent years, dramatic breakthroughs driven by artificial intelligence have revolutionized retrosynthesis. Here we aim to present a comprehensive review of recent advances in AI-based retrosynthesis. For single-step and multi-step retrosynthesis both, we first list their goal and provide a thorough taxonomy of existing methods. Afterwards, we analyze these methods in terms of their mechanism and performance, and introduce popular evaluation metrics for them, in which we also provide a detailed comparison among representative methods on several public datasets. In the next part we introduce popular databases and established platforms for retrosynthesis. Finally, this review concludes with a discussion about promising research directions in this field.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

A Model-Adaptive Clustering Method for Low-Carbon Energy System Optimization

Intermittent renewable energy resources like wind and solar pose great uncertainty of multiple time scales, from minutes to years, on the design and operation of power systems. Energy system optimization models have been developed to find the least-cost solution to matching the uncertainty with flexibility resources. However, input data that capture such multi-time-scale uncertainty are characterized with a long time horizon and bring great difficulty to solving the optimization model. Here we propose an adaptive clustering method based on the decision variables of optimization model to alleviate the computational complexity, in which the energy system is optimized over selected representative time periods instead of the full time horizon. The proposed clustering method is adaptive to various energy system optimization models or settings, because it extracts features from the optimization models. Results show that the proposed clustering method can significantly lower the error in approximating the solution with the full time horizon, compared to traditional clustering methods.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

A Survey of Neural Trees

Neural networks (NNs) and decision trees (DTs) are both popular models of machine learning, yet coming with mutually exclusive advantages and limitations. To bring the best of the two worlds, a variety of approaches are proposed to integrate NNs and DTs explicitly or implicitly. In this survey, these approaches are organized in a school which we term as neural trees (NTs). This survey aims to present a comprehensive review of NTs and attempts to identify how they enhance the model interpretability. We first propose a thorough taxonomy of NTs that expresses the gradual integration and co-evolution of NNs and DTs. Afterward, we analyze NTs in terms of their interpretability and performance, and suggest possible solutions to the remaining challenges. Finally, this survey concludes with a discussion about other considerations like conditional computation and promising directions towards this field. A list of papers reviewed in this survey, along with their corresponding codes, is available at: https://github.com/zju-vipa/awesome-neural-trees

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

An unsupervised cluster-level based method for learning node representations of heterogeneous graphs in scientific papers

Learning knowledge representation of scientific paper data is a problem to be solved, and how to learn the representation of paper nodes in scientific paper heterogeneous network is the core to solve this problem. This paper proposes an unsupervised cluster-level scientific paper heterogeneous graph node representation learning method (UCHL), aiming at obtaining the representation of nodes (authors, institutions, papers, etc.) in the heterogeneous graph of scientific papers. Based on the heterogeneous graph representation, this paper performs link prediction on the entire heterogeneous graph and obtains the relationship between the edges of the nodes, that is, the relationship between papers and papers. Experiments results show that the proposed method achieves excellent performance on multiple evaluation metrics on real scientific paper datasets.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Bootstrapping ViTs: Towards Liberating Vision Transformers from Pre-training

Recently, vision Transformers (ViTs) are developing rapidly and starting to challenge the domination of convolutional neural networks (CNNs) in the realm of computer vision (CV). With the general-purpose Transformer architecture replacing the hard-coded inductive biases of convolution, ViTs have surpassed CNNs, especially in data-sufficient circumstances. However, ViTs are prone to over-fit on small datasets and thus rely on large-scale pre-training, which expends enormous time. In this paper, we strive to liberate ViTs from pre-training by introducing CNNs' inductive biases back to ViTs while preserving their network architectures for higher upper bound and setting up more suitable optimization objectives. To begin with, an agent CNN is designed based on the given ViT with inductive biases. Then a bootstrapping training algorithm is proposed to jointly optimize the agent and ViT with weight sharing, during which the ViT learns inductive biases from the intermediate features of the agent. Extensive experiments on CIFAR-10/100 and ImageNet-1k with limited training data have shown encouraging results that the inductive biases help ViTs converge significantly faster and outperform conventional CNNs with even fewer parameters. Our code is publicly available at https://github.com/zhfeing/Bootstrapping-ViTs-pytorch.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

D-Grasp: Physically Plausible Dynamic Grasp Synthesis for Hand-Object Interactions

We introduce the dynamic grasp synthesis task: given an object with a known 6D pose and a grasp reference, our goal is to generate motions that move the object to a target 6D pose. This is challenging, because it requires reasoning about the complex articulation of the human hand and the intricate physical interaction with the object. We propose a novel method that frames this problem in the reinforcement learning framework and leverages a physics simulation, both to learn and to evaluate such dynamic interactions. A hierarchical approach decomposes the task into low-level grasping and high-level motion synthesis. It can be used to generate novel hand sequences that approach, grasp, and move an object to a desired location, while retaining human-likeness. We show that our approach leads to stable grasps and generates a wide range of motions. Furthermore, even imperfect labels can be corrected by our method to generate dynamic interaction sequences.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Detecting a single atom in a cavity using the $χ^{(2)}$ nonlinear medium

We propose a protocol for detecting a single atom in a cavity with the help of the $χ^{(2)}$ nonlinear medium. When the $χ^{(2)}$ nonlinear medium is driven by an external laser field, the cavity mode will be squeezed, and thus one can obtain an exponentially enhanced light-matter coupling. Such a strong coupling between the atom and the cavity field can significantly change the output photon flux, the quantum fluctuations, the quantum statistical property, and the photon number distributions of the cavity field. This provides practical strategies to determine the presence or absence of an atom in a cavity. The proposed protocol exhibits some advantages, such as controllable squeezing strength and exponential increase of atom-cavity coupling strength, which make the experimental phenomenon more obvious. We hope that this protocol can supplement the existing intracavity single-atom detection protocols and provide a promise for quantum sensing in different quantum systems.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Distribution-Aware Graph Representation Learning for Transient Stability Assessment of Power System

The real-time transient stability assessment (TSA) plays a critical role in the secure operation of the power system. Although the classic numerical integration method, \textit{i.e.} time-domain simulation (TDS), has been widely used in industry practice, it is inevitably trapped in a high computational complexity due to the high latitude sophistication of the power system. In this work, a data-driven power system estimation method is proposed to quickly predict the stability of the power system before TDS reaches the end of simulating time windows, which can reduce the average simulation time of stability assessment without loss of accuracy. As the topology of the power system is in the form of graph structure, graph neural network based representation learning is naturally suitable for learning the status of the power system. Motivated by observing the distribution information of crucial active power and reactive power on the power system's bus nodes, we thus propose a distribution-aware learning~(DAL) module to explore an informative graph representation vector for describing the status of a power system. Then, TSA is re-defined as a binary classification task, and the stability of the system is determined directly from the resulting graph representation without numerical integration. Finally, we apply our method to the online TSA task. The case studies on the IEEE 39-bus system and Polish 2383-bus system demonstrate the effectiveness of our proposed method.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Dual Perceptual Loss for Single Image Super-Resolution Using ESRGAN

The proposal of perceptual loss solves the problem that per-pixel difference loss function causes the reconstructed image to be overly-smooth, which acquires a significant progress in the field of single image super-resolution reconstruction. Furthermore, the generative adversarial networks (GAN) is applied to the super-resolution field, which effectively improves the visual quality of the reconstructed image. However, under the condtion of high upscaling factors, the excessive abnormal reasoning of the network produces some distorted structures, so that there is a certain deviation between the reconstructed image and the ground-truth image. In order to fundamentally improve the quality of reconstructed images, this paper proposes a effective method called Dual Perceptual Loss (DP Loss), which is used to replace the original perceptual loss to solve the problem of single image super-resolution reconstruction. Due to the complementary property between the VGG features and the ResNet features, the proposed DP Loss considers the advantages of learning two features simultaneously, which significantly improves the reconstruction effect of images. The qualitative and quantitative analysis on benchmark datasets demonstrates the superiority of our proposed method over state-of-the-art super-resolution methods.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Federated Selective Aggregation for Knowledge Amalgamation

In this paper, we explore a new knowledge-amalgamation problem, termed Federated Selective Aggregation (FedSA). The goal of FedSA is to train a student model for a new task with the help of several decentralized teachers, whose pre-training tasks and data are different and agnostic. Our motivation for investigating such a problem setup stems from a recent dilemma of model sharing. Many researchers or institutes have spent enormous resources on training large and competent networks. Due to the privacy, security, or intellectual property issues, they are, however, not able to share their own pre-trained models, even if they wish to contribute to the community. The proposed FedSA offers a solution to this dilemma and makes it one step further since, again, the learned student may specialize in a new task different from all of the teachers. To this end, we proposed a dedicated strategy for handling FedSA. Specifically, our student-training process is driven by a novel saliency-based approach that adaptively selects teachers as the participants and integrates their representative capabilities into the student. To evaluate the effectiveness of FedSA, we conduct experiments on both single-task and multi-task settings. Experimental results demonstrate that FedSA effectively amalgamates knowledge from decentralized models and achieves competitive performance to centralized baselines.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Functional acoustic metamaterial using shortcut to adiabatic passage in acoustic waveguide couplers

Shortcut to adiabatic passage (STAP), initially proposed to accelerate adiabatic quantum state transfer, has been widely explored and applied in quantum optics and integrated optics. Here we bring STAP into the field of acoustics to design compact couplers and functional metamaterial. The space-varying coupling strengths of acoustic waveguides (WGs) are tailored by means of dressed states in a three-level system, accounting for the desirable acoustic energy transfer among three WGs with short length. We show that the acoustic coupler has one-way feature when loss is introduced into the intermediate WG. More uniquely, when the propagation of acoustic wave is designed to mimic a Hadamard transformation, an acoustic metamaterial can be constructed by arraying several couplers, possessing the beam-splitting function and unidirectional, broadband performances. Our work bridges STAP and the acoustic coupler as well as metamaterial, which may have profound impacts on exploring quantum technologies for promoting advanced acoustic devices.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

gDNA: Towards Generative Detailed Neural Avatars

To make 3D human avatars widely available, we must be able to generate a variety of 3D virtual humans with varied identities and shapes in arbitrary poses. This task is challenging due to the diversity of clothed body shapes, their complex articulations, and the resulting rich, yet stochastic geometric detail in clothing. Hence, current methods to represent 3D people do not provide a full generative model of people in clothing. In this paper, we propose a novel method that learns to generate detailed 3D shapes of people in a variety of garments with corresponding skinning weights. Specifically, we devise a multi-subject forward skinning module that is learned from only a few posed, un-rigged scans per subject. To capture the stochastic nature of high-frequency details in garments, we leverage an adversarial loss formulation that encourages the model to capture the underlying statistics. We provide empirical evidence that this leads to realistic generation of local details such as wrinkles. We show that our model is able to generate natural human avatars wearing diverse and detailed clothing. Furthermore, we show that our method can be used on the task of fitting human models to raw scans, outperforming the previous state-of-the-art.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Learning with Recoverable Forgetting

Life-long learning aims at learning a sequence of tasks without forgetting the previously acquired knowledge. However, the involved training data may not be life-long legitimate due to privacy or copyright reasons. In practical scenarios, for instance, the model owner may wish to enable or disable the knowledge of specific tasks or specific samples from time to time. Such flexible control over knowledge transfer, unfortunately, has been largely overlooked in previous incremental or decremental learning methods, even at a problem-setup level. In this paper, we explore a novel learning scheme, termed as Learning wIth Recoverable Forgetting (LIRF), that explicitly handles the task- or sample-specific knowledge removal and recovery. Specifically, LIRF brings in two innovative schemes, namely knowledge deposit and withdrawal, which allow for isolating user-designated knowledge from a pre-trained network and injecting it back when necessary. During the knowledge deposit process, the specified knowledge is extracted from the target network and stored in a deposit module, while the insensitive or general knowledge of the target network is preserved and further augmented. During knowledge withdrawal, the taken-off knowledge is added back to the target network. The deposit and withdraw processes only demand for a few epochs of finetuning on the removal data, ensuring both data and time efficiency. We conduct experiments on several datasets, and demonstrate that the proposed LIRF strategy yields encouraging results with gratifying generalization capability.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Mining and searching association relation of scientific papers based on deep learning

There is a complex correlation among the data of scientific papers. The phenomenon reveals the data characteristics, laws, and correlations contained in the data of scientific and technological papers in specific fields, which can realize the analysis of scientific and technological big data and help to design applications to serve scientific researchers. Therefore, the research on mining and searching the association relationship of scientific papers based on deep learning has far-reaching practical significance.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Nonadiabatic geometric quantum computation with cat qubits via invariant-based reverse engineering

We propose a protocol to realize nonadiabatic geometric quantum computation of small-amplitude Schrödinger cat qubits via invariant-based reverse engineering. We consider a system with a two-photon driven Kerr nonlinearity, which provides a pair of dressed even and odd coherent states, i.e., Schrödinger cat states for fault-tolerant quantum computations. An additional coherent field is applied to linearly drive a cavity mode, to induce oscillations between dressed cat states. By designing this linear drive with invariant-based reverse engineering, nonadiabatic geometric quantum computation with cat qubits can be implemented. The performance of the protocol is estimated by taking into account the influence of systematic errors, additive white Gaussian noise, and decoherence including photon loss and dephasing. Numerical results demonstrate that our protocol is robust against these negative factors. Therefore, this protocol may provide a feasible method for nonadiabatic geometric quantum computation in bosonic systems.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

PINA: Learning a Personalized Implicit Neural Avatar from a Single RGB-D Video Sequence

We present a novel method to learn Personalized Implicit Neural Avatars (PINA) from a short RGB-D sequence. This allows non-expert users to create a detailed and personalized virtual copy of themselves, which can be animated with realistic clothing deformations. PINA does not require complete scans, nor does it require a prior learned from large datasets of clothed humans. Learning a complete avatar in this setting is challenging, since only few depth observations are available, which are noisy and incomplete (i.e. only partial visibility of the body per frame). We propose a method to learn the shape and non-rigid deformations via a pose-conditioned implicit surface and a deformation field, defined in canonical space. This allows us to fuse all partial observations into a single consistent canonical representation. Fusion is formulated as a global optimization problem over the pose, shape and skinning parameters. The method can learn neural avatars from real noisy RGB-D sequences for a diverse set of people and clothing styles and these avatars can be animated given unseen motion sequences.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Robust population inversion in three-level systems by composite pulses

In this work, we exploit the idea of composite pulses to achieve robust population inversion in a three-level quantum system. The scheme is based on the modulation of the coupling strength, while the other physical parameters remain unchanged. The composite pulses sequence is designed by vanishing high-order error terms, and can compensate the systematic errors to any desired order. In particular, this scheme keeps a good performance under the disturbance of waveform deformations. This trait ensures that population inversion can be nearly obtained even when the pulse sequence has a short jump delay. As an example, we employ the designed composite pulse sequence to prepare the W state in a robust manner in the superconducting circuits. The numerical results show that the fidelity can still maintain a high level in a decoherence environment.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Root-aligned SMILES: A Tight Representation for Chemical Reaction Prediction

Chemical reaction prediction, involving forward synthesis and retrosynthesis prediction, is a fundamental problem in organic synthesis. A popular computational paradigm formulates synthesis prediction as a sequence-to-sequence translation problem, where the typical SMILES is adopted for molecule representations. However, the general-purpose SMILES neglects the characteristics of chemical reactions, where the molecular graph topology is largely unaltered from reactants to products, resulting in the suboptimal performance of SMILES if straightforwardly applied. In this article, we propose the root-aligned SMILES (R-SMILES), which specifies a tightly aligned one-to-one mapping between the product and the reactant SMILES for more efficient synthesis prediction. Due to the strict one-to-one mapping and reduced edit distance, the computational model is largely relieved from learning the complex syntax and dedicated to learning the chemical knowledge for reactions. We compare the proposed R-SMILES with various state-of-the-art baselines and show that it significantly outperforms them all, demonstrating the superiority of the proposed method.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Spot-adaptive Knowledge Distillation

Knowledge distillation (KD) has become a well established paradigm for compressing deep neural networks. The typical way of conducting knowledge distillation is to train the student network under the supervision of the teacher network to harness the knowledge at one or multiple spots (i.e., layers) in the teacher network. The distillation spots, once specified, will not change for all the training samples, throughout the whole distillation process. In this work, we argue that distillation spots should be adaptive to training samples and distillation epochs. We thus propose a new distillation strategy, termed spot-adaptive KD (SAKD), to adaptively determine the distillation spots in the teacher network per sample, at every training iteration during the whole distillation period. As SAKD actually focuses on "where to distill" instead of "what to distill" that is widely investigated by most existing works, it can be seamlessly integrated into existing distillation methods to further improve their performance. Extensive experiments with 10 state-of-the-art distillers are conducted to demonstrate the effectiveness of SAKD for improving their distillation performance, under both homogeneous and heterogeneous distillation settings. Code is available at https://github.com/zju-vipa/spot-adaptive-pytorch

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Up to 100$\times$ Faster Data-free Knowledge Distillation

Data-free knowledge distillation (DFKD) has recently been attracting increasing attention from research communities, attributed to its capability to compress a model only using synthetic data. Despite the encouraging results achieved, state-of-the-art DFKD methods still suffer from the inefficiency of data synthesis, making the data-free training process extremely time-consuming and thus inapplicable for large-scale tasks. In this work, we introduce an efficacious scheme, termed as FastDFKD, that allows us to accelerate DFKD by a factor of orders of magnitude. At the heart of our approach is a novel strategy to reuse the shared common features in training data so as to synthesize different data instances. Unlike prior methods that optimize a set of data independently, we propose to learn a meta-synthesizer that seeks common features as the initialization for the fast data synthesis. As a result, FastDFKD achieves data synthesis within only a few steps, significantly enhancing the efficiency of data-free training. Experiments over CIFAR, NYUv2, and ImageNet demonstrate that the proposed FastDFKD achieves 10$\times$ and even 100$\times$ acceleration while preserving performances on par with state of the art. Code is available at \url{https://github.com/zju-vipa/Fast-Datafree}.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Data-Driven Short-Term Voltage Stability Assessment Based on Spatial-Temporal Graph Convolutional Network

Post-fault dynamics of short-term voltage stability (SVS) present spatial-temporal characteristics, but the existing data-driven methods for online SVS assessment fail to incorporate such characteristics into their models effectively. Confronted with this dilemma, this paper develops a novel spatial-temporal graph convolutional network (STGCN) to address this problem. The proposed STGCN utilizes graph convolution to integrate network topology information into the learning model to exploit spatial information. Then, it adopts one-dimensional convolution to exploit temporal information. In this way, it models the spatial-temporal characteristics of SVS with complete convolutional structures. After that, a node layer and a system layer are strategically designed in the STGCN for SVS assessment. The proposed STGCN incorporates the characteristics of SVS into the data-driven classification model. It can result in higher assessment accuracy, better robustness and adaptability than conventional methods. Besides, parameters in the system layer can provide valuable information about the influences of individual buses on SVS. Test results on the real-world Guangdong Power Grid in South China verify the effectiveness of the proposed network.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Resilient quantum gates on periodically driven Rydberg atoms

Fault-tolerant implementation of quantum gates is one of preconditions for realizing quantum computation. The platform of Rydberg atoms is one of the most promising candidates for achieving quantum computation. We propose to implement a controlled-$Z$ gate on Rydberg atoms where an amplitude-modulated field is employed to induce Rydberg antiblockade. Gate robustness against the fluctuations in the Rydberg-Rydberg interaction can be largely enhanced by adjusting amplitude-modulated field. Furthermore, we introduce a Landau-Zener-Stückelberg transition on the target atom so as to improve the gate resilience to the deviation in the gate time and the drift in the pulse amplitude. With feasible experimental parameters, one can achieve the gate with low fidelity errors caused by atomic decay, interatomic dipole-dipole force, and Doppler effects. Finally, we generalize the gate scheme into multiqubit cases, where resilient multiqubit phase gates can be obtained in one step with an unchanged gate time as the number of qubits increases.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Category Level Object Pose Estimation via Neural Analysis-by-Synthesis

Many object pose estimation algorithms rely on the analysis-by-synthesis framework which requires explicit representations of individual object instances. In this paper we combine a gradient-based fitting procedure with a parametric neural image synthesis module that is capable of implicitly representing the appearance, shape and pose of entire object categories, thus rendering the need for explicit CAD models per object instance unnecessary. The image synthesis network is designed to efficiently span the pose configuration space so that model capacity can be used to capture the shape and local appearance (i.e., texture) variations jointly. At inference time the synthesized images are compared to the target via an appearance based loss and the error signal is backpropagated through the network to the input parameters. Keeping the network parameters fixed, this allows for iterative optimization of the object pose, shape and appearance in a joint manner and we experimentally show that the method can recover orientation of objects with high accuracy from 2D images alone. When provided with depth measurements, to overcome scale ambiguities, the method can accurately recover the full 6DOF pose successfully.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Data-Free Adversarial Distillation

Knowledge Distillation (KD) has made remarkable progress in the last few years and become a popular paradigm for model compression and knowledge transfer. However, almost all existing KD algorithms are data-driven, i.e., relying on a large amount of original training data or alternative data, which is usually unavailable in real-world scenarios. In this paper, we devote ourselves to this challenging problem and propose a novel adversarial distillation mechanism to craft a compact student model without any real-world data. We introduce a model discrepancy to quantificationally measure the difference between student and teacher models and construct an optimizable upper bound. In our work, the student and the teacher jointly act the role of the discriminator to reduce this discrepancy, when a generator adversarially produces some "hard samples" to enlarge it. Extensive experiments demonstrate that the proposed data-free method yields comparable performance to existing data-driven methods. More strikingly, our approach can be directly extended to semantic segmentation, which is more complicated than classification, and our approach achieves state-of-the-art results. Code and pretrained models are available at https://github.com/VainF/Data-Free-Adversarial-Distillation.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

DEPARA: Deep Attribution Graph for Deep Knowledge Transferability

Exploring the intrinsic interconnections between the knowledge encoded in PRe-trained Deep Neural Networks (PR-DNNs) of heterogeneous tasks sheds light on their mutual transferability, and consequently enables knowledge transfer from one task to another so as to reduce the training effort of the latter. In this paper, we propose the DEeP Attribution gRAph (DEPARA) to investigate the transferability of knowledge learned from PR-DNNs. In DEPARA, nodes correspond to the inputs and are represented by their vectorized attribution maps with regards to the outputs of the PR-DNN. Edges denote the relatedness between inputs and are measured by the similarity of their features extracted from the PR-DNN. The knowledge transferability of two PR-DNNs is measured by the similarity of their corresponding DEPARAs. We apply DEPARA to two important yet under-studied problems in transfer learning: pre-trained model selection and layer selection. Extensive experiments are conducted to demonstrate the effectiveness and superiority of the proposed method in solving both these problems. Code, data and models reproducing the results in this paper are available at \url{https://github.com/zju-vipa/DEPARA}.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Effective Rabi dynamics of Rydberg atoms and robust high-fidelity quantum gates with a resonant amplitude-modulation field

With a resonant amplitude-modulation field on two Rydberg atoms, we propose a Rydberg antiblockade (RAB) regime, where the Rabi oscillation between collective ground and excited states is induced. A controlled-Z gate can be yielded through a Rabi cycle. Further, several common issues of the RAB gates are solved by modifying the parameter relation. The gate fidelity and the gate robustness against the control error are enhanced with a shaped pulse. The requirement of control precision of the Rydberg-Rydberg interaction strength is relaxed. In addition, the atomic excitation is restrained and therefore the gate robustness against the atomic decay is enhanced.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Heralded atomic nonadiabatic holonomic quantum computation with Rydberg blockade

We propose a protocol to realize atomic nonadiabatic holonomic quantum computation (NHQC) with two computational atoms and an auxiliary atom. Dynamics of the system is analyzed in the regime of Rydberg blockade, and robust laser pulses are designed via reverse engineering, so that quantum gates can be easily realized with high fidelities. In addition, we also study the evolution suffering from dissipation with a master equation. The result indicates that decays of atoms can be heralded by measuring the state of the auxiliary atom, and nearly perfect unitary evolution can be obtained if the auxiliary atom remains in its Rydberg state. Therefore, the protocol may be helpful to realize NHQC in dissipative environment.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Human Body Model Fitting by Learned Gradient Descent

We propose a novel algorithm for the fitting of 3D human shape to images. Combining the accuracy and refinement capabilities of iterative gradient-based optimization techniques with the robustness of deep neural networks, we propose a gradient descent algorithm that leverages a neural network to predict the parameter update rule for each iteration. This per-parameter and state-aware update guides the optimizer towards a good solution in very few steps, converging in typically few steps. During training our approach only requires MoCap data of human poses, parametrized via SMPL. From this data the network learns a subspace of valid poses and shapes in which optimization is performed much more efficiently. The approach does not require any hard to acquire image-to-3D correspondences. At test time we only optimize the 2D joint re-projection error without the need for any further priors or regularization terms. We show empirically that this algorithm is fast (avg. 120ms convergence), robust to initialization and dataset, and achieves state-of-the-art results on public evaluation datasets including the challenging 3DPW in-the-wild benchmark (improvement over SMPLify 45%) and also approaches using image-to-3D correspondences

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Impression Space from Deep Template Network

It is an innate ability for humans to imagine something only according to their impression, without having to memorize all the details of what they have seen. In this work, we would like to demonstrate that a trained convolutional neural network also has the capability to "remember" its input images. To achieve this, we propose a simple but powerful framework to establish an {\emph{Impression Space}} upon an off-the-shelf pretrained network. This network is referred to as the {\emph{Template Network}} because its filters will be used as templates to reconstruct images from the impression. In our framework, the impression space and image space are bridged by a layer-wise encoding and iterative decoding process. It turns out that the impression space indeed captures the salient features from images, and it can be directly applied to tasks such as unpaired image translation and image synthesis through impression matching without further network training. Furthermore, the impression naturally constructs a high-level common space for different data. Based on this, we propose a mechanism to model the data relations inside the impression space, which is able to reveal the feature similarity between images. Our code will be released.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Noise-resistant phase gates with amplitude modulation

We propose a simple scheme for implementing fast arbitrary phase gates and employ pulse modulation to improve the gate robustness against different sources of noise. Parametric driving of a cavity is introduced to induce Rabi interactions between the cavity and qutrits, and then a two-qubit arbitrary phase gate is constructed by designing proper logical states. On this basis, we implement amplitude-shaped gates to obtain enhanced resilience to control errors in gate time and frequency detuning. By virtue of specifically designed logical states, the scheme displays intrinsic resistance to the energy relaxations of qutrits. Furthermore, we show that the gate robustness against cavity decay can be enhanced significantly with amplitude modulation.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Robust generation of logical qubit singlet states with reverse engineering and optimal control with spin qubits

A protocol is proposed to generate singlet states of three logical qubits constructed by pairs of spins. Single and multiple operations of logical qubits are studied for the construction of an effective Hamiltonian, with which robust control fields are derived with invariant-based reverse engineering and optimal control. Moreover, systematic errors are further compensated by periodic modulation for better robustness. Furthermore, resistance to decoherence of the protocol is also shown with numerical simulations. Therefore, the protocol may provide useful perspectives for generations of logical qubit entanglement in spin systems.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Sparse Coding Driven Deep Decision Tree Ensembles for Nuclear Segmentation in Digital Pathology Images

In this paper, we propose an easily trained yet powerful representation learning approach with performance highly competitive to deep neural networks in a digital pathology image segmentation task. The method, called sparse coding driven deep decision tree ensembles that we abbreviate as ScD2TE, provides a new perspective on representation learning. We explore the possibility of stacking several layers based on non-differentiable pairwise modules and generate a densely concatenated architecture holding the characteristics of feature map reuse and end-to-end dense learning. Under this architecture, fast convolutional sparse coding is used to extract multi-level features from the output of each layer. In this way, rich image appearance models together with more contextual information are integrated by learning a series of decision tree ensembles. The appearance and the high-level context features of all the previous layers are seamlessly combined by concatenating them to feed-forward as input, which in turn makes the outputs of subsequent layers more accurate and the whole model efficient to train. Compared with deep neural networks, our proposed ScD2TE does not require back-propagation computation and depends on less hyper-parameters. ScD2TE is able to achieve a fast end-to-end pixel-wise training in a layer-wise manner. We demonstrated the superiority of our segmentation technique by evaluating it on the multi-disease state and multi-organ dataset where consistently higher performances were obtained for comparison against several state-of-the-art deep learning methods such as convolutional neural networks (CNN), fully convolutional networks (FCN), etc.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Two-path interference for enantiomer-selective state transfer of chiral molecules

With a microwave-regime cyclic three-state configuration, an enantiomer-selective state transfer~(ESST) is carried out through the two-path interference between a direct one-photon coupling and an effective two-photon coupling. The $π$-phase difference in the one-photon process between two enantiomers makes the interference constructive for one enantiomer but destructive for the other. Therefore only one enantiomer is excited into a higher rotational state while the other remains in the ground state. The scheme is of flexibility in the pulse waveforms and the time order of two paths. We simulate the scheme in a sample of cyclohexylmethanol~(C$_7$H$_{14}$O) molecules. Simulative results show the robust and high-fidelity ESST can be obtained when experimental concerns are considered. Finally, we propose to employ the finished ESST in implementing enantio-separation and determining enantiomeric excess.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Robust and highly-efficient discrimination of chiral molecules through three-mode parallel paths

We propose to discriminate chiral molecules by combining one- and two-photon processes in a closed-loop configuration. The one-photon-coupling intrinsic π-phase difference between two enantiomers leads to their different superposition states, which is then followed by a two-photon process through three-mode parallel paths (3MPPs), enabling the discrimination of enantiomers by inducing their entirely-different population distributions. The 3MPPs are constructed by "chosen paths", a method of shortcuts to adiabaticity (STA), exhibiting a fast two-photon process. As an example, we propose to perform the scheme in 1, 2-propanediol molecules, which shows relatively robust and highly-efficient results under considering the experimental issues concerning unwanted transitions, imperfect initial state, pulse shaping, control errors and the effect of energy relaxations. The present work may provide help for laboratory researchers in a robust separation of chiral molecules.

0 citations0 reviewsNo code linkedOpen access