Searcharxiv⌕ Search

arXiv subjects

Tao Li

Publications and source records attributed to Tao Li.

At least 397 records · Page 22Linked to original sources

Learning Causal Semantic Representation for Out-of-Distribution Prediction

Conventional supervised learning methods, especially deep ones, are found to be sensitive to out-of-distribution (OOD) examples, largely because the learned representation mixes the semantic factor with the variation factor due to their domain-specific correlation, while only the semantic factor causes the output. To address the problem, we propose a Causal Semantic Generative model (CSG) based on a causal reasoning so that the two factors are modeled separately, and develop methods for OOD prediction from a single training domain, which is common and challenging. The methods are based on the causal invariance principle, with a novel design in variational Bayes for both efficient learning and easy prediction. Theoretically, we prove that under certain conditions, CSG can identify the semantic factor by fitting training data, and this semantic-identification guarantees the boundedness of OOD generalization error and the success of adaptation. Empirical study shows improved OOD performance over prevailing baselines.

stat.ML↗

PSSPR: A Source Location Privacy Protection Scheme Based on Sector Phantom Routing in WSNs

Source location privacy (SLP) protection is an emerging research topic in wireless sensor networks (WSNs). Because the source location represents the valuable information of the target being monitored and tracked, it is of great practical significance to achieve a high degree of privacy of the source location. Although many studies based on phantom nodes have alleviates the protection of source location privacy to some extent. It is urgent to solve the problems such as complicate the ac path between nodes, improve the centralized distribution of Phantom nodes near the source nodes and reduce the network communication overhead. In this paper, PSSPR routing is proposed as a visable approach to address SLP issues. We use the coordinates of the center node V to divide sector-domain, which act as important role in generating a new phantom nodes. The phantom nodes perform specified routing policies to ensure that they can choose various locations. In addition, the directed random route can ensure that data packets avoid the visible range when they move to the sink node hop by hop. Thus, the source location is protected. Theoretical analysis and simulation experiments show that this protocol achieves higher security of source node location with less communication overhead.

cs.NI↗

OSCaR: Orthogonal Subspace Correction and Rectification of Biases in Word Embeddings

Language representations are known to carry stereotypical biases and, as a result, lead to biased predictions in downstream tasks. While existing methods are effective at mitigating biases by linear projection, such methods are too aggressive: they not only remove bias, but also erase valuable information from word embeddings. We develop new measures for evaluating specific information retention that demonstrate the tradeoff between bias removal and information retention. To address this challenge, we propose OSCaR (Orthogonal Subspace Correction and Rectification), a bias-mitigating method that focuses on disentangling biased associations between concepts instead of removing concepts wholesale. Our experiments on gender biases show that OSCaR is a well-balanced approach that ensures that semantic information is retained in the embeddings and bias is also effectively mitigated.

cs.CL↗

Low Dimensional Landscape Hypothesis is True: DNNs can be Trained in Tiny Subspaces

Deep neural networks (DNNs) usually contain massive parameters, but there is redundancy such that it is guessed that the DNNs could be trained in low-dimensional subspaces. In this paper, we propose a Dynamic Linear Dimensionality Reduction (DLDR) based on low-dimensional properties of the training trajectory. The reduction is efficient, which is supported by comprehensive experiments: optimization in 40 dimensional spaces can achieve comparable performance as regular training over thousands or even millions of parameters. Since there are only a few optimization variables, we develop a quasi-Newton-based algorithm and also obtain robustness against label noises, which are two follow-up experiments to show the advantages of finding low-dimensional subspaces.

cs.LG↗

Complex High Internal-Phase Emulsions that can Form Interfacial Films with Tuneable Morphologies

High internal phase emulsions (HIPEs) are considered as an important functional material and have been the focus of intense development effort, but it has not been possible to alter their fundamental attributes at either the microcosmic or macroscopic level, which severely limits their practical applications in various areas. In this work, we report a general strategy for creating complex HIPEs and we additionally show a route to forming HIPE films at liquid interfaces. Double HIPEs and Janus HIPEs are both realized for the first time. They feature complex microscopic patterns with a short-range anisotropy, and exhibit non-Newtonian pseudoplastic flow behavior. By taking advantage of their response to a high-pH subphase, interfacial films can be successfully obtained, which are tunable in thickness and morphologies under compression.

cond-mat.soft↗

Enriching Source Style Transfer in Recognition-Synthesis based Non-Parallel Voice Conversion

Current voice conversion (VC) methods can successfully convert timbre of the audio. As modeling source audio's prosody effectively is a challenging task, there are still limitations of transferring source style to the converted speech. This study proposes a source style transfer method based on recognition-synthesis framework. Previously in speech generation task, prosody can be modeled explicitly with prosodic features or implicitly with a latent prosody extractor. In this paper, taking advantages of both, we model the prosody in a hybrid manner, which effectively combines explicit and implicit methods in a proposed prosody module. Specifically, prosodic features are used to explicit model prosody, while VAE and reference encoder are used to implicitly model prosody, which take Mel spectrum and bottleneck feature as input respectively. Furthermore, adversarial training is introduced to remove speaker-related information from the VAE outputs, avoiding leaking source speaker information while transferring style. Finally, we use a modified self-attention based encoder to extract sentential context from bottleneck features, which also implicitly aggregates the prosodic aspects of source speech from the layered representations. Experiments show that our approach is superior to the baseline and a competitive system in terms of style transfer; meanwhile, the speech quality and speaker similarity are well maintained.

eess.AS↗

AN-GCN: An Anonymous Graph Convolutional Network Defense Against Edge-Perturbing Attack

Recent studies have revealed the vulnerability of graph convolutional networks (GCNs) to edge-perturbing attacks, such as maliciously inserting or deleting graph edges. However, a theoretical proof of such vulnerability remains a big challenge, and effective defense schemes are still open issues. In this paper, we first generalize the formulation of edge-perturbing attacks and strictly prove the vulnerability of GCNs to such attacks in node classification tasks. Following this, an anonymous graph convolutional network, named AN-GCN, is proposed to counter against edge-perturbing attacks. Specifically, we present a node localization theorem to demonstrate how the GCN locates nodes during its training phase. In addition, we design a staggered Gaussian noise based node position generator, and devise a spectral graph convolution based discriminator in detecting the generated node positions. Further, we give the optimization of the above generator and discriminator. AN-GCN can classify nodes without taking their position as input. It is demonstrated that the AN-GCN is secure against edge-perturbing attacks in node classification tasks, as AN-GCN classifies nodes without the edge information and thus makes it impossible for attackers to perturb edges anymore. Extensive evaluations demonstrated the effectiveness of the general edge-perturbing attack model in manipulating the classification results of the target nodes. More importantly, the proposed AN-GCN can achieve 82.7% in node classification accuracy without the edge-reading permission, which outperforms the state-of-the-art GCN.

cs.LG↗

Hybrid Visual Servoing Tracking Control of Uncalibrated Robotic Systems for Dynamic Dwarf Culture Orchards Harvest

The paper is concerned with the dynamic tracking problem of SNAP orchards harvesting robots in the presence of multiple uncalibrated model parameters in the application of dwarf culture orchards harvest. A new hybrid visual servoing adaptive tracking controller and three adaptive laws are proposed to guarantee harvesting robots to finish the dynamic harvesting task and the adaption to unknown parameters including camera intrinsic and extrinsic model and robot dynamics. By the Lyapunov theory, asymptotic convergence of the closed-loop system with the proposed control scheme is rigorously proven. Experimental and simulation results have been conducted to verify the performance of the proposed control scheme. The results demonstrate its effectiveness and superiority.

cs.RO↗

Individual Heterogeneity Learning in Distributional Data Response Additive Models

In many complex applications, data heterogeneity and homogeneity exist simultaneously. Ignoring either one will result in incorrect statistical inference. In addition, coping with complex data that are non-Euclidean becomes more common. To address these issues we consider a distributional data response additive model in which the response is a distributional density function and the individual effect curves are homogeneous within a group but heterogeneous across groups, the covariates capturing the variation share common additive bivariate functions. A transformation approach is first utilized to map density functions into a linear space. We then apply the B-spline series approximating method to estimate the unknown subject-specific and additive bivariate functions, and identify the latent group structures by hierarchical agglomerative clustering (HAC) algorithm. Our method is demonstrated to identify the true latent group structures with probability approaching one. To improve the efficiency, we further construct the backfitted local linear estimators for grouped structures and additive bivariate functions in post-grouping model. We establish the asymptotic properties of the resultant estimators including the convergence rates, asymptotic distributions and the post-grouping oracle efficiency. The performance of the proposed method is illustrated by simulation studies and empirical analysis with some interesting results.

stat.ME↗

T-SVD Based Non-convex Tensor Completion and Robust Principal Component Analysis

Tensor completion and robust principal component analysis have been widely used in machine learning while the key problem relies on the minimization of a tensor rank that is very challenging. A common way to tackle this difficulty is to approximate the tensor rank with the $\ell_1-$norm of singular values based on its Tensor Singular Value Decomposition (T-SVD). Besides, the sparsity of a tensor is also measured by its $\ell_1-$norm. However, the $\ell_1$ penalty is essentially biased and thus the result will deviate. In order to sidestep the bias, we propose a novel non-convex tensor rank surrogate function and a novel non-convex sparsity measure. In this new setting by using the concavity instead of the convexity, a majorization minimization algorithm is further designed for tensor completion and robust principal component analysis. Furthermore, we analyze its theoretical properties. Finally, the experiments on natural and hyperspectral images demonstrate the efficacy and efficiency of our proposed method.

cs.LG↗

Signal identification with Kalman Filter towards background-free neutrinoless double beta decay searches in gaseous detectors

Particle tracks and differential energy loss measured in high pressure gaseous detectors can be exploited for event identification in neutrinoless double beta decay~($0νββ$) searches. We develop a new method based on Kalman Filter in a Bayesian formalism (KFB) to reconstruct meandering tracks of MeV-scale electrons. With simulation data, we compare the signal and background discrimination power of the KFB method assuming different detector granularities and energy resolutions. Typical background from $^{232}$Th and $^{238}$U decay chains can be suppressed by another order of magnitude than that in published literatures, approaching the background-free regime. For the proposed PandaX-III experiment, the $0νββ$ search half-life sensitivity at the 90\% confidence level would reach $2.7 \times 10^{26}$~yr with 5-year live time, a factor of 2.7 improvement over the initial design target.

physics.ins-det↗

Modern Subsampling Methods for Large-Scale Least Squares Regression

Subsampling methods aim to select a subsample as a surrogate for the observed sample. As a powerful technique for large-scale data analysis, various subsampling methods are developed for more effective coefficient estimation and model prediction. This review presents some cutting-edge subsampling methods based on the large-scale least squares estimation. Two major families of subsampling methods are introduced, respectively, the randomized subsampling approach and the optimal subsampling approach. The former aims to develop a more effective data-dependent sampling probability, while the latter aims to select a deterministic subsample in accordance with certain optimality criteria. Real data examples are provided to compare these methods empirically, respecting both the estimation accuracy and the computing time.

stat.ME↗

Towards On-Demand Heralded Single-Photon Sources via Photon Blockade

Spontaneous parametric down-conversion (SPDC) in a laser pumped optical nonlinear medium can produce heralded single photons with a high purity but a very low yield. Improving the yield by increasing the pump power in SPDC inevitably reduces the purity due to excitation of multi-photon events. We propose a scheme to overcome this purity-yield trade-off by suppressing multi-photon events in a cavity-enhanced SPDC via the photon blockade effect. By introducing a strong photon-photon interaction into the intracavity medium and increasing the pump power, we can improve the available single-photon yield to larger than $90\%$, while maintaining a high purity of $99\%$, towards on-demand generation of single photons through the SPDC process. Our quasi-on-demand SPDC sources may boost single-photon-based quantum information technology.

quant-ph↗

Differentially Private Imaging via Latent Space Manipulation

There is growing concern about image privacy due to the popularity of social media and photo devices, along with increasing use of face recognition systems. However, established image de-identification techniques are either too subject to re-identification, produce photos that are insufficiently realistic, or both. To tackle this, we present a novel approach for image obfuscation by manipulating latent spaces of an unconditionally trained generative model that is able to synthesize photo-realistic facial images of high resolution. This manipulation is done in a way that satisfies the formal privacy standard of local differential privacy. To our knowledge, this is the first approach to image privacy that satisfies $\varepsilon$-differential privacy \emph{for the person.}

cs.CV↗

Why the Schwinger Boson mean field theory fails to describe the spin dynamics of the triangular lattice antiferromagnetic Heisenberg model?

We find that the Schwinger Boson mean field theory(SBMFT) supplemented with Gutzwiller projection provides an exceedingly accurate description for the ground state of the spin-$\frac{1}{2}$ triangular lattice antiferromagnetic Heisenberg model(spin-$\frac{1}{2}$ TLHAF). However, we find the SBMFT fails even qualitatively in the description of the dynamical behavior of the system. In particular, the SBMFT fails to predict the Goldstone mode in the magnetic ordered phase. We show that the coherent peak in the two-spinon continuum in the presence of spinon condensate should not be interpreted as a magnon mode. The SBMFT also predicts incorrectly a gapless longitudinal spin fluctuation mode in the magnetic ordered phase. We show that these failures are related to the following facts: (1)Spinon condensation fails to provide a consistent description of the order parameter manifold of the 120 degree ordered phase. (2)There lacks in the SBMFT the coupling between the uncondensed spinon and the spinon condensate, which breaks both the spin rotational and the translational symmetry. (3)There lacks in the SBMFT the rigidity that is related to the no double occupancy constraint on the spinon system. We show that such failures of the SBMFT is neither restricted to the spin-$\frac{1}{2}$ TLHAF nor to the magnetic ordered phase. We proposed a generalized SBMFT to resolve the first two issues and a new formalism to address the third issue.

cond-mat.str-el↗

On the origin of the possible chiral spin liquid state of the triangular lattice Hubbard model

Recent numerical simulations find a possible chiral spin liquid state in the intermediate coupling regime of the triangular lattice Hubbard model. Here we provide a simple picture for its origin in terms of a Bosonic RVB description. More specifically, we show that such a chiral spin liquid state can be understood as a quantum disordered tetrahedral spin state stabilized by the four spin ring exchange coupling, which suppresses the order-by-disorder effect toward a stripy spin state. Such a chiral spin liquid state features a spin Berry phase of $\fracπ{2}$ per triangle. However, we show that the topological property of such a state is totally missed in the Schwinger Boson mean field description as a result of the lack of Boson rigidity caused by the no double occupancy constraint.

cond-mat.str-el↗

DeepBlur: A Simple and Effective Method for Natural Image Obfuscation

There is a growing privacy concern due to the popularity of social media and surveillance systems, along with advances in face recognition software. However, established image obfuscation techniques are either vulnerable to re-identification attacks by human or deep learning models, insufficient in preserving image fidelity, or too computationally intensive to be practical. To tackle these issues, we present DeepBlur, a simple yet effective method for image obfuscation by blurring in the latent space of an unconditionally pre-trained generative model that is able to synthesize photo-realistic facial images. We compare it with existing methods by efficiency and image quality, and evaluate against both state-of-the-art deep learning models and industrial products (e.g., Face++, Microsoft face service). Experiments show that our method produces high quality outputs and is the strongest defense for most test cases.

cs.CV↗

Cooperative Extended State Observer Based Control of Vehicle Platoons With Arbitrarily Small Time Headway

We study platoon control of vehicles with linear third-order longitudinal dynamics under the constant time headway policy. The controller of each follower vehicle is only based on its own velocity, acceleration, inter-vehicle distance and velocity difference with respect to its immediate predecessor, which are all obtained by on-board sensors. We develop distributed cooperative extended state observers for followers to estimate the acceleration differences between adjacent vehicles. Based on estimates of the acceleration differences, distributed cooperative control laws are designed. By using the stability theory of perturbed linear systems, we show that the control parameters can be properly designed to ensure the closed-loop and L2 string stabilities for any given positive time headway. We further show that the proposed control law based on the ideal vehicle model can guarantee the closed-loop and L2 string stabilities even if there are small model parameter uncertainties. Also, simulation results demonstrate the robustness of the proposed control law against sensing noises, input delays and parameter uncertainties.

eess.SY↗