arXiv subjects

Siyuan Chen

Publications and source records attributed to Siyuan Chen.

At least 73 records · Page 4Linked to original sources

arXiv2025

Fast Subspace Fluid Simulation with a Temporally-Aware Basis

We present a novel reduced-order fluid simulation technique leveraging Dynamic Mode Decomposition (DMD) to achieve fast, memory-efficient, and user-controllable subspace simulation. We demonstrate that our approach combines the strengths of both spatial reduced order models (ROMs) as well as spectral decompositions. By optimizing for the operator that evolves a system state from one timestep to the next, rather than the system state itself, we gain both the compressive power of spatial ROMs as well as the intuitive physical dynamics of spectral methods. The latter property is of particular interest in graphics applications, where user control of fluid phenomena is of high demand. We demonstrate this in various applications including spatial and temporal modulation tools and fluid upscaling with added turbulence. We adapt DMD for graphics applications by reducing computational overhead, incorporating user-defined force inputs, and optimizing memory usage with randomized SVD. The integration of OptDMD and DMD with Control (DMDc) facilitates noise-robust reconstruction and real-time user interaction. We demonstrate the technique's robustness across diverse simulation scenarios, including artistic editing, time-reversal, and super-resolution. Through experimental validation on challenging scenarios, such as colliding vortex rings and boundary-interacting plumes, our method also exhibits superior performance and fidelity with significantly fewer basis functions compared to existing spatial ROMs. The inherent linearity of the DMD operator enables unique application modes, such as time-reversible fluid simulation. This work establishes another avenue for developing real-time, high-quality fluid simulations, enriching the space of fluid simulation techniques in interactive graphics and animation.

cs.GR↗

arXiv2025

EvoEngineer: Mastering Automated CUDA Kernel Code Evolution with Large Language Models

CUDA kernel optimization has become a critical bottleneck for AI performance, as deep learning training and inference efficiency directly depends on highly optimized GPU kernels. Despite the promise of Large Language Models (LLMs) for automating kernel optimization, this field suffers from a fragmented ecosystem of isolated and incomparable approaches with unclear problem formulations. Furthermore, general-purpose LLM code evolution methods cannot meet strict correctness requirements of CUDA kernel optimization. We address these fundamental challenges by first formalizing CUDA kernel optimization as a code optimization task with a clear objective, constraints, and evaluation metrics. We then establish the first systematic LLM-based code evolution framework, EvoEngineer, that provides guidance for designing and adapting optimization strategies to achieve a balance between performance and correctness. Finally, we implement a kernel optimization system based on this framework and conduct extensive experiments on 91 real-world CUDA kernels. Our results demonstrate that EvoEngineer achieves a principled balance between performance and correctness, with the highest averaged median speedup of \textbf{2.72}$\times$ over baseline CUDA kernels and a code validity rate of \textbf{69.8}\%, outperforming existing methods on both dimensions. Our method achieves a maximum speedup of \textbf{36.75}$\times$ among all operations over PyTorch kernels and delivers the highest speedup on \textbf{28} (\textbf{56.0\%}) of 50 operations that achieve over \textbf{2$\times$} acceleration.

cs.LG↗

arXiv2025

Evolution of Kernels: Automated RISC-V Kernel Optimization with Large Language Models

Automated kernel design is critical for overcoming software ecosystem barriers in emerging hardware platforms like RISC-V. While large language models (LLMs) have shown promise for automated kernel optimization, demonstrating success in CUDA domains with comprehensive technical documents and mature codebases, their effectiveness remains unproven for reference-scarce domains like RISC-V. We present Evolution of Kernels (EoK), a novel LLM-based evolutionary program search framework that automates kernel design for domains with limited reference material. EoK mitigates reference scarcity by mining and formalizing reusable optimization ideas (general design principles + actionable thoughts) from established kernel libraries' development histories; it then guides parallel LLM explorations using these ideas, enriched via Retrieval-Augmented Generation (RAG) with RISC-V-specific context, prioritizing historically effective techniques. Empirically, EoK achieves a median 1.27x speedup, surpassing human experts on all 80 evaluated kernel design tasks and improving upon prior LLM-based automated kernel design methods by 20%. These results underscore the viability of incorporating human experience into emerging domains and highlight the immense potential of LLM-based automated kernel optimization.

cs.SE↗

arXiv2025

Rapid Construction of Joint Pulsar Timing Array Datasets: The Lite Method

The International Pulsar Timing Array (IPTA)'s second data release (IPTA DR2) combines decades of observations of 65 millisecond pulsars from 7 radio telescopes. IPTA datasets should be the most sensitive datasets to nanohertz gravitational waves (GWs), but take years to assemble, often excluding valuable recent data. To address this, we introduce the IPTA "Lite" analysis, where a Figure of Merit is used to select an optimal PTA dataset to analyze for each pulsar, enabling immediate access to new data and preliminary results prior to full combination. We test the capabilities of the Lite analysis using IPTA DR2, finding that "DR2 Lite" can be used to detect the common red noise process with an amplitude of $A = 4.8^{+1.8}_{-1.8} \times 10^{-15}$ at $γ= 13/3$. This amplitude is slightly large in comparison to the combined analysis, and likely biased high as DR2 Lite is more sensitive to systematic errors from individual pulsars than the full dataset. Furthermore, although there is no strong evidence for Hellings-Downs correlations in IPTA DR2, we still find the full dataset is better at resolving Hellings-Downs correlations than DR2 Lite. Alongside the Lite analysis, we also find that analyzing a subset of pulsars from IPTA DR2, available at a hypothetical "early" stage of combination (EDR2), yields equally competitive results as the full dataset. Looking ahead, the Lite method will enable rapid synthesis of the latest PTA data, offering preliminary GW constraints before the superior full dataset combinations are available.

astro-ph.HE↗

arXiv2025

FutureX: An Advanced Live Benchmark for LLM Agents in Future Prediction

Future prediction is a complex task for LLM agents, requiring a high level of analytical thinking, information gathering, contextual understanding, and decision-making under uncertainty. Agents must not only gather and interpret vast amounts of dynamic information but also integrate diverse data sources, weigh uncertainties, and adapt predictions based on emerging trends, just as human experts do in fields like politics, economics, and finance. Despite its importance, no large-scale benchmark exists for evaluating agents on future prediction, largely due to challenges in handling real-time updates and retrieving timely, accurate answers. To address this, we introduce $\textbf{FutureX}$, a dynamic and live evaluation benchmark specifically designed for LLM agents performing future prediction tasks. FutureX is the largest and most diverse live benchmark for future prediction, supporting real-time daily updates and eliminating data contamination through an automated pipeline for question gathering and answer collection. We evaluate 25 LLM/agent models, including those with reasoning, search capabilities, and integration of external tools such as the open-source Deep Research Agent and closed-source Deep Research models. This comprehensive evaluation assesses agents' adaptive reasoning and performance in dynamic environments. Additionally, we provide in-depth analyses of agents' failure modes and performance pitfalls in future-oriented tasks, including the vulnerability to fake web pages and the temporal validity. Our goal is to establish a dynamic, contamination-free evaluation standard that drives the development of LLM agents capable of performing at the level of professional human analysts in complex reasoning and predictive thinking.

cs.AI↗

arXiv2025

Domain Adaptation for Big Data in Agricultural Image Analysis: A Comprehensive Review

With the wide application of computer vision in agriculture, image analysis has become the key to tasks such as crop health monitoring and pest detection. However, the significant domain shifts caused by environmental changes, different crop types, and diverse data acquisition methods seriously hinder the generalization ability of the model in cross-region, cross-season, and complex agricultural scenarios. This paper explores how domain adaptation (DA) techniques can address these challenges to improve cross-domain transferability in agricultural image analysis. DA is considered a promising solution in the case of limited labeled data, insufficient model adaptability, and dynamic changes in the field environment. This paper systematically reviews the latest advances in DA in agricultural images in recent years, focusing on application scenarios such as crop health monitoring, pest and disease detection, and fruit identification, in which DA methods have significantly improved cross-domain performance. We categorize DA methods into shallow learning and deep learning methods, including supervised, semi-supervised and unsupervised strategies, and pay special attention to the adversarial learning-based techniques that perform well in complex scenarios. In addition, this paper also reviews the main public datasets of agricultural images, and evaluates their advantages and limitations in DA research. Overall, this study provides a complete framework and some key insights that can be used as a reference for the research and development of domain adaptation methods in future agricultural vision tasks.

cs.CV↗

arXiv2025

Advances in Quantum Defect Embedding Theory

Quantum defect embedding theory (QDET) is a many-body embedding method designed to describe condensed systems with correlated electrons localized within a given region of space, for example spin defects in semiconductors and insulators. Although the QDET approach has been successful in predicting the electronic properties of several point defects, several limitations of the method remain. In this work, we propose multiple advances to the QDET formalism. We derive a double-counting correction that consistently treats the frequency dependence of the screened Coulomb interaction, and we illustrate the effect of including unoccupied orbitals in the active space. In addition, we propose a method to describe hybridization effects between the active space and the environment, and we compare the results of several impurity solvers, providing further insights into improving the reliability and applicability of the method. We present results for defects in diamond and for molecular qubits, including a detailed comparison with experiments.

cond-mat.mtrl-sci↗

arXiv2025

Orthogonal Finetuning for Direct Preference Optimization

DPO is an effective preference optimization algorithm. However, the DPO-tuned models tend to overfit on the dispreferred samples, manifested as overly long generations lacking diversity. While recent regularization approaches have endeavored to alleviate this issue by modifying the objective function, they achieved that at the cost of alignment performance degradation. In this paper, we innovatively incorporate regularization from the perspective of weight updating to curb alignment overfitting. Through the pilot experiment, we discovered that there exists a positive correlation between overfitting and the hyperspherical energy fluctuation. Hence, we introduce orthogonal finetuning for DPO via a weight-Rotated Preference Optimization (RoPO) method, which merely conducts rotational and magnitude-stretching updates on the weight parameters to maintain the hyperspherical energy invariant, thereby preserving the knowledge encoded in the angle between neurons. Extensive experiments demonstrate that our model aligns perfectly with human preferences while retaining the original expressive capacity using only 0.0086% of the trainable parameters, suggesting an effective regularization against overfitting. Specifically, RoPO outperforms DPO by up to 10 points on MT-Bench and by up to 2.8 points on AlpacaEval 2, while enhancing the generation diversity by an average of 6 points.

cs.CL↗

arXiv2025

Weights-Rotated Preference Optimization for Large Language Models

Despite the efficacy of Direct Preference Optimization (DPO) in aligning Large Language Models (LLMs), reward hacking remains a pivotal challenge. This issue emerges when LLMs excessively reduce the probability of rejected completions to achieve high rewards, without genuinely meeting their intended goals. As a result, this leads to overly lengthy generation lacking diversity, as well as catastrophic forgetting of knowledge. We investigate the underlying reason behind this issue, which is representation redundancy caused by neuron collapse in the parameter space. Hence, we propose a novel Weights-Rotated Preference Optimization (RoPO) algorithm, which implicitly constrains the output layer logits with the KL divergence inherited from DPO and explicitly constrains the intermediate hidden states by fine-tuning on a multi-granularity orthogonal matrix. This design prevents the policy model from deviating too far from the reference model, thereby retaining the knowledge and expressive capabilities acquired during pre-training and SFT stages. Our RoPO achieves up to a 3.27-point improvement on AlpacaEval 2, and surpasses the best baseline by 6.2 to 7.5 points on MT-Bench with merely 0.015% of the trainable parameters, demonstrating its effectiveness in alleviating the reward hacking problem of DPO.

cs.CL↗

arXiv2025

Towards AI-based Sustainable and XR-based human-centric manufacturing: Implementation of ISO 23247 for digital twins of production systems

Since the introduction of Industry 4.0, digital twin technology has significantly evolved, laying the groundwork for a transition toward Industry 5.0 principles centered on human-centricity, sustainability, and resilience. Through digital twins, real-time connected production systems are anticipated to be more efficient, resilient, and sustainable, facilitating communication and connectivity between digital and physical systems. However, environmental performance and integration with virtual reality (VR) and artificial intelligence (AI) of such systems remain challenging. Further exploration of digital twin technologies is needed to validate the real-world impact and benefits. This paper investigates these challenges by implementing a real-time digital twin based on the ISO 23247 standard, connecting the physical factory and simulation software with VR capabilities. This digital twin system provides cognitive assistance and a user-friendly interface for operators, thereby improving cognitive ergonomics. The connection of the Internet of Things (IoT) platform allows the digital twin to have real-time bidirectional communication, collaboration, monitoring, and assistance. A lab-scale drone factory was used as the digital twin application to test and evaluate the ISO 23247 standard and its potential benefits. Additionally, AI integration and environmental performance Key Performance Indicators (KPIs) have been considered as the next stages in improving VR-integrated digital twins. With a solid theoretical foundation and a demonstration of the VR-integrated digital twins, this paper addresses integration issues between various technologies and advances the framework of digital twins based on ISO 23247.

cs.HC↗

arXiv2025

H I absorption line and anomalous dispersion in the radio pulses of PSR B1937+21

We use the Five-hundred-meter Aperture Spherical radio Telescope to observe the bright millisecond pulsar PSR B1937+21 (J1939+2134) and record the data in the band from 1.0 to 1.5 GHz. We measure the neutral hydrogen (HI) emission and absorption lines near 1420 MHz ($λ\simeq 21$ cm). We derive the kinematic distance of the pulsar with the HI observation. By comparing this with the archival absorption spectra observed decades ago, we notice possible variations in the absorption spectra toward this pulsar, which correspond to a possible tiny-scale atomic structure of a few astronomical units in size. We also verify the apparent faster-than-light anomalous dispersion at the HI absorption line of this pulsar previously reported.

astro-ph.HE↗

arXiv2025

Detecting Intermediate-mass Black Holes Using Miniature Pulsar Timing Arrays in Globular Clusters

Theoretical models predict that intermediate-mass black holes (IMBHs) exist in globular clusters (GCs), but observational evidence remains elusive. Millisecond pulsars (MSPs), which are abundant in GCs and have served as precise probes for gravitational waves (GWs), offer a unique opportunity to detect potential IMBH binaries in GCs. Here, we consider the possibility of using multiple MSPs in a GC to form a miniature pulsar timing array (PTA), so as to take advantage of their correlated timing residuals to search for potential IMBH binaries in the same cluster. Our semi-analytical calculations reveal that nearby IMBH binaries around MSPs in GCs could induce microsecond-level timing residuals. In GCs like $ω$ Centauri and M15, favorable configurations are found which could lead to the detection of binaries with mass ratios $q\gtrsim0.1$ and orbital periods of a few days. We estimate that future higher-precision timing programs could achieve $100$-nanosecond sensitivity, substantially expanding the searchable parameter space and establishing mini-PTAs as powerful detectors of IMBHs.

astro-ph.HE↗

arXiv2025

Simulation studies of a high-repetition-rate electron-driven surface muon beamline at SHINE

A high-repetition-rate pulsed muon source operating at approximately 50\,kHz holds the potential to improve the sensitivity of various particle physics and material science experiments involving muons. In this article, we propose utilizing the high-repetition-rate pulsed electron beam at the SHINE facility to generate a surface muon beam. Our simulation studies indicate that an 8\,GeV, 100\,pC charge pulsed electron beam impinging on a copper target can produce up to $2 \times 10^{3}$ muons per pulse. Beamline optimization results demonstrate that approximately 60 surface muons per electron bunch can be efficiently transported to the end of the beamline. This translates to a surface muon rate of $3 \times 10^{6}\,μ^{+}$/s when the pulsed electron beam is operated at 50\,kHz, which is comparable to existing muon facilities. This high-repetition-rate pulsed muon beam, with its ideal time structure, represents a unique and pioneering effort once constructed. It serves as a model for building cost-effective muon sources at existing electron machines with GeV electron energies. In addition to the typical challenges encountered in conventional muon beamlines, such as the installation and construction of the target station and beamline, the removal of substantial quantities of positrons is also a major challenge. A potential solution to this issue is also discussed.

physics.acc-ph↗

arXiv2025

The Chinese Pulsar Timing Array data release I. Single pulsar noise analysis

The Chinese Pulsar Timing Array (CPTA) has collected observations from 57 millisecond pulsars using the Five-hundred-meter Aperture Spherical Radio Telescope (FAST) for close to three years, for the purpose of searching for gravitational waves (GWs). To robustly search for ultra-low-frequency GWs, pulsar timing arrays (PTAs) need to use models to describe the noise from the individual pulsars. We report on the results from the single pulsar noise analysis of the CPTA data release I (DR1). Conventionally, power laws in the frequency domain are used to describe pulsar red noise and dispersion measurement (DM) variations over time. Employing Bayesian methods, we found the choice of number and range of frequency bins with the highest evidence for each pulsar individually. A comparison between a dataset using DM piecewise measured (DMX) values and a power-law Gaussian process to describe the DM variations shows strong Bayesian evidence in favour of the power-law model. Furthermore, we demonstrate that the constraints obtained from four independent software packages are very consistent with each other. The short time span of the CPTA DR1, paired with the large sensitivity of FAST, has proved to be a challenge for the conventional noise model using a power law. This mainly shows in the difficulty to separate different noise terms due to their covariances with each other. Nineteen pulsars are found to display covariances between the short-term white noise and long-term red and DM noise. With future CPTA datasets, we expect that the degeneracy can be broken. Finally, we compared the CPTA DR1 results against the noise properties found by other PTA collaborations. While we can see broad agreement, there is some tension between different PTA datasets for some of the overlapping pulsars. This could be due to the differences in the methods and frequency range compared to the other PTAs.

astro-ph.HE↗

arXiv2025

An Inclusive Foundation Model for Generalizable Cytogenetics in Precision Oncology

Chromosome analysis is vital for diagnosing genetic disorders and guiding cancer therapy decisions through the identification of somatic clonal aberrations. However, developing an AI model are hindered by the overwhelming complexity and diversity of chromosomal abnormalities, requiring extensive annotation efforts, while automated methods remain task-specific and lack generalizability due to the scarcity of comprehensive datasets spanning diverse resource conditions. Here, we introduce CHROMA, a foundation model for cytogenomics, designed to overcome these challenges by learning generalizable representations of chromosomal abnormalities. Pre-trained on over 84,000 specimens (~4 million chromosomal images) via self-supervised learning, CHROMA outperforms other methods across all types of abnormalities, even when trained on fewer labelled data and more imbalanced datasets. By facilitating comprehensive mapping of instability and clonal leisons across various aberration types, CHROMA offers a scalable and generalizable solution for reliable and automated clinical analysis, reducing the annotation workload for experts and advancing precision oncology through the early detection of rare genomic abnormalities, enabling broad clinical AI applications and making advanced genomic analysis more accessible.

q-bio.QM↗

arXiv2025

Self-evolving Agents with reflective and memory-augmented abilities

Large language models (LLMs) have made significant advances in the field of natural language processing, but they still face challenges such as continuous decision-making. In this research, we propose a novel framework by integrating iterative feedback, reflective mechanisms, and a memory optimization mechanism based on the Ebbinghaus forgetting curve, it significantly enhances the agents' capabilities in handling multi-tasking and long-span information.

cs.CL↗

arXiv2025

The Chinese pulsar timing array data release I. Polarimetry for 56 millisecond pulsars

We present polarization pulse profiles for 56 millisecond pulsars (MSPs) monitored by the Chinese Pulsar Timing Array (CPTA) collaboration using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The observations centered at 1.25 GHz with a raw bandwidth of 500 MHz. Due to the high sensitivity ($\sim$16 K/Jy) of the FAST telescope and our long integration time, the high signal-to-noise ratio polarization profiles show features hardly detected before. Among 56 pulsars, the polarization profiles of PSRs J0406$+$3039, J1327$+$3423, and J2022$+$2534 were not previously reported. 80\% of MSPs in the sample show weak components below 3\% of peak flux, 25\% of pulsars show interpulse-like structures, and most pulsars show linear polarization position angle jumps. Six pulsars seem to be emitting for full rotation phase, with another thirteen pulsars being good candidates for such a 360$^\circ$ radiator. We find that the distribution of the polarization percentage in our sample is compatible with the normal pulsar distribution. Our detailed evaluation of the MSP polarization properties suggests that the wave propagation effects in the pulsar magnetosphere are important in shaping the MSP polarization pulse profiles.

astro-ph.HE↗

arXiv2025

HOPE: A Reinforcement Learning-based Hybrid Policy Path Planner for Diverse Parking Scenarios

Automated parking stands as a highly anticipated application of autonomous driving technology. However, existing path planning methodologies fall short of addressing this need due to their incapability to handle the diverse and complex parking scenarios in reality. While non-learning methods provide reliable planning results, they are vulnerable to intricate occasions, whereas learning-based ones are good at exploration but unstable in converging to feasible solutions. To leverage the strengths of both approaches, we introduce Hybrid pOlicy Path plannEr (HOPE). This novel solution integrates a reinforcement learning agent with Reeds-Shepp curves, enabling effective planning across diverse scenarios. HOPE guides the exploration of the reinforcement learning agent by applying an action mask mechanism and employs a transformer to integrate the perceived environmental information with the mask. To facilitate the training and evaluation of the proposed planner, we propose a criterion for categorizing the difficulty level of parking scenarios based on space and obstacle distribution. Experimental results demonstrate that our approach outperforms typical rule-based algorithms and traditional reinforcement learning methods, showing higher planning success rates and generalization across various scenarios. We also conduct real-world experiments to verify the practicability of HOPE. The code for our solution is openly available on https://github.com/jiamiya/HOPE.

cs.RO↗