Search arXiv⌕ Search

arXiv subjects

Yang Chen

Publications and source records attributed to Yang Chen.

At least 253 records · Page 14Linked to original sources
arXiv2025

DTVM: Revolutionizing Smart Contract Execution with Determinism and Compatibility

We introduce the DeTerministic Virtual Machine (DTVM) Stack, a next-generation smart contract execution framework designed to address critical performance, determinism, and ecosystem compatibility challenges in blockchain networks. Building upon WebAssembly (Wasm) while maintaining full Ethereum Virtual Machine (EVM) ABI compatibility, DTVM introduces a Deterministic Middle Intermediate Representation (dMIR) and a hybrid lazy-JIT compilation engine to balance compilation speed and execution efficiency. DTVM further accommodates diverse instruction set architectures (e.g., EVM, RISC-V) through modular adaptation layers. This enables seamless integration with DTVM's hybrid lazy-JIT compilation engine, which dynamically optimizes performance while preserving deterministic execution guarantees across heterogeneous environments. The key contributions including: 1). The framework achieves up to 2$\times$ acceleration over evmone in dominant Ethereum contract (e.g. ERC20/721/1155) execution and reduces fibonacci computation latency by 11.8$\sim$40.5% compared to Wasm based VMs. 2). A novel trampoline hot-switch mechanism enables sub-millisecond (0.95ms) post-deployment invocation times, outperforming up to about 23$\times$ in compilation and invocation efficiency. 3). It supports multi-language development (Solidity, C++, Rust, Java, Go, and AssemblyScript) through unified bytecode conversion while maintaining EVM ABI compatibility for seamless invocation. It reduces machine code object sizes by 30.0$\sim$72.6%, coupled with a minimized Trusted Computing Base. 4). It offers SmartCogent, an AI-driven full-stack development experience, leveraging fine-tuned LLMs and retrieval-augmented generation to automate tasks across the smart contract lifecycle: development, debugging, security auditing, and deployment. DTVM Stack has been open-sourced (https://github.com/DTVMStack).

cs.DC↗
arXiv2025

Open Your Eyes: Vision Enhances Message Passing Neural Networks in Link Prediction

Message-passing graph neural networks (MPNNs) and structural features (SFs) are cornerstones for the link prediction task. However, as a common and intuitive mode of understanding, the potential of visual perception has been overlooked in the MPNN community. For the first time, we equip MPNNs with vision structural awareness by proposing an effective framework called Graph Vision Network (GVN), along with a more efficient variant (E-GVN). Extensive empirical results demonstrate that with the proposed frameworks, GVN consistently benefits from the vision enhancement across seven link prediction datasets, including challenging large-scale graphs. Such improvements are compatible with existing state-of-the-art (SOTA) methods and GVNs achieve new SOTA results, thereby underscoring a promising novel direction for link prediction.

cs.CV↗
arXiv2025

DynamicMind: A Tri-Mode Thinking System for Large Language Models

Modern large language models (LLMs) often struggle to dynamically adapt their reasoning depth to varying task complexities, leading to suboptimal performance or inefficient resource utilization. To address this, we introduce DynamicMind, a novel tri-mode thinking system. DynamicMind empowers LLMs to autonomously select between Fast, Normal, and Slow thinking modes for zero-shot question answering (ZSQA) tasks through cognitive-inspired prompt engineering. Our framework's core innovations include: (1) expanding the established dual-process framework of fast and slow thinking into a tri-mode thinking system involving a normal thinking mode to preserve the intrinsic capabilities of LLM; (2) proposing the Thinking Density metric, which aligns computational resource allocation with problem complexity; and (3) developing the Thinking Mode Capacity (TMC) dataset and a lightweight Mind Router to predict the optimal thinking mode. Extensive experiments across diverse mathematical, commonsense, and scientific QA benchmarks demonstrate that DynamicMind achieves superior ZSQA capabilities while establishing an effective trade-off between performance and computational efficiency.

cs.CL↗
arXiv2025

AceReason-Nemotron: Advancing Math and Code Reasoning through Reinforcement Learning

Despite recent progress in large-scale reinforcement learning (RL) for reasoning, the training recipe for building high-performing reasoning models remains elusive. Key implementation details of frontier models, such as DeepSeek-R1, including data curation strategies and RL training recipe, are often omitted. Moreover, recent research indicates distillation remains more effective than RL for smaller models. In this work, we demonstrate that large-scale RL can significantly enhance the reasoning capabilities of strong, small- and mid-sized models, achieving results that surpass those of state-of-the-art distillation-based models. We systematically study the RL training process through extensive ablations and propose a simple yet effective approach: first training on math-only prompts, then on code-only prompts. Notably, we find that math-only RL not only significantly enhances the performance of strong distilled models on math benchmarks (e.g., +14.6% / +17.2% on AIME 2025 for the 7B / 14B models), but also code reasoning tasks (e.g., +6.8% / +5.8% on LiveCodeBench for the 7B / 14B models). In addition, extended code-only RL iterations further improve performance on code benchmarks with minimal or no degradation in math results. We develop a robust data curation pipeline to collect challenging prompts with high-quality, verifiable answers and test cases to enable verification-based RL across both domains. Finally, we identify key experimental insights, including curriculum learning with progressively increasing response lengths and the stabilizing effect of on-policy parameter updates. We find that RL not only elicits the foundational reasoning capabilities acquired during pretraining and supervised fine-tuning (e.g., distillation), but also pushes the limits of the model's reasoning ability, enabling it to solve problems that were previously unsolvable.

cs.LG↗
arXiv2025

Advanced microwave photonic waveform editing: enabling the evolution of radar systems into joint radar and spectrum sensing systems

In response to the urgent demand for the development of future radar application platforms from single radar functionality towards integrated multi-functional systems, we show an advanced microwave photonic waveform editing method that enables the editing of arbitrary radar waveforms, equipping them with the capability to perform spectrum sensing. This, in turn, expands single-function radar systems into joint radar and spectrum sensing systems. We theoretically define and calculate the accumulation function of an arbitrary waveform after passing through a specific dispersive medium, and utilize this accumulation function to further design a corresponding binary sequence for editing the waveform. After editing, the accumulation function of the edited waveform approximates that of a linearly frequency-modulated signal matching the specific dispersive medium. Thus, the edited waveform can be compressed into a narrow pulse after passing through the dispersive medium, realizing the frequency-to-time mapping for achieving frequency measurement or time-frequency analysis. The concept is verified by a simulation and an experiment. Using a dispersion compensating fiber with a total dispersion of -6817 ps/nm, arbitrary waveforms, including a 7-bit Barker phase-coded waveform, a linearly frequency-modulated waveform, a nonlinearly frequency-modulated waveform, and a waveform with an "E" time-frequency diagram, are edited and further used for microwave frequency measurement and time-frequency analysis in an ultra-wide bandwidth of 36.8 GHz. The temporal resolution and frequency resolution are 2 ns and 0.86 GHz, respectively.

physics.optics↗
arXiv2025

Scalable Complexity Control Facilitates Reasoning Ability of LLMs

The reasoning ability of large language models (LLMs) has been rapidly advancing in recent years, attracting interest in more fundamental approaches that can reliably enhance their generalizability. This work demonstrates that model complexity control, conveniently implementable by adjusting the initialization rate and weight decay coefficient, improves the scaling law of LLMs consistently over varying model sizes and data sizes. This gain is further illustrated by comparing the benchmark performance of 2.4B models pretrained on 1T tokens with different complexity hyperparameters. Instead of fixing the initialization std, we found that a constant initialization rate (the exponent of std) enables the scaling law to descend faster in both model and data sizes. These results indicate that complexity control is a promising direction for the continual advancement of LLMs.

cs.LG↗
arXiv2025

HiDream-I1: A High-Efficient Image Generative Foundation Model with Sparse Diffusion Transformer

Recent advancements in image generative foundation models have prioritized quality improvements but often at the cost of increased computational complexity and inference latency. To address this critical trade-off, we introduce HiDream-I1, a new open-source image generative foundation model with 17B parameters that achieves state-of-the-art image generation quality within seconds. HiDream-I1 is constructed with a new sparse Diffusion Transformer (DiT) structure. Specifically, it starts with a dual-stream decoupled design of sparse DiT with dynamic Mixture-of-Experts (MoE) architecture, in which two separate encoders are first involved to independently process image and text tokens. Then, a single-stream sparse DiT structure with dynamic MoE architecture is adopted to trigger multi-model interaction for image generation in a cost-efficient manner. To support flexiable accessibility with varied model capabilities, we provide HiDream-I1 in three variants: HiDream-I1-Full, HiDream-I1-Dev, and HiDream-I1-Fast. Furthermore, we go beyond the typical text-to-image generation and remould HiDream-I1 with additional image conditions to perform precise, instruction-based editing on given images, yielding a new instruction-based image editing model namely HiDream-E1. Ultimately, by integrating text-to-image generation and instruction-based image editing, HiDream-I1 evolves to form a comprehensive image agent (HiDream-A1) capable of fully interactive image creation and refinement. To accelerate multi-modal AIGC research, we have open-sourced all the codes and model weights of HiDream-I1-Full, HiDream-I1-Dev, HiDream-I1-Fast, HiDream-E1 through our project websites: https://github.com/HiDream-ai/HiDream-I1 and https://github.com/HiDream-ai/HiDream-E1. All features can be directly experienced via https://vivago.ai/studio.

cs.CV↗
arXiv2025

Beyond Prompt Content: Enhancing LLM Performance via Content-Format Integrated Prompt Optimization

Large Language Models (LLMs) have shown significant capability across various tasks, with their real-world effectiveness often driven by prompt design. While recent research has focused on optimizing prompt content, the role of prompt formatting, a critical but often overlooked dimension, has received limited systematic investigation. In this paper, we introduce Content-Format Integrated Prompt Optimization (CFPO), an innovative methodology that jointly optimizes both prompt content and formatting through an iterative refinement process. CFPO leverages natural language mutations to explore content variations and employs a dynamic format exploration strategy that systematically evaluates diverse format options. Our extensive evaluations across multiple tasks and open-source LLMs demonstrate that CFPO demonstrates measurable performance improvements compared to content-only optimization methods. This highlights the importance of integrated content-format optimization and offers a practical, model-agnostic approach to enhancing LLM performance. Code is available at https://github.com/HenryLau7/CFPO.

cs.CL↗
arXiv2025

Fourier Low-rank and Sparse Tensor for Efficient Tensor Completion

Tensor completion is crucial in many scientific domains with missing data problems. Traditional low-rank tensor models, including CP, Tucker, and Tensor-Train, exploit low-dimensional structures to recover missing data. However, these methods often treat all tensor modes symmetrically, failing to capture the unique spatiotemporal patterns inherent in scientific data, where the temporal component exhibits both low-frequency stability and high-frequency variations. To address this, we propose a novel model, \underline{F}ourier \underline{Lo}w-rank and \underline{S}parse \underline{T}ensor (FLoST), which decomposes the tensor along the temporal dimension using a Fourier transform. This approach captures low-frequency components with low-rank matrices and high-frequency fluctuations with sparsity, resulting in a hybrid structure that efficiently models both smooth and localized variations. Compared to the well-known tubal-rank model, which assumes low-rankness across all frequency components, FLoST requires significantly fewer parameters, making it computationally more efficient, particularly when the time dimension is large. Through theoretical analysis and empirical experiments, we demonstrate that FLoST outperforms existing tensor completion models in terms of both accuracy and computational efficiency, offering a more interpretable solution for spatiotemporal data reconstruction.

cs.LG↗
arXiv2025

Driving with Context: Online Map Matching for Complex Roads Using Lane Markings and Scenario Recognition

Accurate online map matching is fundamental to vehicle navigation and the activation of intelligent driving functions. Current online map matching methods are prone to errors in complex road networks, especially in multilevel road area. To address this challenge, we propose an online Standard Definition (SD) map matching method by constructing a Hidden Markov Model (HMM) with multiple probability factors. Our proposed method can achieve accurate map matching even in complex road networks by carefully leveraging lane markings and scenario recognition in the designing of the probability factors. First, the lane markings are generated by a multi-lane tracking method and associated with the SD map using HMM to build an enriched SD map. In areas covered by the enriched SD map, the vehicle can re-localize itself by performing Iterative Closest Point (ICP) registration for the lane markings. Then, the probability factor accounting for the lane marking detection can be obtained using the association probability between adjacent lanes and roads. Second, the driving scenario recognition model is applied to generate the emission probability factor of scenario recognition, which improves the performance of map matching on elevated roads and ordinary urban roads underneath them. We validate our method through extensive road tests in Europe and China, and the experimental results show that our proposed method effectively improves the online map matching accuracy as compared to other existing methods, especially in multilevel road area. Specifically, the experiments show that our proposed method achieves $F_1$ scores of 98.04% and 94.60% on the Zenseact Open Dataset and test data of multilevel road areas in Shanghai respectively, significantly outperforming benchmark methods. The implementation is available at https://github.com/TRV-Lab/LMSR-OMM.

cs.CV↗
arXiv2025

Intensification of Oceanic Inverse Energy Cascade Under Global Warming

Kinetic energy (KE) cascade in the turbulent ocean is pivotal in connecting diverse scales of oceanic motions, redistributing energy, and influencing ocean circulation and climate variability. However, its response to global warming remains poorly understood. Using a 24-year satellite altimetry dataset, we identify a pronounced intensification of inverse geostrophic kinetic energy cascade at the sea surface across most ocean regions during 1994-2017, with cascade amplitude increasing by 1% to 2% per decade. This intensification occurs not only in energetic regions but also in expansive quiescent areas. Contributing factors to this intensification of geostrophic KE cascade include enhanced vertical shear of horizontal velocity, deepened mixed layer, strengthened stratification, weakened eddy killing as well as changes in the KE budget. The dominant factors vary across regions. Our findings offer new insights into the ocean's response to global warming and improve understanding of feedback mechanisms for ocean circulation changes.

physics.geo-ph↗
arXiv2025

Do We Truly Need So Many Samples? Multi-LLM Repeated Sampling Efficiently Scales Test-Time Compute

This paper presents a simple, effective, and cost-efficient strategy to improve LLM performance by scaling test-time compute. Our strategy builds upon the repeated-sampling-then-voting framework, with a novel twist: incorporating multiple models, even weaker ones, to leverage their complementary strengths that potentially arise from diverse training data and paradigms. By using consistency as a signal, our strategy dynamically switches between models. Theoretical analysis highlights the efficiency and performance advantages of our strategy. Extensive experiments on six datasets demonstrate that our strategy not only outperforms self-consistency and state-of-the-art multi-agent debate approaches, but also significantly reduces inference costs. Additionally, ModelSwitch requires only a few comparable LLMs to achieve optimal performance and can be extended with verification methods, demonstrating the potential of leveraging multiple LLMs in the generation-verification paradigm.

cs.AI↗
arXiv2025

Nearby open clusters with tidal features: golden sample selection and 3D structure

Open clusters offer unique opportunities to study stellar dynamics and evolution under the influence of their internal gravity, the Milky Way's gravitational field, and the interactions with encounters. Using the Gaia DR3 data for a catalog of open clusters within 500 parsecs that exhibit tidal features reported by the literature, we apply a novel method based on 3D principal component analysis to select a ``golden sample'' of nearby open clusters with minimal line-of-sight distortions. This approach ensures a systematic comparison of 3D and 2D structural parameters for tidally perturbed clusters. The selected golden sample includes Blanco 1, Melotte 20, Melotte 22, NGC 2632, NGC 7092, NGC 1662, Roslund 6 and Melotte 111. We analyze these clusters by fitting both 2D and 3D King Profiles to their stellar density distributions. Our results reveal systematic discrepancies: most of the golden sample clusters exhibit larger 3D tidal radii compared to their 2D counterparts, demonstrating that the 2D projection effects bias the measured cluster size. Furthermore, the 3D density profiles show stronger deviations from King profiles at the tidal radii ($Δρ_{\rm 3D} > Δρ_{\rm 2D}$), highlighting enhanced sensitivity to tidal disturbances. Additionally, we investigate the spatial distribution of cluster members relative to their bulk motion in the Galactic plane. We find that some clusters exhibit tidal features oriented perpendicular to their direction of motion, which can be attributed to the fact that the current surveys only detect the curved inner regions of the tidal features. In conclusion, this work offers a golden sample of nearby open clusters that are most reliable for 3D structure analysis and underscores the necessity of 3D analysis in characterizing OC morphological asymmetries, determining cluster size, and identifying tidal features.

astro-ph.GA↗
arXiv2025

Abstract Meaning Representation-Based Logic-Driven Data Augmentation for Logical Reasoning

Combining large language models with logical reasoning enhances their capacity to address problems in a robust and reliable manner. Nevertheless, the intricate nature of logical reasoning poses challenges when gathering reliable data from the web to build comprehensive training datasets, subsequently affecting performance on downstream tasks. To address this, we introduce a novel logic-driven data augmentation approach, AMR-LDA. AMR-LDA converts the original text into an Abstract Meaning Representation (AMR) graph, a structured semantic representation that encapsulates the logical structure of the sentence, upon which operations are performed to generate logically modified AMR graphs. The modified AMR graphs are subsequently converted back into text to create augmented data. Notably, our methodology is architecture-agnostic and enhances both generative large language models, such as GPT-3.5 and GPT-4, through prompt augmentation, and discriminative large language models through contrastive learning with logic-driven data augmentation. Empirical evidence underscores the efficacy of our proposed method with improvement in performance across seven downstream tasks, such as reading comprehension requiring logical reasoning, textual entailment, and natural language inference. Furthermore, our method leads on the ReClor leaderboard at https://eval.ai/web/challenges/challenge-page/503/leaderboard/1347. The source code and data are publicly available at https://github.com/Strong-AI-Lab/Logical-Equivalence-driven-AMR-Data-Augmentation-for-Representation-Learning.

cs.CL↗
arXiv2025

Reentrant phase transition in quasiperiodic photonic waveguides

Anderson transition in quasiperiodic potentials and the associated mobility edges have been a central focus in quantum simulation across multidisciplinary physical platforms. While these transitions have been experimentally observed in ultracold atoms, acoustic systems, optical waveguides, and superconducting junctions, their interplay between quasiperiodic potential and long-range hopping remains unexplored experimentally. In this work, we report the observation of localization-delocalization transition induced by the hopping between the next-nearest neighboring sites using quasiperiodic photonic waveguides. Our findings demonstrate that increasing the next-nearest hopping strength induces a reentrant phase transition, where the system transitions from an initially extended phase into a localized phase before eventually returning to an extended phase. This remarkable interplay between hopping and quasiperiodic potential in the lattice models provides crucial insights into the mechanism of Anderson transition. Furthermore, our numerical simulation reveals that this phase transition exhibits a critical exponent of $ν\simeq 1/3$, which is experimentally observable for system sizes $L\sim10^3$ - $10^4$. These results establish a framework for direct observation of the Anderson transition and precise determination of its critical exponents, which can significantly advance our understanding of localization physics in quasiperiodic systems.

cond-mat.mes-hall↗
arXiv2025

Hybrid and scalable photonic circuit cavity quantum electrodynamics

Similar to superconducting circuit quantum electrodynamics (cQED), the development of a photonic analog--specifically, photonic circuit cQED--has become a major focus in integrated quantum photonics. Current solid-state cQED devices, however, face scalability challenges due to the difficulty in simultaneously spectral tuning of cavity modes and quantum emitters while ensuring in-plane optical modes confinement for efficient on-chip light routing. Here, we overcome these limitations by proposing and demonstrating a hybrid solid-state cQED platform integrated on a chip. Our device integrates semiconducting quantum dots (QDs) with a thin-film lithium niobate (TFLN) microring resonator. Leveraging TFLN's ferroelectric and electro-optic (EO) properties, we implement local spectral tuning of both waveguide-coupled QDs and cavity modes. This approach achieves a broad spectral tuning range of up to 4.82 nm for individual QDs, enabling deterministic on-chip single-photon emission with a Purcell factor of 3.52. When combined with EO cavity tuning, we realize a spectrally tunable hybrid photonic circuit cQED device, sustaining near-constant Purcell factors of 1.89 over a 0.30 nm spectral range. This achievement enables scalable on-chip cavity-enhanced single-photon sources while preserving optical properties and maintaining compatibility with advanced photonic architectures, marking a significant step toward practical implementation of large-scale chip-based quantum networks.

quant-ph↗
arXiv2025

Strikingly high fraction of fast rotators in Magellanic Cloud star clusters

There has been growing evidence that the rich star clusters in the Magellanic Clouds contain significant fractions of rapidly rotating stars. In this work, we aim to constrain these fractions by studying the colour-magnitude diagrams of four star clusters, selected among those with the most striking signatures of fast rotators. Using isochrones derived from PARSEC v2.0 stellar tracks, we generate distinct stellar populations, each covering a limited interval of initial rotation rates $ω_\mathrm{i}$, referred to as 'Partial Models' (PMs). Using optimization algorithms and Monte Carlo Markov Chains, PMs are combined to create the final best-fitting model. In our analysis, we adopt two key assumptions: a uniform age and an isotropic distribution of stellar spin axes within each cluster. The solutions are allowed to explore the entire range of $ω_\mathrm{i}$, and different values of age, metallicity, distance and foreground extinction. We find that the rotational velocity distributions in all four clusters reveal a high fraction of stars with $ω_\mathrm{i}$ close to the break-up value, in all cases. Specifically, the fraction of stars with $ω_\mathrm{i}>0.7$ exceeds $80\%$ in the clusters NGC 419 of the Small Magellanic Cloud (SMC) and NGC 1831 and NGC 1866 of the Large Magellanic Cloud (LMC). For NGC 2203 of the LMC, this fraction is smaller, although it still exceeds $50\%$, confirming that also this cluster is mainly populated by fast-rotating stars.

astro-ph.GA↗