Searcharxiv⌕ Search

arXiv subjects

Qian Li

Publications and source records attributed to Qian Li.

At least 253 records · Page 14Linked to original sources
arXiv2021

Improving Generalizability in Limited-Angle CT Reconstruction with Sinogram Extrapolation

Computed tomography (CT) reconstruction from X-ray projections acquired within a limited angle range is challenging, especially when the angle range is extremely small. Both analytical and iterative models need more projections for effective modeling. Deep learning methods have gained prevalence due to their excellent reconstruction performances, but such success is mainly limited within the same dataset and does not generalize across datasets with different distributions. Hereby we propose ExtraPolationNetwork for limited-angle CT reconstruction via the introduction of a sinogram extrapolation module, which is theoretically justified. The module complements extra sinogram information and boots model generalizability. Extensive experimental results show that our reconstruction model achieves state-of-the-art performance on NIH-AAPM dataset, similar to existing approaches. More importantly, we show that using such a sinogram extrapolation module significantly improves the generalization capability of the model on unseen datasets (e.g., COVID-19 and LIDC datasets) when compared to existing approaches.

eess.IV↗
arXiv2021

Authentication of optical physical unclonable functions based on single-pixel detection

Physical unclonable function (PUF) has been proposed as a promising and trustworthy solution to a variety of cryptographic applications. Here we propose a non-imaging based authentication scheme for optical PUFs materialized by random scattering media, in which the characteristic fingerprints of optical PUFs are extracted from stochastical fluctuations of the scattered light intensity with respect to laser challenges which are detected by a single-pixel detector. The randomness, uniqueness, unpredictability, and robustness of the extracted fingerprints are validated to be qualified for real authentication applications. By increasing the key length and improving the signal to noise ratio, the false accept rate of a fake PUF can be dramatically lowered to the order of 10^-28. In comparison to the conventional laser-speckle-imaging based authentication with unique identity information obtained from textures of laser speckle patterns, this non-imaging scheme can be implemented at small speckle size bellowing the Nyquist--Shannon sampling criterion of the commonly used CCD or CMOS cameras, offering benefits in system miniaturization and immunity against reverse engineering attacks simultaneously.

cs.CR↗
arXiv2021

Moser-Tardos Algorithm: Beyond Shearer's Bound

In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos developed a simple and powerful algorithm to find solutions to combinatorial problems in the variable Lov{á}sz Local Lemma (LLL) setting. Kolipaka and Szegedy (STOC'11) proved that the Moser-Tardos algorithm is efficient up to the tight condition of the abstract Lov{á}sz Local Lemma, known as Shearer's bound. A fundamental problem around LLL is whether the efficient region of the Moser-Tardos algorithm can be further extended. In this paper, we give a positive answer to this problem. We show that the efficient region of the Moser-Tardos algorithm goes beyond the Shearer's bound of the underlying dependency graph, if the graph is not chordal. Otherwise, the dependency graph is chordal, and it has been shown that Shearer's bound exactly characterizes the efficient region for such graphs (Kolipaka and Szegedy, STOC'11; He, Li, Liu, Wang and Xia, FOCS'17). Moreover, we demonstrate that the efficient region can exceed Shearer's bound by a constant by explicitly calculating the gaps on several infinite lattices. The core of our proof is a new criterion on the efficiency of the Moser-Tardos algorithm which takes the intersection between dependent events into consideration. Our criterion is strictly better than Shearer's bound whenever the intersection exists between dependent events. Meanwhile, if any two dependent events are mutually exclusive, our criterion becomes the Shearer's bound, which is known to be tight in this situation for the Moser-Tardos algorithm (Kolipaka and Szegedy, STOC'11; Guo, Jerrum and Liu, JACM'19).

cs.DS↗
arXiv2021

AFEC: Active Forgetting of Negative Transfer in Continual Learning

Continual learning aims to learn a sequence of tasks from dynamic data distributions. Without accessing to the old training samples, knowledge transfer from the old tasks to each new task is difficult to determine, which might be either positive or negative. If the old knowledge interferes with the learning of a new task, i.e., the forward knowledge transfer is negative, then precisely remembering the old tasks will further aggravate the interference, thus decreasing the performance of continual learning. By contrast, biological neural networks can actively forget the old knowledge that conflicts with the learning of a new experience, through regulating the learning-triggered synaptic expansion and synaptic convergence. Inspired by the biological active forgetting, we propose to actively forget the old knowledge that limits the learning of new tasks to benefit continual learning. Under the framework of Bayesian continual learning, we develop a novel approach named Active Forgetting with synaptic Expansion-Convergence (AFEC). Our method dynamically expands parameters to learn each new task and then selectively combines them, which is formally consistent with the underlying mechanism of biological active forgetting. We extensively evaluate AFEC on a variety of continual learning benchmarks, including CIFAR-10 regression tasks, visual classification tasks and Atari reinforcement tasks, where AFEC effectively improves the learning of new tasks and achieves the state-of-the-art performance in a plug-and-play way.

cs.LG↗
arXiv2021

Spatially-resolved electronic structure of stripe domains in IrTe$_2$ through electronic structure microscopy

Phase separation in the nanometer- to micrometer-scale is characteristic for correlated materials, for example, high temperature superconductors, colossal magnetoresistance manganites, Mott insulators, etc. Resolving the electronic structure with spatially-resolved information is critical for revealing the fundamental physics of such inhomogeneous systems yet this is challenging experimentally. Here by using nanometer- and micrometer-spot angle-resolved photoemission spectroscopies (NanoARPES and MicroARPES), we reveal the spatially-resolved electronic structure in the stripe phase of IrTe$_2$. Each separated domain shows two-fold symmetric electronic structure with the mirror axis aligned along 3 equivalent directions, and 6$\times$1 replicas are clearly identified. Moreover, such electronic structure inhomogeneity disappears across the stripe phase transition, suggesting that electronic phase with broken symmetry induced by the 6$\times$1 modulation is directly related to the stripe phase transition of IrTe$_2$. Our work demonstrates the capability of NanoARPES and MicroARPES in elucidating the fundamental physics of phase-separated materials.

cond-mat.mes-hall↗
arXiv2021

Experimental evidence of plasmarons and effective fine structure constant in electron-doped graphene/h-BN heterostructure

Electron-electron interaction is fundamental in condensed matter physics and can lead to composite quasiparticles called plasmarons, which strongly renormalize the dispersion and carry information of electron-electron coupling strength as defined by the effective fine structure constant $α_{ee}^*$. Although h-BN with unique dielectric properties has been widely used as an important substrate for graphene, so far there is no experimental report of plasmarons in graphene/h-BN yet. Here, we report direct experimental observation of plasmaron dispersion in graphene/h-BN heterostructures through angle-resolved photoemission spectroscopy (ARPES) measurements upon {\it in situ} electron doping. Characteristic diamond-shaped dispersion is observed near the Dirac cone in both 0$^\circ$ (aligned) and 13.5$^\circ$ (twisted) graphene/h-BN, and the electron-electron interaction strength $α_{ee}^*$ is extracted to be $α_{ee}^*\approx0.9\pm 0.1$, highlighting the important role of electron-electron interaction. Our results suggest graphene/h-BN as an ideal platform for investigating strong electron-electron interaction with weak dielectric screening, and lays fundamental physics for gate-tunable nano-electronics and nano-plasmonics.

cond-mat.mes-hall↗
arXiv2021

A Robust and Novel Linear Fiber Laser Mode-locked by Nonlinear Polarization Evolution in All-polarization-maintaining Fibers

We demonstrate a novel, robust and compact fiber laser mode-locked by nonlinear polarization evolution (NPE) in polarization-maintaining (PM) fibers. The reflectivity of the artificial saturable absorber (SA) is analyzed to explain the mode-locking mechanism in the laser cavity. Experimentally, three linear laser schemes that feature repetition rates 94 MHz, 124 MHz and 133 MHz are systematically investigated. When the pump power is 1100 mW, the 124-MHz laser cavity delivers highly stable pulses with a single-pulse energy of 0.92 nJ. After the compression, the pulse duration obtained from the 124-MHz fiber laser is 250 fs, while the corresponding transform-limited pulse duration is 124 fs. The highest fundamental repetition rate that could be achieved in our experiment is 133 MHz, as mentioned above. The noise characterization has been performed with different cavity lengths and therefore different net-cavity dispersion. The 68-fs timing jitter and the 0.01% relative intensity noise (RIN) of the 133-MHz fiber laser have been realized integrated from 1 kHz to 10 MHz. Furthermore, the root-mean-square (RMS) power fluctuation is 0.35% in 2 hours, which implies superior stability of the output power. Thus, this linear fiber oscillator provides a competitive low-noise light source for optical applications appropriate for complex environments.

physics.optics↗
arXiv2021

Causality Learning: A New Perspective for Interpretable Machine Learning

Recent years have witnessed the rapid growth of machine learning in a wide range of fields such as image recognition, text classification, credit scoring prediction, recommendation system, etc. In spite of their great performance in different sectors, researchers still concern about the mechanism under any machine learning (ML) techniques that are inherently black-box and becoming more complex to achieve higher accuracy. Therefore, interpreting machine learning model is currently a mainstream topic in the research community. However, the traditional interpretable machine learning focuses on the association instead of the causality. This paper provides an overview of causal analysis with the fundamental background and key concepts, and then summarizes most recent causal approaches for interpretable machine learning. The evaluation techniques for assessing method quality, and open problems in causal interpretability are also discussed in this paper.

cs.LG↗
arXiv2021

Bionic Optical Physical Unclonable Functions for Authentication and Encryption

Information security is of great importance for modern society with all things connected. Physical unclonable function (PUF) as a promising hardware primitive has been intensively studied for information security. However, the widely investigated silicon PUF with low entropy is vulnerable to various attacks. Herein, we introduce a concept of bionic optical PUFs inspired from unique biological architectures, and fabricate four types of bionic PUFs by molding the surface micro-nano structures of natural plant tissues with a simple, low-cost, green and environmentally friendly manufacturing process. The laser speckle responses of all bionic PUFs are statistically demonstrated to be random, unique, unpredictable and robust enough for cryptographic applications, indicating the broad applicability of bionic PUFs. On this ground, the feasibility of implementing bionic PUFs as cryptographic primitives in entity authentication and encrypted communication is experimentally validated, which shows its promising potential in the application of future information security.

cs.CR↗
arXiv2021

AdaAttN: Revisit Attention Mechanism in Arbitrary Neural Style Transfer

Fast arbitrary neural style transfer has attracted widespread attention from academic, industrial and art communities due to its flexibility in enabling various applications. Existing solutions either attentively fuse deep style feature into deep content feature without considering feature distributions, or adaptively normalize deep content feature according to the style such that their global statistics are matched. Although effective, leaving shallow feature unexplored and without locally considering feature statistics, they are prone to unnatural output with unpleasing local distortions. To alleviate this problem, in this paper, we propose a novel attention and normalization module, named Adaptive Attention Normalization (AdaAttN), to adaptively perform attentive normalization on per-point basis. Specifically, spatial attention score is learnt from both shallow and deep features of content and style images. Then per-point weighted statistics are calculated by regarding a style feature point as a distribution of attention-weighted output of all style feature points. Finally, the content feature is normalized so that they demonstrate the same local feature statistics as the calculated per-point weighted style feature statistics. Besides, a novel local feature loss is derived based on AdaAttN to enhance local visual quality. We also extend AdaAttN to be ready for video style transfer with slight modifications. Experiments demonstrate that our method achieves state-of-the-art arbitrary image/video style transfer. Codes and models are available.

cs.CV↗
arXiv2021

CasEE: A Joint Learning Framework with Cascade Decoding for Overlapping Event Extraction

Event extraction (EE) is a crucial information extraction task that aims to extract event information in texts. Most existing methods assume that events appear in sentences without overlaps, which are not applicable to the complicated overlapping event extraction. This work systematically studies the realistic event overlapping problem, where a word may serve as triggers with several types or arguments with different roles. To tackle the above problem, we propose a novel joint learning framework with cascade decoding for overlapping event extraction, termed as CasEE. Particularly, CasEE sequentially performs type detection, trigger extraction and argument extraction, where the overlapped targets are extracted separately conditioned on the specific former prediction. All the subtasks are jointly learned in a framework to capture dependencies among the subtasks. The evaluation on a public event extraction benchmark FewFC demonstrates that CasEE achieves significant improvements on overlapping event extraction over previous competitive methods.

cs.CL↗
arXiv2021

Top-Related Meta-Learning Method for Few-Shot Object Detection

Many meta-learning methods are proposed for few-shot detection. However, previous most methods have two main problems, poor detection APs, and strong bias because of imbalance and insufficient datasets. Previous works mainly alleviate these issues by additional datasets, multi-relation attention mechanisms and sub-modules. However, they require more cost. In this work, for meta-learning, we find that the main challenges focus on related or irrelevant semantic features between categories. Therefore, based on semantic features, we propose a Top-C classification loss (i.e., TCL-C) for classification task and a category-based grouping mechanism for category-based meta-features obtained by the meta-model. The TCL-C exploits the true-label prediction and the most likely C-1 false classification predictions to improve detection performance on few-shot classes. According to similar appearance (i.e., visual appearance, shape, and limbs etc.) and environment in which objects often appear, the category-based grouping mechanism splits categories into disjoint groups to make similar semantic features more compact between categories within a group and obtain more significant difference between groups, alleviating the strong bias problem and further improving detection APs. The whole training consists of the base model and the fine-tuning phases. According to grouping mechanism, we group the meta-features vectors obtained by meta-model, so that the distribution difference between groups is obvious, and the one within each group is less. Extensive experiments on Pascal VOC dataset demonstrate that ours which combines the TCL-C with category-based grouping significantly outperforms previous state-of-the-art methods for few-shot detection. Compared with previous competitive baseline, ours improves detection APs by almost 4% for few-shot detection.

cs.CV↗
arXiv2021

Self-energy dynamics and mode-specific phonon threshold effect in a Kekulé-ordered graphene

Electron-phonon interaction and related self-energy are fundamental to both the equilibrium properties and non-equilibrium relaxation dynamics of solids. Although electron-phonon interaction has been suggested by various time-resolved measurements to be important for the relaxation dynamics of graphene, the lack of energy- and momentum-resolved self-energy dynamics prohibits direct identification of the role of specific phonon modes in the relaxation dynamics. Here by performing time- and angle-resolved photoemission spectroscopy measurements on a Kekulé-ordered graphene with folded Dirac cones at the $Γ$ point, we have succeeded in resolving the self-energy effect induced by coupling of electrons to two phonons at $Ω_1$ = 177 meV and $Ω_2$ = 54 meV and revealing its dynamical change in the time domain. Moreover, these strongly coupled phonons define energy thresholds, which separate the hierarchical relaxation dynamics from ultrafast, fast to slow, thereby providing direct experimental evidence for the dominant role of mode-specific phonons in the relaxation dynamics

cond-mat.mes-hall↗
arXiv2021

Experimental evidence of chiral symmetry breaking in Kekulé-ordered graphene

The low-energy excitations of graphene are relativistic massless Dirac fermions with opposite chiralities at valleys K and K'. Breaking the chiral symmetry could lead to gap opening in analogy to dynamical mass generation in particle physics. Here we report direct experimental evidences of chiral symmetry breaking (CSB) from both microscopic and spectroscopic measurements in a Li-intercalated graphene. The CSB is evidenced by gap opening at the Dirac point, Kekulé-O type modulation, and chirality mixing near the gap edge. Our work opens up opportunities for investigating CSB related physics in a Kekulé-ordered graphene.

cond-mat.mes-hall↗
arXiv2021

Stochastic Intervention for Causal Inference via Reinforcement Learning

Causal inference methods are widely applied in various decision-making domains such as precision medicine, optimal policy and economics. Central to causal inference is the treatment effect estimation of intervention strategies, such as changes in drug dosing and increases in financial aid. Existing methods are mostly restricted to the deterministic treatment and compare outcomes under different treatments. However, they are unable to address the substantial recent interest of treatment effect estimation under stochastic treatment, e.g., "how all units health status change if they adopt 50\% dose reduction". In other words, they lack the capability of providing fine-grained treatment effect estimation to support sound decision-making. In our study, we advance the causal inference research by proposing a new effective framework to estimate the treatment effect on stochastic intervention. Particularly, we develop a stochastic intervention effect estimator (SIE) based on nonparametric influence function, with the theoretical guarantees of robustness and fast convergence rates. Additionally, we construct a customised reinforcement learning algorithm based on the random search solver which can effectively find the optimal policy to produce the greatest expected outcomes for the decision-making process. Finally, we conduct an empirical study to justify that our framework can achieve significant performance in comparison with state-of-the-art baselines.

cs.AI↗
arXiv2021

Stochastic Intervention for Causal Effect Estimation

Causal inference methods are widely applied in various decision-making domains such as precision medicine, optimal policy and economics. Central to these applications is the treatment effect estimation of intervention strategies. Current estimation methods are mostly restricted to the deterministic treatment, which however, is unable to address the stochastic space treatment policies. Moreover, previous methods can only make binary yes-or-no decisions based on the treatment effect, lacking the capability of providing fine-grained effect estimation degree to explain the process of decision making. In our study, we therefore advance the causal inference research to estimate stochastic intervention effect by devising a new stochastic propensity score and stochastic intervention effect estimator (SIE). Meanwhile, we design a customized genetic algorithm specific to stochastic intervention effect (Ge-SIO) with the aim of providing causal evidence for decision making. We provide the theoretical analysis and conduct an empirical study to justify that our proposed measures and algorithms can achieve a significant performance lift in comparison with state-of-the-art baselines.

cs.AI↗
arXiv2021

Be Causal: De-biasing Social Network Confounding in Recommendation

In recommendation systems, the existence of the missing-not-at-random (MNAR) problem results in the selection bias issue, degrading the recommendation performance ultimately. A common practice to address MNAR is to treat missing entries from the so-called "exposure" perspective, i.e., modeling how an item is exposed (provided) to a user. Most of the existing approaches use heuristic models or re-weighting strategy on observed ratings to mimic the missing-at-random setting. However, little research has been done to reveal how the ratings are missing from a causal perspective. To bridge the gap, we propose an unbiased and robust method called DENC (De-bias Network Confounding in Recommendation) inspired by confounder analysis in causal inference. In general, DENC provides a causal analysis on MNAR from both the inherent factors (e.g., latent user or item factors) and auxiliary network's perspective. Particularly, the proposed exposure model in DENC can control the social network confounder meanwhile preserves the observed exposure information. We also develop a deconfounding model through the balanced representation learning to retain the primary user and item features, which enables DENC generalize well on the rating prediction. Extensive experiments on three datasets validate that our proposed model outperforms the state-of-the-art baselines.

cs.LG↗