Searcharxiv⌕ Search

arXiv subjects

Ting Yu

Publications and source records attributed to Ting Yu.

At least 55 records · Page 3Linked to original sources

Prompt Inference Attack on Distributed Large Language Model Inference Frameworks

The inference process of modern large language models (LLMs) demands prohibitive computational resources, rendering them infeasible for deployment on consumer-grade devices. To address this limitation, recent studies propose distributed LLM inference frameworks, which employ split learning principles to enable collaborative LLM inference on resource-constrained hardware. However, distributing LLM layers across participants requires the transmission of intermediate outputs, which may introduce privacy risks to the original input prompts - a critical issue that has yet to be thoroughly explored in the literature. In this paper, we rigorously examine the privacy vulnerabilities of distributed LLM inference frameworks by designing and evaluating three prompt inference attacks aimed at reconstructing input prompts from intermediate LLM outputs. These attacks are developed under various query and data constraints to reflect diverse real-world LLM service scenarios. Specifically, the first attack assumes an unlimited query budget and access to an auxiliary dataset sharing the same distribution as the target prompts. The second attack also leverages unlimited queries but uses an auxiliary dataset with a distribution differing from the target prompts. The third attack operates under the most restrictive scenario, with limited query budgets and no auxiliary dataset available. We evaluate these attacks on a range of LLMs, including state-of-the-art models such as Llama-3.2 and Phi-3.5, as well as widely-used models like GPT-2 and BERT for comparative analysis. Our experiments show that the first two attacks achieve reconstruction accuracies exceeding 90%, while the third achieves accuracies typically above 50%, even under stringent constraints. These findings highlight privacy risks in distributed LLM inference frameworks, issuing a strong alert on their deployment in real-world applications.

cs.CR↗

Spontaneous Enhancement of Dzyaloshinskii-Moriya Interaction via Field-Cooling-Induced Interface Engineering in 2D van der Waals Ferromagnetic ternary Tellurides

The emergence of two-dimensional (2D) van der Waals (vdW) ferromagnets has opened new avenues for exploring topological spin textures and their applications in next-generation spintronics. Among these materials, Fe3GaTe2 (FGaT) emerges as a model system due to its room-temperature skyrmion phases, which are stabilized by strong Dzyaloshinskii-Moriya interaction (DMI). However, the atomistic origins of DMI in centrosymmetric vdW lattices remain elusive. Here, we report a spontaneous DMI enhancement mechanism driven by FC in FGaT and its analog Fe3GeTe2 (FGeT). Combining Raman spectroscopy and scanning transmission electron microscopy (STEM), we have observed the irreversible precipitation of FeTe2 in annealed FGaT. The resulting FeTe2/FGaT heterostructure is considered to break the symmetry and significantly enhance the DMI. Furthermore, similar phenomenon has been observed in the family ferromagnetic material FGeT as well. Additionally, the precipitation of FeTe2 varies significantly with different thicknesses of FGaT, aligning closely with the reported behavior of skyrmions. This discovery provides new insights into the mechanisms behind the origin of the DMI in ternary tellurides, paving the way for advanced spintronic applications.

cond-mat.mtrl-sci↗

Strain Induced Robust Skyrmion lattice at Room Temperature in van der Waals Ferromagnet

Manipulating topological magnetic orders of two-dimensional (2D) magnets by strain, once achieved, offers enormous potential for future low-power flexible spintronic applications. In this work, by placing Fe3GaTe2 (FGaT), a room-temperature 2D ferromagnet, on flexible substrate, we demonstrate a field-free and robust formation of skyrmion lattice induced by strain. By applying a minimal strain of ~0.80% to pre-annealed FGaT flakes, the Magnetic Force Microscopy (MFM) tip directly triggers the transition from maze-like domains to an ordered skyrmion lattice while scanning the sample surface. The skyrmion lattice is rather stable against extensive cyclic mechanical testing (stretching, bending, and twisting over 2000 cycles each). It also exhibited stability across a wide range of magnetic fields (~2.9 kOe) and temperatures (~ 323 K), as well as long-term retention stability, highlighting its robustness and field free stabilization. The strain effect reduces the lattice symmetry and enhances the Dzyaloshinskii-Moriya interaction (DMI) of FGaT, thus stabilizing the skyrmion lattice. Our findings highlight the potential of FGaT for integrating magnetic skyrmions into future low-power-consumption flexible spintronics devices.

cond-mat.mtrl-sci↗

DeBackdoor: A Deductive Framework for Detecting Backdoor Attacks on Deep Models with Limited Data

Backdoor attacks are among the most effective, practical, and stealthy attacks in deep learning. In this paper, we consider a practical scenario where a developer obtains a deep model from a third party and uses it as part of a safety-critical system. The developer wants to inspect the model for potential backdoors prior to system deployment. We find that most existing detection techniques make assumptions that are not applicable to this scenario. In this paper, we present a novel framework for detecting backdoors under realistic restrictions. We generate candidate triggers by deductively searching over the space of possible triggers. We construct and optimize a smoothed version of Attack Success Rate as our search objective. Starting from a broad class of template attacks and just using the forward pass of a deep model, we reverse engineer the backdoor attack. We conduct extensive evaluation on a wide range of attacks, models, and datasets, with our technique performing almost perfectly across these settings.

cs.CR↗

MANTIS: Detection of Zero-Day Malicious Domains Leveraging Low Reputed Hosting Infrastructure

Internet miscreants increasingly utilize short-lived disposable domains to launch various attacks. Existing detection mechanisms are either too late to catch such malicious domains due to limited information and their short life spans or unable to catch them due to evasive techniques such as cloaking and captcha. In this work, we investigate the possibility of detecting malicious domains early in their life cycle using a content-agnostic approach. We observe that attackers often reuse or rotate hosting infrastructures to host multiple malicious domains due to increased utilization of automation and economies of scale. Thus, it gives defenders the opportunity to monitor such infrastructure to identify newly hosted malicious domains. However, such infrastructures are often shared hosting environments where benign domains are also hosted, which could result in a prohibitive number of false positives. Therefore, one needs innovative mechanisms to better distinguish malicious domains from benign ones even when they share hosting infrastructures. In this work, we build MANTIS, a highly accurate practical system that not only generates daily blocklists of malicious domains but also is able to predict malicious domains on-demand. We design a network graph based on the hosting infrastructure that is accurate and generalizable over time. Consistently, our models achieve a precision of 99.7%, a recall of 86.9% with a very low false positive rate (FPR) of 0.1% and on average detects 19K new malicious domains per day, which is over 5 times the new malicious domains flagged daily in VirusTotal. Further, MANTIS predicts malicious domains days to weeks before they appear in popular blocklists.

cs.CR↗

Optimal entanglement generation in optomechanical systems via Krotov control of covariance matrix dynamics

We investigated the optimal control of a continuous variable system, focusing on entanglement generation in an optomechanical system without utilizing Fock basis cutoffs. Using the Krotov algorithm to optimize the dynamics of the covariance matrix, we illustrated how to design a control objective function to manipulate the dynamics of the system to generate a desirable target state. We showed that entanglement between the macroscopic mechanical mirror and the quantum optical cavity can be reliably generated through imposing the control on the detuning of the external laser field. It has be shown that the control may be still achieved when imposing spectral constraints on the external field to restrict it to low-frequency components. In addition, we systematically studies the effects of quantum control on non-Markovian open system dynamics. We observed that memory effects can play a beneficial role in mitigating the detrimental impact of environmental noises. Specifically, the entanglement generated shows reduced decay in the presence of these memory effects.

quant-ph↗

Chaos in Optomechanical Systems coupled to a Non-Markovian environment

We study the chaotic motion of a semi-classical optomechanical system coupled to a non-Markovian environment with a finite correlation time. We show that the non-Markovian environment can significantly enhance chaos, by studying the emergence of chaos using Lyapunov exponent with the changing non-Markovian parameter. It is observed that non-Markovian environment characterized by the Ornstein-Uhlenbeck type noise can modify the generation of chaos with different environmental memory times. As a comparison, the crossover properties from Markov to non-Markovian regimes are also discussed. Our findings indicate that the quantum memory effects on the onset of chaos may become a useful property to be investigated in quantum manipulations and control.

quant-ph↗

Domain-specific Guided Summarization for Mental Health Posts

In domain-specific contexts, particularly mental health, abstractive summarization requires advanced techniques adept at handling specialized content to generate domain-relevant and faithful summaries. In response to this, we introduce a guided summarizer equipped with a dual-encoder and an adapted decoder that utilizes novel domain-specific guidance signals, i.e., mental health terminologies and contextually rich sentences from the source document, to enhance its capacity to align closely with the content and context of guidance, thereby generating a domain-relevant summary. Additionally, we present a post-editing correction model to rectify errors in the generated summary, thus enhancing its consistency with the original content in detail. Evaluation on the MentSum dataset reveals that our model outperforms existing baseline models in terms of both ROUGE and FactCC scores. Although the experiments are specifically designed for mental health posts, the methodology we've developed offers broad applicability, highlighting its versatility and effectiveness in producing high-quality domain-specific summaries.

cs.CL↗

Prompting Video-Language Foundation Models with Domain-specific Fine-grained Heuristics for Video Question Answering

Video Question Answering (VideoQA) represents a crucial intersection between video understanding and language processing, requiring both discriminative unimodal comprehension and sophisticated cross-modal interaction for accurate inference. Despite advancements in multi-modal pre-trained models and video-language foundation models, these systems often struggle with domain-specific VideoQA due to their generalized pre-training objectives. Addressing this gap necessitates bridging the divide between broad cross-modal knowledge and the specific inference demands of VideoQA tasks. To this end, we introduce HeurVidQA, a framework that leverages domain-specific entity-action heuristics to refine pre-trained video-language foundation models. Our approach treats these models as implicit knowledge engines, employing domain-specific entity-action prompters to direct the model's focus toward precise cues that enhance reasoning. By delivering fine-grained heuristics, we improve the model's ability to identify and interpret key entities and actions, thereby enhancing its reasoning capabilities. Extensive evaluations across multiple VideoQA datasets demonstrate that our method significantly outperforms existing models, underscoring the importance of integrating domain-specific knowledge into video-language models for more accurate and context-aware VideoQA.

cs.CV↗

Multi-granularity Contrastive Cross-modal Collaborative Generation for End-to-End Long-term Video Question Answering

Long-term Video Question Answering (VideoQA) is a challenging vision-and-language bridging task focusing on semantic understanding of untrimmed long-term videos and diverse free-form questions, simultaneously emphasizing comprehensive cross-modal reasoning to yield precise answers. The canonical approaches often rely on off-the-shelf feature extractors to detour the expensive computation overhead, but often result in domain-independent modality-unrelated representations. Furthermore, the inherent gradient blocking between unimodal comprehension and cross-modal interaction hinders reliable answer generation. In contrast, recent emerging successful video-language pre-training models enable cost-effective end-to-end modeling but fall short in domain-specific ratiocination and exhibit disparities in task formulation. Toward this end, we present an entirely end-to-end solution for long-term VideoQA: Multi-granularity Contrastive cross-modal collaborative Generation (MCG) model. To derive discriminative representations possessing high visual concepts, we introduce Joint Unimodal Modeling (JUM) on a clip-bone architecture and leverage Multi-granularity Contrastive Learning (MCL) to harness the intrinsically or explicitly exhibited semantic correspondences. To alleviate the task formulation discrepancy problem, we propose a Cross-modal Collaborative Generation (CCG) module to reformulate VideoQA as a generative task instead of the conventional classification scheme, empowering the model with the capability for cross-modal high-semantic fusion and generation so as to rationalize and answer. Extensive experiments conducted on six publicly available VideoQA datasets underscore the superiority of our proposed method.

cs.CV↗

Jaynes-Cummings atoms coupled to a structured environment: Leakage elimination operators and the Petz recovery maps

We consider the Jaynes-Cummings (JC) model embedded in a structured environment, where the atom inside an optical cavity will be affected by a hierarchical environment consisting of the cavity and its environment. We propose several effective strategies to control and suppress the decoherence effects to protect the quantum coherence of the JC atom. We study the non-perturbative control of the system dynamics by means of the leakage elimination operators. We also investigate a full quantum state reversal scheme by engineering the system and its coupling to the bath via the Petz recovery map. Our findings conclude that, with the Petz recovery map, the dynamics of the JC atom can be fully recovered regardless of Markov or non-Markovian noises. Finally, we show that our quantum control and recovery methods are effective at protecting different aspects of the system coherence.

quant-ph↗

GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction

In this paper, we propose a Graph Inception Diffusion Networks(GIDN) model. This model generalizes graph diffusion in different feature spaces, and uses the inception module to avoid the large amount of computations caused by complex network structures. We evaluate GIDN model on Open Graph Benchmark(OGB) datasets, reached an 11% higher performance than AGDN on ogbl-collab dataset.

cs.LG↗

CPSDBench: A Large Language Model Evaluation Benchmark and Baseline for Chinese Public Security Domain

Large Language Models (LLMs) have demonstrated significant potential and effectiveness across multiple application domains. To assess the performance of mainstream LLMs in public security tasks, this study aims to construct a specialized evaluation benchmark tailored to the Chinese public security domain--CPSDbench. CPSDbench integrates datasets related to public security collected from real-world scenarios, supporting a comprehensive assessment of LLMs across four key dimensions: text classification, information extraction, question answering, and text generation. Furthermore, this study introduces a set of innovative evaluation metrics designed to more precisely quantify the efficacy of LLMs in executing tasks related to public security. Through the in-depth analysis and evaluation conducted in this research, we not only enhance our understanding of the performance strengths and limitations of existing models in addressing public security issues but also provide references for the future development of more accurate and customized LLM models targeted at applications in this field.

cs.AI↗

A Comprehensive Survey of 3D Dense Captioning: Localizing and Describing Objects in 3D Scenes

Three-Dimensional (3D) dense captioning is an emerging vision-language bridging task that aims to generate multiple detailed and accurate descriptions for 3D scenes. It presents significant potential and challenges due to its closer representation of the real world compared to 2D visual captioning, as well as complexities in data collection and processing of 3D point cloud sources. Despite the popularity and success of existing methods, there is a lack of comprehensive surveys summarizing the advancements in this field, which hinders its progress. In this paper, we provide a comprehensive review of 3D dense captioning, covering task definition, architecture classification, dataset analysis, evaluation metrics, and in-depth prosperity discussions. Based on a synthesis of previous literature, we refine a standard pipeline that serves as a common paradigm for existing methods. We also introduce a clear taxonomy of existing models, summarize technologies involved in different modules, and conduct detailed experiment analysis. Instead of a chronological order introduction, we categorize the methods into different classes to facilitate exploration and analysis of the differences and connections among existing techniques. We also provide a reading guideline to assist readers with different backgrounds and purposes in reading efficiently. Furthermore, we propose a series of promising future directions for 3D dense captioning by identifying challenges and aligning them with the development of related tasks, offering valuable insights and inspiring future research in this field. Our aim is to provide a comprehensive understanding of 3D dense captioning, foster further investigations, and contribute to the development of novel applications in multimedia and related domains.

cs.CV↗

PICO: Accelerating All k-Core Paradigms on GPU

Core decomposition is a well-established graph mining problem with various applications that involves partitioning the graph into hierarchical subgraphs. Solutions to this problem have been developed using both bottom-up and top-down approaches from the perspective of vertex convergence dependency. However, existing algorithms have not effectively harnessed GPU performance to expedite core decomposition, despite the growing need for enhanced performance. Moreover, approaching performance limitations of core decomposition from two different directions within a parallel synchronization structure has not been thoroughly explored. This paper introduces an efficient GPU acceleration framework, PICO, for the Peel and Index2core paradigms of k-core decomposition. We propose PeelOne, a Peel-based algorithm designed to simplify the parallel logic and minimize atomic operations by eliminating vertices that are 'under-core'. We also propose an Index2core-based algorithm, named HistoCore, which addresses the issue of extensive redundant computations across both vertices and edges. Extensive experiments on NVIDIA RTX 3090 GPU show that PeelOne outperforms all other Peel-based algorithms, and HistoCore outperforms all other Index2core-based algorithms. Furthermore, HistoCore even outperforms PeelOne by 1.1x - 3.2x speedup on six datasets, which breaks the stereotype that the Index2core paradigm performs much worse than the Peel in a shared memory parallel setting.

cs.DC↗

Schwarz lemma for harmonic functions in the unit ball

Recently, it is proven that positive harmonic functions defined in the unit disc or the upper half-plane in $\mathbb{C}$ are contractions in hyperbolic metrics \cite{Markovic}. Furthermore, the same result does not hold in higher dimensions as shown by given counterexamples \cite{Melentijevic-P}. In this paper, we shall show that positive (or bounded) harmonic functions defined in the unit ball in $\mathbb{R}^{n}$ are Lipschitz in hyperbolic metrics. The involved method in main results allows to establish essential improvements of Schwarz type inequalities for monogenic functions in Clifford analysis \cite{Zhang14,Zhang16} and octonionic analysis \cite{Wang-Bian-Liu} in a unified approach.

math.CV↗

Time-reversal assisted quantum metrology with an optimal control

We propose a protocol to overcome the shot noise limit and reach the Heisenberg scaling limit for parameter estimation by using quantum optimal control and a time-reversal strategy. Exemplified through the phase estimation, which can play an important role in quantum navigation and measurement, we show that the uncertainty arising from a photon number measurement of the system can saturate the assisted Creamér-Rao bound, independent of the phase being estimated. In a realistic case with photon loss, we show that the optimal estimation may still be attainable by optimal control and a projective measurement on an ancilla two-level system coupled to photonic modes.

quant-ph↗

Quantum synchronization via Active-Passive-Decomposition configuration: An open quantum system study

In this paper, we study the synchronization of dissipative quantum harmonic oscillators in the framework of quantum open system via the Active-Passive Decomposition (APD) configuration. We show that two or more quantum systems may be synchronized when the quantum systems of interest are embedded in dissipative environments and influenced by a common classical system. Such a classical system is typically termed as a controller, which (1) can drive quantum systems to cross different regimes (e.g., from periodic to chaotic motions) and (2) constructs the so-called Active-Passive Decomposition configuration such that all the quantum objects under consideration may be synchronized. The main findings of this paper is that we demonstrate that the complete synchronizations measured by the standard quantum deviation may be achieved for both stable regimes (quantum limit circles) and unstable regimes (quantum chaotic motions). As an example, we numerically show in an optomechanical setup that the complete synchronization can be realized in quantum mechanical resonators.

quant-ph↗