arXiv subjects

Jiaming Li

Publications and source records attributed to Jiaming Li.

At least 19 recordsLinked to original sources

arXiv2026

A Data-Efficient Analytical Prior Machine Learning Framework for Sound Reduction Frequency Prediction in Helmholtz Resonators

High-fidelity finite-element simulations can provide accurate numerical predictions for side-branch resonators, but large simulation datasets are expensive to generate and purely data-driven surrogates may become unreliable when simulation-labelled data are scarce. This study develops an analytical-prior learning framework that reuses a low-cost analytical model to improve data efficiency under limited high-fidelity simulation budgets. Two complementary routes are considered. When the analytical model remains available at inference, it is retained as an explicit baseline and the simulation data are used to learn only the analytical-to-simulation discrepancy. When a self-contained predictor is required, the analytical mapping is first distilled from abundant low-cost evaluations into a learned prior and then calibrated with the limited simulation data. The framework is evaluated on rectangular side-branch Helmholtz resonators using 86 simulation-labelled geometries and 8,998 non-overlapping analytical-only geometries. The analytical model achieved a mean absolute error (MAE) of 1.333 Hz. Direct support vector regression (SVR) achieved 3.375 Hz, while residual SVR reduced the MAE to 0.426 Hz. A direct multilayer perceptron (MLP) achieved 1.109 Hz, whereas analytical-prior pretraining reduced the error to 0.556 Hz with frozen-prior residual adaptation and 0.371 Hz with full-model fine-tuning. Across training budgets of 20 to 70 simulation-labelled cases, both analytical correction and analytical-prior pretraining consistently improved data efficiency relative to direct learning. These results show that analytical prior information can substantially improve high-fidelity prediction when simulation data are scarce, with explicit correction and prior distillation serving complementary deployment needs.

cs.LG↗

arXiv2026

Sinkhorn Linearization and the Spectral Proxy: Unifying the Statistical and Algorithmic Theory of Feature-Parameterized Inverse Optimal Transport via a Single Spectral Sandwich

We develop the statistical and algorithmic theory of inverse optimal transport (IOT) under the feature-parameterized cost C_theta(i,j) = -theta^T phi(i,j). The core technical contribution is the Sinkhorn linearization -- the implicit-function sensitivity of the entropic OT plan to the cost -- together with its spectral proxy, a formula that is spectrally exact yet geometrically transparent. The restricted Hessian on the tangent space satisfies the spectral sandwich (pi_min/epsilon) I <= H_T^{-1} <= (pi_max/epsilon) I, yielding the single core bound sigma_min >= (pi_min/(a_max epsilon)) sqrt(lambda_min(Sigma)) that drives the entire theory. On this core we establish four theorems and one observation. T1 (identifiability): theta is globally injective on the quotient of the gauge kernel, with dimension bound F <= (K-1)^2. T2 (sparsistency): the l1-penalized estimator recovers the true support under irrepresentability and score concentration, with exponential failure probability. T3 (well-posedness): the feature-moment map M(theta) = Phi^T x_theta is strongly monotone, and the inverse is Lipschitz with constant L <= epsilon ||Phi^T S_a||_op / (pi_min lambda_min(Sigma)). T4 (convergence): local strong convexity with mu >= pi_min^2 lambda_min(Sigma) / epsilon^2 guarantees monotone gradient descent convergence. O5 (misspecification): the estimator converges to the OT-model projection of the truth; the Holder continuity of the projection map is assessed numerically, yielding setting-dependent empirical exponents alpha_eff in (0,1).

stat.ML↗

arXiv2026

RA-FinBERT: Rule-aware LoRA adaptation for low-resource financial sentiment classification

Financial sentiment analysis converts unstructured financial news into quantitative signals that can support market analysis and decision-making. Existing work on resource-efficient financial NLP has largely focused on compressing or adapting pretrained language models, with less attention to combining contextual representations with lightweight rule-derived features. This study develops Rule-Aware FinBERT (RA-FinBERT), a parameter-efficient framework that integrates low-rank adaptation (LoRA) with three continuous VADER-derived sentiment proportions (positive, negative, and neutral) and a source-level metadata feature. The standardized four-dimensional feature vector is directly concatenated with the 768-dimensional final-layer FinBERT [CLS] representation and passed through a lightweight classification head. This design introduces only 1,024 additional trainable weights relative to a structurally matched text-only FinBERT model. RA-FinBERT was evaluated against text-only FinBERT and a lightweight DistilBERT baseline for three-class sentiment classification of financial-news titles and descriptions. On the held-out test set, RA-FinBERT achieved 69.89% accuracy and a macro F1 score of 0.634, compared with 63.44% and 0.526 for text-only FinBERT. Neutral-class recall increased from 18.18% to 45.45%. The framework supports both CPU and GPU execution, offering a lightweight and practical approach to financial sentiment classification under constrained computational resources. These findings indicate that rule-derived sentiment information and source metadata can provide complementary signals to contextual FinBERT representations and improve performance with minimal additional model complexity.

cs.CL↗

arXiv2026

Orca: The World is in Your Mind

We introduce Orca, an initial instantiation of a general world foundation model. Orca learns a unified world latent space from multimodal world signals and exposes it through multimodal readout interfaces. Rather than optimizing isolated next-token, next-frame, or next-action prediction, we are centered on Next-State-Prediction modeling, offering a unified state-transition modeling route toward understanding, predicting, and acting upon the world. Orca learns through two complementary paradigms: unconscious learning captures dense natural state transitions from continuous videos, and conscious learning models sparse meaningful state transitions by language-described events and VQA supervision. For pre-training, we construct a large-scale world-learning inventory data, including 125K hours of video data and 160M event annotations. After pre-training, Orca learns a unified world latent space. To examine whether the learned latent supports downstream, we evaluate it by three representative downstream readouts: text generation, image prediction, and embodied action generation. Orca's backbone is frozen, and only the lightweight modality-specific decoders are trainable. Experiments show the scalability of the proposed paradigm and verify that stronger world latent enables stronger downstream readouts. Orca outperforms similar-sized specialized baselines. These results show that Orca, as a general world foundation model, presents a promising approach to understanding, predicting, and acting upon the world. Finally, we discuss the current limitations, aiming to provide useful insights and inspiration for the community.

cs.CV↗

arXiv2026

TMPO: Trajectory Matching Policy Optimization for Diverse and Efficient Diffusion Alignment

Reinforcement learning (RL) has shown extraordinary potential in aligning diffusion models to downstream tasks, yet most of them still suffer from significant reward hacking, which degrades generative diversity and quality by inducing visual mode collapse and amplifying unreliable rewards. We identify the root cause as the mode-seeking nature of these methods, which maximize expected reward without effectively constraining probability distribution over acceptable trajectories, causing concentration on a few high-reward paths. In contrast, we propose Trajectory Matching Policy Optimization (TMPO), which replaces scalar reward maximization with trajectory-level reward distribution matching. Specifically, TMPO introduces a Softmax Trajectory Balance (Softmax-TB) objective to match the policy probabilities of K trajectories to a reward-induced Boltzmann distribution. We prove that this objective inherits the mode-covering property of forward KL divergence, preserving coverage over all acceptable trajectories while optimizing reward. To further reduce multi-trajectory training time on large-scale flow-matching models, TMPO incorporates Dynamic Stochastic Tree Sampling, where trajectories share denoising prefixes and branch at dynamically scheduled steps, reducing redundant computation while improving training effectiveness. Extensive results across diverse alignment tasks such as human preference, compositional generation and text rendering show that TMPO improves generative diversity over state-of-the-art methods by 9.1%, and achieves competitive performance in all downstream and efficiency metrics, attaining the optimal trade-off between reward and diversity.

cs.LG↗

arXiv2026

OASIS: On-Demand Hierarchical Event Memory for Streaming Video Reasoning

Streaming video reasoning requires models to operate in a setting where history grows without bound while meaningful evidence remains scarce. In such a landscape, relevant signal is like an oasis-small, critical, and easily lost in a desert of redundancy. Enlarging memory only widens the desert; aggressive compression dries up the oasis. The real difficulty lies in discovering where to look, not how much to remember. We therefore introduce OASIS, a novel framework for streaming video reasoning that tackles this challenge through structured, on-demand retrieval. It organizes streaming history into hierarchical events and performs reasoning as controlled refinement-short-context inference first, followed by semantically grounded retrieval only when uncertainty arises. As the retrieval is driven by high-level intent rather than embedding similarity, the retrieved memory is substantially more accurate and less noisy. Additionally, the mechanism is plug-and-play, training-free, and readily attaches to different streaming MLLM backbones. Experiments across multiple benchmarks and backbones show that OASIS achieves strong gains in long-horizon accuracy and compositional reasoning with bounded token cost and low request delay. Code is available at https://github.com/Solus-sano/OASIS.

cs.CV↗

arXiv2026

Edge-Side Residual Timing and Frequency Control for Software-Defined Ground Stations in 5G NTN Uplinks

This paper studies a ground-segment implementation problem in 5G non-terrestrial networks (NTN): once UE-side geometric pre-compensation has produced a coarse timing/frequency prior, can an edge-side residual loop keep the uplink inside an NR-feasible operating region under rapid LEO dynamics? We examine this question with a software-defined ground station (SDGS) design that keeps the coarse prior at the UE and closes the residual timing-advance (TA) / carrier-frequency-offset (CFO) loop at the ground-station edge. This paper takes a systems-and-control view rather than proposing a full-stack intelligent architecture. Its evidence base consists of a March 2026 hardware-in-the-loop (HIL) campaign and a companion uncertainty analysis. The HIL campaign includes same-window reference runs collected on the same platform with edge residual control disabled, but it does not include a cloud-loop benchmark. The placement claim is therefore architectural and control-oriented rather than a head-to-head cloud-versus-edge proof. In the Shenzhen steady-state tracking interval, the edge-controlled mode lowers mean RTT from 70.51 +/- 2.34 ms to 32.84 +/- 2.56 ms and, within the retained Layer-3 transport mapping, improves artifact-level goodput from 80.14 +/- 0.14 Mbps to 196.04 +/- 1.87 Mbps relative to that reference configuration. Across four ground-station locations, the closed-loop controller keeps residual TA P95 at 0.49 us and residual CFO P95 within 76-77 Hz. Together with the uncertainty analysis, these observations support a bounded claim: an edge-side residual timing/frequency loop can keep the SDGS uplink in a more stable NR-feasible operating regime under the assumptions retained in the current HIL artifact.

cs.NI↗

arXiv2026

GUIDED: Granular Understanding via Identification, Detection, and Discrimination for Fine-Grained Open-Vocabulary Object Detection

Fine-grained open-vocabulary object detection (FG-OVD) aims to detect novel object categories described by attribute-rich texts. While existing open-vocabulary detectors show promise at the base-category level, they underperform in fine-grained settings due to the semantic entanglement of subjects and attributes in pretrained vision-language model (VLM) embeddings -- leading to over-representation of attributes, mislocalization, and semantic drift in embedding space. We propose GUIDED, a decomposition framework specifically designed to address the semantic entanglement between subjects and attributes in fine-grained prompts. By separating object localization and fine-grained recognition into distinct pathways, HUIDED aligns each subtask with the module best suited for its respective roles. Specifically, given a fine-grained class name, we first use a language model to extract a coarse-grained subject and its descriptive attributes. Then the detector is guided solely by the subject embedding, ensuring stable localization unaffected by irrelevant or overrepresented attributes. To selectively retain helpful attributes, we introduce an attribute embedding fusion module that incorporates attribute information into detection queries in an attention-based manner. This mitigates over-representation while preserving discriminative power. Finally, a region-level attribute discrimination module compares each detected region against full fine-grained class names using a refined vision-language model with a projection head for improved alignment. Extensive experiments on FG-OVD and 3F-OVD benchmarks show that GUIDED achieves new state-of-the-art results, demonstrating the benefits of disentangled modeling and modular optimization. Our code will be released at https://github.com/lijm48/GUIDED.

cs.CV↗

arXiv2026

Orbital-Dependent Dimensional Crossover of a $p$-Wave Feshbach Resonance

We report the observation of a dimensional crossover of a $p$-wave Feshbach resonance in an ultracold, spin-polarized $^6$Li Fermi gas confined by a one-dimensional optical lattice. Using high-resolution atom-loss spectroscopy, we resolve the orbital doublet associated with the $\ml=0$ and $|\ml|=1$ scattering channels over a wide range of lattice depths. In the weak-confinement regime, the atom loss signal associated with the $|\ml|=1$ branch is stronger, consistent with the twofold orbital degeneracy of the three-dimensional system. As the lattice confinement increases, the relative loss weight of the two orbital branches evolves continuously toward the quasi-two-dimensional limit, indicating a progressive suppression of relative motion along the lattice direction. In addition, we observe a systematic confinement dependence of the orbital splitting between the two resonance branches. These results provide an experimental characterization of orbital-dependent $p$-wave scattering in reduced dimensions and motivate future microscopic studies of confined anisotropic scattering.

cond-mat.quant-gas↗

arXiv2026

RuCL: Stratified Rubric-Based Curriculum Learning for Multimodal Large Language Model Reasoning

Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a prevailing paradigm for enhancing reasoning in Multimodal Large Language Models (MLLMs). However, relying solely on outcome supervision risks reward hacking, where models learn spurious reasoning patterns to satisfy final answer checks. While recent rubric-based approaches offer fine-grained supervision signals, they suffer from high computational costs of instance-level generation and inefficient training dynamics caused by treating all rubrics as equally learnable. In this paper, we propose Stratified Rubric-based Curriculum Learning (RuCL), a novel framework that reformulates curriculum learning by shifting the focus from data selection to reward design. RuCL generates generalized rubrics for broad applicability and stratifies them based on the model's competence. By dynamically adjusting rubric weights during training, RuCL guides the model from mastering foundational perception to tackling advanced logical reasoning. Extensive experiments on various visual reasoning benchmarks show that RuCL yields a remarkable +7.83% average improvement over the Qwen2.5-VL-7B model, achieving a state-of-the-art accuracy of 60.06%.

cs.CL↗

arXiv2026

Learning Ordinal Probabilistic Reward from Preferences

Reward models are crucial for aligning large language models (LLMs) with human values and intentions. Existing approaches follow either Generative (GRMs) or Discriminative (DRMs) paradigms, yet both suffer from limitations: GRMs typically demand costly point-wise supervision, while DRMs produce uncalibrated relative scores that lack probabilistic interpretation. To address these challenges, we introduce a novel reward modeling paradigm: Probabilistic Reward Model (PRM). Instead of modeling reward as a deterministic scalar, our approach treats it as a random variable, learning a full probability distribution for the quality of each response. To make this paradigm practical, we present its closed-form, discrete realization: the Ordinal Probabilistic Reward Model (OPRM), which discretizes the quality score into a finite set of ordinal ratings. Building on OPRM, we propose a data-efficient training strategy called Region Flooding Tuning (RgFT). It enables rewards to better reflect absolute text quality by incorporating quality-level annotations, which guide the model to concentrate the probability mass within corresponding rating sub-regions. Experiments on various reward model benchmarks show that our method improves accuracy by $\textbf{2.9%}\sim\textbf{7.4%}$ compared to prior reward models, demonstrating strong performance and data efficiency. Analysis of the score distribution provides evidence that our method captures not only relative rankings but also absolute quality.

cs.CL↗

arXiv2026

Broadband Population Transfer Based on Suture Adiabatic Pulses

High-fidelity coherent population transfer plays a vital role in the realization of quantum memories. However, population transfer with high performance across a broad frequency range is still challenging due to the finite Rabi coupling strength limited by laser powers. Here we propose a novel population-transfer scheme by suturing adiabatic control pulses with each pulse covering certain frequency interval, which are connected in a way that neighboring adiabatic pulses have opposite chirping directions. Taking the widely utilized hyperbolic-square-hyperbolic pulse as an example, we demonstrate that rapid and robust population transfer can be achieved. The transfer bandwidth scales linearly with the number of suture pulses while maintaining high fidelity, even at the suture points where adiabaticity breaks down. Crucially, these pulses can be realized by a single laser by means of temporal multiplexing. For a given bandwidth, this strategy substantially reduces the operational time which is necessary for on demand read-out and suppressing decoherence effects. Our scheme enables a dramatic increase in multimode storage capacity and paves the way for realizing practical quantum networks.

quant-ph↗

arXiv2026

Semi-implicit Lax-Wendroff kinetic scheme for electron-phonon coupling

A semi-implicit Lax-Wendroff scheme is developed for electron-phonon coupling process in metals based on the two-temperature kinetic equations. The core of this method is to integrate the evolution information of physical equations into the numerical modeling process, which leads to that the time step or cell size is not limited by the relaxation time and mean free path. Specifically, the finite difference method is used to solve the kinetic model again when reconstructing the interfacial distribution function, through which the particle migration, scattering and electron-phonon coupling processes are coupled together within a single time step. Numerical tests demonstrate that this method could efficiently capture electron-phonon coupling or heat conduction processes from the ballistic to diffusive regimes. It provides a new tool for describing electron-phonon coupling or thermal management in microelectronic devices.

physics.comp-ph↗

arXiv2026

Burn-After-Use for Preventing Data Leakage through a Secure Multi-Tenant Architecture in Enterprise LLM

This study presents a Secure Multi-Tenant Architecture (SMTA) combined with a novel concept Burn-After-Use (BAU) mechanism for enterprise LLM environments to effectively prevent data leakage. As institutions increasingly adopt LLMs across departments, the risks of data leakage have become a critical security and compliance concern. The proposed SMTA isolates LLM instances across departments and enforces rigorous context ownership boundaries within an internally deployed infrastructure. The BAU mechanism introduces data confidentiality by enforcing ephemeral conversational contexts that are automatically destroyed after use, preventing cross-session or cross-user inference. The evaluation to SMTA and BAU is through two sets of realistic and reproducible experiments comprising of 127 test iterations. One aspect of this experiment is to assess prompt-based and semantic leakage attacks in a multi-tenant architecture (Appendix A) across 55 infrastructure-level attack tests, including vector-database credential compromise and shared logging pipeline exposure. SMTA achieves 92% defense success rate, demonstrating strong semantic isolation while highlighting residual risks from credential misconfiguration and observability pipelines. Another aspect is to evaluate the robustness of BAU under realistic failure scenarios (Appendix B) using four empirical metrics: Local Residual Persistence Rate (LRPR), Remote Residual Persistence Rate (RRPR), Image Frame Exposure Rate (IFER), and Burn Timer Persistence Rate (BTPR). Across 72 test iterations, BAU achieves a 76.75% success rate in mitigating post-session leakage threats across the client, server, application, infrastructure, and cache layers. These results show that SMTA and BAU together enforce strict isolation, complete session ephemerality, strong confidentiality guarantees, non-persistence, and policy-aligned behavior for enterprise LLMs.

cs.CR↗

arXiv2026

I2E: From Image Pixels to Actionable Interactive Environments for Text-Guided Image Editing

Existing text-guided image editing methods primarily rely on end-to-end pixel-level inpainting paradigm. Despite its success in simple scenarios, this paradigm still significantly struggles with compositional editing tasks that require precise local control and complex multi-object spatial reasoning. This paradigm is severely limited by 1) the implicit coupling of planning and execution, 2) the lack of object-level control granularity, and 3) the reliance on unstructured, pixel-centric modeling. To address these limitations, we propose I2E, a novel "Decompose-then-Action" paradigm that revisits image editing as an actionable interaction process within a structured environment. I2E utilizes a Decomposer to transform unstructured images into discrete, manipulable object layers and then introduces a physics-aware Vision-Language-Action Agent to parse complex instructions into a series of atomic actions via Chain-of-Thought reasoning. Further, we also construct I2E-Bench, a benchmark designed for multi-instance spatial reasoning and high-precision editing. Experimental results on I2E-Bench and multiple public benchmarks demonstrate that I2E significantly outperforms state-of-the-art methods in handling complex compositional instructions, maintaining physical plausibility, and ensuring multi-turn editing stability.

cs.CV↗

arXiv2026

Accelerating evaporative cooling of a strongly interacting Fermi gas by tilting the optical trap with a magnetic field gradient

We present a rapid evaporative cooling scheme for a strongly interacting $^{6}\mathrm{Li}$ Fermi gas in an optical dipole trap. The method uses a magnetic-field-gradient--induced tilt of the trapping potential to accelerate cooling in the unitarity-limited regime. In evaporation based only on lowering the optical trap depth, the unitarity-limited scattering cross section can support runaway cooling; however, the cooling rate slows around $T/T_F \simeq 0.5$, and the runaway behavior is no longer maintained. We improve on this approach by applying a magnetic-field gradient when the gas temperature reaches about half the Fermi temperature. The induced tilt opens an escape channel for energetic atoms while keeping the trap frequencies nearly unchanged. This modification increases the cooling speed and cools the gas below the superfluid transition temperature, reaching $T/T_F = 0.16$ on a timescale of $\sim 25\,\mathrm{ms}$. Our results provide a simple and robust route for rapidly cooling a strongly interacting Fermi gas into the superfluid regime, facilitating studies of the physics of unitary Fermi superfluids.

cond-mat.quant-gas↗

arXiv2025

Orbital-resolved three-body recombination across a p-wave Feshbach resonance in ultracold $^6$Li

We report precision, orbital-resolved measurements of three-body recombination near the 159~G $p$-wave Feshbach resonance in an ultracold gas of $^{6}$Li atoms prepared in their lowest hyperfine state. Using a radio-frequency gated protocol that suppresses magnetic-field transients below the milligauss level, we resolve loss features associated with the $|m_\ell|=1$ and $m_\ell=0$ orbital projections. The measured three-body loss coefficient $L_3$ is well captured by a thermally averaged cascade-recombination model, enabling extraction of the resonance splitting $\delta B$ and effective-range parameter $k_e$. At the lowest temperature, we obtain $\delta B = 7.6(3)$~mG and $k_e = 0.151(6)\,a_0^{-1}$, both in quantitative agreement with coupled-channel theory. These results establish orbital-resolved three-body spectroscopy as a precision probe of $p$-wave scattering and provide a benchmark for microscopic models of resonant few-body loss.

cond-mat.quant-gas↗

arXiv2025

VisionCAD: An Integration-Free Radiology Copilot Framework

Widespread clinical deployment of computer-aided diagnosis (CAD) systems is hindered by the challenge of integrating with existing hospital IT infrastructure. Here, we introduce VisionCAD, a vision-based radiological assistance framework that circumvents this barrier by capturing medical images directly from displays using a camera system. The framework operates through an automated pipeline that detects, restores, and analyzes on-screen medical images, transforming camera-captured visual data into diagnostic-quality images suitable for automated analysis and report generation. We validated VisionCAD across diverse medical imaging datasets, demonstrating that our modular architecture can flexibly utilize state-of-the-art diagnostic models for specific tasks. The system achieves diagnostic performance comparable to conventional CAD systems operating on original digital images, with an F1-score degradation typically less than 2\% across classification tasks, while natural language generation metrics for automated reports remain within 1\% of those derived from original images. By requiring only a camera device and standard computing resources, VisionCAD offers an accessible approach for AI-assisted diagnosis, enabling the deployment of diagnostic capabilities in diverse clinical settings without modifications to existing infrastructure.

cs.CV↗