arXiv subjects

Min Chen

Publications and source records attributed to Min Chen.

At least 109 records · Page 6Linked to original sources

arXiv2025

GroverGPT: A Large Language Model with 8 Billion Parameters for Quantum Searching

Quantum computing is an exciting non-Von Neumann paradigm, offering provable speedups over classical computing for specific problems. However, the practical limits of classical simulatability for quantum circuits remain unclear, especially with current noisy quantum devices. In this work, we explore the potential of leveraging Large Language Models (LLMs) to simulate the output of a quantum Turing machine using Grover's quantum circuits, known to provide quadratic speedups over classical counterparts. To this end, we developed GroverGPT, a specialized model based on LLaMA's 8-billion-parameter architecture, trained on over 15 trillion tokens. Unlike brute-force state-vector simulations, which demand substantial computational resources, GroverGPT employs pattern recognition to approximate quantum search algorithms without explicitly representing quantum states. Analyzing 97K quantum search instances, GroverGPT consistently outperformed OpenAI's GPT-4o (45\% accuracy), achieving nearly 100\% accuracy on 6- and 10-qubit datasets when trained on 4-qubit or larger datasets. It also demonstrated strong generalization, surpassing 95\% accuracy for systems with over 20 qubits when trained on 3- to 6-qubit data. Analysis indicates GroverGPT captures quantum features of Grover's search rather than classical patterns, supported by novel prompting strategies to enhance performance. Although accuracy declines with increasing system size, these findings offer insights into the practical boundaries of classical simulatability. This work suggests task-specific LLMs can surpass general-purpose models like GPT-4o in quantum algorithm learning and serve as powerful tools for advancing quantum research.

quant-ph↗

arXiv2025

Towards the generation of petawatt near-infrared few-cycle light pulses via forward Raman amplification in plasma

Light amplification towards extremely high power in the infrared regime remains a significant challenge due to the lack of suitable gain media. Here we propose a new scheme to amplify a laser pulse with tunable wavelengths towards extremely high power via forward Raman amplification in plasma. Different from those previously proposed schemes based upon backward Raman or Brillouin amplification, our scheme involves a pump pulse and a seed pulse co-propagating in moderate density plasma, with the phase matching conditions for forward Raman scattering fulfilled. Due to their group velocity difference in plasma, the pump with a shorter wavelength and longer duration will chase the seed and transfer energy to the latter efficiently. Analytical models both for linear and nonlinear stages of amplification as well as particle-in-cell simulation show that by employing a 1.0 $\mathrm{μm}$ pump laser, a 1.8 $\mathrm{μm}$ seed pulse can be amplified $10^4$ times in its intensity, and then self-compressed to near-single-cycle. Our scheme shows the merits of high efficiency, high compactness, and relatively easy implementation with the co-propagating configuration, which may provide a unique route towards the petawatt few-cycle infrared laser pulses.

physics.plasm-ph↗

arXiv2025

EdgeGFL: Rethinking Edge Information in Graph Feature Preference Learning

Graph Neural Networks (GNNs) have significant advantages in handling non-Euclidean data and have been widely applied across various areas, thus receiving increasing attention in recent years. The framework of GNN models mainly includes the information propagation phase and the aggregation phase, treating nodes and edges as information entities and propagation channels, respectively. However, most existing GNN models face the challenge of disconnection between node and edge feature information, as these models typically treat the learning of edge and node features as independent tasks. To address this limitation, we aim to develop an edge-empowered graph feature preference learning framework that can capture edge embeddings to assist node embeddings. By leveraging the learned multidimensional edge feature matrix, we construct multi-channel filters to more effectively capture accurate node features, thereby obtaining the non-local structural characteristics and fine-grained high-order node features. Specifically, the inclusion of multidimensional edge information enhances the functionality and flexibility of the GNN model, enabling it to handle complex and diverse graph data more effectively. Additionally, integrating relational representation learning into the message passing framework allows graph nodes to receive more useful information, thereby facilitating node representation learning. Finally, experiments on four real-world heterogeneous graphs demonstrate the effectiveness of theproposed model.

cs.LG↗

arXiv2025

Alexandrov-Fenchel type inequalities for hypersurfaces in the sphere

The Alexandrov Fenchel inequality, a far-reaching generalization of the classical isoperimetric inequality to arbitrary mixed volumes, is fundamental in convex geometry. In $\mathbb{R}^{n+1}$, it states: $\int_Mσ_k dμ_g \ge C(n,k)\big(\int_Mσ_{k-1} dμ_g\big)^{\frac{n-k}{n-k+1}}$. In \cite{Brendle-Guan-Li} (see also \cite{Guan-Li-2}), Brendle, Guan, and Li proposed a Conjecture on the corresponding inequalities in $\mathbb{S}^{n+1}$, which implies a sharp relation between two adjacent quermassintegrals: $\mathcal{A}_k(Ω)\ge ξ_{k,k-1}\big(\mathcal{A}_{k-1}(Ω)\big)$, for any $ 1\le k\le n-1$. This is a long-standing open problem. In this paper, we prove a type of corresponding inequalities in $\mathbb{S}^{n+1}:$ $\int_{M}σ_kdμ_g\ge η_k\big(\mathcal{A}_{k-1}(Ω)\big)$ for any $0\le k\le n-1$. This is equivalent to the sharp relation among three adjacent quermassintegrals for hypersurfaces in $\mathbb{S}^{n+1}$(see (\ref{ineq three})), which also implies a non-sharp relation between two adjacent quermassintegrals $\mathcal{A}_{k}(Ω)\ge η_k\big(\mathcal{A}_{k-1}(Ω)\big)$, for any $ 1\le k\le n-1$.

math.DG↗

arXiv2024

Natural Language Fine-Tuning

Large language model fine-tuning techniques typically depend on extensive labeled data, external guidance, and feedback, such as human alignment, scalar rewards, and demonstration. However, in practical application, the scarcity of specific knowledge poses unprecedented challenges to existing fine-tuning techniques. In this paper, focusing on fine-tuning tasks in specific domains with limited data, we introduce Natural Language Fine-Tuning (NLFT), which utilizes natural language for fine-tuning for the first time. By leveraging the strong language comprehension capability of the target LM, NLFT attaches the guidance of natural language to the token-level outputs. Then, saliency tokens are identified with calculated probabilities. Since linguistic information is effectively utilized in NLFT, our proposed method significantly reduces training costs. It markedly enhances training efficiency, comprehensively outperforming reinforcement fine-tuning algorithms in accuracy, time-saving, and resource conservation. Additionally, on the macro level, NLFT can be viewed as a token-level fine-grained optimization of SFT, thereby efficiently replacing the SFT process without the need for warm-up (as opposed to ReFT requiring multiple rounds of warm-up with SFT). Compared to SFT, NLFT does not increase the algorithmic complexity, maintaining O(n). Extensive experiments on the GSM8K dataset demonstrate that NLFT, with only 50 data instances, achieves an accuracy increase that exceeds SFT by 219%. Compared to ReFT, the time complexity and space complexity of NLFT are reduced by 78.27% and 92.24%, respectively. The superior technique of NLFT is paving the way for the deployment of various innovative LLM fine-tuning applications when resources are limited at network edges. Our code has been released at https://github.com/Julia-LiuJ/NLFT.

cs.CL↗

arXiv2024

FaGeL: Fabric LLMs Agent empowered Embodied Intelligence Evolution with Autonomous Human-Machine Collaboration

Recent advancements in Large Language Models (LLMs) have enhanced the reasoning capabilities of embodied agents, driving progress toward AGI-powered robotics. While LLMs have been applied to tasks like semantic reasoning and task generalization, their potential in open physical space exploration remains underexplored. This paper introduces FaGeL (Fabric aGent empowered by embodied intelligence with LLMs), an embodied agent integrating smart fabric technology for seamless, non-intrusive human-agent interaction. FaGeL autonomously generates tasks using multimodal data from wearable and ambient sensors, refining its behavior based on implicit human feedback in generated text, without explicit ratings or preferences. We also introduce a token-level saliency map to visualize LLM fine-tuning, enhancing the interpretability of token-level alignment. The system leverages dual feedback mechanisms to improve token-level alignment and addresses challenges in non-intrusive human-machine interaction and cognition evolution. Our contributions include FaGeL's development, the DualCUT algorithm for AI alignment, and experimental validation in cooperative tasks, demonstrating FaGeL's ability to adapt and evolve autonomously through implicit feedback. In the future, we plan to explore FaGeL's scalability in dynamic environments and its integration with other AI systems to develop AGI agents that adapt seamlessly to diverse human needs.

cs.HC↗

arXiv2024

High-efficiency fast pinching radiation of electron beams in nonuniform plasma

The continuous development of bright x/gamma-ray sources has opened up new frontiers of science and advanced applications. Currently, there is still a lack of efficient approaches to produce gamma-rays with photon energies up to GeV and with high peak brilliance comparable to modern free-electron lasers. Here we report a novel mechanism called beam fast pinching radiation burst to generate such gamma-ray sources. It is achieved by injecting a GeV electron beam into a submillimeter plasma with an upramp density profile, enabling violent beam pinching to occur rapidly. During this process, a burst of collimated gamma-rays is efficiently produced with photon energy up to GeV, energy conversion efficiency exceeding $30\%$, and peak brilliance exceeding $10^{28}$ photons s$^{-1}$ mm$^{-2}$ mrad$^{-2}$ per $0.1\%$ bandwidth. All of these are several orders of magnitude higher than existing gamma-ray sources. This opens a novel avenue for the development of extremely bright gamma-ray sources for both fundamental research and cutting-edge applications.

physics.plasm-ph↗

arXiv2024

Multi-Criteria Decision Analysis for Aiding Glyph Design

Glyph-based visualization is one of the main techniques for visualizing complex multivariate data. With small glyphs, data variables are typically encoded with relatively low visual and perceptual precision. Glyph designers have to contemplate the trade-offs in allocating visual channels when there is a large number of data variables. While there are many successful glyph designs in the literature, there is not yet a systematic method for assisting visualization designers to evaluate different design options that feature different types of trade-offs. In this paper, we present an evaluation scheme based on the multi-criteria decision analysis (MCDA) methodology. The scheme provides designers with a structured way to consider their glyph designs from a range of perspectives, while rendering a semi-quantitative template for evaluating different design options. In addition, this work provides guideposts for future empirical research to obtain more quantitative measurements that can be used in MCDA-aided glyph design processes.

cs.HC↗

arXiv2024

DCMAC: Demand-aware Customized Multi-Agent Communication via Upper Bound Training

Efficient communication can enhance the overall performance of collaborative multi-agent reinforcement learning. A common approach is to share observations through full communication, leading to significant communication overhead. Existing work attempts to perceive the global state by conducting teammate model based on local information. However, they ignore that the uncertainty generated by prediction may lead to difficult training. To address this problem, we propose a Demand-aware Customized Multi-Agent Communication (DCMAC) protocol, which use an upper bound training to obtain the ideal policy. By utilizing the demand parsing module, agent can interpret the gain of sending local message on teammate, and generate customized messages via compute the correlation between demands and local observation using cross-attention mechanism. Moreover, our method can adapt to the communication resources of agents and accelerate the training progress by appropriating the ideal policy which is trained with joint observation. Experimental results reveal that DCMAC significantly outperforms the baseline algorithms in both unconstrained and communication constrained scenarios.

cs.AI↗

arXiv2024

TA3: Testing Against Adversarial Attacks on Machine Learning Models

Adversarial attacks are major threats to the deployment of machine learning (ML) models in many applications. Testing ML models against such attacks is becoming an essential step for evaluating and improving ML models. In this paper, we report the design and development of an interactive system for aiding the workflow of Testing Against Adversarial Attacks (TA3). In particular, with TA3, human-in-the-loop (HITL) enables human-steered attack simulation and visualization-assisted attack impact evaluation. While the current version of TA3 focuses on testing decision tree models against adversarial attacks based on the One Pixel Attack Method, it demonstrates the importance of HITL in ML testing and the potential application of HITL to the ML testing workflows for other types of ML models and other types of adversarial attacks.

cs.CR↗

arXiv2024

Image Similarity using An Ensemble of Context-Sensitive Models

Image similarity has been extensively studied in computer vision. In recent years, machine-learned models have shown their ability to encode more semantics than traditional multivariate metrics. However, in labelling semantic similarity, assigning a numerical score to a pair of images is impractical, making the improvement and comparisons on the task difficult. In this work, we present a more intuitive approach to build and compare image similarity models based on labelled data in the form of A:R vs B:R, i.e., determining if an image A is closer to a reference image R than another image B. We address the challenges of sparse sampling in the image space (R, A, B) and biases in the models trained with context-based data by using an ensemble model. Our testing results show that the ensemble model constructed performs ~5% better than the best individual context-sensitive models. They also performed better than the models that were directly fine-tuned using mixed imagery data as well as existing deep embeddings, e.g., CLIP and DINO. This work demonstrates that context-based labelling and model training can be effective when an appropriate ensemble approach is used to alleviate the limitation due to sparse sampling.

cs.CV↗

arXiv2024

STAA: Spatio-Temporal Alignment Attention for Short-Term Precipitation Forecasting

There is a great need to accurately predict short-term precipitation, which has socioeconomic effects such as agriculture and disaster prevention. Recently, the forecasting models have employed multi-source data as the multi-modality input, thus improving the prediction accuracy. However, the prevailing methods usually suffer from the desynchronization of multi-source variables, the insufficient capability of capturing spatio-temporal dependency, and unsatisfactory performance in predicting extreme precipitation events. To fix these problems, we propose a short-term precipitation forecasting model based on spatio-temporal alignment attention, with SATA as the temporal alignment module and STAU as the spatio-temporal feature extractor to filter high-pass features from precipitation signals and capture multi-term temporal dependencies. Based on satellite and ERA5 data from the southwestern region of China, our model achieves improvements of 12.61\% in terms of RMSE, in comparison with the state-of-the-art methods.

physics.ao-ph↗

arXiv2024

Report on the Advanced Linear Collider Study Group (ALEGRO) Workshop 2024

The workshop focused on the application of ANAs to particle physics keeping in mind the ultimate goal of a collider at the energy frontier (10\,TeV, e$^+$/e$^-$, e$^-$/e$^-$, or $γγ$). The development of ANAs is conducted at universities and national laboratories worldwide. The community is thematically broad and diverse, in particular since lasers suitable for ANA research (multi-hundred-terawatt peak power, a few tens of femtosecond-long pulses) and acceleration of electrons to hundreds of mega electron volts to multi giga electron volts became commercially available. The community spans several continents (Europe, America, Asia), including more than 62 laboratories in more than 20 countries. It is among the missions of the ICFA-ANA panel to feature the amazing progress made with ANAs, to provide international coordination and to foster international collaborations towards a future HEP collider. The scope of this edition of the workshop was to discuss the recent progress and necessary steps towards realizing a linear collider for particle physics based on novel-accelerator technologies (laser or beam driven in plasma or structures). Updates on the relevant aspects of the European Strategy for Particle Physics (ESPP) Roadmap Process as well as of the P5 (in the US) were presented, and ample time was dedicated to discussions. The major outcome of the workshop is the decision for ALEGRO to coordinate efforts in Europe, in the US, and in Asia towards a pre-CDR for an ANA-based, 10\,TeV CM collider. This goal of this coordination is to lead to a funding proposal to be submitted to both EU and EU/US funding agencies. This document presents a summary of the workshop, as seen by the co-chairs, as well as short 'one-pagers' written by the presenters at the workshop.

physics.acc-ph↗

arXiv2024

Generation of relativistic polarized electron beams via collective beam-target interactions

Relativistic polarized electron beams can find applications in broad areas of fundamental physics. Here, we propose for the first time that electron spin polarization can be realized efficiently via collective beam-target interactions. When a relativistic unpolarized electron beam is incident onto the surface of a solid target with a grazing angle, strong magnetic fields are induced at the target surface due to the formation of a high reflux of target electrons. This results in violent beam self-focusing and corresponding beam density increase via magnetic pinching. The pinched dense beam in turn further enhances the magnetic fields to the level of a few Giga-Gauss, which is high enough to trigger strong synchrotron radiation of ultrarelativistic electrons. During the interaction, electron spin polarization develops along the magnetic field direction, which is achieved via radiative spin flips in the quantum radiation-dominated regime. As a consequence, the incident electron beam can be effectively polarized via the spin-dependent radiation reaction, for example, the mean polarization of electrons with energy less than 2 GeV can reach above 50% for an initial 5GeV beam. This provides a robust way for the development of polarized electron sources.

physics.plasm-ph↗

arXiv2024

Flexible Bayesian Last Layer Models Using Implicit Priors and Diffusion Posterior Sampling

Bayesian Last Layer (BLL) models focus solely on uncertainty in the output layer of neural networks, demonstrating comparable performance to more complex Bayesian models. However, the use of Gaussian priors for last layer weights in Bayesian Last Layer (BLL) models limits their expressive capacity when faced with non-Gaussian, outlier-rich, or high-dimensional datasets. To address this shortfall, we introduce a novel approach that combines diffusion techniques and implicit priors for variational learning of Bayesian last layer weights. This method leverages implicit distributions for modeling weight priors in BLL, coupled with diffusion samplers for approximating true posterior predictions, thereby establishing a comprehensive Bayesian prior and posterior estimation strategy. By delivering an explicit and computationally efficient variational lower bound, our method aims to augment the expressive abilities of BLL models, enhancing model accuracy, calibration, and out-of-distribution detection proficiency. Through detailed exploration and experimental validation, We showcase the method's potential for improving predictive accuracy and uncertainty quantification while ensuring computational efficiency.

cs.LG↗

arXiv2024

PDF: A Probability-Driven Framework for Open World 3D Point Cloud Semantic Segmentation

Existing point cloud semantic segmentation networks cannot identify unknown classes and update their knowledge, due to a closed-set and static perspective of the real world, which would induce the intelligent agent to make bad decisions. To address this problem, we propose a Probability-Driven Framework (PDF) for open world semantic segmentation that includes (i) a lightweight U-decoder branch to identify unknown classes by estimating the uncertainties, (ii) a flexible pseudo-labeling scheme to supply geometry features along with probability distribution features of unknown classes by generating pseudo labels, and (iii) an incremental knowledge distillation strategy to incorporate novel classes into the existing knowledge base gradually. Our framework enables the model to behave like human beings, which could recognize unknown objects and incrementally learn them with the corresponding knowledge. Experimental results on the S3DIS and ScanNetv2 datasets demonstrate that the proposed PDF outperforms other methods by a large margin in both important tasks of open world semantic segmentation.

cs.CV↗

arXiv2024

DACB-Net: Dual Attention Guided Compact Bilinear Convolution Neural Network for Skin Disease Classification

This paper introduces the three-branch Dual Attention-Guided Compact Bilinear CNN (DACB-Net) by focusing on learning from disease-specific regions to enhance accuracy and alignment. A global branch compensates for lost discriminative features, generating Attention Heat Maps (AHM) for relevant cropped regions. Finally, the last pooling layers of global and local branches are concatenated for fine-tuning, which offers a comprehensive solution to the challenges posed by skin disease diagnosis. Although current CNNs employ Stochastic Gradient Descent (SGD) for discriminative feature learning, using distinct pairs of local image patches to compute gradients and incorporating a modulation factor in the loss for focusing on complex data during training. However, this approach can lead to dataset imbalance, weight adjustments, and vulnerability to overfitting. The proposed solution combines two supervision branches and a novel loss function to address these issues, enhancing performance and interpretability. The framework integrates data augmentation, transfer learning, and fine-tuning to tackle data imbalance to improve classification performance, and reduce computational costs. Simulations on the HAM10000 and ISIC2019 datasets demonstrate the effectiveness of this approach, showcasing a 2.59% increase in accuracy compared to the state-of-the-art.

cs.CV↗

arXiv2024

Multimodal Physiological Signals Representation Learning via Multiscale Contrasting for Depression Recognition

Depression recognition based on physiological signals such as functional near-infrared spectroscopy (fNIRS) and electroencephalogram (EEG) has made considerable progress. However, most existing studies ignore the complementarity and semantic consistency of multimodal physiological signals under the same stimulation task in complex spatio-temporal patterns. In this paper, we introduce a multimodal physiological signals representation learning framework using Siamese architecture via multiscale contrasting for depression recognition (MRLMC). First, fNIRS and EEG are transformed into different but correlated data based on a time-domain data augmentation strategy. Then, we design a spatio-temporal contrasting module to learn the representation of fNIRS and EEG through weight-sharing multiscale spatio-temporal convolution. Furthermore, to enhance the learning of semantic representation associated with stimulation tasks, a semantic consistency contrast module is proposed, aiming to maximize the semantic similarity of fNIRS and EEG. Extensive experiments on publicly available and self-collected multimodal physiological signals datasets indicate that MRLMC outperforms the state-of-the-art models. Moreover, our proposed framework is capable of transferring to multimodal time series downstream tasks.

cs.LG↗