Searcharxiv⌕ Search

arXiv subjects

Fang Liu

Publications and source records attributed to Fang Liu.

At least 343 records · Page 19Linked to original sources

Whiteout: Gaussian Adaptive Noise Regularization in Deep Neural Networks

Noise injection (NI) is an efficient technique to mitigate over-fitting in neural networks (NNs). The Bernoulli NI procedure as implemented in dropout and shakeout has connections with $l_1$ and $l_2$ regularization for the NN model parameters. We propose whiteout, a family NI regularization techniques (NIRT) through injecting adaptive Gaussian noises during the training of NNs. Whiteout is the first NIRT than imposes a broad range of the $l_γ$ sparsity regularization $(γ\in(0,2))$ without having to involving the $l_2$ regularization. Whiteout can also be extended to offer regularizations similar to the adaptive lasso and group lasso. We establish the regularization effect of whiteout in the framework of generalized linear models with closed-form penalty terms and show that whiteout stabilizes the training of NNs with decreased sensitivity to small perturbations in the input. We establish that the noise-perturbed empirical loss function (pelf) with whiteout converges almost surely to the ideal loss function (ilf), and the minimizer of the pelf is consistent for the minimizer of the ilf. We derive the tail bound on the pelf to establish the practical feasibility in its minimization. The superiority of whiteout over the Bernoulli NIRTs, dropout and shakeout, in learning NNs with relatively small-sized training sets and non-inferiority in large-sized training sets is demonstrated in both simulated and real-life data sets. This work represents the first in-depth theoretical, methodological, and practical examination of the regularization effects of both additive and multiplicative Gaussian NI in deep NNs.

stat.ML↗

Insights into the interactions among Surfactin, betaines, and PAM: surface tension, small-angle neutron scattering, and small-angle X-ray scattering study

The interactions among neutral polymer polyacrylamide (PAM) and the biosurfactant Surfactin and four betaines, N-dodecyl-N,N-dimethyl-3-ammonio-1-propanesulfonate (SDDAB), N-tetradecyl-N,N-dimethyl-3-ammonio-1-propanesulfonate (STDAB), N-hexadecyl-N,N-dimethyl-3-ammonio-1-propanesulfonate (SHDAB), and N-dodecyl-N,N-dimethyl-2-ammonio-acetate (C12BE), in phosphate buffer solution (PBS) have been studied by surface tension measurements, small-angle neutron scattering (SANS), small-angle X-ray scattering (SAXS), and rheological experiments. It has been confirmed that the length of alkyl chain is a key parameter of interaction between betaines and PAM. Differences in scattering contrast between X-ray and neutrons for surfactants and PAM molecules provide the opportunity to separately follow the changes of structure of PAM and surfactant aggregates. At concentrations of betaines higher than CMC (critical micelle concentration) and C2 (CMC of surfactant with the presence of polymer), spherical micelles are formed in betaines and betaines/PAM solutions. Transition from spherical to rod-like aggregates (micelles) has been observed in solutions of Surfactin and Surfactin/SDDAB (αSurfactin = 0.67 (molar fraction)) with addition of 0.8 wt % of PAM. The conformation change of PAM molecules only can be observed for Surfactin/SDDAB/PAM system. Viscosity values follow the structural changes suggested from scattering measurements i.e., gradually increases for mixtures PAM -> Surfactin/PAM -> Surfactin/SDDAB/PAM in PBS.

cond-mat.soft↗

UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits

In this work, we address the open problem of finding low-complexity near-optimal multi-armed bandit algorithms for sequential decision making problems. Existing bandit algorithms are either sub-optimal and computationally simple (e.g., UCB1) or optimal and computationally complex (e.g., kl-UCB). We propose a boosting approach to Upper Confidence Bound based algorithms for stochastic bandits, that we call UCBoost. Specifically, we propose two types of UCBoost algorithms. We show that UCBoost($D$) enjoys $O(1)$ complexity for each arm per round as well as regret guarantee that is $1/e$-close to that of the kl-UCB algorithm. We propose an approximation-based UCBoost algorithm, UCBoost($ε$), that enjoys a regret guarantee $ε$-close to that of kl-UCB as well as $O(\log(1/ε))$ complexity for each arm per round. Hence, our algorithms provide practitioners a practical way to trade optimality with computational complexity. Finally, we present numerical results which show that UCBoost($ε$) can achieve the same regret performance as the standard kl-UCB while incurring only $1\%$ of the computational cost of kl-UCB.

cs.LG↗

Charge Transfer in Classical Molecular Dynamics Simulations of Met-enkephalin: Improving Traditional Force Field with Data Driven Models

The charge transfer and polarization effects are important components in the molecular mechanism description of bio-molecules. Classical force field with fixed point charge cannot take into the account of the non-negligible correlation between atomic charge and structure changes. In this work, high throughput ab initio calculations for the pentapeptide Met-enkephalin (MetEnk) reveal that geometric dependent charge transfer among residues is significant among tens of thousands of conformations. And we suggest a data driven model with machine learning algorithms to solve the geometric dependent charge fluctuations problem. This data driven model can directly provide ab initio level atomic charges of any structure for MetEnk, and avoids self-consistent iteration in polarizable force field. Molecular dynamics simulations demonstrated that the data driven model provides a possible choice to describe the explicit charge flux with minor modification of available classical force fields. This work provides us an alternative molecular mechanism model for future dynamics simulation of oligopeptides.

physics.chem-ph↗

Charge Transfer Database for Bio-molecule Tight Binding Model Derived from Thousands of Proteins

The anisotropic feature of charge transfer reactions in realistic proteins cannot be ignored, due to the highly complex chemical structure of bio-molecules. In this work, we have performed the first large-scale quantitative assessment of charge transfer preference in protein complexes by calculating the charge transfer couplings in all 20*20 possible amino acid side chain combinations, which are extracted from available high-quality structures of thousands of protein complexes. The charge transfer database quantitatively shows distinct features of charge transfer couplings among millions of amino acid side-chains combinations. The knowledge graph of charge transfer couplings reveals that only one average or representative structure cannot be regarded as the typical charge transfer preference in realistic proteins. This data driven model provides us an alternative route to comprehensively understand the pairwise charge transfer coupling parameters based structural similarity, without any require of the knowledge of chemical intuition about the chemical interactions.

physics.chem-ph↗

Learning Intrinsic Sparse Structures within Long Short-Term Memory

Model compression is significant for the wide adoption of Recurrent Neural Networks (RNNs) in both user devices possessing limited resources and business clusters requiring quick responses to large-scale service requests. This work aims to learn structurally-sparse Long Short-Term Memory (LSTM) by reducing the sizes of basic structures within LSTM units, including input updates, gates, hidden states, cell states and outputs. Independently reducing the sizes of basic structures can result in inconsistent dimensions among them, and consequently, end up with invalid LSTM units. To overcome the problem, we propose Intrinsic Sparse Structures (ISS) in LSTMs. Removing a component of ISS will simultaneously decrease the sizes of all basic structures by one and thereby always maintain the dimension consistency. By learning ISS within LSTM units, the obtained LSTMs remain regular while having much smaller basic structures. Based on group Lasso regularization, our method achieves 10.59x speedup without losing any perplexity of a language modeling of Penn TreeBank dataset. It is also successfully evaluated through a compact model with only 2.69M weights for machine Question Answering of SQuAD dataset. Our approach is successfully extended to non- LSTM RNNs, like Recurrent Highway Networks (RHNs). Our source code is publicly available at https://github.com/wenwei202/iss-rnns

cs.LG↗

Universal linear optical operations on discrete phase-coherent spatial modes

Linear optical operations are fundamental and significant for both quantum mechanics and classical technologies. We demonstrate a non-cascaded approach to perform arbitrary unitary and non-unitary linear operations for N-dimensional phase-coherent spatial modes with meticulously designed phase gratings. As implemented on spatial light modulators (SLMs), the unitary transformation matrix has been realized with dimensionalities ranging from 7 to 24 and the corresponding fidelities are from 95.1% to 82.1%. For the non-unitary operators, a matrix is presented for the tomography of a 4-level quantum system with a fidelity of 94.9%. Thus, the linear operator has been successfully implemented with much higher dimensionality than that in previous reports. It should be mentioned that our method is not limited to SLMs and can be easily applied on other devices. Thus we believe that our proposal provides another option to perform linear operation with a simple, fixed, error-tolerant and scalable scheme.

physics.optics↗

Measure Upper Bounds of Nodal Sets of Robin Eigenfunctions

In this paper, we obtain the upper bounds for the Hausdorff measures of nodal sets of eigenfunctions with the Robin boundary conditions, i.e., \begin{equation*} {\left\{\begin{array}{l} \triangle u+λu=0,\quad in\quad Ω,\\ u_ν+μu=0,\quad on\quad\partialΩ, \end{array} \right.} \end{equation*} where the domain $Ω\subseteq\mathbb{R}^n$, $u_ν$ means the derivative of $u$ along the outer normal direction of $\partialΩ$. We show that, if $Ω$ is bounded and analytic, and the corresponding eigenvalue $λ$ is large enough,then the measure upper bounds for the nodal sets of eigenfunctions are $C\sqrtλ$, where $C$ is a positive constant depending only on $n$ and $Ω$ but not on $μ$ We also show that, if $\partialΩ$ is $C^{\infty}$ smooth and $\partialΩ\setminusΓ$ is piecewise analytic, where $Γ\subseteq\partialΩ$ is a union of some $n-2$ dimensional submanifolds of $\partialΩ$, $μ>0$, and $λ$ is large enough, then the corresponding measure upper bounds for the nodal sets of $u$ are $C(\sqrtλ+μ^α+μ^{-cα})$ for some positive number $α$, where $c$ is a positive constant depending only on $n$, and $C$ is a positive constant depending on $n$, $Ω$, $Γ$ and $α$.

math.AP↗

Generalized Gaussian Mechanism for Differential Privacy

Assessment of disclosure risk is of paramount importance in the research and applications of data privacy techniques. The concept of differential privacy (DP) formalizes privacy in probabilistic terms and provides a robust concept for privacy protection without making assumptions about the background knowledge of adversaries. Practical applications of DP involve development of DP mechanisms to release results at a pre-specified privacy budget. In this paper, we generalize the widely used Laplace mechanism to the family of generalized Gaussian (GG) mechanism based on the $l_p$ global sensitivity of statistical queries. We explore the theoretical requirement for the GG mechanism to reach DP at prespecified privacy parameters, and investigate the connections and differences between the GG mechanism and the Exponential mechanism based on the GG distribution We also present a lower bound on the scale parameter of the Gaussian mechanism of $(ε,δ)$-probabilistic DP as a special case of the GG mechanism, and compare the statistical utility of the sanitized results in the tail probability and dispersion in the Gaussian and Laplace mechanisms. Lastly, we apply the GG mechanism in 3 experiments (the mildew, Czech, adult data), and compare the accuracy of sanitized results via the $l_1$ distance and Kullback-Leibler divergence and examine how sanitization affects the prediction power of a classifier constructed with the sanitized data in the adult experiment.

math.ST↗

The effect of publishing a highly cited paper on journal's impact factor: a case study of the Review of Particle Physics

A single highly cited article can give a big but temporary lift in its host journal's impact factor evidenced by the striking example of "A short history of SHELX" published in Acta Crystallographica Section A. By using Journal Citation Reports and Web of Science's citation analysis tool, we find a more general and continuous form of this phenomenon in the Particle Physics field. The highly-cited "Review of Particle Physics" series have been published in one of the major Particle Physics journals biennially. This study analyses the effect of these articles on the Impact Factor (IF) of the host journals. The results show that the publication of Review of Particle Physics articles has a direct effect of lifting the IF of its host journal. However the effect on the IF varies according to whether the host journal already has a relatively high or low IF, and the number of articles that it publishes. The impact of these highly cited articles clearly demonstrates the limitations of journal impact factor, and endorses the need to use it more wisely when deciding where to publish and how to evaluate the relative impact of a journal.

cs.DL↗

A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problem

The multi-armed bandit problem has been extensively studied under the stationary assumption. However in reality, this assumption often does not hold because the distributions of rewards themselves may change over time. In this paper, we propose a change-detection (CD) based framework for multi-armed bandit problems under the piecewise-stationary setting, and study a class of change-detection based UCB (Upper Confidence Bound) policies, CD-UCB, that actively detects change points and restarts the UCB indices. We then develop CUSUM-UCB and PHT-UCB, that belong to the CD-UCB class and use cumulative sum (CUSUM) and Page-Hinkley Test (PHT) to detect changes. We show that CUSUM-UCB obtains the best known regret upper bound under mild assumptions. We also demonstrate the regret reduction of the CD-UCB policies over arbitrary Bernoulli rewards and Yahoo! datasets of webpage click-through rates.

cs.LG↗

Information Directed Sampling for Stochastic Bandits with Graph Feedback

We consider stochastic multi-armed bandit problems with graph feedback, where the decision maker is allowed to observe the neighboring actions of the chosen action. We allow the graph structure to vary with time and consider both deterministic and Erdős-Rényi random graph models. For such a graph feedback model, we first present a novel analysis of Thompson sampling that leads to tighter performance bound than existing work. Next, we propose new Information Directed Sampling based policies that are graph-aware in their decision making. Under the deterministic graph case, we establish a Bayesian regret bound for the proposed policies that scales with the clique cover number of the graph instead of the number of actions. Under the random graph case, we provide a Bayesian regret bound for the proposed policies that scales with the ratio of the number of actions over the expected number of observations per iteration. To the best of our knowledge, this is the first analytical result for stochastic bandits with random graph feedback. Finally, using numerical evaluations, we demonstrate that our proposed IDS policies outperform existing approaches, including adaptions of upper confidence bound, $ε$-greedy and Exp3 algorithms.

cs.LG↗

Shell feature: a new radiomics descriptor for predicting distant failure after radiotherapy in non-small cell lung cancer and cervix cancer

Purpose To develop and demonstrate a novel tumor shell feature for predicting distant failure in non-small cell lung cancer (NSCLC) and cervical cancer (CC) patients. Patients and Methods The shell predictive model was constructed using pretreatment positron emission tomography (PET) images from 48 NSCLC patients received stereotactic body radiation therapy (SBRT) and 52 CC patients underwent external beam radiation therapy and concurrent chemotherapy followed with high-dose-rate intracavitary brachytherapy. A shell feature, consisting of outer voxels around the tumor boundary, was extracted from a series of axial PET slices. The hypothesis behind this feature is that non-invasive and invasive tumors may have different morphologic patterns in the tumor periphery, in turn reflecting the differences in radiological presentations in the PET images. The utility of the shell was evaluated by the support vector machine (SVM) classifier in comparison with intensity, geometry, gray level co-occurrence matrix (GLCM) based texture, neighborhood gray tone difference matrix (NGTDM) based texture, and a combination of these four features. The results were assessed in terms of accuracy, sensitivity, specificity, and the area under the receiver operating curve (AUC). Results For NSCLC, the AUC achieved by the shell feature was 0.82 while the highest AUC achieved by the other features was 0.76. Similarly, for CC, the AUC achieved by the shell feature was 0.83 while the highest AUC achieved by the other features was 0.76. Also, the difference in performance between shell and the other features was significant (P < 0.005) in all cases. Conclusions We propose a boundary-based shell feature that correlates with tumor metastasis. The shell feature showed better predictive performance than all the other features for distant failure prediction in both NSCLC and CC.

physics.med-ph↗

Thermodynamics and critical behaviors of topological dS black holes with nonlinear source

We discuss black hole solutions of Einstein gravity in presence of nonlinear electrodynamics in dS spacetime. Considering prescribed entropy, thermodynamic volume of dS spacetime, We investigate properties of the effective thermodynamic quantities under influence of nonlinearity parameter $α$. They show a similar phase transition and criticality properties with that of black holes in AdS spacetime. And the nonlinearity parameter $α$ combined with electric charge is found to have effects on the phase structure. By the Ehrenfest equations we prove the critical phase transition is a second order equilibrium transition.

hep-th↗

Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks

We study the stochastic multi-armed bandit (MAB) problem in the presence of side-observations across actions that occur as a result of an underlying network structure. In our model, a bipartite graph captures the relationship between actions and a common set of unknowns such that choosing an action reveals observations for the unknowns that it is connected to. This models a common scenario in online social networks where users respond to their friends' activity, thus providing side information about each other's preferences. Our contributions are as follows: 1) We derive an asymptotic lower bound (with respect to time) as a function of the bi-partite network structure on the regret of any uniformly good policy that achieves the maximum long-term average reward. 2) We propose two policies - a randomized policy; and a policy based on the well-known upper confidence bound (UCB) policies - both of which explore each action at a rate that is a function of its network position. We show, under mild assumptions, that these policies achieve the asymptotic lower bound on the regret up to a multiplicative factor, independent of the network structure. Finally, we use numerical examples on a real-world social network and a routing example network to demonstrate the benefits obtained by our policies over other existing policies.

cs.LG↗

Direct Mapping Hidden Excited State Interaction Patterns from ab initio Dynamics and Its Implications on Force Field Development

The excited states of polyatomic systems are rather complex, and often exhibit meta-stable dynamical behaviors. Static analysis of reaction pathway often fails to sufficiently characterize excited state motions due to their highly non-equilibrium nature. Here, we proposed a time series guided clustering algorithm to generate most relevant meta-stable patterns directly from ab initio dynamic trajectories. Based on the knowledge of these meta-stable patterns, we suggested an interpolation scheme with only a concrete and finite set of known patterns to accurately predict the ground and excited state properties of the entire dynamics trajectories. As illustrated with the example of sinapic acids, the estimation error for both ground and excited state is very close, which indicates one could predict the ground and excited state molecular properties with similar accuracy. These results may provide us some insights to construct an excited state force field with compatible energy terms as traditional ones.

physics.chem-ph↗

Interaction between magnetic moments and itinerant carriers in d0 ferromagnetic SiC

Elucidating the interaction between magnetic moments and itinerant carriers is an important step to spintronic applications. Here, we investigate magnetic and transport properties in d0 ferromagnetic SiC single crystals prepared by postimplantation pulsed laser annealing. Magnetic moments are contributed by the p states of carbon atoms, but their magnetic circular dichroism is different from that in semi-insulating SiC samples. The anomalous Hall effect and negative magnetoresistance indicate the influence of d0 spin order on free carriers. The ferromagnetism is relatively weak in N-implanted SiC compared with that in Al-implanted SiC after annealing. The results suggest that d0 magnetic moments and itinerant carriers can interact with each other, which will facilitate the development of SiC spintronic devices with d0 ferromagnetism.

cond-mat.mtrl-sci↗

Commissioning of te China-ADS injector-I testing facility

The 10 MeV accelerator-driven subcritical system (ADS) Injector-I test stand at Institute of High Energy Physics (IHEP) is a testing facility dedicated to demonstrate one of the two injector design schemes [Injector Scheme-I, which works at 325 MHz], for the ADS project in China. The Injector adopted a four vane copper structure RFQ with output energy of 3.2 MeV and a superconducting (SC) section accommodating fourteen \b{eta}g=0.12 single spoke cavities, fourteen SC solenoids and fourteen cold BPMs. The ion source was installed since April of 2014, periods of commissioning are regularly scheduled between installation phases of the rest of the injector. Continuous wave (CW) beam was shooting through the injector and 10 MeV CW proton beam with average beam current around 2 mA was obtained recently. This contribution describe the results achieved so far and the difficulties encountered in CW commissioning.

physics.acc-ph↗