arXiv subjects

Jing Chen

Publications and source records attributed to Jing Chen.

At least 199 records · Page 11Linked to original sources

arXiv2022

Inference and Prediction Using Functional Principal Components Analysis: Application to Diabetic Kidney Disease Progression in the Chronic Renal Insufficiency Cohort (CRIC) Study

Repeated longitudinal measurements are commonly used to model long-term disease progression, and timing and number of assessments per patient may vary, leading to irregularly spaced and sparse data. Longitudinal trajectories may exhibit curvilinear patterns, in which mixed linear regression methods may fail to capture true trends in the data. We applied functional principal components analysis to model kidney disease progression via estimated glomerular filtration rate (eGFR) trajectories. In a cohort of 2641 participants with diabetes and up to 15 years of annual follow-up from the Chronic Renal Insufficiency Cohort (CRIC) study, we detected novel dominant modes of variation and patterns of diabetic kidney disease (DKD) progression among subgroups defined by the presence of albuminuria. We conducted inferential permutation tests to assess differences in longitudinal eGFR patterns between groups. To determine whether fitting a full cohort model or separate group-specific models is more optimal for modeling long-term trajectories, we evaluated model fit, using our goodness-of-fit procedure, and future prediction accuracy. Our findings indicated advantages for both modeling approaches in accomplishing different objectives. Beyond DKD, the methods described are applicable to other settings with longitudinally assessed biomarkers as indicators of disease progression. Supplementary materials for this article are available online.

stat.AP↗

arXiv2022

Free Fine-tuning: A Plug-and-Play Watermarking Scheme for Deep Neural Networks

Watermarking has been widely adopted for protecting the intellectual property (IP) of Deep Neural Networks (DNN) to defend the unauthorized distribution. Unfortunately, the popular data-poisoning DNN watermarking scheme relies on target model fine-tuning to embed watermarks, which limits its practical applications in tackling real-world tasks. Specifically, the learning of watermarks via tedious model fine-tuning on a poisoned dataset (carefully-crafted sample-label pairs) is not efficient in tackling the tasks on challenging datasets and production-level DNN model protection. To address the aforementioned limitations, in this paper, we propose a plug-and-play watermarking scheme for DNN models by injecting an independent proprietary model into the target model to serve the watermark embedding and ownership verification. In contrast to the prior studies, our proposed method by incorporating a proprietary model is free of target model fine-tuning without involving any parameters update of the target model, thus the fidelity is well preserved. Our research findings reveal that model fine-tuning with poisoned data is not prepared for the IP protection of DNN models deployed in real-world tasks and poses a new research direction toward a more thorough understanding and investigation of adopting the proprietary model for DNN watermarking. The source code and models are available at https://github.com/AntigoneRandy/PTYNet.

cs.CR↗

arXiv2022

Installation, Commissioning and Performance of Phase Reference Line for LCLS-II

Any cavity controller for a distributed system needs a Phase Reference Line (PRL) signal from which to define phases of a cavity field measurement. The LCLS-II PRL system at SLAC provides bidirectional (forward and reverse) phase references at 1300 MHz to each rack of the LLRF system. The PRL controller embedded with the Master Oscillator (MO) locks the average phase of the two directions to the MO itself. Phase-averaging tracking loop is applied in firmware which supports the feature of cancelling the phase drift caused by changes in PRL cable length. FPGA logic moves the phase of digital LO to get zero average phase of the two PRL signals. This same LO is used for processing cavity pickup signals, thus establishing a stable reference phase for critical cavity RF measurements. At low frequencies, open-loop PRL noise relative to the LO distribution includes a strong environment and 1/f components, but the closed-loop noise approaches the noise floor of the DSP. The implication is that the close-in phase noise of the cavities will be dominated by the chassis DAQ noise. The final out-of-loop phase noise relevant to machine operations is that of the cavity field relative to the beam.

physics.acc-ph↗

arXiv2022

GBA: A Tuning-free Approach to Switch between Synchronous and Asynchronous Training for Recommendation Model

High-concurrency asynchronous training upon parameter server (PS) architecture and high-performance synchronous training upon all-reduce (AR) architecture are the most commonly deployed distributed training modes for recommendation models. Although synchronous AR training is designed to have higher training efficiency, asynchronous PS training would be a better choice for training speed when there are stragglers (slow workers) in the shared cluster, especially under limited computing resources. An ideal way to take full advantage of these two training modes is to switch between them upon the cluster status. However, switching training modes often requires tuning hyper-parameters, which is extremely time- and resource-consuming. We find two obstacles to a tuning-free approach: the different distribution of the gradient values and the stale gradients from the stragglers. This paper proposes Global Batch gradients Aggregation (GBA) over PS, which aggregates and applies gradients with the same global batch size as the synchronous training. A token-control process is implemented to assemble the gradients and decay the gradients with severe staleness. We provide the convergence analysis to reveal that GBA has comparable convergence properties with the synchronous training, and demonstrate the robustness of GBA the recommendation models against the gradient staleness. Experiments on three industrial-scale recommendation tasks show that GBA is an effective tuning-free approach for switching. Compared to the state-of-the-art derived asynchronous training, GBA achieves up to 0.2% improvement on the AUC metric, which is significant for the recommendation models. Meanwhile, under the strained hardware resource, GBA speeds up at least 2.4x compared to synchronous training.

cs.LG↗

arXiv2022

Revisit the Poynting vector in PT-symmetric coupled waveguides

We show that the time-averaged Poynting vector in parity-time (PT ) symmetric coupled waveguides is always positive and cannot explain the stopped light at exceptional points (EPs). In order to solve this paradox, we must accept the fact that the fields E and H and the Poynting vector in non-Hermitian systems are in general complex. Based on the original definition of the instantaneous Poynting vector, a formula on the group velocity is proposed, which agrees perfectly well with that calculated directly from the dispersion curves. It explains not only the stopped light at EPs, but also the fast-light effect near it. This investigation bridges a gap between the classic electrodynamics and the non-Hermitian physics, and highlights the novelty of non-Hermitian optics.

physics.optics↗

arXiv2022

Efficient free-space to chip coupling of ultrafast sub-ps THz pulse for biomolecule fingerprint sensing

Ultrafast sub-ps THz pulse conveys rich distinctive spectral fingerprints related to the vibrational or rotational modes of biomolecules and can be used to resolve the time-dependent dynamics of the motions. Thus, an efficient platform for enhancing the THz light-matter interaction is strongly demanded. Waveguides, owing to their tightly spatial confinement of the electromagnetic fields and the longer interaction distance, are promising platforms. However, the efficient feeding of the sub-ps THz pulse to the waveguides remains challenging due to the ultra-wide bandwidth property of the ultrafast signal. We propose a sensing chip comprised of a pair of back-to-back Vivaldi antennas and a 90° bent slotline waveguide to overcome the challenge. The effective operating bandwidth of the sensing chip ranges from 0.2 to 1.15 THz, with the free-space to chip coupling efficiency up to 50%. Over the entire band, the THz signal is 42.44 dB above the noise level with a peak of 73.40 dB. To take advantages of the efficient sensing chip, we have measured the characteristic fingerprint of α-lactose monohydrate, and a sharp absorption dip at near 0.53 THz has been successfully observed demonstrating the accuracy of the proposed solution. The proposed sensing chip has the advantages of efficient in-plane coupling, ultra-wide bandwidth, easy integration and fabrication, large-scale manufacturing capability, and cost-effective, and can be a strong candidate for THz light-matter interaction platform.

physics.optics↗

arXiv2022

Decomposition of Matrix Product States into Shallow Quantum Circuits

The rapid pace of recent advancements in numerical computation, notably the rise of GPU and TPU hardware accelerators, have allowed tensor network (TN) algorithms to scale to even larger quantum simulation problems, and to be employed more broadly for solving machine learning tasks. The "quantum-inspired" nature of TNs permits them to be mapped to parametrized quantum circuits (PQCs), a fact which has inspired recent proposals for enhancing the performance of TN algorithms using near-term quantum devices, as well as enabling joint quantum-classical training frameworks which benefit from the distinct strengths of TN and PQC models. However, the success of any such methods depends on efficient and accurate methods for approximating TN states using realistic quantum circuits, something which remains an unresolved question. In this work, we compare a range of novel and previously-developed algorithmic protocols for decomposing matrix product states (MPS) of arbitrary bond dimensions into low-depth quantum circuits consisting of stacked linear layers of two-qubit unitaries. These protocols are formed from different combinations of a preexisting analytical decomposition scheme with constrained optimization of circuit unitaries, and all possess efficient classical runtimes. Our experimental results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods, with even greater benefits seen in the setting of limited computational resources. Given these promising results, we expect our proposed decomposition protocol to form a useful ingredient within any joint application of TNs and PQCs, in turn further unlocking the rich and complementary benefits of classical and quantum computation.

quant-ph↗

arXiv2022

HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management

Processing large graphs with memory-limited GPU needs to resolve issues of host-GPU data transfer, which is a key performance bottleneck. Existing GPU-accelerated graph processing frameworks reduce the data transfers by managing the active subgraph transfer at runtime. Some frameworks adopt explicit transfer management approaches based on explicit memory copy with filter or compaction. In contrast, others adopt implicit transfer management approaches based on on-demand access with zero-copy or unified-memory. Having made intensive analysis, we find that as the active vertices evolve, the performance of the two approaches varies in different workloads. Due to heavy redundant data transfers, high CPU compaction overhead, or low bandwidth utilization, adopting a single approach often results in suboptimal performance. In this work, we propose a hybrid transfer management approach to take the merits of both the two approaches at runtime, with an objective to achieve the shortest execution time in each iteration. Based on the hybrid approach, we present HytGraph, a GPU-accelerated graph processing framework, which is empowered by a set of effective task scheduling optimizations to improve the performance. Our experimental results on real-world and synthesized graphs demonstrate that HyTGraph achieves up to 10.27X speedup over existing GPU-accelerated graph processing systems including Grus, Subway, and EMOGI.

cs.DC↗

arXiv2022

Fluid laminarization in protein-based high internal phase emulsions process

Protein-based high internal phase emulsions (HIPEs) have gained tremendous attention in diverse fields, but their mechanism in the emulsification process remains elusive. In this article, HIPEs were stabilized directly by food-grade proteins, depending on a self-organized process featuring a fluid laminarization. We elucidated that the emulsification with the rotor-stator mixer is a typical non-equilibrium process. The crucial factor for the process is related to the irreversible energy dissipation, while the internal phase volume fraction is the threshold determining the laminarization. The feasible explanation speculated that the transition corresponds to the dissipative structure, i.e., compressive droplets, arising from the spatiotemporal self-organization, to dissipate the turbulent kinetic energy. We found a new paradigm of dissipative structure, comprehending such structure in the HIPEs emulsification process, which is expected to pave the way for its industrial-scale production with the virtue of low-cost proteins.

cond-mat.soft↗

arXiv2022

Trajectory Prediction with Graph-based Dual-scale Context Fusion

Motion prediction for traffic participants is essential for a safe and robust automated driving system, especially in cluttered urban environments. However, it is highly challenging due to the complex road topology as well as the uncertain intentions of the other agents. In this paper, we present a graph-based trajectory prediction network named the Dual Scale Predictor (DSP), which encodes both the static and dynamical driving context in a hierarchical manner. Different from methods based on a rasterized map or sparse lane graph, we consider the driving context as a graph with two layers, focusing on both geometrical and topological features. Graph neural networks (GNNs) are applied to extract features with different levels of granularity, and features are subsequently aggregated with attention-based inter-layer networks, realizing better local-global feature fusion. Following the recent goal-driven trajectory prediction pipeline, goal candidates with high likelihood for the target agent are extracted, and predicted trajectories are generated conditioned on these goals. Thanks to the proposed dual-scale context fusion network, our DSP is able to generate accurate and human-like multi-modal trajectories. We evaluate the proposed method on the large-scale Argoverse motion forecasting benchmark, and it achieves promising results, outperforming the recent state-of-the-art methods.

cs.RO↗

arXiv2022

Embedded Point Iteration Based Recursive Algorithm for Online Identification of Nonlinear Regression Models

This paper presents a novel online identification algorithm for nonlinear regression models. The online identification problem is challenging due to the presence of nonlinear structure in the models. Previous works usually ignore the special structure of nonlinear regression models, in which the parameters can be partitioned into a linear part and a nonlinear part. In this paper, we develop an efficient recursive algorithm for nonlinear regression models based on analyzing the equivalent form of variable projection (VP) algorithm. By introducing the embedded point iteration (EPI) step, the proposed recursive algorithm can properly exploit the coupling relationship of linear parameters and nonlinear parameters. In addition, we theoretically prove that the proposed algorithm is mean-square bounded. Numerical experiments on synthetic data and real-world time series verify the high efficiency and robustness of the proposed algorithm.

math.OC↗

arXiv2022

Fast Sinkhorn II: Collinear Triangular Matrix and Linear Time Accurate Computation of Optimal Transport

In our previous work [arXiv:2202.10042], the complexity of Sinkhorn iteration is reduced from $O(N^2)$ to the optimal $O(N)$ by leveraging the special structure of the kernel matrix. In this paper, we explore the special structure of kernel matrices by defining and utilizing the properties of the Lower-ColLinear Triangular Matrix (L-CoLT matrix) and Upper-ColLinear Triangular Matrix (U-CoLT matrix). We prove that (1) L/U-CoLT matrix-vector multiplications can be carried out in $O(N)$ operations; (2) both families of matrices are closed under the Hadamard product and matrix scaling. These properties help to alleviate two key difficulties for reducing the complexity of the Inexact Proximal point method (IPOT), and allow us to significantly reduce the number of iterations to $O(N)$. This yields the Fast Sinkhorn II (FS-2) algorithm for accurate computation of optimal transport with low algorithm complexity and fast convergence. Numerical experiments are presented to show the effectiveness and efficiency of our approach.

math.OC↗

arXiv2022

Anti-Forgery: Towards a Stealthy and Robust DeepFake Disruption Attack via Adversarial Perceptual-aware Perturbations

DeepFake is becoming a real risk to society and brings potential threats to both individual privacy and political security due to the DeepFaked multimedia are realistic and convincing. However, the popular DeepFake passive detection is an ex-post forensics countermeasure and failed in blocking the disinformation spreading in advance. To address this limitation, researchers study the proactive defense techniques by adding adversarial noises into the source data to disrupt the DeepFake manipulation. However, the existing studies on proactive DeepFake defense via injecting adversarial noises are not robust, which could be easily bypassed by employing simple image reconstruction revealed in a recent study MagDR. In this paper, we investigate the vulnerability of the existing forgery techniques and propose a novel \emph{anti-forgery} technique that helps users protect the shared facial images from attackers who are capable of applying the popular forgery techniques. Our proposed method generates perceptual-aware perturbations in an incessant manner which is vastly different from the prior studies by adding adversarial noises that is sparse. Experimental results reveal that our perceptual-aware perturbations are robust to diverse image transformations, especially the competitive evasion technique, MagDR via image reconstruction. Our findings potentially open up a new research direction towards thorough understanding and investigation of perceptual-aware adversarial attack for protecting facial images against DeepFakes in a proactive and robust manner. We open-source our tool to foster future research. Code is available at https://github.com/AbstractTeen/AntiForgery/.

cs.CR↗

arXiv2022

Thick branes with inner structure in mimetic $f(R)$ gravity

In this paper, we study the structure and gravitational resonances of thick branes generated by a mimetic scalar field in $f(R)$ gravity. We obtain several typical thick brane solutions for $f(R)=R+αR^2$. To study their stability, we analyze the tensor perturbation of the metric. It is shown that any thick brane model with $df/dR>0$ is stable and the graviton zero mode can be localized on the brane for each solution, which indicates that the four-dimensional Newtonian gravity can be restored. The effect of the parameter $α$ on the gravitational resonances is studied. As a brane splits into multi sub-branes, the effective potential of the tensor perturbation will have an abundant inner structure with multi-wells, and this will lead to new phenomena of the gravitational resonances.

gr-qc↗

arXiv2022

S-type stars discovered in Medium-Resolution Spectra of LAMOST DR9

In this paper, we report on 606 S-type stars identified from Data Release 9 of the LAMOST medium-resolution spectroscopic (MRS) survey, and 539 of them are reported for the first time. The discovery of these stars is a three-step process, i.e., selecting with the ZrO band indices greater than 0.25, excluding non-S-type stars with the iterative Support Vector Machine method, and finally retaining stars with absolute bolometric magnitude larger than -7.1. The 606 stars are consistent with the distribution of known S-type stars in the color-magnitude diagram. We estimated the C/Os using the [C/Fe] and [O/Fe] provided by APOGEE and the MARCS model for S-type stars, respectively, and the results of the two methods show that C/Os of all stars are larger than 0.5. Both the locations on the color-magnitude diagram and C/Os further verify the nature of our S-type sample. Investigating the effect of TiO and atmospheric parameters on ZrO with the sample, we found that log g has a more significant impact on ZrO than Teff and [Fe/H], and both TiO and log g may negatively correlate with ZrO. According to the criterion of Tian et al. (2020), a total of 238 binary candidates were found by the zero-point-calibrated radial velocities from the officially released catalog of LAMOST MRS and the catalog of Zhang et al. (2021). A catalog of these 606 S-type stars is available from the following link https://doi.org/10.12149/101097.

astro-ph.SR↗

arXiv2022

Fast Sinkhorn I: An O(N) algorithm for the Wasserstein-1 metric

The Wasserstein metric is broadly used in optimal transport for comparing two probabilistic distributions, with successful applications in various fields such as machine learning, signal processing, seismic inversion, etc. Nevertheless, the high computational complexity is an obstacle for its practical applications. The Sinkhorn algorithm, one of the main methods in computing the Wasserstein metric, solves an entropy regularized minimizing problem, which allows arbitrary approximations to the Wasserstein metric with O(N^2) computational cost. However, higher accuracy of its numerical approximation requires more Sinkhorn iterations with repeated matrix-vector multiplications, which is still unaffordable. In this work, we propose an efficient implementation of the Sinkhorn algorithm to calculate the Wasserstein-1 metric with O(N) computational cost, which achieves the optimal theoretical complexity. By utilizing the special structure of Sinkhorn's kernel, the repeated matrix-vector multiplications can be implemented with O(N) times multiplications and additions, using the Qin Jiushao or Horner's method for efficient polynomial evaluation, leading to an efficient algorithm without losing accuracy. In addition, the log-domain stabilization technique, used to stabilize the iterative procedure, can also be applied in this algorithm. Our numerical experiments show that the newly developed algorithm is one to three orders of magnitude faster than the original Sinkhorn algorithm.

math.OC↗

arXiv2022

ERASE: Energy Efficient Task Mapping and Resource Management for Work Stealing Runtimes

Parallel applications often rely on work stealing schedulers in combination with fine-grained tasking to achieve high performance and scalability. However, reducing the total energy consumption in the context of work stealing runtimes is still challenging, particularly when using asymmetric architectures with different types of CPU cores. A common approach for energy savings involves dynamic voltage and frequency scaling (DVFS) wherein throttling is carried out based on factors like task parallelism, stealing relations and task criticality. This paper makes the following observations: (i) leveraging DVFS on a per-task basis is impractical when using fine-grained tasking and in environments with cluster/chip-level DVFS; (ii) task moldability, wherein a single task can execute on multiple threads/cores via work-sharing, can help to reduce energy consumption; and (iii) mismatch between tasks and assigned resources (i.e.~core type and number of cores) can detrimentally impact energy consumption. In this paper, we propose ERASE (EneRgy Aware SchedulEr), an intra-application task scheduler on top of work stealing runtimes that aims to reduce the total energy consumption of parallel applications. It achieves energy savings by guiding scheduling decisions based on per-task energy consumption predictions of different resource configurations. In addition, ERASE is capable of adapting to both given static frequency settings and externally controlled DVFS. Overall, ERASE achieves up to 31% energy savings and improves performance by 44% on average, compared to the state-of-the-art DVFS-based schedulers.

cs.DC↗

arXiv2022

The Quadratic Wasserstein Metric With Squaring Scaling For Seismic Velocity Inversion

The quadratic Wasserstein metric has shown its power in measuring the difference between probability densities, which benefits optimization objective function with better convexity and is insensitive to data noise. Nevertheless, it is always an important question to make the seismic signals suitable for comparison using the quadratic Wasserstein metric. The squaring scaling is worth exploring since it guarantees the convexity caused by data shift. However, as mentioned in [Commun. Inf. Syst., 2019, 19:95-145], the squaring scaling may lose uniqueness and result in more local minima to the misfit function. In our previous work [J. Comput. Phys., 2018, 373:188-209], the quadratic Wasserstein metric with squaring scaling was successfully applied to the earthquake location problem. But it only discussed the inverse problem with few degrees of freedom. In this work, we will present a more in-depth study on the combination of squaring scaling technique and the quadratic Wasserstein metric. By discarding some inapplicable data, picking seismic phases, and developing a new normalization method, we successfully invert the seismic velocity structure based on the squaring scaling technique and the quadratic Wasserstein metric. The numerical experiments suggest that this newly proposed method is an efficient approach to obtain more accurate inversion results.

math.NA↗