Searcharxiv⌕ Search

arXiv subjects

Pei Zhang

Publications and source records attributed to Pei Zhang.

At least 127 records · Page 7Linked to original sources

A Data-driven feature selection and machine-learning model benchmark for the prediction of longitudinal dispersion coefficient

Longitudinal Dispersion(LD) is the dominant process of scalar transport in natural streams. An accurate prediction on LD coefficient(Dl) can produce a performance leap in related simulation. The emerging machine learning(ML) techniques provide a self-adaptive tool for this problem. However, most of the existing studies utilize an unproved quaternion feature set, obtained through simple theoretical deduction. Few studies have put attention on its reliability and rationality. Besides, due to the lack of comparative comparison, the proper choice of ML models in different scenarios still remains unknown. In this study, the Feature Gradient selector was first adopted to distill the local optimal feature sets directly from multivariable data. Then, a global optimal feature set (the channel width, the flow velocity, the channel slope and the cross sectional area) was proposed through numerical comparison of the distilled local optimums in performance with representative ML models. The channel slope is identified to be the key parameter for the prediction of LDC. Further, we designed a weighted evaluation metric which enables comprehensive model comparison. With the simple linear model as the baseline, a benchmark of single and ensemble learning models was provided. Advantages and disadvantages of the methods involved were also discussed. Results show that the support vector machine has significantly better performance than other models. Decision tree is not suitable for this problem due to poor generalization ability. Notably, simple models show superiority over complicated model on this low-dimensional problem, for their better balance between regression and generalization.

physics.geo-ph↗

GearV: A Two-Gear Hypervisor for Mixed-Criticality IoT Systems

This paper presents GearV, a two-gear lightweight hypervisor architecture to address the some known challenges. By dividing hypervisor into some partitions, and dividing scheduling policies into Gear1 and Gear2 respectively, GearV creates a consolidated platform to run best-effort system and safety-critical system simultaneously with managed engineering effort. The two-gears architecture also simplifies retrofitting the virtualization systems. We believe that GearV can serves as a reasonable hypervisor architecture for the mix-critical IoT systems.

cs.DC↗

Multi-view Clustering via Deep Matrix Factorization and Partition Alignment

Multi-view clustering (MVC) has been extensively studied to collect multiple source information in recent years. One typical type of MVC methods is based on matrix factorization to effectively perform dimension reduction and clustering. However, the existing approaches can be further improved with following considerations: i) The current one-layer matrix factorization framework cannot fully exploit the useful data representations. ii) Most algorithms only focus on the shared information while ignore the view-specific structure leading to suboptimal solutions. iii) The partition level information has not been utilized in existing work. To solve the above issues, we propose a novel multi-view clustering algorithm via deep matrix decomposition and partition alignment. To be specific, the partition representations of each view are obtained through deep matrix decomposition, and then are jointly utilized with the optimal partition representation for fusing multi-view information. Finally, an alternating optimization algorithm is developed to solve the optimization problem with proven convergence. The comprehensive experimental results conducted on six benchmark multi-view datasets clearly demonstrates the effectiveness of the proposed algorithm against the SOTA methods.

cs.LG↗

Multi-view Clustering with Deep Matrix Factorization and Global Graph Refinement

Multi-view clustering is an important yet challenging task in machine learning and data mining community. One popular strategy for multi-view clustering is matrix factorization which could explore useful feature representations at lower-dimensional space and therefore alleviate dimension curse. However, there are two major drawbacks in the existing work: i) most matrix factorization methods are limited to shadow depth, which leads to the inability to fully discover the rich hidden information of original data. Few deep matrix factorization methods provide a basis for the selection of the new representation's dimensions of different layers. ii) the majority of current approaches only concentrate on the view-shared information and ignore the specific local features in different views. To tackle the above issues, we propose a novel Multi-View Clustering method with Deep semi-NMF and Global Graph Refinement (MVC-DMF-GGR) in this paper. Firstly, we capture new representation matrices for each view by hierarchical decomposition, then learn a common graph by approximating a combination of graphs which are reconstructed from these new representations to refine the new representations in return. An alternate algorithm with proved convergence is then developed to solve the optimization problem and the results on six multi-view benchmarks demonstrate the effectiveness and superiority of our proposed algorithm.

cs.LG↗

Quantum state transfer between two photons with polarization and orbital angular momentum via quantum teleportation technology

Quantum teleportation is a useful quantum information technology to transmit quantum states between different degrees of freedom. We here report a quantum state transfer experiment in the linear optical system, transferring a single photon state in the polarization degree of freedom (DoF) to another photon in the orbital angular momentum (OAM) quantum state via a biphoton OAM entangled channel. Our experimental method is based on quantum teleportation technology. The differences between ours and the original teleportation scheme is that the transfer state is known in ours, and our method is for different particles with different DoFs while the original one is for different particles with same DoF. Besides, our present experiment is implemented with a high Bell-efficiency since each of the four hybrid-entangled Bell states can be discriminated. We use six states of poles of the Bloch sphere to test our experiment, and the fidelity of the quantum state transfer is $91.8\pm1.3\%$.

quant-ph↗

Experimental Demonstration of a Quantum Controlled-SWAP Gate with Multiple Degrees of Freedom of a Single Photon

Optimizing the physical realization of quantum gates is important to build a quantum computer. The controlled-SWAP gate, also named Fredkin gate, can be widely applicable in various quantum information processing schemes. In the present research, we propose and experimentally implement quantum Fredkin gate in a single-photon hybrid-degrees-of-freedom system. Polarization is used as the control qubit, and SWAP operation is achieved in a four-dimensional Hilbert space spanned by photonic orbital angular momentum. The effective conversion rate $\mathcal{P}$ of the quantum Fredkin gate in our experiment is $(95.4\pm 2.6)\%$. Besides, we find that a kind of Greenberger-Horne-Zeilinger-like states can be prepared by using our quantum Fredkin gate, and these nonseparale states can show its quantum contextual characteristic by the violation of Mermin inequality. Our experimental design and coding method are useful for quantum computing and quantum fundamental study in high-dimensional and hybrid coding quantum systems.

quant-ph↗

Realization of a deterministic quantum Toffoli gate with a single photon

Quantum controlled-logic gates, including controlled NOT gate and Toffoli gate, play critical roles in lots of quantum information processing schemes. We design and experimentally demonstrate deterministic Toffoli gate by utilizing orbital-angular-momentum and polarization degrees of freedom of a single photon. In addition, we generate Bell states by using the controlled NOT gate. The effective conversion rate of the Toffoli gate in our experiment is $(95.1\pm3.2)\%$. Furthermore, our experimental setup does not require any auxiliary photons and probabilistic post selections.

quant-ph↗

PSA: A novel optimization algorithm based on survival rules of porcellio scaber

Bio-inspired algorithms such as neural network algorithms and genetic algorithms have received a significant amount of attention in both academic and engineering societies. In this paper, based on the observation of two major survival rules of a species of woodlice, i.e., porcellio scaber, we present an algorithm called the porcellio scaber algorithm (PSA) for solving general unconstrained optimization problems, including differentiable and non-differential ones as well as the case with local optima. Numerical results based on benchmark problems are presented to validate the efficacy of PSA.

cs.NE↗

Long-Short Term Masking Transformer: A Simple but Effective Baseline for Document-level Neural Machine Translation

Many document-level neural machine translation (NMT) systems have explored the utility of context-aware architecture, usually requiring an increasing number of parameters and computational complexity. However, few attention is paid to the baseline model. In this paper, we research extensively the pros and cons of the standard transformer in document-level translation, and find that the auto-regressive property can simultaneously bring both the advantage of the consistency and the disadvantage of error accumulation. Therefore, we propose a surprisingly simple long-short term masking self-attention on top of the standard transformer to both effectively capture the long-range dependence and reduce the propagation of errors. We examine our approach on the two publicly available document-level datasets. We can achieve a strong result in BLEU and capture discourse phenomena.

cs.CL↗

Extending Label Smoothing Regularization with Self-Knowledge Distillation

Inspired by the strong correlation between the Label Smoothing Regularization(LSR) and Knowledge distillation(KD), we propose an algorithm LsrKD for training boost by extending the LSR method to the KD regime and applying a softer temperature. Then we improve the LsrKD by a Teacher Correction(TC) method, which manually sets a constant larger proportion for the right class in the uniform distribution teacher. To further improve the performance of LsrKD, we develop a self-distillation method named Memory-replay Knowledge Distillation (MrKD) that provides a knowledgeable teacher to replace the uniform distribution one in LsrKD. The MrKD method penalizes the KD loss between the current model's output distributions and its copies' on the training trajectory. By preventing the model learning so far from its historical output distribution space, MrKD can stabilize the learning and find a more robust minimum. Our experiments show that LsrKD can improve LSR performance consistently at no cost, especially on several deep neural networks where LSR is ineffectual. Also, MrKD can significantly improve single model training. The experiment results confirm that the TC can help LsrKD and MrKD to boost training, especially on the networks they are failed. Overall, LsrKD, MrKD, and their TC variants are comparable to or outperform the LSR method, suggesting the broad applicability of these KD methods.

cs.LG↗

O-MedAL: Online Active Deep Learning for Medical Image Analysis

Active Learning methods create an optimized labeled training set from unlabeled data. We introduce a novel Online Active Deep Learning method for Medical Image Analysis. We extend our MedAL active learning framework to present new results in this paper. Our novel sampling method queries the unlabeled examples that maximize the average distance to all training set examples. Our online method enhances performance of its underlying baseline deep network. These novelties contribute significant performance improvements, including improving the model's underlying deep network accuracy by 6.30%, using only 25% of the labeled dataset to achieve baseline accuracy, reducing backpropagated images during training by as much as 67%, and demonstrating robustness to class imbalance in binary and multi-class tasks.

cs.LG↗

LaNet: Real-time Lane Identification by Learning Road SurfaceCharacteristics from Accelerometer Data

The resolution of GPS measurements, especially in urban areas, is insufficient for identifying a vehicle's lane. In this work, we develop a deep LSTM neural network model LaNet that determines the lane vehicles are on by periodically classifying accelerometer samples collected by vehicles as they drive in real time. Our key finding is that even adjacent patches of road surfaces contain characteristics that are sufficiently unique to differentiate between lanes, i.e., roads inherently exhibit differing bumps, cracks, potholes, and surface unevenness. Cars can capture this road surface information as they drive using inexpensive, easy-to-install accelerometers that increasingly come fitted in cars and can be accessed via the CAN-bus. We collect an aggregate of 60 km driving data and synthesize more based on this that capture factors such as variable driving speed, vehicle suspensions, and accelerometer noise. Our formulated LSTM-based deep learning model, LaNet, learns lane-specific sequences of road surface events (bumps, cracks etc.) and yields 100% lane classification accuracy with 200 meters of driving data, achieving over 90% with just 100 m (correspondingly to roughly one minute of driving). We design the LaNet model to be practical for use in real-time lane classification and show with extensive experiments that LaNet yields high classification accuracy even on smooth roads, on large multi-lane roads, and on drives with frequent lane changes. Since different road surfaces have different inherent characteristics or entropy, we excavate our neural network model and discover a mechanism to easily characterize the achievable classification accuracies in a road over various driving distances by training the model just once. We present LaNet as a low-cost, easily deployable and highly accurate way to achieve fine-grained lane identification.

cs.CV↗

Learning Contextualized Sentence Representations for Document-Level Neural Machine Translation

Document-level machine translation incorporates inter-sentential dependencies into the translation of a source sentence. In this paper, we propose a new framework to model cross-sentence dependencies by training neural machine translation (NMT) to predict both the target translation and surrounding sentences of a source sentence. By enforcing the NMT model to predict source context, we want the model to learn "contextualized" source sentence representations that capture document-level dependencies on the source side. We further propose two different methods to learn and integrate such contextualized sentence embeddings into NMT: a joint training method that jointly trains an NMT model with the source context prediction model and a pre-training & fine-tuning method that pretrains the source context prediction model on a large-scale monolingual document corpus and then fine-tunes it with the NMT model. Experiments on Chinese-English and English-German translation show that both methods can substantially improve the translation quality over a strong document-level Transformer baseline.

cs.CL↗

Visual Agreement Regularized Training for Multi-Modal Machine Translation

Multi-modal machine translation aims at translating the source sentence into a different language in the presence of the paired image. Previous work suggests that additional visual information only provides dispensable help to translation, which is needed in several very special cases such as translating ambiguous words. To make better use of visual information, this work presents visual agreement regularized training. The proposed approach jointly trains the source-to-target and target-to-source translation models and encourages them to share the same focus on the visual information when generating semantically equivalent visual words (e.g. "ball" in English and "ballon" in French). Besides, a simple yet effective multi-head co-attention model is also introduced to capture interactions between visual and textual features. The results show that our approaches can outperform competitive baselines by a large margin on the Multi30k dataset. Further analysis demonstrates that the proposed regularized training can effectively improve the agreement of attention on the image, leading to better use of visual information.

cs.CL↗

Efficient quantum state tomography with auxiliary Hilbert space

Quantum state tomography is an important tool for quantum communication, computation, metrology, and simulation. Efficient quantum state tomography on a high dimensional quantum system is still a challenging problem. Here, we propose a novel quantum state tomography method, auxiliary Hilbert space tomography, to avoid pre-rotations before measurement in a quantum state tomography experiment. Our method requires projective measurements in a higher dimensional space that contains the subspace that includes the prepared states. We experimentally demonstrate this method with orbital angular momentum states of photons. In our experiment, the quantum state tomography measurements are as simple as taking a photograph with a camera. We experimentally verify our method with near-pure- and mixed-states of orbital angular momentum with dimension up to $d=13$, and achieve greater than 95 % state fidelities for all states tested. This method dramatically reduces the complexity of measurements for full quantum state tomography, and shows potential application in various high dimensional quantum information tasks.

quant-ph↗

Lattice Transformer for Speech Translation

Recent advances in sequence modeling have highlighted the strengths of the transformer architecture, especially in achieving state-of-the-art machine translation results. However, depending on the up-stream systems, e.g., speech recognition, or word segmentation, the input to translation system can vary greatly. The goal of this work is to extend the attention mechanism of the transformer to naturally consume the lattice in addition to the traditional sequential input. We first propose a general lattice transformer for speech translation where the input is the output of the automatic speech recognition (ASR) which contains multiple paths and posterior scores. To leverage the extra information from the lattice structure, we develop a novel controllable lattice attention mechanism to obtain latent representations. On the LDC Spanish-English speech translation corpus, our experiments show that lattice transformer generalizes significantly better and outperforms both a transformer baseline and a lattice LSTM. Additionally, we validate our approach on the WMT 2017 Chinese-English translation task with lattice inputs from different BPE segmentations. In this task, we also observe the improvements over strong baselines.

cs.CL↗

Velocity interpolation based Bounce-Back scheme for non-slip boundary condition in Lattice Boltzmann Method

Lattice Boltzmann Method(LBM) has achieved considerable success on simulating complex flows. However, how to impose correct boundary conditions on the fluid-solid interface with complex geometries is still an open question. Here we proposed a velocity interpolation based bounce-back scheme where the ideas of interpolated bounce-back and non-equilibrium extrapolation are combined. The proposed scheme is validated by several well-defined benchmark cases. It is shown that the proposed scheme offers a better accuracy at high Reynolds number and less dependency on solids positions which may crucial in many engineering and science applications.

physics.flu-dyn↗

Realization of a scalable Laguerre-Gaussian mode sorter based on a robust radial mode sorter

The transverse structure of light is recognized as a resource that can be used to encode information onto photons and has been shown to be useful to enhance communication capacity as well as resolve point sources in superresolution imaging. The Laguerre-Gaussian (LG) modes form a complete and orthonormal basis set and are described by a radial index p and an orbital angular momentum (OAM) index l. Earlier works have shown how to build a sorter for the radial index p or/and the OAM index l of LG modes, but a scalable and dedicated LG mode sorter which simultaneous determinate p and l is immature. Here we propose and experimentally demonstrate a scheme to accomplish complete LG mode sorting, which consists of a novel, robust radial mode sorter that can be used to couple radial modes to polarizations, an l-dependent phase shifter and an OAM mode sorter. Our scheme is in principle efficient, scalable, and crosstalk-free, and therefore has potential for applications in optical communications, quantum information technology, superresolution imaging, and fiber optics.

physics.optics↗