arXiv subjects

Jie Lu

Publications and source records attributed to Jie Lu.

At least 145 records · Page 8Linked to original sources

arXiv2021

Chiral domain wall dynamics in magnetic heterostructures with bulk Dzyaloshinskii-Moriya interactions

In this work, dynamics of chiral domain walls in long and narrow magnetic heterostructures based on non-centrosymmetric chiral magnets with bulk Dzyaloshinskii-Moriya interactions (DMI) and perpendicular magnetic anisotropy is systematically investigated. The driving forces can be out-of-plane magnetic fields and in-plane currents, correspondingly both steady and precessional flows are considered. Their dividing points (the Walker critical field and current density) are obtained as functions of bulk DMI strength ($D_{\mathrm{b}}$) and the ratio ($κ$) of total (crystalline plus shape) anisotropy in the hard axis over that in the easy one. When far beyond Walker breakdown, the dependence curve of wall velocity on external in-plane bias field takes parabolic shape around the compensation point where the total in-plane field disappears. The center shift is determined by $D_{\mathrm{b}}$, $κ$, and the wall's topological charge, thus can be used to measure the bulk DMI strength in chiral magnets.

cond-mat.mes-hall↗

arXiv2021

Learning Bounds for Open-Set Learning

Traditional supervised learning aims to train a classifier in the closed-set world, where training and test samples share the same label space. In this paper, we target a more challenging and realistic setting: open-set learning (OSL), where there exist test samples from the classes that are unseen during training. Although researchers have designed many methods from the algorithmic perspectives, there are few methods that provide generalization guarantees on their ability to achieve consistent performance on different training samples drawn from the same distribution. Motivated by the transfer learning and probably approximate correct (PAC) theory, we make a bold attempt to study OSL by proving its generalization error-given training samples with size n, the estimation error will get close to order O_p(1/\sqrt{n}). This is the first study to provide a generalization bound for OSL, which we do by theoretically investigating the risk of the target classifier on unknown classes. According to our theory, a novel algorithm, called auxiliary open-set risk (AOSR) is proposed to address the OSL problem. Experiments verify the efficacy of AOSR. The code is available at github.com/Anjin-Liu/Openset_Learning_AOSR.

cs.LG↗

arXiv2021

Anisotropic magnon-magnon coupling in synthetic antiferromagnets

The magnon-magnon coupling in synthetic antiferromagnets advances it as hybrid magnonic systems to explore the quantum information technologies. To induce the magnon-magnon coupling, the parity symmetry between two magnetization needs to be broken. Here we experimentally demonstrate a convenient method to break the parity symmetry by the asymmetric thickness of two magnetic layers and thus introduce a magnon-magnon coupling in Ir-based synthetic antiferromagnets CoFeB(10 nm)/Ir(tIr=0.6 nm, 1.2 nm)/CoFeB(13 nm). Remarkably, we find that the weakly uniaxial anisotropy field (~ 20 Oe) makes the magnon-magnon coupling anisotropic. The coupling strength presented by a characteristic anticrossing gap varies in the range between 0.54 GHz and 0.90 GHz for tIr =0.6 nm, and between nearly zero to 1.4 GHz for tIr = 1.2 nm, respectively. Our results demonstrate a feasible way to induce the magnon-magnon coupling by an asymmetric structure and tune the coupling strength by varying the direction of in-plane magnetic field. The magnon-magnon coupling in this highly tunable material system could open exciting perspectives for exploring quantum-mechanical coupling phenomena.

cond-mat.mtrl-sci↗

arXiv2021

Automatic Learning to Detect Concept Drift

Many methods have been proposed to detect concept drift, i.e., the change in the distribution of streaming data, due to concept drift causes a decrease in the prediction accuracy of algorithms. However, the most of current detection methods are based on the assessment of the degree of change in the data distribution, cannot identify the type of concept drift. In this paper, we propose Active Drift Detection with Meta learning (Meta-ADD), a novel framework that learns to classify concept drift by tracking the changed pattern of error rates. Specifically, in the training phase, we extract meta-features based on the error rates of various concept drift, after which a meta-detector is developed via a prototypical neural network by representing various concept drift classes as corresponding prototypes. In the detection phase, the learned meta-detector is fine-tuned to adapt to the corresponding data stream via stream-based active learning. Hence, Meta-ADD uses machine learning to learn to detect concept drifts and identify their types automatically, which can directly support drift understand. The experiment results verify the effectiveness of Meta-ADD.

cs.AI↗

arXiv2021

Decentralized Statistical Inference with Unrolled Graph Neural Networks

In this paper, we investigate the decentralized statistical inference problem, where a network of agents cooperatively recover a (structured) vector from private noisy samples without centralized coordination. Existing optimization-based algorithms suffer from issues of model mismatch and poor convergence speed, and thus their performance would be degraded, provided that the number of communication rounds is limited. This motivates us to propose a learning-based framework, which unrolls well-noted decentralized optimization algorithms (e.g., Prox-DGD and PG-EXTRA) into graph neural networks (GNNs). By minimizing the recovery error via end-to-end training, this learning-based framework resolves the model mismatch issue. Our convergence analysis (with PG-EXTRA as the base algorithm) reveals that the learned model parameters may accelerate the convergence and reduce the recovery error to a large extent. The simulation results demonstrate that the proposed GNN-based learning methods prominently outperform several state-of-the-art optimization-based algorithms in convergence speed and recovery error.

cs.LG↗

arXiv2021

Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation

In unsupervised domain adaptation (UDA), classifiers for the target domain are trained with massive true-label data from the source domain and unlabeled data from the target domain. However, it may be difficult to collect fully-true-label data in a source domain given a limited budget. To mitigate this problem, we consider a novel problem setting where the classifier for the target domain has to be trained with complementary-label data from the source domain and unlabeled data from the target domain named budget-friendly UDA (BFUDA). The key benefit is that it is much less costly to collect complementary-label source data (required by BFUDA) than collecting the true-label source data (required by ordinary UDA). To this end, the complementary label adversarial network (CLARINET) is proposed to solve the BFUDA problem. CLARINET maintains two deep networks simultaneously, where one focuses on classifying complementary-label source data and the other takes care of the source-to-target distributional adaptation. Experiments show that CLARINET significantly outperforms a series of competent baselines.

cs.LG↗

arXiv2021

Distributed Optimization with Coupling Constraints

In this paper, we develop a novel distributed algorithm for addressing convex optimization with both nonlinear inequality and linear equality constraints, where the objective function can be a general nonsmooth convex function and all the constraints can be fully coupled. Specifically, we first separate the constraints into three groups, and design two primal-dual methods and utilize a virtual-queue-based method to handle each group of the constraints independently. Then, we integrate these three methods in a strategic way, leading to an integrated primal-dual proximal (IPLUX) algorithm, and enable the distributed implementation of IPLUX. We show that IPLUX achieves an $O(1/k)$ rate of convergence in terms of optimality and feasibility, which is stronger than the convergence results of the state-of-the-art distributed algorithms for convex optimization with coupling nonlinear constraints. Finally, IPLUX exhibits competitive practical performance in the simulations.

math.OC↗

arXiv2021

Butterfly: One-step Approach towards Wildly Unsupervised Domain Adaptation

In unsupervised domain adaptation (UDA), classifiers for the target domain (TD) are trained with clean labeled data from the source domain (SD) and unlabeled data from TD. However, in the wild, it is difficult to acquire a large amount of perfectly clean labeled data in SD given limited budget. Hence, we consider a new, more realistic and more challenging problem setting, where classifiers have to be trained with noisy labeled data from SD and unlabeled data from TD -- we name it wildly UDA (WUDA). We show that WUDA ruins all UDA methods if taking no care of label noise in SD, and to this end, we propose a Butterfly framework, a powerful and efficient solution to WUDA. Butterfly maintains four deep networks simultaneously, where two take care of all adaptations (i.e., noisy-to-clean, labeled-to-unlabeled, and SD-to-TD-distributional) and then the other two can focus on classification in TD. As a consequence, Butterfly possesses all the conceptually necessary components for solving WUDA. Experiments demonstrate that, under WUDA, Butterfly significantly outperforms existing baseline methods.

cs.LG↗

arXiv2021

PAC-Bayes Bounds for Meta-learning with Data-Dependent Prior

By leveraging experience from previous tasks, meta-learning algorithms can achieve effective fast adaptation ability when encountering new tasks. However it is unclear how the generalization property applies to new tasks. Probably approximately correct (PAC) Bayes bound theory provides a theoretical framework to analyze the generalization performance for meta-learning. We derive three novel generalisation error bounds for meta-learning based on PAC-Bayes relative entropy bound. Furthermore, using the empirical risk minimization (ERM) method, a PAC-Bayes bound for meta-learning with data-dependent prior is developed. Experiments illustrate that the proposed three PAC-Bayes bounds for meta-learning guarantee a competitive generalization performance guarantee, and the extended PAC-Bayes bound with data-dependent prior can achieve rapid convergence ability.

cs.LG↗

arXiv2021

Multiplexed structured illumination super-resolution imaging with time-domain upconversion nanoparticles

The emerging optical multiplexing within nanoscale shows super-capacity in encoding information by using the time-domain fingerprints from uniform nanoparticles. However, the optical diffraction limit compromises the decoding throughput and accuracy of the nanoparticles during wide-field imaging. This, in turn, challenges the quality of nanoparticles to afford the modulated excitation condition, and further to retain the multiplexed optical fingerprints for super-resolution multiplexing. Here we report a tailor-made time-domain super-resolution method with the lifetime-engineered upconversion nanoparticles for multiplexing. We demonstrate that the nanoparticles are bright, uniform, and stable under structured illumination, which supports a lateral resolution of 186 nm, less than 1/4th of the excitation wavelength. We further develop a deep learning algorithm to coordinate with super-resolution images for more accurate decoding compared to a numeric algorithm. We demonstrate a three-channel sub-diffraction-limit imaging-based optical multiplexing with decoding accuracies above 93% for each channel, and larger than 60% accuracies for potential seven-channel multiplexing. The improved resolution provides high throughput by resolving the particles within the optical limit, which enables higher multiplexing capacity in space. This time-domain super-resolution multiplexing opens a new horizon for handling the growing amount of information content, diseases source, and security risk in modern society

physics.optics↗

arXiv2021

Stabilizing current-driven steady flows of 180$^{\circ}$ domain walls in spin valves by interfacial Dzyaloshinskii-Moriya interaction

Modulations of interfacial Dzyaloshinskii-Moriya interaction (iDMI) on current-driven dynamics of 180$^{\circ}$ domain walls (180DWs) in long and narrow spin valves (LNSVs) with heavy-metal caplayers are systematically investigated. We focus on LNSVs with in-plane magnetic anisotropy in their free layers. For planar-transverse polarizers (pinned layers of LNSVs), the Walker breakdown can be postponed considerably (practical infinity) by iDMI. More interestingly, the originally unstable traveling mode is also stabilized by iDMI with high saturation velocity thus serves as fast carrier of information. For parallel polarizers, the Walker limit is increased and the corresponding modifications of iDMI to wall velocity in both steady and precessional flows of 180DWs are provided. For perpendicular polarizers, precessional flow of 180DWs is absent due to the stability of stationary mode beyond the modified Walker limit. For LNSVs with perpendicular magnetic anisotropy in their free layers, similar results are obtained. Our findings open new possibilities for developing magnetic nanodevices based on 180DW propagation with low energy consumption and high robustness.

cond-mat.mes-hall↗

arXiv2021

Learning Deep Kernels for Non-Parametric Two-Sample Tests

We propose a class of kernel-based two-sample tests, which aim to determine whether two sets of samples are drawn from the same distribution. Our tests are constructed from kernels parameterized by deep neural nets, trained to maximize test power. These tests adapt to variations in distribution smoothness and shape over space, and are especially suited to high dimensions and complex data. By contrast, the simpler kernels used in prior kernel testing work are spatially homogeneous, and adaptive only in lengthscale. We explain how this scheme includes popular classifier-based two-sample tests as a special case, but improves on them in general. We provide the first proof of consistency for the proposed adaptation method, which applies both to kernels on deep features and to simpler radial basis kernels or multiple kernel learning. In experiments, we establish the superior performance of our deep kernels in hypothesis testing on benchmark and real-world data. The code of our deep-kernel-based two sample tests is available at https://github.com/fengliu90/DK-for-TST.

stat.ML↗

arXiv2020

How does the Combined Risk Affect the Performance of Unsupervised Domain Adaptation Approaches?

Unsupervised domain adaptation (UDA) aims to train a target classifier with labeled samples from the source domain and unlabeled samples from the target domain. Classical UDA learning bounds show that target risk is upper bounded by three terms: source risk, distribution discrepancy, and combined risk. Based on the assumption that the combined risk is a small fixed value, methods based on this bound train a target classifier by only minimizing estimators of the source risk and the distribution discrepancy. However, the combined risk may increase when minimizing both estimators, which makes the target risk uncontrollable. Hence the target classifier cannot achieve ideal performance if we fail to control the combined risk. To control the combined risk, the key challenge takes root in the unavailability of the labeled samples in the target domain. To address this key challenge, we propose a method named E-MixNet. E-MixNet employs enhanced mixup, a generic vicinal distribution, on the labeled source samples and pseudo-labeled target samples to calculate a proxy of the combined risk. Experiments show that the proxy can effectively curb the increase of the combined risk when minimizing the source risk and distribution discrepancy. Furthermore, we show that if the proxy of the combined risk is added into loss functions of four representative UDA methods, their performance is also improved.

cs.LG↗

arXiv2020

Decentralized Approximate Newton Methods for Convex Optimization on Networked Systems

In this paper, a class of Decentralized Approximate Newton (DEAN) methods for addressing convex optimization on a networked system are developed, where nodes in the networked system seek for a consensus that minimizes the sum of their individual objective functions through local interactions only. The proposed DEAN algorithms allow each node to repeatedly perform a local approximate Newton update, which leverages tracking the global Newton direction and dissipating the discrepancies among the nodes. Under less restrictive problem assumptions in comparison with most existing second-order methods, the DEAN algorithms enable the nodes to reach a consensus that can be arbitrarily close to the optimum. Moreover, for a particular DEAN algorithm, the nodes linearly converge to a common suboptimal solution with an explicit error bound. Finally, simulations demonstrate the competitive performance of DEAN in convergence speed, accuracy, and efficiency.

math.OC↗

arXiv2020

Wide-field Decodable Orthogonal Fingerprints of Single Nanoparticles Unlock Multiplexed Digital Assays

The control in optical uniformity of single nanoparticles and tuning their diversity in orthogonal dimensions, dot to dot, holds the key to unlock nanoscience and applications. Here we report that the time-domain emissive profile from single upconversion nanoparticle, including the rising, decay and peak moment of the excited state population (T2 profile), can be arbitrarily tuned by upconversion schemes, including interfacial energy migration, concentration dependency, energy transfer, and isolation of surface quenchers. This allows us to significantly increase the coding capacity at the nanoscale. We further implement both time-resolved wide-field imaging and deep-learning techniques to decode these fingerprints, showing high accuracies at high throughput. These high-dimensional optical fingerprints provide a new horizon for applications spanning from sub-diffraction-limit data storage, security inks, to high-throughput single-molecule digital assays and super-resolution imaging.

physics.app-ph↗

arXiv2020

Symmetry breaking induced magnon-magnon coupling in synthetic antiferromagnets

We propose a general theory of microwave absorption spectroscopy for symmetry-breaking synthetic antiferromagnets (SAFs). Generally, inhomogeneity or different thickness of the two ferromagnetic sublayers of a SAF results in the intrinsic symmetry breaking, while out-of-plane components of dc magnetic fields lead to the extrinsic one. The broken symmetry of SAFs excludes the original symmetry-protected crossing between pure in-phase and out-of-phase resonance modes with opposite parity. Alternatively, new frequency branches become hybridization of original bare modes in terms of symmetry-breaking-induced magnon-magnon coupling, which results in an indirect gap in ferromagnetic resonance frequencies. Also, the dependence of gap width on the degree of symmetry breaking for several typical cases are presented and compared with existing experiments. Our theory provides a simple but physical understanding on the rich structure of ferromagnetic resonance spectra for asymmetric SAFs.

cond-mat.mes-hall↗

arXiv2020

Open Set Domain Adaptation: Theoretical Bound and Algorithm

The aim of unsupervised domain adaptation is to leverage the knowledge in a labeled (source) domain to improve a model's learning performance with an unlabeled (target) domain -- the basic strategy being to mitigate the effects of discrepancies between the two distributions. Most existing algorithms can only handle unsupervised closed set domain adaptation (UCSDA), i.e., where the source and target domains are assumed to share the same label set. In this paper, we target a more challenging but realistic setting: unsupervised open set domain adaptation (UOSDA), where the target domain has unknown classes that are not found in the source domain. This is the first study to provide a learning bound for open set domain adaptation, which we do by theoretically investigating the risk of the target classifier on unknown classes. The proposed learning bound has a special term, namely open set difference, which reflects the risk of the target classifier on unknown classes. Further, we present a novel and theoretically guided unsupervised algorithm for open set domain adaptation, called distribution alignment with ppen difference (DAOD), which is based on regularizing this open set difference bound. The experiments on several benchmark datasets show the superior performance of the proposed UOSDA method compared with the state-of-the-art methods in the literature.

cs.LG↗

arXiv2020

Interactive Steering of Hierarchical Clustering

Hierarchical clustering is an important technique to organize big data for exploratory data analysis. However, existing one-size-fits-all hierarchical clustering methods often fail to meet the diverse needs of different users. To address this challenge, we present an interactive steering method to visually supervise constrained hierarchical clustering by utilizing both public knowledge (e.g., Wikipedia) and private knowledge from users. The novelty of our approach includes 1) automatically constructing constraints for hierarchical clustering using knowledge (knowledge-driven) and intrinsic data distribution (data-driven), and 2) enabling the interactive steering of clustering through a visual interface (user-driven). Our method first maps each data item to the most relevant items in a knowledge base. An initial constraint tree is then extracted using the ant colony optimization algorithm. The algorithm balances the tree width and depth and covers the data items with high confidence. Given the constraint tree, the data items are hierarchically clustered using evolutionary Bayesian rose tree. To clearly convey the hierarchical clustering results, an uncertainty-aware tree visualization has been developed to enable users to quickly locate the most uncertain sub-hierarchies and interactively improve them. The quantitative evaluation and case study demonstrate that the proposed approach facilitates the building of customized clustering trees in an efficient and effective manner.

cs.LG↗