Searcharxiv⌕ Search

arXiv subjects

Lei Li

Publications and source records attributed to Lei Li.

At least 667 records · Page 37Linked to original sources

PointDSC: Robust Point Cloud Registration using Deep Spatial Consistency

Removing outlier correspondences is one of the critical steps for successful feature-based point cloud registration. Despite the increasing popularity of introducing deep learning methods in this field, spatial consistency, which is essentially established by a Euclidean transformation between point clouds, has received almost no individual attention in existing learning frameworks. In this paper, we present PointDSC, a novel deep neural network that explicitly incorporates spatial consistency for pruning outlier correspondences. First, we propose a nonlocal feature aggregation module, weighted by both feature and spatial coherence, for feature embedding of the input correspondences. Second, we formulate a differentiable spectral matching module, supervised by pairwise spatial compatibility, to estimate the inlier confidence of each correspondence from the embedded features. With modest computation cost, our method outperforms the state-of-the-art hand-crafted and learning-based outlier rejection approaches on several real-world datasets by a significant margin. We also show its wide applicability by combining PointDSC with different 3D local descriptors.

cs.CV↗

Taxonomy Completion via Triplet Matching Network

Automatically constructing taxonomy finds many applications in e-commerce and web search. One critical challenge is as data and business scope grow in real applications, new concepts are emerging and needed to be added to the existing taxonomy. Previous approaches focus on the taxonomy expansion, i.e. finding an appropriate hypernym concept from the taxonomy for a new query concept. In this paper, we formulate a new task, "taxonomy completion", by discovering both the hypernym and hyponym concepts for a query. We propose Triplet Matching Network (TMN), to find the appropriate pairs for a given query concept. TMN consists of one primal scorer and multiple auxiliary scorers. These auxiliary scorers capture various fine-grained signals (e.g., query to hypernym or query to hyponym semantics), and the primal scorer makes a holistic prediction on triplet based on the internal feature representations of all auxiliary scorers. Also, an innovative channel-wise gating mechanism that retains task-specific information in concept representations is introduced to further boost model performance. Experiments on four real-world large-scale datasets show that TMN achieves the best performance on both taxonomy completion task and the previous taxonomy expansion task, outperforming existing methods.

cs.CL↗

Scheduling fixed length quarantines to minimize the total number of fatalities during an epidemic

We consider a susceptible, infected, removed (SIR) system where the transmission rate may be temporarily reduced for a fixed amount of time. We show that in order to minimize the total number of fatalities, the transmission rate should be reduced on a single contiguous time interval, and we characterize this interval via an integral condition. We conclude with a few numerical simulations showing the actual reduction obtained.

math.DS↗

Numerical methods for stochastic differential equations based on Gaussian mixture

We develop in this work a numerical method for stochastic differential equations (SDEs) with weak second order accuracy based on Gaussian mixture. Unlike the conventional higher order schemes for SDEs based on Itô-Taylor expansion and iterated Itô integrals, the proposed scheme approximates the probability measure $μ(X^{n+1}|X^n=x_n)$ by a mixture of Gaussians. The solution at next time step $X^{n+1}$ is then drawn from the Gaussian mixture with complexity linear in the dimension $d$. This provides a new general strategy to construct efficient high weak order numerical schemes for SDEs.

math.NA↗

Controlling directed atomic motion and second-order tunneling of a spin-orbit-coupled atom in optical lattices

We theoretically explore the tunneling dynamics for the tight-binding (TB) model of a single spin-orbit-coupled atom trapped in an optical lattice subjected to lattice shaking and to time-periodic Zeeman field. By means of analytical and numerical methods, we demonstrate that the spin-orbit (SO) coupling adds some new results to the tunneling dynamics in both multiphoton resonance and far-off-resonance parameter regimes. When the driving frequency is resonant with the static Zeeman field (multi-photon resonances), we obtain an unexpected new dynamical localization (DL) phenomenon where the single SO-coupled atom is restricted to making perfect two-site Rabi oscillation accompanied by spin flipping.By using the unconventional DL phenomenon, we are able to generate a ratchetlike effect which enables directed atomic motion towards different directions and accompanies periodic spin-flipping under the action of SO coupling. For the far-off-resonance case, we show that by suppressing the usual inter-site tunneling alone, it is possible to realize a type of spin-conserving second-order tunneling between next-nearest-neighboring sites, which is not accessible in the conventional lattice system without SO coupling. We also show that simultaneous controls of the usual inter-site tunneling and the SO-coupling-related second-order-tunneling are necessary for quasienergies flatness (collapse) and completely frozen dynamics to exist. These results may be relevant to potential applications such as spin-based quantum information processing and design of novel spintronics devices.

cond-mat.quant-gas↗

Triangular Bidword Generation for Sponsored Search Auction

Sponsored search auction is a crucial component of modern search engines. It requires a set of candidate bidwords that advertisers can place bids on. Existing methods generate bidwords from search queries or advertisement content. However, they suffer from the data noise in and pairs. In this paper, we propose a triangular bidword generation model (TRIDENT), which takes the high-quality data of paired as a supervision signal to indirectly guide the bidword generation process. Our proposed model is simple yet effective: by using bidword as the bridge between search query and advertisement, the generation of search query, advertisement and bidword can be jointly learned in the triangular training framework. This alleviates the problem that the training data of bidword may be noisy. Experimental results, including automatic and human evaluations, show that our proposed TRIDENT can generate relevant and diverse bidwords for both search queries and advertisements. Our evaluation on online real data validates the effectiveness of the TRIDENT's generated bidwords for product search.

cs.CL↗

Tight upper bound on the quantum value of Svetlichny operators under local filtering and hidden genuine nonlocality

Nonlocal quantum correlations among the quantum subsystems play essential roles in quantum science. The violation of the Svetlichny inequality provides sufficient conditions of genuine tripartite nonlocality. We provide tight upper bounds on the maximal quantum value of the Svetlichny operators under local filtering operations, and present a qualitative analytical analysis on the hidden genuine nonlocality for three-qubit systems. We investigate in detail two classes of three-qubit states whose hidden genuine nonlocalities can be revealed by local filtering.

quant-ph↗

Pre-training Multilingual Neural Machine Translation by Leveraging Alignment Information

We investigate the following question for machine translation (MT): can we develop a single universal MT model to serve as the common seed and obtain derivative and improved models on arbitrary language pairs? We propose mRASP, an approach to pre-train a universal multilingual neural machine translation model. Our key idea in mRASP is its novel technique of random aligned substitution, which brings words and phrases with similar meanings across multiple languages closer in the representation space. We pre-train a mRASP model on 32 language pairs jointly with only public datasets. The model is then fine-tuned on downstream language pairs to obtain specialized MT models. We carry out extensive experiments on 42 translation directions across a diverse settings, including low, medium, rich resource, and as well as transferring to exotic language pairs. Experimental results demonstrate that mRASP achieves significant performance improvement compared to directly training on those target pairs. It is the first time to verify that multiple low-resource language pairs can be utilized to improve rich resource MT. Surprisingly, mRASP is even able to improve the translation quality on exotic languages that never occur in the pre-training corpus. Code, data, and pre-trained models are available at https://github.com/linzehui/mRASP.

cs.CL↗

Complete monotonicity-preserving numerical methods for time fractional ODEs

The time fractional ODEs are equivalent to convolutional Volterra integral equations with completely monotone kernels. We therefore introduce the concept of complete monotonicity-preserving ($\mathcal{CM}$-preserving) numerical methods for fractional ODEs, in which the discrete convolutional kernels inherit the $\mathcal{CM}$ property as the continuous equations. We prove that $\mathcal{CM}$-preserving schemes are at least $A(π/2)$ stable and can preserve the monotonicity of solutions to scalar nonlinear autonomous fractional ODEs, both of which are novel. Significantly, by improving a result of Li and Liu (Quart. Appl. Math., 76(1):189-198, 2018), we show that the $\mathcal{L}$1 scheme is $\mathcal{CM}$-preserving, so that the $\mathcal{L}$1 scheme is at least $A(π/2)$ stable, which is an improvement on stability analysis for $\mathcal{L}$1 scheme given in Jin, Lazarov and Zhou (IMA J. Numer. Analy. 36:197-221, 2016). The good signs of the coefficients for such class of schemes ensure the discrete fractional comparison principles, and allow us to establish the convergence in a unified framework when applied to time fractional sub-diffusion equations and fractional ODEs. The main tools in the analysis are a characterization of convolution inverses for completely monotone sequences and a characterization of completely monotone sequences using Pick functions due to Liu and Pego (Trans. Amer. Math. Soc. 368(12):8499-8518, 2016). The results for fractional ODEs are extended to $\mathcal{CM}$-preserving numerical methods for Volterra integral equations with general completely monotone kernels. Numerical examples are presented to illustrate the main theoretical results.

math.NA↗

Effect of inter-system coupling on heat transport in a microscopic collision model

In this paper we consider a bipartite system composed of two subsystems each coupled to its own thermal environment. Based on a collision model, we mainly study whether the approximation (i.e., the inter-system interaction is ignored when modeling the system-environment coupling) is valid or not. We also address the problem of heat transport unitedly for both conventional energy-preserving system-environment interactions and non-energy preserving system-environment interactions. For the former interaction, as the inter-system interaction strength increases, at first this approximation gets worse as expected, but then counterintuitively gets better even for a stronger inter-system coupling. For the latter interaction with asymmetry, this approximation gets progressively worse. In this case we realize a perfect thermal rectification, and we can not find apparent rectification effect for the former interaction. Finally and more importantly, our results show that whether this approximation is valid or not is closely related to the quantum correlations between the subsystems, i.e., the weaker the quantum correlations, the more justified the approximation and vice versa.

quant-ph↗

A verifiable multi-party quantum key distribution protocol based on repetitive codes

A multi-party quantum key distribution protocol based on repetitive code is designed for the first time in this paper. First we establish a classical (t, n) threshold protocol which can authenticate the identity of the participants, and encode the classical key sequence in accordance with this repetitive code. Then unitary transformation of the quantum state sequence corresponding to this encoded sequence is carried out by using the parameters from this (t, n) threshold protocol. Furthermore, we derive two thresholds for whether or not reserving the measured values of the received sequence, and extract the classical subkey sequence from the measured values conforming to these two threshold conditions. This protocol can authenticate the identity of the participant, resist the attack from the internal and external participants, and do not need the decoy state particles when testing the eavesdropper, which is more efficient than the similar protocols, and also saves the quantum resources.

quant-ph↗

Dual-energy CT Reconstruction from Dual Quarter Scans

Compared with conventional single-energy computed tomography (CT), dual-energy CT (DECT) provides better material differentiation but most DECT imaging systems require dual full-angle projection data at different X-ray spectra. Relaxing the requirement of data acquisition is a particularly attractive research to promote the applications of DECT in a wide range of imaging areas. In this work, we design a novel DECT imaging scheme with dual quarter scans and propose an efficient method to reconstruct the desired DECT images from dual limited-angle projection data, which enables DECT on imaging configurations with half-scan and largely reduces scanning angles and radiation doses. We first study the characteristics of image artifacts under dual quarter scans scheme, and find that the directional limited-angle artifacts of DECT images are complementarily distributed in image domain because the corresponding X-rays of high- and low-energy scans are orthogonal. Inspired by this finding, a fusion CT image is generated by integrating the limited-angle DECT images of dual quarter scans. This strategy largely reduces the limited-angle artifacts and preserves the image edges and inner structures. Utilizing the capability of neural network in the modeling of nonlinear problem, a novel Anchor network with single-entry double-out architecture is designed in this work to yield the desired DECT images from the generated fusion CT image. Experimental results on the simulated and real data verify the effectiveness of the proposed method.

physics.med-ph↗

Trustworthy Preference Completion in Social Choice

As from time to time it is impractical to ask agents to provide linear orders over all alternatives, for these partial rankings it is necessary to conduct preference completion. Specifically, the personalized preference of each agent over all the alternatives can be estimated with partial rankings from neighboring agents over subsets of alternatives. However, since the agents' rankings are nondeterministic, where they may provide rankings with noise, it is necessary and important to conduct the trustworthy preference completion. Hence, in this paper firstly, a trust-based anchor-kNN algorithm is proposed to find $k$-nearest trustworthy neighbors of the agent with trust-oriented Kendall-Tau distances, which will handle the cases when an agent exhibits irrational behaviors or provides only noisy rankings. Then, for alternative pairs, a bijection can be built from the ranking space to the preference space, and its certainty and conflict can be evaluated based on a well-built statistical measurement Probability-Certainty Density Function. Therefore, a certain common voting rule for the first $k$ trustworthy neighboring agents based on certainty and conflict can be taken to conduct the trustworthy preference completion. The properties of the proposed certainty and conflict have been studied empirically, and the proposed approach has been experimentally validated compared to state-of-arts approaches with several data sets.

cs.AI↗

Cross-Lingual Vision-Language Navigation

Commanding a robot to navigate with natural language instructions is a long-term goal for grounded language understanding and robotics. But the dominant language is English, according to previous studies on vision-language navigation (VLN). To go beyond English and serve people speaking different languages, we collect a bilingual Room-to-Room (BL-R2R) dataset, extending the original benchmark with new Chinese instructions. Based on this newly introduced dataset, we study how an agent can be trained on existing English instructions but navigate effectively with another language under a zero-shot learning scenario. Without any training data of the target language, our model shows competitive results even compared to a model with full access to the target language training data. Moreover, we investigate the transferring ability of our model when given a certain amount of target language training data.

cs.CL↗

Reciprocal Supervised Learning Improves Neural Machine Translation

Despite the recent success on image classification, self-training has only achieved limited gains on structured prediction tasks such as neural machine translation (NMT). This is mainly due to the compositionality of the target space, where the far-away prediction hypotheses lead to the notorious reinforced mistake problem. In this paper, we revisit the utilization of multiple diverse models and present a simple yet effective approach named Reciprocal-Supervised Learning (RSL). RSL first exploits individual models to generate pseudo parallel data, and then cooperatively trains each model on the combined synthetic corpus. RSL leverages the fact that different parameterized models have different inductive biases, and better predictions can be made by jointly exploiting the agreement among each other. Unlike the previous knowledge distillation methods built upon a much stronger teacher, RSL is capable of boosting the accuracy of one model by introducing other comparable or even weaker models. RSL can also be viewed as a more efficient alternative to ensemble. Extensive experiments demonstrate the superior performance of RSL on several benchmarks with significant margins.

cs.CL↗

Language Generation via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approach

Generating natural language under complex constraints is a principled formulation towards controllable text generation. We present a framework to allow specification of combinatorial constraints for sentence generation. We propose TSMH, an efficient method to generate high likelihood sentences with respect to a pre-trained language model while satisfying the constraints. Our approach is highly flexible, requires no task-specific training, and leverages efficient constraint satisfaction solving techniques. To better handle the combinatorial constraints, a tree search algorithm is embedded into the proposal process of the Markov chain Monte Carlo (MCMC) to explore candidates that satisfy more constraints. Compared to existing MCMC approaches, our sampling approach has a better mixing performance. Experiments show that TSMH achieves consistent and significant improvement on multiple language generation tasks.

cs.CL↗

On the mean field limit of the Random Batch Method for interacting particle systems

The Random Batch Method proposed in our previous work [Jin et al., J. Comput. Phys., 400(1), 2020] is not only a numerical method for interacting particle systems and its mean-field limit, but also can be viewed as a model of particle system in which particles interact, at discrete time, with randomly selected mini-batch of particles. In this paper we investigate the mean-field limit of this model as the number of particles $N \to \infty$. Unlike the classical mean field limit for interacting particle systems where the law of large numbers plays the role and the chaos is propagated to later times, the mean field limit now does not rely on the law of large numbers and chaos is imposed at every discrete time. Despite this, we will not only justify this mean-field limit (discrete in time) but will also show that the limit, as the discrete time interval $τ\to 0$, approaches to the solution of a nonlinear Fokker-Planck equation arising as the mean-field limit of the original interacting particle system in Wasserstein distance.

math.PR↗

DmifNet:3D Shape Reconstruction Based on Dynamic Multi-Branch Information Fusion

3D object reconstruction from a single-view image is a long-standing challenging problem. Previous work was difficult to accurately reconstruct 3D shapes with a complex topology which has rich details at the edges and corners. Moreover, previous works used synthetic data to train their network, but domain adaptation problems occurred when tested on real data. In this paper, we propose a Dynamic Multi-branch Information Fusion Network (DmifNet) which can recover a high-fidelity 3D shape of arbitrary topology from a 2D image. Specifically, we design several side branches from the intermediate layers to make the network produce more diverse representations to improve the generalization ability of network. In addition, we utilize DoG (Difference of Gaussians) to extract edge geometry and corners information from input images. Then, we use a separate side branch network to process the extracted data to better capture edge geometry and corners feature information. Finally, we dynamically fuse the information of all branches to gain final predicted probability. Extensive qualitative and quantitative experiments on a large-scale publicly available dataset demonstrate the validity and efficiency of our method. Code and models are publicly available at https://github.com/leilimaster/DmifNet.

cs.CV↗