arXiv subjects

Ye Wang

Publications and source records attributed to Ye Wang.

At least 271 records · Page 15Linked to original sources

arXiv2022

Advanced Conditional Variational Autoencoders (A-CVAE): Towards interpreting open-domain conversation generation via disentangling latent feature representation

Currently end-to-end deep learning based open-domain dialogue systems remain black box models, making it easy to generate irrelevant contents with data-driven models. Specifically, latent variables are highly entangled with different semantics in the latent space due to the lack of priori knowledge to guide the training. To address this problem, this paper proposes to harness the generative model with a priori knowledge through a cognitive approach involving mesoscopic scale feature disentanglement. Particularly, the model integrates the macro-level guided-category knowledge and micro-level open-domain dialogue data for the training, leveraging the priori knowledge into the latent space, which enables the model to disentangle the latent variables within the mesoscopic scale. Besides, we propose a new metric for open-domain dialogues, which can objectively evaluate the interpretability of the latent space distribution. Finally, we validate our model on different datasets and experimentally demonstrate that our model is able to generate higher quality and more interpretable dialogues than other models.

cs.CL↗

arXiv2022

Enhancing Dual-Encoders with Question and Answer Cross-Embeddings for Answer Retrieval

Dual-Encoders is a promising mechanism for answer retrieval in question answering (QA) systems. Currently most conventional Dual-Encoders learn the semantic representations of questions and answers merely through matching score. Researchers proposed to introduce the QA interaction features in scoring function but at the cost of low efficiency in inference stage. To keep independent encoding of questions and answers during inference stage, variational auto-encoder is further introduced to reconstruct answers (questions) from question (answer) embeddings as an auxiliary task to enhance QA interaction in representation learning in training stage. However, the needs of text generation and answer retrieval are different, which leads to hardness in training. In this work, we propose a framework to enhance the Dual-Encoders model with question answer cross-embeddings and a novel Geometry Alignment Mechanism (GAM) to align the geometry of embeddings from Dual-Encoders with that from Cross-Encoders. Extensive experimental results show that our framework significantly improves Dual-Encoders model and outperforms the state-of-the-art method on multiple answer retrieval datasets.

cs.CL↗

arXiv2022

Non-decreasing Payment Rules for Combinatorial Auctions

Combinatorial auctions are used to allocate resources in domains where bidders have complex preferences over bundles of goods. However, the behavior of bidders under different payment rules is not well understood, and there has been limited success in finding Bayes-Nash equilibria of such auctions due to the computational difficulties involved. In this paper, we introduce non-decreasing payment rules. Under such a rule, the payment of a bidder cannot decrease when he increases his bid, which is a natural and desirable property. VCG-nearest, the payment rule most commonly used in practice, violates this property and can thus be manipulated in surprising ways. In contrast, we show that many other payment rules are non-decreasing. We also show that a non-decreasing payment rule imposes a structure on the auction game that enables us to search for an approximate Bayes-Nash equilibrium much more efficiently than in the general case. Finally, we introduce the utility planes BNE algorithm, which exploits this structure and outperforms a state-of-the-art algorithm by multiple orders of magnitude.

cs.GT↗

arXiv2022

Crosstalk Suppression in Individually Addressed Two-Qubit Gates in a Trapped-Ion Quantum Computer

Crosstalk between target and neighboring spectator qubits due to spillover of control signals represents a major error source limiting the fidelity of two-qubit entangling gates in quantum computers. We show that in our laser-driven trapped-ion system coherent crosstalk error can be modelled as residual $X\hatσ_ϕ$ interaction and can be actively cancelled by single-qubit echoing pulses. We propose and demonstrate a crosstalk suppression scheme that eliminates all first-order crosstalk, yet only requires local control by driving rotations solely on the target qubits. We report a two-qubit Bell state fidelity of $99.52(6) \%$ with the echoing pulses applied after collective gates and $99.37(5) \%$ with the echoing pulses applied to each gate in a 5-ion chain. This scheme is widely applicable to other platforms with analogous interaction Hamiltonians.

quant-ph↗

arXiv2022

Determination of Multi-mode Motional Quantum States in a Trapped Ion System

Trapped atomic ions are a versatile platform for studying interactions between spins and bosons by coupling the internal states of the ions to their motion. Measurement of complex motional states with multiple modes is challenging, because all motional state populations can only be measured indirectly through the spin state of ions. Here we present a general method to determine the Fock state distributions and to reconstruct the density matrix of an arbitrary multi-mode motional state. We experimentally verify the method using different entangled states of multiple radial modes in a 5-ion chain. This method can be extended to any system with Jaynes-Cummings type interactions.

quant-ph↗

arXiv2022

Quantum Transfer Learning for Wi-Fi Sensing

Beyond data communications, commercial-off-the-shelf Wi-Fi devices can be used to monitor human activities, track device locomotion, and sense the ambient environment. In particular, spatial beam attributes that are inherently available in the 60-GHz IEEE 802.11ad/ay standards have shown to be effective in terms of overhead and channel measurement granularity for these indoor sensing tasks. In this paper, we investigate transfer learning to mitigate domain shift in human monitoring tasks when Wi-Fi settings and environments change over time. As a proof-of-concept study, we consider quantum neural networks (QNN) as well as classical deep neural networks (DNN) for the future quantum-ready society. The effectiveness of both DNN and QNN is validated by an in-house experiment for human pose recognition, achieving greater than 90% accuracy with a limited data size.

cs.LG↗

arXiv2022

Variational Quantum Compressed Sensing for Joint User and Channel State Acquisition in Grant-Free Device Access Systems

This paper introduces a new quantum computing framework integrated with a two-step compressed sensing technique, applied to a joint channel estimation and user identification problem. We propose a variational quantum circuit (VQC) design as a new denoising solution. For a practical grant-free communications system having correlated device activities, variational quantum parameters for Pauli rotation gates in the proposed VQC system are optimized to facilitate to the non-linear estimation. Numerical results show that the VQC method can outperform modern compressed sensing techniques using an element-wise denoiser.

eess.SP↗

arXiv2022

Learning to Learn Quantum Turbo Detection

This paper investigates a turbo receiver employing a variational quantum circuit (VQC). The VQC is configured with an ansatz of the quantum approximate optimization algorithm (QAOA). We propose a 'learning to learn' (L2L) framework to optimize the turbo VQC decoder such that high fidelity soft-decision output is generated. Besides demonstrating the proposed algorithm's computational complexity, we show that the L2L VQC turbo decoder can achieve an excellent performance close to the optimal maximum-likelihood performance in a multiple-input multiple-output system.

eess.SP↗

arXiv2022

AutoQML: Automated Quantum Machine Learning for Wi-Fi Integrated Sensing and Communications

Commercial Wi-Fi devices can be used for integrated sensing and communications (ISAC) to jointly exchange data and monitor indoor environment. In this paper, we investigate a proof-of-concept approach using automated quantum machine learning (AutoQML) framework called AutoAnsatz to recognize human gesture. We address how to efficiently design quantum circuits to configure quantum neural networks (QNN). The effectiveness of AutoQML is validated by an in-house experiment for human pose recognition, achieving state-of-the-art performance greater than 80% accuracy for a limited data size with a significantly small number of trainable parameters.

cs.LG↗

arXiv2022

AutoTransfer: Subject Transfer Learning with Censored Representations on Biosignals Data

We provide a regularization framework for subject transfer learning in which we seek to train an encoder and classifier to minimize classification loss, subject to a penalty measuring independence between the latent representation and the subject label. We introduce three notions of independence and corresponding penalty terms using mutual information or divergence as a proxy for independence. For each penalty term, we provide several concrete estimation algorithms, using analytic methods as well as neural critic functions. We provide a hands-off strategy for applying this diverse family of regularization algorithms to a new dataset, which we call "AutoTransfer". We evaluate the performance of these individual regularization strategies and our AutoTransfer method on EEG, EMG, and ECoG datasets, showing that these approaches can improve subject transfer learning for challenging real-world datasets.

cs.LG↗

arXiv2022

Experimental Realization of the Rabi-Hubbard Model with Trapped Ions

Quantum simulation provides important tools in studying strongly correlated many-body systems with controllable parameters. As a hybrid of two fundamental models in quantum optics and in condensed matter physics, the Rabi-Hubbard model demonstrates rich physics through the competition between local spin-boson interactions and long-range boson hopping. Here we report an experimental realization of the Rabi-Hubbard model using up to $16$ trapped ions and present a controlled study of its equilibrium properties and quantum dynamics. We observe the ground-state quantum phase transition by slowly quenching the coupling strength, and measure the quantum dynamical evolution in various parameter regimes. With the magnetization and the spin-spin correlation as probes, we verify the prediction of the model Hamiltonian by comparing theoretical results in small system sizes with experimental observations. For larger-size systems of $16$ ions and $16$ phonon modes, the effective Hilbert space dimension exceeds $2^{57}$, whose dynamics is intractable for classical supercomputers.

quant-ph↗

arXiv2022

CLIP-Forge: Towards Zero-Shot Text-to-Shape Generation

Generating shapes using natural language can enable new ways of imagining and creating the things around us. While significant recent progress has been made in text-to-image generation, text-to-shape generation remains a challenging problem due to the unavailability of paired text and shape data at a large scale. We present a simple yet effective method for zero-shot text-to-shape generation that circumvents such data scarcity. Our proposed method, named CLIP-Forge, is based on a two-stage training process, which only depends on an unlabelled shape dataset and a pre-trained image-text network such as CLIP. Our method has the benefits of avoiding expensive inference time optimization, as well as the ability to generate multiple shapes for a given text. We not only demonstrate promising zero-shot generalization of the CLIP-Forge model qualitatively and quantitatively, but also provide extensive comparative evaluations to better understand its behavior.

cs.CV↗

arXiv2022

Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions

Combinatorial auctions (CAs) allow bidders to express complex preferences for bundles of goods being auctioned. However, the behavior of bidders under different payment rules is often unclear. In this paper, we aim to understand how core constraints interact with different core-selecting payment rules. In particular, we examine the natural and desirable non-decreasing property of payment rules, which states that bidders cannot decrease their payments by increasing their bids. Previous work showed that, in general, the widely used VCG-nearest payment rule violates the non-decreasing property in single-minded CAs. We prove that under a single effective core constraint, the VCG-nearest payment rule is non-decreasing. In order to determine in which auctions single effective core constraints occur, we introduce a conflict graph representation of single-minded CAs and find sufficient conditions for the single effective core constraint in CAs. Finally, we study the consequences on the behavior of the bidders and show that no over-bidding exists in any Nash equilibrium for non-decreasing core-selecting payment rules.

cs.GT↗

arXiv2022

Observing frustrated quantum magnetism in two-dimensional ion crystals

Two-dimensional (2D) quantum magnetism is a paradigm in strongly correlated many-body physics. The understanding of 2D quantum magnetism can be expedited by employing a controllable quantum simulator that faithfully maps 2D-spin Hamiltonians. The 2D quantum simulators can exhibit exotic phenomena such as frustrated quantum magnetism and topological order and can be used to show quantum computational advantages. Many experimental platforms are being developed, including Rydberg atoms and superconducting annealers. However, with trapped-ion systems, which showed the most advanced controllability and quantum coherence, quantum magnetism was explored in one-dimensional chains. Here, we report simulations of frustrated quantum magnetism with 2D ion crystals. We create a variety of spin-spin interactions for quantum magnets, including those that exhibit frustration by driving different vibrational modes and adiabatically prepare the corresponding ground states. The experimentally measured ground states are consistent with the theoretical predictions and are highly degenerate for geometrically frustrated spin models in two dimensions. Quantum coherence of the ground states is probed by reversing the time evolution of the B-field to the initial value and then measuring the extent to which the remaining state coincides with the initial state. Our results open the door for quantum simulations with 2D ion crystals.

quant-ph↗

arXiv2022

Exploring Transformer's potential on automatic piano transcription

Most recent research about automatic music transcription (AMT) uses convolutional neural networks and recurrent neural networks to model the mapping from music signals to symbolic notation. Based on a high-resolution piano transcription system, we explore the possibility of incorporating another powerful sequence transformation tool -- the Transformer -- to deal with the AMT problem. We argue that the properties of the Transformer make it more suitable for certain AMT subtasks. We confirm the Transformer's superiority on the velocity detection task by experiments on the MAESTRO dataset and a cross-dataset evaluation on the MAPS dataset. We observe a performance improvement on both frame-level and note-level metrics after introducing the Transformer network.

eess.AS↗

arXiv2022

Data-Driven Quantum Approximate Optimization Algorithm for Cyber-Physical Power Systems

Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems, especially for Distributed Energy Resources (DERs) dominant cyber-physical systems that have been widely developed to promote energy sustainability. The systems' maximum power or data sections are essential for monitoring, operation, and control, while high computational effort is required. Quantum Approximate Optimization Algorithm (QAOA) provides a promising means to search for these sections by leveraging quantum resources. However, its performance highly relies on the critical parameters, especially for weighted graphs. We present a data-driven QAOA, which transfers quasi-optimal parameters between weighted graphs based on the normalized graph density, and verify the strategy with 39,774 instances. Without parameter optimization, our data-driven QAOA is comparable with the Goemans-Williamson algorithm. This work advances QAOA and pilots the practical application of quantum technique to power systems in noisy intermediate-scale quantum devices, heralding its next-generation computation in the quantum era.

quant-ph↗

arXiv2022

Hidden Inverses: Coherent Error Cancellation at the Circuit Level

Coherent gate errors are a concern in many proposed quantum computing architectures. These errors can be effectively handled through composite pulse sequences for single-qubit gates, however, such techniques are less feasible for entangling operations. In this work, we benchmark our coherent errors by comparing the actual performance of composite single-qubit gates to the predicted performance based on characterization of individual single-qubit rotations. We then propose a compilation technique, which we refer to as hidden inverses, that creates circuits robust to these coherent errors. We present experimental data showing that these circuits suppress both overrotation and phase misalignment errors in our trapped ion system.

quant-ph↗

arXiv2022

RotateQVS: Representing Temporal Information as Rotations in Quaternion Vector Space for Temporal Knowledge Graph Completion

Temporal factors are tied to the growth of facts in realistic applications, such as the progress of diseases and the development of political situation, therefore, research on Temporal Knowledge Graph (TKG) attracks much attention. In TKG, relation patterns inherent with temporality are required to be studied for representation learning and reasoning across temporal facts. However, existing methods can hardly model temporal relation patterns, nor can capture the intrinsic connections between relations when evolving over time, lacking of interpretability. In this paper, we propose a novel temporal modeling method which represents temporal entities as Rotations in Quaternion Vector Space (RotateQVS) and relations as complex vectors in Hamilton's quaternion space. We demonstrate our method can model key patterns of relations in TKG, such as symmetry, asymmetry, inverse, and can further capture time-evolved relations by theory. Empirically, we show that our method can boost the performance of link prediction tasks over four temporal knowledge graph benchmarks.

cs.AI↗