Searcharxiv⌕ Search

arXiv subjects

Min Li

Publications and source records attributed to Min Li.

At least 109 records · Page 6Linked to original sources

Resource-Optimized Grouping Shadow for Efficient Energy Estimation

The accurate and efficient energy estimation of quantum Hamiltonians consisting of Pauli observables is an essential task in modern quantum computing. We introduce a Resource-Optimized Grouping Shadow (ROGS) algorithm, which optimally allocates measurement resources by minimizing the estimation error bound through a novel overlapped grouping strategy and convex optimization. Our numerical experiments demonstrate that ROGS requires significantly fewer unique quantum circuits for accurate estimation accuracy compared to existing methods given a fixed measurement budget, addressing a major cost factor for compiling and executing circuits on quantum computers.

quant-ph↗

Movable Antenna Enhanced Downlink Multi-User Integrated Sensing and Communication System

This work investigates the potential of exploiting movable antennas (MAs) to enhance the performance of a multi-user downlink integrated sensing and communication (ISAC) system. Specifically, we formulate an optimization problem to maximize the transmit beampattern gain for sensing while simultaneously meeting each user's communication requirement by jointly optimizing antenna positions and beamforming design. The problem formulated is highly non-convex and involves multivariate-coupled constraints. To address these challenges, we introduce a series of auxiliary random variables and transform the original problem into an augmented Lagrangian problem. A double-loop algorithm based on a penalty dual decomposition framework is then developed to solve the problem. Numerical results validate the effectiveness of the proposed design, demonstrating its superiority over MA designs based on successive convex approximation optimization and other baseline approaches in ISAC systems. The results also highlight the advantages of MAs in achieving better sensing performance and improved beam control, especially for sparse arrays with large apertures.

cs.IT↗

Beyond Words: Advancing Long-Text Image Generation via Multimodal Autoregressive Models

Recent advancements in autoregressive and diffusion models have led to strong performance in image generation with short scene text words. However, generating coherent, long-form text in images, such as paragraphs in slides or documents, remains a major challenge for current generative models. We present the first work specifically focused on long text image generation, addressing a critical gap in existing text-to-image systems that typically handle only brief phrases or single sentences. Through comprehensive analysis of state-of-the-art autoregressive generation models, we identify the image tokenizer as a critical bottleneck in text generating quality. To address this, we introduce a novel text-focused, binary tokenizer optimized for capturing detailed scene text features. Leveraging our tokenizer, we develop \ModelName, a multimodal autoregressive model that excels in generating high-quality long-text images with unprecedented fidelity. Our model offers robust controllability, enabling customization of text properties such as font style, size, color, and alignment. Extensive experiments demonstrate that \ModelName~significantly outperforms SD3.5 Large~\cite{sd3} and GPT4o~\cite{gpt4o} with DALL-E 3~\cite{dalle3} in generating long text accurately, consistently, and flexibly. Beyond its technical achievements, \ModelName~opens up exciting opportunities for innovative applications like interleaved document and PowerPoint generation, establishing a new frontier in long-text image generating.

cs.CV↗

Neutral-current background induced by atmospheric neutrinos at large liquid-scintillator detectors: III. Comprehensive prediction for low energy neutrinos

Atmospheric neutrinos play a vital role in generating irreducible backgrounds in liquid-scintillator (LS) detectors via their neutral-current (NC) interactions with $^{12}$C nuclei. These interactions may affect a wide range of research areas from the MeV to GeV energy range, such as the reactor and geo neutrinos, diffuse supernova neutrino background (DSNB), dark matter, and nucleon decay searches. In this work, we extend our preceding paper, by conducting a first-time systematic exploration of NC backgrounds as low as the MeV region of reactor and geo neutrinos. We utilize up-to-date neutrino generator models from GENIE and NuWro, a TALYS-based nuclear deexcitation package and a GEANT4-based detector simulation toolkit for our complete calculation. Our primary focus is to predict the NC background for experimental searches of inverse-beta-decay signals below the 100 MeV visible energy. In order to have deeper understanding of the characteristics of atmospheric neutrino NC interactions in LS, we investigate the model dependence of NC background predictions by using various data-driven models, including the initial neutrino-nucleon interactions, nuclear ground-state structure, final-state interactions, nuclear deexcitation processes, and secondary interactions of final-state particles.

hep-ph↗

CoMT: A Novel Benchmark for Chain of Multi-modal Thought on Large Vision-Language Models

Large Vision-Language Models (LVLMs) have recently demonstrated amazing success in multi-modal tasks, including advancements in Multi-modal Chain-of-Thought (MCoT) reasoning. Despite these successes, current benchmarks still follow a traditional paradigm with multi-modal input and text-modal output, which leads to significant drawbacks such as missing visual operations and vague expressions. Motivated by this, we introduce a novel Chain of Multi-modal Thought (CoMT) benchmark to address these limitations. Different from the traditional MCoT benchmark, CoMT requires both multi-modal input and multi-modal reasoning output, aiming to mimic human-like reasoning that inherently integrates visual operation. Specifically, CoMT consists of four categories: (1) Visual Creation, (2) Visual Deletion, (3) Visual Update, and (4) Visual Selection to comprehensively explore complex visual operations and concise expression in real scenarios. We evaluate various LVLMs and strategies on CoMT, revealing some key insights into the capabilities and limitations of the current approaches. We hope that CoMT can inspire more research on introducing multi-modal generation into the reasoning process.

cs.CV↗

Ambiguity Function Analysis and Optimization of Frequency-Hopping MIMO Radar with Movable Antennas

In this paper, we propose a movable antenna (MA)-enabled frequency-hopping (FH) multiple-input multiple-output (MIMO) radar system and investigate its sensing resolution. Specifically, we derive the expression of the ambiguity function and analyze the relationship between its main lobe width and the transmit antenna positions. In particular, the optimal antenna distribution to achieve the minimum main lobe width in the angular domain is characterized. We discover that this minimum width is related to the antenna size, the antenna number, and the target angle. Meanwhile, we present lower bounds of the ambiguity function in the Doppler and delay domains, and show that the impact of the antenna size on the radar performance in these two domains is very different from that in the angular domain. Moreover, the performance enhancement brought by MAs exhibits a certain trade-off between the main lobe width and the side lobe peak levels. Therefore, we propose to balance between minimizing the side lobe levels and narrowing the main lobe of the ambiguity function by optimizing the antenna positions. To achieve this goal, we propose a low-complexity algorithm based on the Rosen's gradient projection method, and show that its performance is very close to the baseline. Simulation results are presented to validate the theoretical analysis on the properties of the ambiguity function, and demonstrate that MAs can reduce the main lobe width and suppress the side lobe levels of the ambiguity function, thereby enhancing radar performance.

eess.SP↗

Valley resolved dynamics of phonon bottleneck in semiconductor molybdenum ditelluride

Semiconductor molybdenum ditelluride (2H-MoTe2) possess multiple valleys in the band structure, enriching its physical properties and potentials in applications. The understanding of its multivalley nature of fundamental processes involving population and relaxation of carriers and phonons is still evolving; particularly, the possible phonon bottleneck has not yet been addressed. Here, we investigate the carrier intra- and intervalley scattering and the phonon dynamics in different valleys in photoexcited few-layer 2H-MoTe2, by using the time resolved measurements of optical absorption and electron diffraction, together with the density functional theory calculation and molecular dynamics simulation. The pathways and timescales of carrier relaxation, accompanied with the emissions of optical phonons at the Brillouin zone center and acoustic phonons at the zone border are revealed. We present a couple of approaches to estimate the population of different phonon modes based on the results of optical and electron diffraction measurements, hence quantitatively identify the occurrences of phonon bottleneck located in different valleys. Our findings make possible to construct a comprehensive picture of the complex interactions between carriers and phonons in 2H-MoTe2 with the valley degree of freedom resolved.

cond-mat.mtrl-sci↗

Stochastic Parareal Algorithm for Stochastic Differential Equations

This paper analyzes the SParareal algorithm for stochastic differential equations (SDEs). Compared to the classical Parareal algorithm, the SParareal algorithm accelerates convergence by introducing stochastic perturbations, achieving linear convergence over unbounded time intervals. We first revisit the classical Parareal algorithm and stochastic Parareal algorithm. Then we investigate mean-square stability of the SParareal algorithm based on the stochastic $θ$-method for SDEs, deriving linear error bounds under four sampling rules. Numerical experiments demonstrate the superiority of the SParareal algorithm in solving both linear and nonlinear SDEs, reducing the number of iterations required compared to the classical Parareal algorithm.

math.NA↗

Do Large Language Models Possess Sensitive to Sentiment?

Large Language Models (LLMs) have recently displayed their extraordinary capabilities in language understanding. However, how to comprehensively assess the sentiment capabilities of LLMs continues to be a challenge. This paper investigates the ability of LLMs to detect and react to sentiment in text modal. As the integration of LLMs into diverse applications is on the rise, it becomes highly critical to comprehend their sensitivity to emotional tone, as it can influence the user experience and the efficacy of sentiment-driven tasks. We conduct a series of experiments to evaluate the performance of several prominent LLMs in identifying and responding appropriately to sentiments like positive, negative, and neutral emotions. The models' outputs are analyzed across various sentiment benchmarks, and their responses are compared with human evaluations. Our discoveries indicate that although LLMs show a basic sensitivity to sentiment, there are substantial variations in their accuracy and consistency, emphasizing the requirement for further enhancements in their training processes to better capture subtle emotional cues. Take an example in our findings, in some cases, the models might wrongly classify a strongly positive sentiment as neutral, or fail to recognize sarcasm or irony in the text. Such misclassifications highlight the complexity of sentiment analysis and the areas where the models need to be refined. Another aspect is that different LLMs might perform differently on the same set of data, depending on their architecture and training datasets. This variance calls for a more in-depth study of the factors that contribute to the performance differences and how they can be optimized.

cs.CL↗

How Privacy-Savvy Are Large Language Models? A Case Study on Compliance and Privacy Technical Review

The recent advances in large language models (LLMs) have significantly expanded their applications across various fields such as language generation, summarization, and complex question answering. However, their application to privacy compliance and technical privacy reviews remains under-explored, raising critical concerns about their ability to adhere to global privacy standards and protect sensitive user data. This paper seeks to address this gap by providing a comprehensive case study evaluating LLMs' performance in privacy-related tasks such as privacy information extraction (PIE), legal and regulatory key point detection (KPD), and question answering (QA) with respect to privacy policies and data protection regulations. We introduce a Privacy Technical Review (PTR) framework, highlighting its role in mitigating privacy risks during the software development life-cycle. Through an empirical assessment, we investigate the capacity of several prominent LLMs, including BERT, GPT-3.5, GPT-4, and custom models, in executing privacy compliance checks and technical privacy reviews. Our experiments benchmark the models across multiple dimensions, focusing on their precision, recall, and F1-scores in extracting privacy-sensitive information and detecting key regulatory compliance points. While LLMs show promise in automating privacy reviews and identifying regulatory discrepancies, significant gaps persist in their ability to fully comply with evolving legal standards. We provide actionable recommendations for enhancing LLMs' capabilities in privacy compliance, emphasizing the need for robust model improvements and better integration with legal and regulatory requirements. This study underscores the growing importance of developing privacy-aware LLMs that can both support businesses in compliance efforts and safeguard user privacy rights.

cs.CL↗

MedGNN: Towards Multi-resolution Spatiotemporal Graph Learning for Medical Time Series Classification

Medical time series has been playing a vital role in real-world healthcare systems as valuable information in monitoring health conditions of patients. Accurate classification for medical time series, e.g., Electrocardiography (ECG) signals, can help for early detection and diagnosis. Traditional methods towards medical time series classification rely on handcrafted feature extraction and statistical methods; with the recent advancement of artificial intelligence, the machine learning and deep learning methods have become more popular. However, existing methods often fail to fully model the complex spatial dynamics under different scales, which ignore the dynamic multi-resolution spatial and temporal joint inter-dependencies. Moreover, they are less likely to consider the special baseline wander problem as well as the multi-view characteristics of medical time series, which largely hinders their prediction performance. To address these limitations, we propose a Multi-resolution Spatiotemporal Graph Learning framework, MedGNN, for medical time series classification. Specifically, we first propose to construct multi-resolution adaptive graph structures to learn dynamic multi-scale embeddings. Then, to address the baseline wander problem, we propose Difference Attention Networks to operate self-attention mechanisms on the finite difference for temporal modeling. Moreover, to learn the multi-view characteristics, we utilize the Frequency Convolution Networks to capture complementary information of medical time series from the frequency domain. In addition, we introduce the Multi-resolution Graph Transformer architecture to model the dynamic dependencies and fuse the information from different resolutions. Finally, we have conducted extensive experiments on multiple medical real-world datasets that demonstrate the superior performance of our method. Our Code is available.

cs.LG↗

TopoLa: A Universal Framework to Enhance Cell Representations for Single-cell and Spatial Omics through Topology-encoded Latent Hyperbolic Geometry

Recent advances in cellular research demonstrate that scRNA-seq characterizes cellular heterogeneity, while spatial transcriptomics reveals the spatial distribution of gene expression. Cell representation is the fundamental issue in the two fields. Here, we propose Topology-encoded Latent Hyperbolic Geometry (TopoLa), a computational framework enhancing cell representations by capturing fine-grained intercellular topological relationships. The framework introduces a new metric, TopoLa distance (TLd), which quantifies the geometric distance between cells within latent hyperbolic space, capturing the network's topological structure more effectively. With this framework, the cell representation can be enhanced considerably by performing convolution on its neighboring cells. Performance evaluation across seven biological tasks, including scRNA-seq data clustering and spatial transcriptomics domain identification, shows that TopoLa significantly improves the performance of several state-of-the-art models. These results underscore the generalizability and robustness of TopoLa, establishing it as a valuable tool for advancing both biological discovery and computational methodologies.

q-bio.GN↗

KG-TRICK: Unifying Textual and Relational Information Completion of Knowledge for Multilingual Knowledge Graphs

Multilingual knowledge graphs (KGs) provide high-quality relational and textual information for various NLP applications, but they are often incomplete, especially in non-English languages. Previous research has shown that combining information from KGs in different languages aids either Knowledge Graph Completion (KGC), the task of predicting missing relations between entities, or Knowledge Graph Enhancement (KGE), the task of predicting missing textual information for entities. Although previous efforts have considered KGC and KGE as independent tasks, we hypothesize that they are interdependent and mutually beneficial. To this end, we introduce KG-TRICK, a novel sequence-to-sequence framework that unifies the tasks of textual and relational information completion for multilingual KGs. KG-TRICK demonstrates that: i) it is possible to unify the tasks of KGC and KGE into a single framework, and ii) combining textual information from multiple languages is beneficial to improve the completeness of a KG. As part of our contributions, we also introduce WikiKGE10++, the largest manually-curated benchmark for textual information completion of KGs, which features over 25,000 entities across 10 diverse languages.

cs.CL↗

Joint Node Selection and Resource Allocation Optimization for Cooperative Sensing with a Shared Wireless Backhaul

In this paper, we consider a cooperative sensing framework in the context of future multi-functional network with both communication and sensing ability, where one base station (BS) serves as a sensing transmitter and several nearby BSs serve as sensing receivers. Each receiver receives the sensing signal reflected by the target and communicates with the fusion center (FC) through a wireless multiple access channel (MAC) for cooperative target localization. To improve the localization performance, we present a hybrid information-signal domain cooperative sensing (HISDCS) design, where each sensing receiver transmits both the estimated time delay/effective reflecting coefficient and the received sensing signal sampled around the estimated time delay to the FC. Then, we propose to minimize the number of channel uses by utilizing an efficient Karhunen-Loéve transformation (KLT) encoding scheme for signal quantization and proper node selection, under the Cramér-Rao lower bound (CRLB) constraint and the capacity limits of MAC. A novel matrix-inequality constrained successive convex approximation (MCSCA) algorithm is proposed to optimize the wireless backhaul resource allocation, together with a greedy strategy for node selection. Despite the high non-convexness of the considered problem, we prove that the proposed MCSCA algorithm is able to converge to the set of Karush-Kuhn-Tucker (KKT) solutions of a relaxed problem obtained by relaxing the discrete variables. Besides, a low-complexity quantization bit reallocation algorithm is designed, which does not perform explicit node selection, and is able to harvest most of the performance gain brought by HISDCS. Finally, numerical simulations are presented to show that the proposed HISDCS design is able to significantly outperform the baseline schemes.

cs.IT↗

Finite-time Non-overshooting Leader-following Consensus Control for Multi-Agent Systems

This paper addresses the finite-time non-overshooting leader-following consensus problem for multi-agent systems, whose agents are modeled by a dynamical system topologically equivalent to the integrator chain. Based on the weighted homogeneity, a nonlinear consensus control protocol is designed. A tuning scheme ensures the finite-time stability of the consensus error such that the agents do not have overshoots in the first component of the state vector. Simulations are presented to demonstrate the effectiveness of the proposed design.

math.OC↗

Real-space study of zero-field correlation in tetralayer rhombohedral graphene

Rhombohedral graphene (RG) has emerged as a promising platform for exploring exotic quantum phenomena, such as quantum magnetism, unconventional superconductivity, and fractional quantum anomalous Hall effects. Despite its potential, atomic-scale investigations of RG remain limited, hindering a detailed microscopic understanding of the origins of these correlated states. In this study, we employ scanning probe microscopy and spectroscopy to probe the intrinsic electronic states in trilayer and tetralayer RG. We identify a correlated insulating state with a 17 meV gap at the charge neutrality point in tetralayer RG, which is absent in the trilayer configuration. This gap is suppressed by applying a perpendicular magnetic field or doping the charge carrier density and does not exhibit inter-valley coherence patterns. We attribute this phenomenon to a symmetry-broken layer antiferromagnetic state, characterized by ferrimagnetic ordering in the outermost layers and antiferromagnetic coupling between them. To further investigate this magnetic correlated state, we conduct local scattering experiments. Within the correlated regime, a bound state emerges around a non-magnetic impurity but is absent near magnetic impurities, suggesting that non-magnetic doping induces a spin texture in the ferrimagnetic surface layers. Outside the correlated regime, Friedel oscillations are observed, allowing precise determination of the band dispersion in tetralayer RG. These findings provide atomic-scale evidences of zero-field correlations in RG and may be extended to study other exotic phases in RG.

cond-mat.mes-hall↗

InfiniteWorld: A Unified Scalable Simulation Framework for General Visual-Language Robot Interaction

Realizing scaling laws in embodied AI has become a focus. However, previous work has been scattered across diverse simulation platforms, with assets and models lacking unified interfaces, which has led to inefficiencies in research. To address this, we introduce InfiniteWorld, a unified and scalable simulator for general vision-language robot interaction built on Nvidia Isaac Sim. InfiniteWorld encompasses a comprehensive set of physics asset construction methods and generalized free robot interaction benchmarks. Specifically, we first built a unified and scalable simulation framework for embodied learning that integrates a series of improvements in generation-driven 3D asset construction, Real2Sim, automated annotation framework, and unified 3D asset processing. This framework provides a unified and scalable platform for robot interaction and learning. In addition, to simulate realistic robot interaction, we build four new general benchmarks, including scene graph collaborative exploration and open-world social mobile manipulation. The former is often overlooked as an important task for robots to explore the environment and build scene knowledge, while the latter simulates robot interaction tasks with different levels of knowledge agents based on the former. They can more comprehensively evaluate the embodied agent's capabilities in environmental understanding, task planning and execution, and intelligent interaction. We hope that this work can provide the community with a systematic asset interface, alleviate the dilemma of the lack of high-quality assets, and provide a more comprehensive evaluation of robot interactions.

cs.RO↗

113 km absolute ranging with nanometer precision

Accurate long-distance ranging is crucial for diverse applications, including satellite formation flying, very-long-baseline interferometry, gravitational-wave observatory, geographical research, etc. The integration of the time-of-flight mesurement with phase interference in dual-comb method enables high-precision ranging with a rapid update rate and an extended ambiguity range. Pioneering experiments have demonstrated unprecedented precision in ranging, achieving 5 nm @ 60 ms for 1.1 m and 200 nm @ 0.5 s for 25 m. However, long-distance ranging remains technically challenging due to high transmission loss and noise. In this letter, we propose a two-way dual-comb ranging (TWDCR) approach that enables successful ranging over a distance of 113 kilometers. We employ air dispersion analysis and synthetic repetition rate technique to extend the ambiguity range of the inherently noisy channel beyond 100 km. The achieved ranging precision is 11.5 $μ$m @ 1.3 ms, 681 nm @ 1 s, and 82 nm @ 21 s, as confirmed through a comparative analysis of two independent systems. The advanced long-distance ranging technology is expected to have immediate implications for space research initiatives, such as the space telescope array and the satellite gravimetry.

physics.optics↗