arXiv subjects

Jing Chen

Publications and source records attributed to Jing Chen.

At least 181 records · Page 10Linked to original sources

arXiv2023

Semantic reconstruction of continuous language from MEG signals

Decoding language from neural signals holds considerable theoretical and practical importance. Previous research has indicated the feasibility of decoding text or speech from invasive neural signals. However, when using non-invasive neural signals, significant challenges are encountered due to their low quality. In this study, we proposed a data-driven approach for decoding semantic of language from Magnetoencephalography (MEG) signals recorded while subjects were listening to continuous speech. First, a multi-subject decoding model was trained using contrastive learning to reconstruct continuous word embeddings from MEG data. Subsequently, a beam search algorithm was adopted to generate text sequences based on the reconstructed word embeddings. Given a candidate sentence in the beam, a language model was used to predict the subsequent words. The word embeddings of the subsequent words were correlated with the reconstructed word embedding. These correlations were then used as a measure of the probability for the next word. The results showed that the proposed continuous word embedding model can effectively leverage both subject-specific and subject-shared information. Additionally, the decoded text exhibited significant similarity to the target text, with an average BERTScore of 0.816, a score comparable to that in the previous fMRI study.

cs.HC↗

arXiv2023

Exploring the Intersection of Complex Aesthetics and Generative AI for Promoting Cultural Creativity in Rural China after the Post-Pandemic Era

This paper explores using generative AI and aesthetics to promote cultural creativity in rural China amidst COVID-19's impact. Through literature reviews, case studies, surveys, and text analysis, it examines art and technology applications in rural contexts and identifies key challenges. The study finds artworks often fail to resonate locally, while reliance on external artists limits sustainability. Hence, nurturing grassroots "artist villagers" through AI is proposed. Our approach involves training machine learning on subjective aesthetics to generate culturally relevant content. Interactive AI media can also boost tourism while preserving heritage. This pioneering research puts forth original perspectives on the intersection of AI and aesthetics to invigorate rural culture. It advocates holistic integration of technology and emphasizes AI's potential as a creative enabler versus replacement. Ultimately, it lays the groundwork for further exploration of leveraging AI innovations to empower rural communities. This timely study contributes to growing interest in emerging technologies to address critical issues facing rural China.

cs.CY↗

arXiv2023

Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage

While recent breakthroughs have proven the ability of noisy intermediate-scale quantum (NISQ) devices to achieve quantum advantage in classically-intractable sampling tasks, the use of these devices for solving more practically relevant computational problems remains a challenge. Proposals for attaining practical quantum advantage typically involve parametrized quantum circuits (PQCs), whose parameters can be optimized to find solutions to diverse problems throughout quantum simulation and machine learning. However, training PQCs for real-world problems remains a significant practical challenge, largely due to the phenomenon of barren plateaus in the optimization landscapes of randomly-initialized quantum circuits. In this work, we introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for PQCs, which we show significantly improves the trainability and performance of PQCs on a variety of problems. Given a specific optimization task, this method first utilizes tensor network (TN) simulations to identify a promising quantum state, which is then converted into gate parameters of a PQC by means of a high-performance decomposition procedure. We show that this learned initialization avoids barren plateaus, and effectively translates increases in classical resources to enhanced performance and speed in training quantum circuits. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing, and opens up new avenues to harness the power of modern quantum hardware for realizing practical quantum advantage.

quant-ph↗

arXiv2023

What can Discriminator do? Towards Box-free Ownership Verification of Generative Adversarial Network

In recent decades, Generative Adversarial Network (GAN) and its variants have achieved unprecedented success in image synthesis. However, well-trained GANs are under the threat of illegal steal or leakage. The prior studies on remote ownership verification assume a black-box setting where the defender can query the suspicious model with specific inputs, which we identify is not enough for generation tasks. To this end, in this paper, we propose a novel IP protection scheme for GANs where ownership verification can be done by checking outputs only, without choosing the inputs (i.e., box-free setting). Specifically, we make use of the unexploited potential of the discriminator to learn a hypersphere that captures the unique distribution learned by the paired generator. Extensive evaluations on two popular GAN tasks and more than 10 GAN architectures demonstrate our proposed scheme to effectively verify the ownership. Our proposed scheme shown to be immune to popular input-based removal attacks and robust against other existing attacks. The source code and models are available at https://github.com/AbstractTeen/gan_ownership_verification

cs.CV↗

arXiv2023

Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization

Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In some heuristic solvers, these are typically addressed by introducing certain Lagrange multipliers in the cost function, by relaxing them in some way, or worse yet, by generating many samples and only keeping valid ones, which leads to very expensive and inefficient searches. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric tensor networks (TNs) and leverage their applicability as quantum-inspired generative models to assist in the search of solutions to combinatorial optimization problems. This allows us to exploit the generalization capabilities of TN generative models while constraining them so that they only output valid samples. Our constrained TN generative model efficiently captures the constraints by reducing number of parameters and computational costs. We find that at tasks with constraints given by arbitrary equalities, symmetric Matrix Product States outperform their standard unconstrained counterparts at finding novel and better solutions to combinatorial optimization problems.

quant-ph↗

arXiv2023

Drugst.One -- A plug-and-play solution for online systems medicine and network-based drug repurposing

In recent decades, the development of new drugs has become increasingly expensive and inefficient, and the molecular mechanisms of most pharmaceuticals remain poorly understood. In response, computational systems and network medicine tools have emerged to identify potential drug repurposing candidates. However, these tools often require complex installation and lack intuitive visual network mining capabilities. To tackle these challenges, we introduce Drugst.One, a platform that assists specialized computational medicine tools in becoming user-friendly, web-based utilities for drug repurposing. With just three lines of code, Drugst.One turns any systems biology software into an interactive web tool for modeling and analyzing complex protein-drug-disease networks. Demonstrating its broad adaptability, Drugst.One has been successfully integrated with 21 computational systems medicine tools. Available at https://drugst.one, Drugst.One has significant potential for streamlining the drug discovery process, allowing researchers to focus on essential aspects of pharmaceutical treatment research.

q-bio.QM↗

arXiv2023

Accessibility optimization of public transportation in historical districts:a study of Belin District, Xian

With the continuous improvement of urbanization and motorization, travel demand in historical blocks is higher than before. The contradiction between supply of transportation facilities and environmental protection is more serious. Traditional public transport planning methods aim to improve mobility. However, several existing studies do not put travelers in the first place, which ignore quantitative description of land uses and the characteristics of travelers. This paper intends to improve individual accessibility of public transportation in historical districts. Based on POI data, the calculation of accessibility combines the utility model and spatial interaction model. To optimize public transportation, the goal of improving individual accessibility is transformed into reducing residents' travel negative utility. Using a real-world dataset in Beilin District of Xian, the performance of the proposed model is evaluated. This paper calculates the present accessibility and uses ant colony algorithm to optimize public transportation. The results demonstrate that the calculation and optimization of public transportation accessibility are practical, which are also valuable to public transportation planning and organization in historical blocks.

physics.soc-ph↗

arXiv2023

Revisiting k-NN for Fine-tuning Pre-trained Language Models

Pre-trained Language Models (PLMs), as parametric-based eager learners, have become the de-facto choice for current paradigms of Natural Language Processing (NLP). In contrast, k-Nearest-Neighbor (kNN) classifiers, as the lazy learning paradigm, tend to mitigate over-fitting and isolated noise. In this paper, we revisit kNN classifiers for augmenting the PLMs-based classifiers. From the methodological level, we propose to adopt kNN with textual representations of PLMs in two steps: (1) Utilize kNN as prior knowledge to calibrate the training process. (2) Linearly interpolate the probability distribution predicted by kNN with that of the PLMs' classifier. At the heart of our approach is the implementation of kNN-calibrated training, which treats predicted results as indicators for easy versus hard examples during the training process. From the perspective of the diversity of application scenarios, we conduct extensive experiments on fine-tuning, prompt-tuning paradigms and zero-shot, few-shot and fully-supervised settings, respectively, across eight diverse end-tasks. We hope our exploration will encourage the community to revisit the power of classical methods for efficient NLP. Code and datasets are available in https://github.com/zjunlp/Revisit-KNN.

cs.CL↗

arXiv2023

JOSS: Joint Exploration of CPU-Memory DVFS and Task Scheduling for Energy Efficiency

Energy-efficient execution of task-based parallel applications is crucial as tasking is a widely supported feature in many parallel programming libraries and runtimes. Currently, state-of-the-art proposals primarily rely on leveraging core asymmetry and CPU DVFS. Additionally, these proposals mostly use heuristics and lack the ability to explore the trade-offs between energy usage and performance. However, our findings demonstrate that focusing solely on CPU energy consumption for energy-efficient scheduling while neglecting memory energy consumption leaves room for further energy savings. We propose JOSS, a runtime scheduling framework that leverages both CPU DVFS and memory DVFS in conjunction with core asymmetry and task characteristics to enable energy-efficient execution of task-based applications. JOSS also enables the exploration of energy and performance trade-offs by supporting user-defined performance constraints. JOSS uses a set of models to predict task execution time, CPU and memory power consumption, and then selects the configuration for the tunable knobs to achieve the desired energy performance trade-off. Our evaluation shows that JOSS achieves 21.2% energy reduction, on average, compared to the state-of-the-art. Moreover, we demonstrate that even in the absence of a memory DVFS knob, taking energy consumption of both CPU and memory into account achieves better energy savings compared to only accounting for CPU energy. Furthermore, JOSS is able to adapt scheduling to reduce energy consumption while satisfying the desired performance constraints.

cs.DC↗

arXiv2023

Online Learning Under A Separable Stochastic Approximation Framework

We propose an online learning algorithm for a class of machine learning models under a separable stochastic approximation framework. The essence of our idea lies in the observation that certain parameters in the models are easier to optimize than others. In this paper, we focus on models where some parameters have a linear nature, which is common in machine learning. In one routine of the proposed algorithm, the linear parameters are updated by the recursive least squares (RLS) algorithm, which is equivalent to a stochastic Newton method; then, based on the updated linear parameters, the nonlinear parameters are updated by the stochastic gradient method (SGD). The proposed algorithm can be understood as a stochastic approximation version of block coordinate gradient descent approach in which one part of the parameters is updated by a second-order SGD method while the other part is updated by a first-order SGD. Global convergence of the proposed online algorithm for non-convex cases is established in terms of the expected violation of a first-order optimality condition. Numerical experiments show that the proposed method accelerates convergence significantly and produces more robust training and test performance when compared to other popular learning algorithms. Moreover, our algorithm is less sensitive to the learning rate and outperforms the recently proposed slimTrain algorithm (Newman et al., 2022). The code has been uploaded to GitHub for validation.

cs.LG↗

arXiv2023

S-type stars from LAMOST DR10: classification of intrinsic and extrinsic stars

In this paper, we found 2939 S-type stars from LAMOST Data Release 10 using two machine-learning methods, and 2306 of them were reported for the first time. The main purpose of this work is to study how to divide S-type stars into intrinsic and extrinsic stars with photometric data and LAMOST spectra. Using infrared photometric data, we adopted two methods to distinguish S-type stars, i.e., XGBoost algorithm and color-color diagrams. We trained XGBoost model with 15 input features consisting of colors and absolute magnitudes of Two Micron All Sky Survey (2MASS), AllWISE, AKARI, and IRAS, and found that the model trained by input features with 2MASS, AKARI, and IRAS data has the highest accuracy of 95.52%. Furthermore, using this XGBoost model, we found four color-color diagrams with six infrared color criteria to divide S-type stars, which has an accuracy of about 90%. Applying the two methods to the 2939 S-type stars, 381 (XGBoost)/336 (color-color diagrams) intrinsic and 495 (XGBoost)/82 (color-color diagrams) extrinsic stars were classified, respectively. Using these photometrically classified intrinsic and extrinsic stars, we retrained XGBoost model with their blue and red medium-resolution spectra, and the 2939 stars were divided into 855 intrinsic and 2056 extrinsic stars from spectra with an accuracy of 94.82%. In addition, we also found four spectral regions of Zr I (6451.6A), Ne II (6539.6A), Hα (6564.5A), and Fe I (6609.1A) and C I (6611.4A) are the most important features, which can reach an accuracy of 92.1% when using them to classify S-type stars.

astro-ph.SR↗

arXiv2023

Higher-order exceptional points in loss-free waveguide arrays with negative-index materials

Negative-index materials (NIMs) are shown to support optical anti-parity-time (anti-PT) symmetry even when they are lossless. Here we prove the feasibility in achieving higher-order exceptional points (EPs) in loss-free waveguide arrays by utilizing the anti-$\mathcal{PT}$ symmetry induced by NIM. Numerical simulation about a third-order EP fits well with the coupled-mode theory. A scheme of achieving fourth-order EPs is also discussed. This work highlights the potential of loss-free NIMs in the study of non-Hermitian optics.

physics.class-ph↗

arXiv2023

Non-Hermitian guided modes and exceptional points using loss-free negative-index materials

We analyze the guided modes in coupled waveguides made of negative-index materials without gain or loss. We show that it supports non-Hermitian phenomenon on the existence of guided mode versus geometric parameters of the structure. The non-Hermitian effect is different from parity-time (PT) symmetry, and can be explained by a simple coupled-mode theory with an anti-PT symmetry. The existence of exceptional points and slow-light effect are discussed. This work highlights the potential of loss-free negative-index materials in the study of non-Hermitian optics.

physics.optics↗

arXiv2023

Matrix Product Study of Spin Fractionalization in the 1D Kondo Insulator

The Kondo lattice is one of the classic examples of strongly correlated electronic systems. We conduct a controlled study of the Kondo lattice in one dimension, highlighting the role of excitations created by the composite fermion operator. Using time-dependent matrix-product-state methods we compute various correlation functions and contrast them with both large-N mean-field theory and the strong-coupling expansion. We show that the composite fermion operator creates long-lived, charge-e and spin-1/2 excitations, which cover the low-lying single-particle excitation spectrum of the system. Furthermore, spin excitations can be thought to be composed of such fractionalized quasi-particles with a residual interaction which tend to disappear at weak Kondo coupling.

cond-mat.str-el↗

arXiv2022

EBHI-Seg: A Novel Enteroscope Biopsy Histopathological Haematoxylin and Eosin Image Dataset for Image Segmentation Tasks

Background and Purpose: Colorectal cancer is a common fatal malignancy, the fourth most common cancer in men, and the third most common cancer in women worldwide. Timely detection of cancer in its early stages is essential for treating the disease. Currently, there is a lack of datasets for histopathological image segmentation of rectal cancer, which often hampers the assessment accuracy when computer technology is used to aid in diagnosis. Methods: This present study provided a new publicly available Enteroscope Biopsy Histopathological Hematoxylin and Eosin Image Dataset for Image Segmentation Tasks (EBHI-Seg). To demonstrate the validity and extensiveness of EBHI-Seg, the experimental results for EBHI-Seg are evaluated using classical machine learning methods and deep learning methods. Results: The experimental results showed that deep learning methods had a better image segmentation performance when utilizing EBHI-Seg. The maximum accuracy of the Dice evaluation metric for the classical machine learning method is 0.948, while the Dice evaluation metric for the deep learning method is 0.965. Conclusion: This publicly available dataset contained 5,170 images of six types of tumor differentiation stages and the corresponding ground truth images. The dataset can provide researchers with new segmentation algorithms for medical diagnosis of colorectal cancer, which can be used in the clinical setting to help doctors and patients.

eess.IV↗

arXiv2022

A fractional Hawkes process II: Further characterization of the process

We characterize a Hawkes point process with kernel proportional to the probability density function of Mittag-Leffler random variables. This kernel decays as a power law with exponent $β+1 \in (1,2]$. Several analytical results can be proved, in particular for the expected intensity of the point process and for the expected number of events of the counting process. These analytical results are used to validate algorithms that numerically invert the Laplace transform of the expected intensity as well as Monte Carlo simulations of the process. Finally, Monte Carlo simulations are used to derive the full distribution of the number of events. The algorithms used for this paper are available at {\tt https://github.com/habyarimanacassien/Fractional-Hawkes}.

math.PR↗

arXiv2022

Qubit seriation: Improving data-model alignment using spectral ordering

With the advent of quantum and quantum-inspired machine learning, adapting the structure of learning models to match the structure of target datasets has been shown to be crucial for obtaining high performance. Probabilistic models based on tensor networks (TNs) are prime candidates to benefit from data-dependent design considerations, owing to their bias towards correlations which are local with respect to the topology of the model. In this work, we use methods from spectral graph theory to search for optimal permutations of model sites which are adapted to the structure of an input dataset. Our method uses pairwise mutual information estimates from the target dataset to ensure that strongly correlated bits are placed closer to each other relative to the model's topology. We demonstrate the effectiveness of such preprocessing for probabilistic modeling tasks, finding substantial improvements in the performance of generative models based on matrix product states (MPS) across a variety of datasets. We also show how spectral embedding, a dimensionality reduction technique from spectral graph theory, can be used to gain further insights into the structure of datasets of interest.

quant-ph↗

arXiv2022

Evolution of scalar field resonances in a braneworld

In this work, we investigate numerical evolution of massive Kaluza-Klein (KK) modes of a scalar field in a thick brane. We derive the Klein-Gordon equation in five dimensional spacetime, and obtain the evolution equation and the Schrödinger-like equation. With the resonances of the scalar KK modes as the initial data, the scalar field is evolved with the maximally dissipative boundary condition. The results show that there are scalar KK resonant particles with long life on the brane, which indicates that these resonances might be viewed as one of the candidates for dark matter.

hep-th↗