Searcharxiv⌕ Search

arXiv subjects

Yuchen Zhang

Publications and source records attributed to Yuchen Zhang.

At least 37 records · Page 2Linked to original sources

Tri-Hybrid Multi-User Precoding Using Pattern-Reconfigurable Antennas: Fundamental Models and Practical Algorithms

The integration of pattern-reconfigurable antennas into hybrid multiple-input multiple-output (MIMO) architectures presents a promising path toward high-efficiency and low-cost transceiver solutions. Pattern-reconfigurable antennas can dynamically steer per-antenna radiation patterns, enabling more efficient power utilization and interference suppression. In this work, we study a tri-hybrid MIMO architecture for multi-user communications that integrates digital, analog, and antenna-domain precoding using pattern-reconfigurable antennas. For characterizing the reconfigurability of antenna radiation patterns, we develop two models---Model~I and Model~II. Model~I captures realistic hardware constraints through limited pattern selection, while Model~II explores the performance upper bound by assuming arbitrary pattern generation. Based on these models, we develop two corresponding tri-hybrid precoding algorithms grounded in the weighted minimum mean square error (WMMSE) framework, which alternately optimize the digital, analog, and antenna precoders under practical per-antenna power constraints. Realistic simulations conducted in ray-tracing generated environments are utilized to evaluate the proposed system and algorithms. The results demonstrate the significant potential of the considered tri-hybrid architecture in enhancing communication performance and hardware efficiency. However, they also reveal that the existing hardware is not yet capable of fully realizing these performance gains, underscoring the need for joint progress in antenna design and communication theory development.

eess.SP↗

CLARA: Clip-Level Multimodal Alignment with VLM-Derived Rationales for Hateful Video Detection

Hateful video detection has become increasingly important with the rapid growth of video-centric social media platforms, given the serious risks that hate speech poses to both individual well-being and social cohesion. Compared with text or static multimodal content, hateful video detection remains underexplored and significantly more challenging, as hateful meaning often arises from complex interactions among multimodal cues, including speech, audio, and visual content. Moreover, such signals are often brief, implicit, and temporally dependent, making them difficult to capture using conventional video-level representations. In this work, we propose CLARA, a clip-level multimodal framework for hateful video detection. Instead of treating a video as a single instance, CLARA models it as a sequence of fine-grained clips, enabling more precise capture of temporally localized hateful signals. We introduce a Mixture-of-Experts clip encoder for adaptive multimodal alignment, a local-global segment contrastive objective to jointly model short-term cues and long-range temporal dependencies, and VLM-derived rationales integrated via a gated Transformer to provide high-level semantic guidance. Extensive experiments on three hateful video datasets demonstrate that CLARA consistently outperforms state-of-the-art methods. Further ablation studies and parameter analyses validate the effectiveness of each component.

cs.CV↗

Language Family Matters: Evaluating LLM-Based ASR Across Linguistic Boundaries

Large Language Model (LLM)-powered Automatic Speech Recognition (ASR) systems achieve strong performance with limited resources by linking a frozen speech encoder to a pretrained LLM via a lightweight connector. Prior work trains a separate connector per language, overlooking linguistic relatedness. We propose an efficient and novel connector-sharing strategy based on linguistic family membership, enabling one connector per family, and empirically validate its effectiveness across two multilingual LLMs and two real-world corpora spanning curated and crowd-sourced speech. Our results show that family-based connectors reduce parameter count while improving generalization across domains, offering a practical and scalable strategy for multilingual ASR deployment.

cs.CL↗

Speak in Context: Multilingual ASR with Speech Context Alignment via Contrastive Learning

Automatic speech recognition (ASR) has benefited from advances in pretrained speech and language models, yet most systems remain constrained to monolingual settings and short, isolated utterances. While recent efforts in context-aware ASR show promise, two key challenges persist: limited multilingual support and the absence of principled alignment between speech and contextual representations. In this paper, we introduce a context-aware multilingual ASR framework that supports diverse languages and accents while preserving the modularity of pretrained models. Our approach combines a frozen speech encoder and a decoder-only language model via a lightweight projection module, allowing structured context prompts, including dialogue history and biasing words, to guide transcription. To improve interaction between speech and context, we employ a contrastive learning objective that aligns their representations in a shared embedding space. Evaluations on over 1,500 hours of real-world conversational speech across 11 languages and 5 English dialects show that contextual input consistently improves recognition quality. Contrastive alignment provides additional gains when applied to different context types, with an overall performance gain of over 5%. These results highlight the importance of both contextual modeling and cross-modal alignment in multilingual ASR.

cs.CL↗

ReMP: Low-Downtime Runtime Model-Parallelism Reconfiguration for LLM Serving

Current large language model (LLM) inference systems universally deploy ultra-large-scale models using a combination of Tensor Parallelism (TP) and Pipeline Parallelism (PP). However, existing systems treat the model parallelism topology as a static configuration that cannot be flexibly adjusted at runtime. This rigid design creates a fundamental contradiction with the dynamically changing inference workloads in real-world scenarios. State-of-the-art systems lack online reconfiguration capabilities and can only switch configurations by restarting the service, resulting in several minutes of service interruption, KV cache loss, and prohibitive recomputation overhead. To address this problem, this paper presents ReMP, a runtime model parallelism reconfiguration framework that supports low downtime. ReMP achieves dynamic adjustment through three key techniques: (1) decoupling the model parallelism topology from runtime state to avoid full service reconstruction; (2) designing a two-dimensional KV cache migration mechanism to preserve reusable cache states after TP/PP changes; and (3) implementing end-to-end online reconfiguration. Experiments demonstrate that ReMP can complete most topology switches within 1-7 seconds on models ranging from 7B to 70B parameters, achieving speedups of tens to over a hundred times compared to the restart approach. Moreover, ReMP significantly outperforms fixed configurations under dynamic workloads, delivering superior performance in terms of TTFT, TPOT, and output throughput.

cs.DC↗

VOLA: Improving Open-World Driving by VLM-Based Semantic Attribute Prediction

Driving in the real world is open-world: a car may encounter a fallen mattress, a deer, or other objects outside its training data. Naming them is not enough. The system must know how to treat each region: can it drive over it, and how severe would a collision be? We therefore shift scene perception from category labels to dense action-relevant attributes, where each pixel is labeled by how it should affect motion rather than by object name. We instantiate this general formulation with two ordered attributes: 7-rank drivability and 5-rank vulnerability. We read Qwen3.5 image-token hidden states directly as a spatial semantic representation. A lightweight boundary-aware decoder then turns this coarse token grid into sharp full-resolution attribute maps. The whole process requires neither autoregressive text generation nor an external mask model such as SAM. We train on dense attribute labels built in CARLA and test transfer to real scenes and to novel obstacles never seen in training. We compare with vision-only segmenters trained on the same attributes and prompted VLM segmenters. Our model matches strong vision-only segmenters on familiar categories and improves transfer to real open-world anomalies, reaching 69.4% mean vulnerability-rank recall versus 57.1% for the best vision-only baseline and 53.9% for the best prompted VLM baseline. These results show that VLM image tokens provide useful semantic cues for transferring driving attributes to objects outside the training vocabulary.

cs.CV↗

AirFlow: Context Preserving and Multi-Rate State Modeling for Air Quality Forecasting

Accurate air quality forecasting is essential for public health and urban environmental management, but remains challenging because pollutant channels differ in periodicity and distribution drift, while their concentration trajectories contain both multi-scale dependencies and rapid changes. Recent methods have improved spatial dependency learning and meteorological covariate modeling. However, pollutant channels are still passed through the same normalization rule and temporal backbone, using a shared latent representation for channel-specific distributions and changes at different rates. To address this limitation, we propose AirFlow, a pollutant-aware dual-stream framework that operates on station multivariate observations without additional graph propagation or predefined signal decomposition. Specifically, AirFlow designs two novel blocks: (1) a statistic-guided normalization routing mechanism that selects a normalization path for each pollutant according to its 24-hour autocorrelation and distribution drift; and (2) a hierarchical dual-stream state model that combines multi-scale state space propagation with learnable response coefficients, where gated bidirectional cross-attention exchanges information and adaptively fuses the resulting representations. Experiments on real-world data from multiple cities show that AirFlow achieves the best performance in 34 of 36 metrics comparisons, with reductions of up to 11.11% root mean square error over the state-of-the-art baseline. AirFlow also requires only 0.0483M parameters and 0.0215G FLOPs, achieving high forecasting accuracy with low computational overhead.

cs.AI↗

Observational constraints on fractional holographic dark energy in the light of DESI DR2

Based on the fractional entropy from fractional quantum mechanics, fractional holographic dark energy (FHDE) has been proposed with the Hubble horizon as the IR cutoff (FHDEH). We extend this framework by adopting the future event horizon and the particle horizon as the IR cutoff, proposing the FHDEF and FHDEP models. Using the SN+OHD+DESI DR2 dataset to constrain these models, we find that all three models provide a marginally lower $χ^{2}_{min}$ compared to $Λ$CDM but without significant preference according to AIC and BIC. When CMB distance priors are included, the FHDEH and FHDEP models are strongly ruled out. We further analyze the cosmological evolution for these models, and find that only the FHDEF model predicts nearly identical evolutions of $Ω_{m}$ and $Ω_{de}$ to those of the $Λ$CDM model across cosmic history, but its deceleration parameter $q$ deviate from the $Λ$CDM model in the future, indicating richer late time dynamics beyond the standard $Λ$CDM cosmology.

gr-qc↗

Memorization Dynamics in Knowledge Distillation for Language Models

Knowledge Distillation (KD) is increasingly adopted to transfer capabilities from large language models to smaller ones, offering significant improvements in efficiency and utility while often surpassing standard fine-tuning. Beyond performance, KD is also explored as a privacy-preserving mechanism to mitigate the risk of training data leakage. While training data memorization has been extensively studied in standard pre-training and fine-tuning settings, its dynamics in a knowledge distillation setup remain poorly understood. In this work, we study memorization across the KD pipeline using three large language model (LLM) families (Pythia, OLMo-2, Qwen-3) and three datasets (FineWeb, Wikitext, Nemotron-CC-v2). We find: (1) distilled models memorize significantly less training data than standard fine-tuning (reducing memorization by more than 50%); (2) some examples are inherently easier to memorize and account for a large fraction of memorization during distillation (over ~95%); (3) student memorization is predictable prior to distillation using features based on zlib entropy, KL divergence, and perplexity; and (4) while soft and hard distillation have similar overall memorization rates, hard distillation poses a greater risk: it inherits $2.7\times$ more teacher-specific examples than soft distillation. Overall, we demonstrate that distillation can provide both improved generalization and reduced memorization risks compared to standard fine-tuning.

cs.CL↗

Science Edge Evaluation: SEE the Missing Step Toward Real Scientific Discovery

Large language models (LLMs) are increasingly involved in scientific discovery, yet it remains unclear whether they can support complex real laboratory science. Here we introduce Science Edge Evaluation (SEE), a multimodal benchmark of expert-curated questions grounded in peer-reviewed literature and experimental practice in chemistry, biology, and materials science. Evaluation of 19 multimodal large language models (MLLMs) shows that even the best-performing model reaches only 48.7% accuracy. Moreover, general-purpose models outperform science-specialized models on average. In the visual-agent evaluation, the use of tools increases the best accuracy to 52.7%. Tool use can expand the information available to models, but more information does not necessarily lead to reliable scientific reasoning. The key challenge is whether models can manage tool-derived information within the boundaries of the original experimental evidence. Together, these findings reveal that current MLLMs still cannot reliably make justified and evidence-bounded inferences from experimental results, which is an essential capability in real scientific discovery. Bridging this gap requires MLLMs to transition from explaining established scientific concepts to deriving novel and evidence-based insights from experimental data.

cs.AI↗

The Eloquence team submission for task 1 of MLC-SLM challenge

In this paper, we present our studies and experiments carried out for the task 1 of the Challenge and Workshop on Multilingual Conversational Speech Language Model (MLC-SLM), which focuses on advancing multilingual conversational speech recognition through the development of speech language models architectures. Given the increasing relevance of real-world conversational data for building robust Spoken Dialogue Systems, we explore three approaches to multilingual ASR. First, we conduct an evaluation of the official baseline to better understand its strengths and limitations, by training two projectors (linear and qformer) with different foundation models. Second we leverage the SLAM-ASR framework to train a custom multilingual linear projector. Finally we investigate the role of contrastive learning and the extended conversational context in enhancing the robustness of recognition.

cs.SD↗

Towards Unified Multimodal Misinformation Detection in Social Media: A Benchmark Dataset and Baseline

Detecting deceptive multimodal content on social media has become an increasingly important problem. Two major types of deception dominate: human-crafted misinformation (e.g., rumors and misleading posts) and AI-generated content produced by image synthesis models or vision-language models (VLMs). However, these two types are usually addressed as separate tasks. Consequently, existing models are often specialized for only one type of fake content. In real deployments, however, the fake-content type of an incoming multimodal post is typically unknown, which limits the practicality of such specialized systems. To study this setting, we build OmniFake, a benchmark with 98K samples that combines human-curated misinformation from existing resources with newly created AI-generated examples. To address this new task, we propose Unified Multimodal Fake Content Detection (UMFDet), a framework designed to handle both types of deception. UMFDet builds on a VLM backbone augmented with a Category-aware Mixture-of-Experts (CMoE) adapter to capture category-specific cues. We further introduce an Expert-wise Discriminative Regularization to enforce intra-expert compactness. In addition, cross-modal consistency alignment is proposed to improve the perceptual capability of experts for handling different deception types. Experiments show that UMFDet consistently outperforms competitive specialized baselines across both deception types.

cs.AI↗

Multi-User Localization via Active Sensing with Electromagnetically Reconfigurable Antennas

This paper investigates multi-user localization in uplink wireless systems assisted by electromagnetically reconfigurable antennas (ERAs). Unlike traditional localization schemes, we formulate an active sensing problem where a base station (BS) exploits historical pilot observations accumulated over previous sensing stages to adapt the shared ERA configuration and progressively refine position estimates. To capture both theoretical flexibility and practical hardware constraints, we establish a unified wideband geometric signal model accommodating two complementary ERA paradigms: a synthesis-based model utilizing spherical-harmonic basis functions, and a finite-state model based on measured radiation codebooks. Because analytically solving the resulting joint design problem is highly intractable due to the high-dimensional observation and the shared-aperture coupling among multiple users, we develop a learning-based active sensing framework. Specifically, pilot-matched wideband observations are compressed into compact user-wise features and sequentially accumulated by a long short-term memory (LSTM) module. These temporal features are then processed by a graph neural network (GNN) to capture multi-user shared-aperture coupling. Model-specific output heads generate either continuous synthesis coefficients or finite-state ERA selections, while a localization head produces stage-wise position estimates. Numerical results under a specific channel distribution show that the proposed ERA-assisted active sensing framework achieves progressive localization refinement across sensing stages and obtains better performance than conventional non-reconfigurable arrays and representative ablation baselines.

eess.SP↗

Dynamic Interaction-Aware and Causality-Disentangled Framework for Multimodal Sentiment Analysis

Although Multimodal Sentiment Analysis (MSA) effectively leverages rich information from language, visual, and acoustic modalities, existing methods still face two core challenges: 1) static conflict suppression mechanisms fail to adapt to dynamic variations across samples, and 2) the inherent sentimental bias within the language modality, which can misguide learning from other modalities, remains entangled. To this end, we propose a Dynamic Multimodal Causal Disentanglement and Adaptive Fusion Framework (MCAF). Its cornerstone is the Multi-Granularity Causal Dynamic Router and a Conditional Diffusion Denoising Module. First, we introduce a causal intervention module based on the information bottleneck principle, which builds a Structural Causal Model to disentangle sentimental bias from language features, yielding a "de-confounded" language representation as a pure guiding signal. Second, we devise a Dynamic Multimodal Router that evaluates the interaction states (complementary, conflicting, or redundant) among visual, acoustic, and de-confounded language signals in real-time across three levels: feature, temporal, and modality, then adaptively allocates weights and routes information flow for fine-grained regulation. Finally, a lightweight Conditional Diffusion Denoising Module performs iterative denoising on the fused joint representation to explicitly filter out residual irrelevant information, generating a robust hyper-modality representation. Extensive experiments on the CMU-MOSI and CMU-MOSEI benchmarks show that MCAF sets new state-of-the-art on key classification metrics, achieving an Acc-2/F1 of 86.52%/86.51% on MOSI and 86.72%/86.65% on MOSEI, while remaining highly competitive on others. Comprehensive analyses and visualizations further validate its efficacy in dynamically perceiving interactions, disentangling bias, and enhancing interpretability.

cs.MM↗

DSBench: A Comprehensive Benchmark for Evaluating External and In-Cabin Risks

Vision-Language Models (VLMs) show great promise for autonomous driving, but their suitability for safety-critical scenarios is largely unexplored, raising safety concerns. This issue arises from the lack of comprehensive benchmarks that assess both external environmental risks and in-cabin driving behavior safety simultaneously. To bridge this critical gap, we introduce DSBench, the first comprehensive Driving Safety Benchmark designed to assess a VLM's awareness of various safety risks in a unified manner. DSBench encompasses two major categories: external environmental risks and in-cabin driving behavior safety, divided into 10 key categories and a total of 28 sub-categories. This comprehensive evaluation covers a wide range of scenarios, ensuring a thorough assessment of VLMs' performance in safety-critical contexts. Extensive evaluations across various mainstream open-source and closed-source VLMs reveal significant performance degradation under complex safety-critical situations, highlighting urgent safety concerns. To address this, we constructed a large dataset of 98K instances focused on in-cabin and external safety scenarios, showing that fine-tuning on this dataset significantly enhances the safety performance of existing VLMs and paves the way for advancing autonomous driving technology. The benchmark toolkit, code, and model checkpoints will be publicly accessible.

cs.RO↗

Model predictive control for laser thermal processing: operator learning, closed-loop validation, and out-of-distribution analysis

Laser-based thermal processing, such as laser powder bed fusion, requires tight regulation of the peak surface temperature: heat accumulates where the moving source re-enters previously heated material, driving the temperature out of its process window and causing defects. High-fidelity thermal models capture this physics but are too slow for online optimization, which motivates fast, differentiable, and generalizable surrogates. We develop and validate a complete surrogate-based control pipeline that regulates the maximum surface temperature of a moving laser on a 304-stainless-steel substrate. We also determine conditions under which our surrogate can be trusted inside the control loop by probing its out-of-distribution limits. A key component of our surrogate is a multi-step deep operator network bespoke for moving sources: its branch subnetwork encodes the future power and trajectory (position and velocity) sequence, while its trunk encodes the current peak temperature and the temperature at the future laser locations, yielding a one-shot five-step prediction. By way of illustration, we use this surrogate as a smooth (algebraic-rectifier) nonlinear program inside a receding-horizon model predictive controller solved in CasADi/IPOPT. The surrogate forward pass is over thousand times faster than the equivalent finite-difference steps. We show that aggregate open-loop accuracy is necessary but not sufficient for control-readiness: two surrogates with near-identical offline error behave drastically differently in closed loop. A controlled two-ensemble data design reduces a 91 K path-corner underprediction failure to 1.4 K, and a calibrated one-sided constraint margin of 13 K yields zero violations of the true upper bound on all tested paths.

math.OC↗

Text-Driven 3D Indoor Scene Synthesis in Non-Manhattan Environments

Large Language Models (LLMs) have demonstrated remarkable capabilities in 3D indoor synthesis for Manhattan environments. However, existing methods often fail to capture plausible object layout patterns in non-Manhattan settings, primarily because they struggle to model non-orthogonal spatial relationships, leading to high geometric violations and low physical fidelity. To address this challenge, we propose SPG-Layout, a novel text-driven framework designed to generate physically plausible indoor scenes within complex non-Manhattan environments. Specifically, we first utilize statistical priors of object distributions to guide the training process, enhancing environmental understanding and fidelity. Furthermore, mirroring human design workflows, we adopt a hierarchical layout strategy that prioritizes the placement of large objects, thereby substantially minimizing layout violations. By synergizing these components, SPG-Layout achieves a balanced optimization of semantic realism and physical plausibility. To evaluate performance in these complex settings, we constructed a new benchmark comprising 500 diverse non-Manhattan environments. Extensive experiments demonstrate that SPG-Layout consistently and significantly outperforms existing methods across both Manhattan and non-Manhattan environments. The code will be publicly released.

cs.AI↗

Robust 3D Alignment of Generative Reconstructions via Partial Monocular Observations

Aligning generative 3D reconstructions with partial monocular observations is a critical but under-explored challenge in computer vision. This task is inherently ill-posed due to severe asymmetries between noisy, sparse monocular inputs and dense generative priors, whose scale ambiguity and geometric hallucinations, combined with the lack of initial overlap, render traditional registration pipelines ineffective. To resolve these issues, we propose a training-free and interpretable geometric alignment framework that grounds generative 3D priors via a 3D similarity transformation (Sim(3)), which can recover accurate metric scale and pose. Specifically, we introduce an explicit scale factor to resolve metric ambiguity and employ a coarse-to-fine alignment strategy, leveraging geometry-aware descriptors for robust initialization and a decoupled closed-form solver for precision refinement. In addition, we introduce a Hallucination Filtering operation to effectively suppress outliers caused by hallucinated geometry. To evaluate alignment performance under these extreme conditions, we introduce GenPMOAlign--Where2Place, a rigorous benchmark specifically designed for Generative-to-Partial Monocular Observational Alignment. Experiments demonstrate that our method achieves stable and accurate registration, substantially outperforming both classical geometric pipelines and state-of-the-art learning-based baselines. Code and the benchmark will be publicly released.

cs.CV↗