Searcharxiv⌕ Search

arXiv subjects

Yuqi Liu

Publications and source records attributed to Yuqi Liu.

At least 55 records · Page 3Linked to original sources

DataScout: Automatic Data Fact Retrieval for Statement Augmentation with an LLM-Based Agent

A data story typically integrates data facts from multiple perspectives and stances to construct a comprehensive and objective narrative. However, retrieving these facts demands time for data search and challenges the creator's analytical skills. In this work, we introduce DataScout, an interactive system that automatically performs reasoning and stance-based data facts retrieval to augment the user's statement. Particularly, DataScout leverages an LLM-based agent to construct a retrieval tree, enabling collaborative control of its expansion between users and the agent. The interface visualizes the retrieval tree as a mind map that eases users to intuitively steer the retrieval direction and effectively engage in reasoning and analysis. We evaluate the proposed system through case studies and in-depth expert interviews. Our evaluation demonstrates that DataScout can effectively retrieve multifaceted data facts from different stances, helping users verify their statements and enhance the credibility of their stories.

cs.HC↗

Optimizing thermoelectric performance of graphene antidot lattices via quantum transport and machine-learning molecular dynamics simulations

Thermoelectric materials, which can convert waste heat to electricity or be utilized as solid-state coolers, hold promise for sustainable energy applications. However, optimizing thermoelectric performance remains a significant challenge due to the complex interplay between electronic and thermal transport properties. In this work, we systematically optimize $ZT$ in graphene antidot lattices (GALs), nanostructured graphene sheets with periodic nanopores characterized by two geometric parameters: the hexagonal unit cell side length $L$ and the antidot radius $R$. The lattice thermal conductivity is determined through machine-learned potential-driven molecular dynamics (MD) simulations, while electronic transport properties are computed using linear-scaling quantum transport in combination with MD trajectories based on a bond-length-dependent tight-binding model. This method is able to account for electron-phonon scattering, allowing access to diffusive transport in large-scale systems, overcoming limitations of previous methods based on nonequilibrium Green function formalism. Our results show that the introduction of the antidots effectively decouples lattice and electronic transport and lead to a favorable and significant violation of the Wiedemann-Franz law. We find that optimal $ZT$ values occur in GALs with intermediate $L$ and $R$, closely correlated with peak power factor values. Notably, thermoelectric performance peaks near room temperature, with maximal $ZT$ values approaching 2, highlighting GALs as promising candidates for high-performance thermoelectric energy conversion.

cond-mat.mes-hall↗

On a shrink-and-expand technique for symmetric block eigensolvers

In symmetric block eigenvalue algorithms, such as the subspace iteration algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm, a large block size is often employed to achieve robustness and rapid convergence. However, using a large block size also increases the computational cost. Traditionally, the block size is typically reduced after convergence of some eigenpairs, known as deflation. In this work, we propose a non-deflation-based, more aggressive technique, where the block size is adjusted dynamically during the algorithm. This technique can be applied to a wide range of block eigensolvers, reducing computational cost without compromising convergence speed. We present three adaptive strategies for adjusting the block size, and apply them to four well-known eigensolvers as examples. Detailed theoretical analysis and numerical experiments are provided to illustrate the efficiency of the proposed technique. In practice, an overall acceleration of 20% to 30% is observed.

math.NA↗

Barium Titanate and Lithium Niobate Permittivity and Pockels Coefficients from MHz to Sub-THz Frequencies

The Pockels effect is essential for controlling optical signals at the highest speeds, particularly for electro-optic modulators in photonic integrated circuits. Lithium niobate (LN) and barium titanate (BTO) are two excellent Pockels materials to this end. Here, we measure the Pockels coefficients and permittivity in LN and BTO over a continuous frequency range from 100 MHz to 330 GHz. These properties are constant across this frequency range in LN but have a significant frequency dependence in BTO. Still, our measurements show that BTO has remarkably large electro-optic properties compared to LN. Furthermore, we show how BTO devices can be designed with a flat electro-optic frequency response despite the Pockels coefficient dispersion. Finally, we expound our method for broadband characterization of these vital electro-optic properties, utilizing specialized integrated electro-optic phase shifters. Altogether, this work empowers the design of high-speed BTO devices and the development of new electro-optic materials.

physics.optics↗

Solving nonlinear eigenvalue problems via contour integration and region partitioning

In this work, we combine Beyn's method and the recently developed recursive integral method (RIM) to propose a contour integral-based, region partitioning eigensolver for nonlinear eigenvalue problems. A new partitioning criterion is employed to eliminate the need for a problem-dependent parameter, making our algorithm much more robust compared to the original RIM. Moreover, our algorithm can be directly applied to regions containing singularities or accumulation points, which are typically challenging for existing nonlinear eigensolvers to handle. Comprehensive numerical experiments are provided to demonstrate that the proposed algorithm is particularly well suited for dealing with regions including many eigenvalues.

math.NA↗

AdaFlow: Efficient Long Video Editing via Adaptive Attention Slimming And Keyframe Selection

Despite great progress, text-driven long video editing is still notoriously challenging mainly due to excessive memory overhead. Although recent efforts have simplified this task into a two-step process of keyframe translation and interpolation generation, the token-wise keyframe translation still plagues the upper limit of video length. In this paper, we propose a novel and training-free approach towards efficient and effective long video editing, termed AdaFlow. We first reveal that not all tokens of video frames hold equal importance for keyframe translation, based on which we propose an Adaptive Attention Slimming scheme for AdaFlow to squeeze the $KV$ sequence, thus increasing the number of keyframes for translations by an order of magnitude. In addition, an Adaptive Keyframe Selection scheme is also equipped to select the representative frames for joint editing, further improving generation quality. With these innovative designs, AdaFlow achieves high-quality long video editing of minutes in one inference, i.e., more than 1$k$ frames on one A800 GPU, which is about ten times longer than the compared methods, e.g., TokenFlow. To validate AdaFlow, we also build a new benchmark for long video editing with high-quality annotations, termed LongV-EVAL. Our code is released at: https://github.com/jidantang55/AdaFlow.

cs.CV↗

Improving performance of contour integral-based nonlinear eigensolvers with infinite GMRES

In this work, the infinite GMRES algorithm, recently proposed by Correnty et al., is employed in contour integral-based nonlinear eigensolvers, avoiding the computation of costly factorizations at each quadrature node to solve the linear systems efficiently. Several techniques are applied to make the infinite GMRES memory-friendly, computationally efficient, and numerically stable in practice. More specifically, we analyze the relationship between polynomial eigenvalue problems and their scaled linearizations, and provide a novel weighting strategy which can significantly accelerate the convergence of infinite GMRES in this particular context. We also adopt the technique of TOAR to infinite GMRES to reduce the memory footprint. Theoretical analysis and numerical experiments are provided to illustrate the efficiency of the proposed algorithm.

math.NA↗

SVFR: A Unified Framework for Generalized Video Face Restoration

Face Restoration (FR) is a crucial area within image and video processing, focusing on reconstructing high-quality portraits from degraded inputs. Despite advancements in image FR, video FR remains relatively under-explored, primarily due to challenges related to temporal consistency, motion artifacts, and the limited availability of high-quality video data. Moreover, traditional face restoration typically prioritizes enhancing resolution and may not give as much consideration to related tasks such as facial colorization and inpainting. In this paper, we propose a novel approach for the Generalized Video Face Restoration (GVFR) task, which integrates video BFR, inpainting, and colorization tasks that we empirically show to benefit each other. We present a unified framework, termed as stable video face restoration (SVFR), which leverages the generative and motion priors of Stable Video Diffusion (SVD) and incorporates task-specific information through a unified face restoration framework. A learnable task embedding is introduced to enhance task identification. Meanwhile, a novel Unified Latent Regularization (ULR) is employed to encourage the shared feature representation learning among different subtasks. To further enhance the restoration quality and temporal stability, we introduce the facial prior learning and the self-referred refinement as auxiliary strategies used for both training and inference. The proposed framework effectively combines the complementary strengths of these tasks, enhancing temporal coherence and achieving superior restoration quality. This work advances the state-of-the-art in video FR and establishes a new paradigm for generalized video face restoration. Code and video demo are available at https://github.com/wangzhiyaoo/SVFR.git.

cs.CV↗

Lyra: An Efficient and Speech-Centric Framework for Omni-Cognition

As Multi-modal Large Language Models (MLLMs) evolve, expanding beyond single-domain capabilities is essential to meet the demands for more versatile and efficient AI. However, previous omni-models have insufficiently explored speech, neglecting its integration with multi-modality. We introduce Lyra, an efficient MLLM that enhances multimodal abilities, including advanced long-speech comprehension, sound understanding, cross-modality efficiency, and seamless speech interaction. To achieve efficiency and speech-centric capabilities, Lyra employs three strategies: (1) leveraging existing open-source large models and a proposed multi-modality LoRA to reduce training costs and data requirements; (2) using a latent multi-modality regularizer and extractor to strengthen the relationship between speech and other modalities, thereby enhancing model performance; and (3) constructing a high-quality, extensive dataset that includes 1.5M multi-modal (language, vision, audio) data samples and 12K long speech samples, enabling Lyra to handle complex long speech inputs and achieve more robust omni-cognition. Compared to other omni-methods, Lyra achieves state-of-the-art performance on various vision-language, vision-speech, and speech-language benchmarks, while also using fewer computational resources and less training data.

cs.CV↗

Strong interaction induced dimensional crossover in 1D quantum gas

We generated a one-dimensional quantum gas confined in an elongated optical dipole trap instead of 2D optical lattices. The sample, comprising thousands of atoms, spans several hundred micrometers and allows for independent control of temperature and chemical potential using Feshbach resonance. This allows us to directly observe and investigate the spatial distribution and associated excitation of 1D quantum gas without any ensemble averaging. In this system, we observed that the dimension of 1D gas will be popped up into 3D due to strong interaction without changing any trapping confinement. During the dimensional crossover, we found that increasing the scattering length leads to the failure of 1D theories, including 1D mean field, Yang-Yang equation, and 1D hydrodynamics. Specifically, the modified Yang-Yang equation effectively describes this 1D system at temperatures beyond the 1D threshold, but it does not account for the effects of stronger interactions. Meanwhile, we observe two possible quantized plateaus of breathing-mode oscillation frequencies predicted by 1D and 3D hydrodynamics, corresponding to weak and strong interactions respectively. And there is also a universal crossover connecting two different regimes where both hydrodynamics fail.

cond-mat.quant-gas↗

Million-atom heat transport simulations of polycrystalline graphene approaching first-principles accuracy enabled by neuroevolution potential on desktop GPUs

First-principles molecular dynamics simulations of heat transport in systems with large-scale structural features are challenging due to their high computational cost. Here, using polycrystalline graphene as a case study, we demonstrate the feasibility of simulating heat transport with near first-principles accuracy in systems containing over 1.4 million atoms, achievable even with consumer desktop GPUs. This is enabled by the highly efficient neuroevolution potential (NEP) approach, as implemented in the open-source GPUMD package. Leveraging the NEP model's accuracy and efficiency, we quantify the reduction in thermal conductivity of polycrystalline graphene due to grain boundaries with varying grain sizes, resolving contributions from in-plane and out-of-plane (flexural) phonon modes. Additionally, we find that grain boundaries can lead to finite thermal conductivity even under significant tensile strain, in contrast to the divergent behavior observed in pristine graphene under similar conditions, indicating that grain boundaries may play a crucial role in thermal transport in low-dimensional momentum-conserving systems. These findings could offer insights for interpreting experimental observations, given the widespread presence of both large-scale grain boundaries and external strains in real materials. The demonstrated ability to simulate millions of atoms with near-first-principles accuracy on consumer desktop GPUs using the NEP approach will help make large-scale high-fidelity atomistic simulations more accessible to the broader research community.

cond-mat.mtrl-sci↗

SCOPE: Sign Language Contextual Processing with Embedding from LLMs

Sign languages, used by around 70 million Deaf individuals globally, are visual languages that convey visual and contextual information. Current methods in vision-based sign language recognition (SLR) and translation (SLT) struggle with dialogue scenes due to limited dataset diversity and the neglect of contextually relevant information. To address these challenges, we introduce SCOPE (Sign language Contextual Processing with Embedding from LLMs), a novel context-aware vision-based SLR and SLT framework. For SLR, we utilize dialogue contexts through a multi-modal encoder to enhance gloss-level recognition. For subsequent SLT, we further fine-tune a Large Language Model (LLM) by incorporating prior conversational context. We also contribute a new sign language dataset that contains 72 hours of Chinese sign language videos in contextual dialogues across various scenarios. Experimental results demonstrate that our SCOPE framework achieves state-of-the-art performance on multiple datasets, including Phoenix-2014T, CSL-Daily, and our SCOPE dataset. Moreover, surveys conducted with participants from the Deaf community further validate the robustness and effectiveness of our approach in real-world applications. Both our dataset and code will be open-sourced to facilitate further research.

cs.CV↗

Computational Modelling of Plurality and Definiteness in Chinese Noun Phrases

Theoretical linguists have suggested that some languages (e.g., Chinese and Japanese) are "cooler" than other languages based on the observation that the intended meaning of phrases in these languages depends more on their contexts. As a result, many expressions in these languages are shortened, and their meaning is inferred from the context. In this paper, we focus on the omission of the plurality and definiteness markers in Chinese noun phrases (NPs) to investigate the predictability of their intended meaning given the contexts. To this end, we built a corpus of Chinese NPs, each of which is accompanied by its corresponding context, and by labels indicating its singularity/plurality and definiteness/indefiniteness. We carried out corpus assessments and analyses. The results suggest that Chinese speakers indeed drop plurality and definiteness markers very frequently. Building on the corpus, we train a bank of computational models using both classic machine learning models and state-of-the-art pre-trained language models to predict the plurality and definiteness of each NP. We report on the performance of these models and analyse their behaviours.

cs.CL↗

Taiyi: A Bilingual Fine-Tuned Large Language Model for Diverse Biomedical Tasks

Objective: Most existing fine-tuned biomedical large language models (LLMs) focus on enhancing performance in monolingual biomedical question answering and conversation tasks. To investigate the effectiveness of the fine-tuned LLMs on diverse biomedical NLP tasks in different languages, We present Taiyi, a bilingual fine-tuned LLM for diverse biomedical tasks. Materials and Methods: We first curated a comprehensive collection of 140 existing biomedical text mining datasets (102 English and 38 Chinese datasets) across over 10 task types. Subsequently, a two-stage strategy is proposed for supervised fine-tuning to optimize the model performance across varied tasks. Results: Experimental results on 13 test sets covering named entity recognition, relation extraction, text classification, question answering tasks demonstrate that Taiyi achieves superior performance compared to general LLMs. The case study involving additional biomedical NLP tasks further shows Taiyi's considerable potential for bilingual biomedical multi-tasking. Conclusion: Leveraging rich high-quality biomedical corpora and developing effective fine-tuning strategies can significantly improve the performance of LLMs within the biomedical domain. Taiyi shows the bilingual multi-tasking capability through supervised fine-tuning. However, those tasks such as information extraction that are not generation tasks in nature remain challenging for LLM-based generative approaches, and they still underperform the conventional discriminative approaches of smaller language models.

cs.CL↗

Calibrating the absorption imaging of cold atoms under high magnetic fields

We develop a theoretical model for calibrating the absorption imaging of cold atoms under high magnetic fields. Comparing to zero or low magnetic fields, the efficiency of the absorption imaging becomes lower while it requires an additional correction factor to obtain the absolute atom number under the Beer-Lambert law. Our model is based on the rate equations and can account many experimental imperfections such as Zeeman level crossing, failures of hyperfine structures, off-resonant couplings, and low repumping efficiency, etc. Based on this method, we can precisely calculate the correction factor for atom number measurement without any empirical or fitting parameters. Meanwhile, we use a cold-atom apparatus of rubidium-85 to experimentally verify our model. Besides these, we find our work can also serve as a benchmark to measure the polarization impurity of a circular-polarized laser beam with high sensitivities. We believe this work will bring convenience for most of cold-atom experiments using absorption imaging.

physics.atom-ph↗

Using stochastic order to compare different Euclidean Random Assignment Problems

This paper provides a theorem to compare the minimum total cost of two different Euclidean Random Assignment Problems with the same number of points, using the stochastic order of the costs of one of the pairs in these two problems. The subsequent sections provide two applications of the theorem, including studies of the problem on the one-dimensional $k$-star graph and comparisons between some problems in higher dimensions. More possible applications and limitations of the theorem are also discussed.

math-ph↗

Spherical Transformer: Adapting Spherical Signal to CNNs

Convolutional neural networks (CNNs) have been widely used in various vision tasks, e.g. image classification, semantic segmentation, etc. Unfortunately, standard 2D CNNs are not well suited for spherical signals such as panorama images or spherical projections, as the sphere is an unstructured grid. In this paper, we present Spherical Transformer which can transform spherical signals into vectors that can be directly processed by standard CNNs such that many well-designed CNNs architectures can be reused across tasks and datasets by pretraining. To this end, the proposed method first uses local structured sampling methods such as HEALPix to construct a transformer grid by using the information of spherical points and its adjacent points, and then transforms the spherical signals to the vectors through the grid. By building the Spherical Transformer module, we can use multiple CNN architectures directly. We evaluate our approach on the tasks of spherical MNIST recognition, 3D object classification and omnidirectional image semantic segmentation. For 3D object classification, we further propose a rendering-based projection method to improve the performance and a rotational-equivariant model to improve the anti-rotation ability. Experimental results on three tasks show that our approach achieves superior performance over state-of-the-art methods.

cs.CV↗

An Efficient End-to-End 3D Voxel Reconstruction based on Neural Architecture Search

Using neural networks to represent 3D objects has become popular. However, many previous works employ neural networks with fixed architecture and size to represent different 3D objects, which lead to excessive network parameters for simple objects and limited reconstruction accuracy for complex objects. For each 3D model, it is desirable to have an end-to-end neural network with as few parameters as possible to achieve high-fidelity reconstruction. In this paper, we propose an efficient voxel reconstruction method utilizing neural architecture search (NAS) and binary classification. Taking the number of layers, the number of nodes in each layer, and the activation function of each layer as the search space, a specific network architecture can be obtained based on reinforcement learning technology. Furthermore, to get rid of the traditional surface reconstruction algorithms (e.g., marching cube) used after network inference, we complete the end-to-end network by classifying binary voxels. Compared to other signed distance field (SDF) prediction or binary classification networks, our method achieves significantly higher reconstruction accuracy using fewer network parameters.

cs.CV↗