arXiv subjects

Bin Zhang

Publications and source records attributed to Bin Zhang.

At least 73 records · Page 4Linked to original sources

arXiv2025

On the validity of intermediate tracing in multiple quantum interactions

Interactions between many (initially separate) quantum systems raise the question on how to prepare and how to compute the measurable results of their interaction. When one prepares each system individually and let them interact, one has to tensor multiply their density matrices and apply Hamiltonians on the composite system (i.e. the system which includes all the interacting systems) for definite time intervals. Evaluating the final state of one of the systems after multiple consecutive interactions, requires tracing all other systems out of the composite system, which may grow up to immense dimensions. For computation efficiency during the interaction(s) one may consider only the contemporary interacting partial systems, while tracing out the other non interacting systems. In concrete terms, the type of problems to which we direct this formulation is a ``target'' system interacting {\bf succesively} with ``incident'' systems, where the ``incident'' systems do not mutually interact. For example a two-level atom, interacting succesively with free electrons, or a resonant cavity interacting with radiatively free electrons, or a quantum dot interacting succesively with photons. We refer to a ``system'' as one of the components before interaction, while each interaction creates a ``composite system''. A new interaction of the ``composite system'' with another ``system'' creates a ``larger composite system'', unless we trace out one of the systems before this interaction. The scope of this work is to show that under proper conditions one may add a system to the composite system just before it interacts, and one may trace out this very system after it finishes to interact. We show in this work a mathematical proof of the above property and give a computational example.

quant-ph↗

arXiv2025

TimeFormer: Transformer with Attention Modulation Empowered by Temporal Characteristics for Time Series Forecasting

Although Transformers excel in natural language processing, their extension to time series forecasting remains challenging due to insufficient consideration of the differences between textual and temporal modalities. In this paper, we develop a novel Transformer architecture designed for time series data, aiming to maximize its representational capacity. We identify two key but often overlooked characteristics of time series: (1) unidirectional influence from the past to the future, and (2) the phenomenon of decaying influence over time. These characteristics are introduced to enhance the attention mechanism of Transformers. We propose TimeFormer, whose core innovation is a self-attention mechanism with two modulation terms (MoSA), designed to capture these temporal priors of time series under the constraints of the Hawkes process and causal masking. Additionally, TimeFormer introduces a framework based on multi-scale and subsequence analysis to capture semantic dependencies at different temporal scales, enriching the temporal dependencies. Extensive experiments conducted on multiple real-world datasets show that TimeFormer significantly outperforms state-of-the-art methods, achieving up to a 7.45% reduction in MSE compared to the best baseline and setting new benchmarks on 94.04\% of evaluation metrics. Moreover, we demonstrate that the MoSA mechanism can be broadly applied to enhance the performance of other Transformer-based models.

cs.LG↗

arXiv2025

OpusAnimation: Code-Based Dynamic Chart Generation

Dynamic Chart Generation (DCG) involves producing code-rendered animated visualizations as charts. While recent advances in multi-modal large language models (MLLMs) have significantly improved their capability on static chart generation and comprehension, MLLMs' potential for handling dynamic chart generation and understanding remains underexplored. To bridge this research gap, we introduce DCG-Bench (Dynamic Chart Generation Benchmark), the first benchmark evaluating MLLM's capability on dynamic chart generation tasks from three dimensions: Simple Text-to-Chart, Detailed Text-to-Chart, and Video-to-Chart tasks. We construct DCG-8K, a high-quality DCG dataset with annotations covering instruction-code-video triplets and QA pairs for both code and video evaluation. Based on DCG-8K, we explored a two-stage training recipe, proposing Joint-Code-Visual Reward for group relative policy optimization to construct expert MLLM Qwen2.5-VL-DCG-3B for the DCG task. Our benchmarking result reveals shortcomings of existing MLLMs in the visual-to-chart task, and our model beats the best open-sourced MLLM with an average 8.31% performance gain across three tasks, and shows on par performance against proprietary models with only 3B parameters, proving the effectiveness of our training recipe. Our code and dataset will be publicly available.

cs.CV↗

arXiv2025

PPD-CPP: Pointwise predictive density calibrated-power prior in dynamically borrowing historical information

Incorporating historical or real-world data into analyses of treatment effects for rare diseases has become increasingly popular. A major challenge, however, lies in determining the appropriate degree of congruence between historical and current data. In this study, we devote ourselves to the capacity of historical data in replicating the current data, and propose a new congruence measure/estimand $p_{CM}$. $p_{CM}$ quantifies the heterogeneity between two datasets following the idea of the marginal posterior predictive $p$-value, and its asymptotic properties were derived. Building upon $p_{CM}$, we develop the pointwise predictive density calibrated-power prior (PPD-CPP) to dynamically leverage historical information. PPD-CPP achieves the borrowing consistency and allows modeling the power parameter either as a fixed scalar or case-specific quantity informed by covariates. Simulation studies were conducted to demonstrate the performance of these methods and the methodology was illustrated using the Mother's Gift study and \textit{Ceriodaphnia dubia} toxicity test.

stat.ME↗

arXiv2025

50 mm $\times$ 50 mm Cesium Atomic Vapor Cell for Terahertz Imaging: Implementation and Application

Rydberg atomic sensors offer transformative potential for high-speed, high-sensitivity terahertz (THz) imaging. However, previous systems are hindered by restricted imaging areas, largely due to the compact dimension of atomic vapor cells and inefficient beam-shaping methodologies. We present a THz imaging system with a 50 mm $\times$ 50 mm area, enabled by a custom-engineered scaled-up atomic vapor cell and an optimized beam-shaping optical architecture. Experimental validation confirms that this system achieves near-diffraction-limited, high resolution THz imaging at 0.55 THz under ambient conditions. Furthermore, its capabilities are demonstrated through real-time visualization of the diffusion dynamics of a deionized water droplet in anhydrous ethanol. This work not only expands the boundaries of Rydberg atomic sensors but also establishes a critical foundation for advancing THz imaging technologies toward into real-world, large-scale applications.

physics.optics↗

arXiv2025

Qwen3-Omni Technical Report

We present Qwen3-Omni, a single multimodal model that, for the first time, maintains state-of-the-art performance across text, image, audio, and video without any degradation relative to single-modal counterparts. Qwen3-Omni matches the performance of same-sized single-modal models within the Qwen series and excels particularly on audio tasks. Across 36 audio and audio-visual benchmarks, Qwen3-Omni achieves open-source SOTA on 32 benchmarks and overall SOTA on 22, outperforming strong closed-source models such as Gemini-2.5-Pro, Seed-ASR, and GPT-4o-Transcribe. Qwen3-Omni adopts a Thinker-Talker MoE architecture that unifies perception and generation across text, images, audio, and video, yielding fluent text and natural real-time speech. It supports text interaction in 119 languages, speech understanding in 19 languages, and speech generation in 10 languages. To reduce first-packet latency in streaming synthesis, Talker autoregressively predicts discrete speech codecs using a multi-codebook scheme. Leveraging the representational capacity of these codebooks, we replace computationally intensive block-wise diffusion with a lightweight causal ConvNet, enabling streaming from the first codec frame. In cold-start settings, Qwen3-Omni achieves a theoretical end-to-end first-packet latency of 234 ms. To further strengthen multimodal reasoning, we introduce a Thinking model that explicitly reasons over inputs from any modality. Since the research community currently lacks a general-purpose audio captioning model, we fine-tuned Qwen3-Omni-30B-A3B to obtain Qwen3-Omni-30B-A3B-Captioner, which produces detailed, low-hallucination captions for arbitrary audio inputs. Qwen3-Omni-30B-A3B, Qwen3-Omni-30B-A3B-Thinking, and Qwen3-Omni-30B-A3B-Captioner are publicly released under the Apache 2.0 license.

cs.CL↗

arXiv2025

OneRec Technical Report

Recommender systems have been widely used in various large-scale user-oriented platforms for many years. However, compared to the rapid developments in the AI community, recommendation systems have not achieved a breakthrough in recent years. For instance, they still rely on a multi-stage cascaded architecture rather than an end-to-end approach, leading to computational fragmentation and optimization inconsistencies, and hindering the effective application of key breakthrough technologies from the AI community in recommendation scenarios. To address these issues, we propose OneRec, which reshapes the recommendation system through an end-to-end generative approach and achieves promising results. Firstly, we have enhanced the computational FLOPs of the current recommendation model by 10 $\times$ and have identified the scaling laws for recommendations within certain boundaries. Secondly, reinforcement learning techniques, previously difficult to apply for optimizing recommendations, show significant potential in this framework. Lastly, through infrastructure optimizations, we have achieved 23.7% and 28.8% Model FLOPs Utilization (MFU) on flagship GPUs during training and inference, respectively, aligning closely with the LLM community. This architecture significantly reduces communication and storage overhead, resulting in operating expense that is only 10.6% of traditional recommendation pipelines. Deployed in Kuaishou/Kuaishou Lite APP, it handles 25% of total queries per second, enhancing overall App Stay Time by 0.54% and 1.24%, respectively. Additionally, we have observed significant increases in metrics such as 7-day Lifetime, which is a crucial indicator of recommendation experience. We also provide practical lessons and insights derived from developing, optimizing, and maintaining a production-scale recommendation system with significant real-world impact.

cs.IR↗

arXiv2025

SolarSeer: Ultrafast and accurate 24-hour solar irradiance forecasts outperforming numerical weather prediction across the USA

Accurate 24-hour solar irradiance forecasting is essential for the safe and economic operation of solar photovoltaic systems. Traditional numerical weather prediction (NWP) models represent the state-of-the-art in forecasting performance but rely on computationally costly data assimilation and solving complicated partial differential equations (PDEs) that simulate atmospheric physics. Here, we introduce SolarSeer, an end-to-end large artificial intelligence (AI) model for solar irradiance forecasting across the Contiguous United States (CONUS). SolarSeer is designed to directly map the historical satellite observations to future forecasts, eliminating the computational overhead of data assimilation and PDEs solving. This efficiency allows SolarSeer to operate over 1,500 times faster than traditional NWP, generating 24-hour cloud cover and solar irradiance forecasts for the CONUS at 5-kilometer resolution in under 3 seconds. Compared with the state-of-the-art NWP in the CONUS, i.e., High-Resolution Rapid Refresh (HRRR), SolarSeer significantly reduces the root mean squared error of solar irradiance forecasting by 27.28% in reanalysis data and 15.35% across 1,800 stations. SolarSeer also effectively captures solar irradiance fluctuations and significantly enhances the first-order irradiance difference forecasting accuracy. SolarSeer's ultrafast, accurate 24-hour solar irradiance forecasts provide strong support for the transition to sustainable, net-zero energy systems.

cs.LG↗

arXiv2025

Ultrafast Stern-Gerlach and Anomalous Bragg Diffraction Regimes of Low-energy Free Electron Interaction with Light

Recent advances in photon-induced near-field electron microscopy (PINEM) have significantly impacted allied disciplines such as laser-driven accelerators and free electron radiations, collectively fostering the emergence of free-electron quantum optics (FEQO). A central objective of FEQO is to achieve coherent optical control of free electrons, analogous to light manipulation of atoms in atom optics. Motivated by this analogy, we propose an ultrafast Stern-Gerlach (USG) regime for low-energy quantum electron wavepacket (QEW), which crucially incorporates the effects of second-order dispersion inherent to slow electrons. We demonstrate that the USG diffraction induces spectral splitting and shifting of the QEW via a longitudinal electric field gradient, with the two dominant truncated sidebands forming a pseudospin degree of freedom for an effective "two-level" electron. Furthermore, by examining the wave-particle duality of the QEW during light interaction, we identify a dispersion-induced anomalous Bragg diffraction regime. This regime exhibits a distinct spectral pattern, differentiating it from these reported PINEM (Raman-Nath), dielectric laser accelerators (DLA), anomalous PINEM, and Bragg diffraction regimes. Our study provides a comprehensive classification for light-induced diffraction regimes for both swift and slow electrons. These findings underscore the pivotal role of slow-electron dispersion and duality nature in free-electron optics, offering promising avenues for electron wavefunction quantum engineering ultrafast interferometers.

quant-ph↗

arXiv2025

Extreme-ultraviolet laser generation at 118 nm via adaptive random additional periodic-phase engineering in a LiF crystal

Extreme ultraviolet (EUV) coherent sources below 120nm are of paramount significance for promoting next-generation nano-scale lithography,precision spectroscopy, and exploring the emerging physical phenomena in quantum materials. Nonlinear optical conversion serves as the only feasible approach to obtain solid state EUV lasers, yet the intrinsic strong absorption at EUV and giant phase mismatch among light waves have hindered the realization of highly-efficient EUV light sources. Herein, we propose a random additional periodic phase (RAPP) strategy in third-order nonlinear crystals to overcome these problems, that an artificially designed random phase grating at micrometer-scales is embedded in the homogeneous bulk crystal, thus adaptively compensating the phase mismatch between fundamental-wave and third-harmonic waves. For the first time, the EUV laser at 118nm is demonstrated in the RAPP lithium fluoride (LiF) crystals with wide period distributions, where the highest output power is over 90uW. To the best our knowledge, this is the shortest wavelength among all solid-state laser systems, which represents a significant advance in nonlinear optical materials and opens new roadmap toward high-brightness EUV sources.

physics.optics↗

arXiv2025

DisMS-TS: Eliminating Redundant Multi-Scale Features for Time Series Classification

Real-world time series typically exhibit complex temporal variations, making the time series classification task notably challenging. Recent advancements have demonstrated the potential of multi-scale analysis approaches, which provide an effective solution for capturing these complex temporal patterns. However, existing multi-scale analysis-based time series prediction methods fail to eliminate redundant scale-shared features across multi-scale time series, resulting in the model over- or under-focusing on scale-shared features. To address this issue, we propose a novel end-to-end Disentangled Multi-Scale framework for Time Series classification (DisMS-TS). The core idea of DisMS-TS is to eliminate redundant shared features in multi-scale time series, thereby improving prediction performance. Specifically, we propose a temporal disentanglement module to capture scale-shared and scale-specific temporal representations, respectively. Subsequently, to effectively learn both scale-shared and scale-specific temporal representations, we introduce two regularization terms that ensure the consistency of scale-shared representations and the disparity of scale-specific representations across all temporal scales. Extensive experiments conducted on multiple datasets validate the superiority of DisMS-TS over its competitive baselines, with the accuracy improvement up to 9.71%.

cs.AI↗

arXiv2025

Indirect multiphoton scattering between light and bulk plasmons via ultrafast free electrons

Efficient coupling between light and bulk plasmons (BPs) remains a central challenge because of their inherent mode mismatch, limited penetration depth, and pronounced resonant energy mismatch between visible-range photons and BPs. In this work, we demonstrate that ultrafast free electrons can coherently mediate an interaction between electromagnetic fields and BPs at the nanoscale. An electron pulse emitted from the photocathode of ultrafast transmission electron microscope, functions as a quantum intermediary that is capable of simultaneously interacting with the laser field by multiphoton processes and BPs by perturbative scattering. Electron energy-loss spectroscopy can capture this indirect interaction, the final electron energy distribution encodes both quantum pathways arising from distinct combinations of multiphoton absorption and emission and BP scattering events. Interference among these pathways gives rise to characteristic spectral modulations, directly revealing the exchange of energy and information between photons and BPs via the electron delivery. Our results show that femtosecond-driven, ultrafast electrons provide a viable route to modulate and even control bulk plasmon excitations in a volume, thereby extending beyond the conventional nanoplasmonics schemes on manipulating surface plasmons by light. This indirect light-BP interaction paves the promising way for exploring fundamental light-matter interaction at ultrafast and nanometer scales.

physics.optics↗

arXiv2025

Gamma-Ray Bursts Calibrated by Using Artificial Neural Networks from the Pantheon+ Sample

In this paper, we calibrate the luminosity relation of gamma-ray bursts (GRBs) by Artificial Neural Networks (ANN) which is employed to analyze the Pantheon+ sample of type Ia supernovae (SNe Ia) in a manner independent of cosmological assumptions. The A219 GRB dataset are used to calibrate the Amati relation ($E_{\rm p}$-$E_{\rm iso}$) at low redshift with the ANN framework, facilitating the construction of the Hubble diagram at higher redshifts. Cosmological models are constrained with GRBs at high-redshift and the latest observational Hubble data (OHD) via a Markov Chain Monte Carlo numerical approach. For the Chevallier-Polarski-Linder (CPL) model within a flat universe, we obtain $Ω_{\rm m} = 0.321^{+0.078}_{-0.069}$, $h = 0.654^{+0.053}_{-0.071}$, $w_0 = -1.02^{+0.67}_{-0.50}$, and $w_a = -0.98^{+0.58}_{-0.58}$ at the 1-$σ$ confidence level, which indicating a preference for dark energy with potential redshift evolution ($w_a \neq 0$). These findings by using ANN align closely with those derived from GRBs calibrated by using Gaussian Processes.

astro-ph.CO↗

arXiv2025

Accurate and Efficient Fetal Birth Weight Estimation from 3D Ultrasound

Accurate fetal birth weight (FBW) estimation is essential for optimizing delivery decisions and reducing perinatal mortality. However, clinical methods for FBW estimation are inefficient, operator-dependent, and challenging to apply in cases of complex fetal anatomy. Existing deep learning methods are based on 2D standard ultrasound (US) images or videos that lack spatial information, limiting their prediction accuracy. In this study, we propose the first method for directly estimating FBW from 3D fetal US volumes. Our approach integrates a multi-scale feature fusion network (MFFN) and a synthetic sample-based learning framework (SSLF). The MFFN effectively extracts and fuses multi-scale features under sparse supervision by incorporating channel attention, spatial attention, and a ranking-based loss function. SSLF generates synthetic samples by simply combining fetal head and abdomen data from different fetuses, utilizing semi-supervised learning to improve prediction performance. Experimental results demonstrate that our method achieves superior performance, with a mean absolute error of $166.4\pm155.9$ $g$ and a mean absolute percentage error of $5.1\pm4.6$%, outperforming existing methods and approaching the accuracy of a senior doctor. Code is available at: https://github.com/Qioy-i/EFW.

eess.IV↗

arXiv2025

MoQAE: Mixed-Precision Quantization for Long-Context LLM Inference via Mixture of Quantization-Aware Experts

One of the primary challenges in optimizing large language models (LLMs) for long-context inference lies in the high memory consumption of the Key-Value (KV) cache. Existing approaches, such as quantization, have demonstrated promising results in reducing memory usage. However, current quantization methods cannot take both effectiveness and efficiency into account. In this paper, we propose MoQAE, a novel mixed-precision quantization method via mixture of quantization-aware experts. First, we view different quantization bit-width configurations as experts and use the traditional mixture of experts (MoE) method to select the optimal configuration. To avoid the inefficiency caused by inputting tokens one by one into the router in the traditional MoE method, we input the tokens into the router chunk by chunk. Second, we design a lightweight router-only fine-tuning process to train MoQAE with a comprehensive loss to learn the trade-off between model accuracy and memory usage. Finally, we introduce a routing freezing (RF) and a routing sharing (RS) mechanism to further reduce the inference overhead. Extensive experiments on multiple benchmark datasets demonstrate that our method outperforms state-of-the-art KV cache quantization approaches in both efficiency and effectiveness.

cs.CV↗

arXiv2025

Hopf algebras for the shuffle algebra and fractions from multiple zeta values

The algebra of multiple zeta values (MZVs) is encoded as a stuffle (quasi-shuffle) algebra and a shuffle algebra. The MZV stuffle algebra has a natural Hopf algebra structure. This paper equips a Hopf algebra structure to the MZV shuffle algebra. The needed coproduct is defined by a recursion through a family of weight-increasing linear operators. To verify the Hopf algebra axioms, we make use of a family of fractions, called Chen fractions, that have been used to study MZVs and also serve as the function model for the MZV shuffle algebra. Applying natural derivations on functions and working in the context of locality, a locality Hopf algebra structure is established on the linear span of Chen fractions. This locality Hopf algebra is then shown to descend to a Hopf algebra on the MZV shuffle algebra, whose coproduct satisfies the same recursion as the first-defined coproduct. Thus the two coproducts coincide, establishing the needed Hopf algebra axioms on the MZV shuffle algebra.

math.NT↗

arXiv2025

Extended Shuffle Product for Multiple Zeta Values

The shuffle algebra on positive integers encodes the usual multiple zeta values (MZVs) (with positive arguments) thanks to the representations of MZVs by iterated Chen integrals of Kontsevich. Together with the quasi-shuffle (stuffle) algebra, it provides the algebraic framework to study relations among MZVs. This paper enlarges the shuffle algebra uniquely to what we call the extended shuffle algebra that encodes convergent multiple zeta series with arbitrary integer arguments, not just the positive ones in the usual case. To achieved this goal, we first replace the Rota-Baxter operator of weight zero (the integral operator) that characterizes the shuffle product by the differential operator which extends the shuffle product to the larger space. We then show that the subspace corresponding to the convergent MZVs with integer arguments becomes a subalgebra under this extended shuffle product. Furthermore, by lifting the extended shuffle algebra to the locality algebra of Chen symbols, we prove that taking summations of fractions from Chen symbols defines an algebra homomorphism from the above subalgebra to the subalgebra of real numbers spanned by convergent multiple zeta series.

math.NT↗

arXiv2025

QPO: Query-dependent Prompt Optimization via Multi-Loop Offline Reinforcement Learning

Prompt engineering has demonstrated remarkable success in enhancing the performance of large language models (LLMs) across diverse tasks. However, most existing prompt optimization methods only focus on the task-level performance, overlooking the importance of query-preferred prompts, which leads to suboptimal performances. Additionally, these methods rely heavily on frequent interactions with LLMs to obtain feedback for guiding the optimization process, incurring substantial redundant interaction costs. In this paper, we introduce Query-dependent Prompt Optimization (QPO), which leverages multi-loop offline reinforcement learning to iteratively fine-tune a small pretrained language model to generate optimal prompts tailored to the input queries, thus significantly improving the prompting effect on the large target LLM. We derive insights from offline prompting demonstration data, which already exists in large quantities as a by-product of benchmarking diverse prompts on open-sourced tasks, thereby circumventing the expenses of online interactions. Furthermore, we continuously augment the offline dataset with the generated prompts in each loop, as the prompts from the fine-tuned model are supposed to outperform the source prompts in the original dataset. These iterative loops bootstrap the model towards generating optimal prompts. Experiments on various LLM scales and diverse NLP and math tasks demonstrate the efficacy and cost-efficiency of our method in both zero-shot and few-shot scenarios.

cs.AI↗