Search arXiv⌕ Search

arXiv subjects

Jin Li

Publications and source records attributed to Jin Li.

At least 145 records · Page 8Linked to original sources

Scene Graph Generation with Role-Playing Large Language Models

Current approaches for open-vocabulary scene graph generation (OVSGG) use vision-language models such as CLIP and follow a standard zero-shot pipeline -- computing similarity between the query image and the text embeddings for each category (i.e., text classifiers). In this work, we argue that the text classifiers adopted by existing OVSGG methods, i.e., category-/part-level prompts, are scene-agnostic as they remain unchanged across contexts. Using such fixed text classifiers not only struggles to model visual relations with high variance, but also falls short in adapting to distinct contexts. To plug these intrinsic shortcomings, we devise SDSGG, a scene-specific description based OVSGG framework where the weights of text classifiers are adaptively adjusted according to the visual content. In particular, to generate comprehensive and diverse descriptions oriented to the scene, an LLM is asked to play different roles (e.g., biologist and engineer) to analyze and discuss the descriptive features of a given scene from different views. Unlike previous efforts simply treating the generated descriptions as mutually equivalent text classifiers, SDSGG is equipped with an advanced renormalization mechanism to adjust the influence of each text classifier based on its relevance to the presented scene (this is what the term "specific" means). Furthermore, to capture the complicated interplay between subjects and objects, we propose a new lightweight module called mutual visual adapter. It refines CLIP's ability to recognize relations by learning an interaction-aware semantic space. Extensive experiments on prevalent benchmarks show that SDSGG outperforms top-leading methods by a clear margin.

cs.CV↗

SPFresh: Incremental In-Place Update for Billion-Scale Vector Search

Approximate Nearest Neighbor Search (ANNS) is now widely used in various applications, ranging from information retrieval, question answering, and recommendation, to search for similar high-dimensional vectors. As the amount of vector data grows continuously, it becomes important to support updates to vector index, the enabling technique that allows for efficient and accurate ANNS on vectors. Because of the curse of high dimensionality, it is often costly to identify the right neighbors of a single new vector, a necessary process for index update. To amortize update costs, existing systems maintain a secondary index to accumulate updates, which are merged by the main index by global rebuilding the entire index periodically. However, this approach has high fluctuations of search latency and accuracy, not even to mention that it requires substantial resources and is extremely time-consuming for rebuilds. We introduce SPFresh, a system that supports in-place vector updates. At the heart of SPFresh is LIRE, a lightweight incremental rebalancing protocol to split vector partitions and reassign vectors in the nearby partitions to adapt to data distribution shift. LIRE achieves low-overhead vector updates by only reassigning vectors at the boundary between partitions, where in a high-quality vector index the amount of such vectors are deemed small. With LIRE, SPFresh provides superior query latency and accuracy to solutions based on global rebuild, with only 1% of DRAM and less than 10% cores needed at the peak compared to the state-of-the-art, in a billion scale vector index with 1% of daily vector update rate.

cs.IR↗

Isolated zero-energy flat-bands and intrinsic magnetism in carbon monolayers

Flat-band in twisted graphene bilayer has garnered widespread attention, and whether flat-bands can be realized in carbon monolayer is an interesting topic worth exploring in condensed matter physics. In this work, we demonstrate that, based on the theory of compact localized states, a series of two-dimensional carbon allotropes with flat-bands can be achieved. Two of them named as 191-8-66-C-r567x-1 and 191-10-90-C-r567x-1 are confirmed to be dynamically stable carbon phases with isolated or weakly overlapped flat-bands at the Fermi-level. The maximum Fermi velocities of the flat-band electrons are evaluated to be 1x10^4 m/s and 0.786x10^4 m/s, both of which are lower than the Fermi velocity of the flat-band electrons in magic-angle graphene (4x10^4 m/s). Furthermore, 191-8-66-C-r567x-1 has been confirmed to be a flat-band related magnetic half-metal with a magnetic moment of 1.854 miuB per cell, while 191-10-90-C-r567x-1 is a flat-band related magnetic normal metal with a magnetic moment of 1.663 miuB per cell. These results not only show that flat-bands can be constructed in carbon monolayer, but also indicate the potential for achieving metal-free magnetic materials with light elements based on flat-band theory.

cond-mat.mes-hall↗

Cost-Effective Online Multi-LLM Selection with Versatile Reward Models

With the rapid advancement of large language models (LLMs), the diversity of multi-LLM tasks and the variability in their pricing structures have become increasingly important, as costs can vary greatly between different LLMs. To tackle these challenges, we introduce the \textit{C2MAB-V}, a \underline{C}ost-effective \underline{C}ombinatorial \underline{M}ulti-armed \underline{B}andit with \underline{V}ersatile reward models for optimal LLM selection and usage. This online model differs from traditional static approaches or those reliant on a single LLM without cost consideration. With multiple LLMs deployed on a scheduling cloud and a local server dedicated to handling user queries, \textit{C2MAB-V} facilitates the selection of multiple LLMs over a combinatorial search space, specifically tailored for various collaborative task types with different reward models. Based on our designed online feedback mechanism and confidence bound technique, \textit{C2MAB-V} can effectively address the multi-LLM selection challenge by managing the exploration-exploitation trade-off across different models, while also balancing cost and reward for diverse tasks. The NP-hard integer linear programming problem for selecting multiple LLMs with trade-off dilemmas is addressed by: i) decomposing the integer problem into a relaxed form by the local server, ii) utilizing a discretization rounding scheme that provides optimal LLM combinations by the scheduling cloud, and iii) continual online updates based on feedback. Theoretically, we prove that \textit{C2MAB-V} offers strict guarantees over versatile reward models, matching state-of-the-art results for regret and violations in some degenerate cases. Empirically, we show that \textit{C2MAB-V} effectively balances performance and cost-efficiency with nine LLMs for three application scenarios.

cs.LG↗

Why Are Learned Indexes So Effective but Sometimes Ineffective?

Learned indexes have attracted significant research interest due to their ability to offer better space-time trade-offs compared to traditional B+-tree variants. Among various learned indexes, the PGM-Index based on error-bounded piecewise linear approximation is an elegant data structure that has demonstrated \emph{provably} superior performance over conventional B+-tree indexes. In this paper, we explore two interesting research questions regarding the PGM-Index: (a) \emph{Why are PGM-Indexes theoretically effective?} and (b) \emph{Why do PGM-Indexes underperform in practice?} For question~(a), we first prove that, for a set of $N$ sorted keys, the PGM-Index can, with high probability, achieve a lookup time of $O(\log\log N)$ while using $O(N)$ space. To the best of our knowledge, this is the \textbf{tightest bound} for learned indexes to date. For question~(b), we identify that querying PGM-Indexes is highly memory-bound, where the internal error-bounded search operations often become the bottleneck. To fill the performance gap, we propose PGM++, a \emph{simple yet effective} extension to the original PGM-Index that employs a mixture of different search strategies, with hyper-parameters automatically tuned through a calibrated cost model. Extensive experiments on real workloads demonstrate that PGM++ establishes a new Pareto frontier. At comparable space costs, PGM++ speeds up index lookup queries by up to $\mathbf{2.31\times}$ and $\mathbf{1.56\times}$ when compared to the original PGM-Index and state-of-the-art learned indexes.

cs.DB↗

Optimization of Nuclear Mass Models Using Algorithms and Neural Networks

Taking into account nucleon-nucleon gravitational interaction, higher-order terms of symmetry energy, pairing interaction, and neural network corrections, a new BW4 mass model has been developed, which more accurately reflects the contributions of various terms to the binding energy. A novel hybrid algorithm and neural network correction method has been implemented to optimize the discrepancy between theoretical and experimental results, significantly improving the model's binding energy predictions (reduced to around 350 keV). At the same time, the theoretical accuracy near magic nuclei has been marginally enhanced, effectively capturing the special interaction effects around magic nuclei and showing good agreement with experimental data.

nucl-th↗

Holographic Einstein Rings of AdS Black Holes in Horndeski Theory

By utilizing the AdS/CFT correspondence and wave optics techniques, we conducted an extensive study of the imaging properties of holographic Einstein rings in the context of Anti-de Sitter (AdS) black holes (BHs) in Horndeski theory. Our results indicate that the optical characteristics of these holographic Einstein rings are significantly influenced by the observer's position, the physical parameters of the BH, the nature of the wave source, and the configuration of the optical system. Specifically, when the observer is positioned at the north pole of the AdS boundary, the holographic image prominently displays a ring structure aligning with the BH's photon sphere. We thoroughly analyzed how various physical parameters -- including the observation position, event horizon radius, temperature, and the parameter $γ$ in Horndeski theory -- affect the holographic Einstein rings. These parameters play a crucial role in determining the rings' radius and brightness, with variations potentially causing the ring structures to deform or even transform into bright spots. Furthermore, our comparative analysis between wave optics and geometric optics reveals a strong agreement in predicting the positions and brightnesses of both the photon ring and the Einstein ring. This research offers new insights into the spacetime geometry of BHs in Horndeski theory and proposes a promising framework for exploring the gravitational duals of strongly coupled systems.

gr-qc↗

Fourth-order compact finite difference schemes for solving biharmonic equations with Dirichlet boundary conditions

In this study, we propose a genuine fourth-order compact finite difference scheme for solving biharmonic equations with Dirichlet boundary conditions in both two and three dimensions. In the 2D case, we build upon the high-order compact (HOC) schemes for flux-type boundary conditions originally developed by Zhilin Li and Kejia Pan [SIAM J. Sci. Comput., 45 (2023), pp. A646-A674] to construct a high order compact discretization for coupled boundary conditions. When considering the 3D case, we modify carefully designed undetermined coefficient methods of Li and Pan to derive the finite difference approximations of coupled boundary conditions. The resultant FD discretization maintains the global fourth order convergence and compactness. Unlike the very popular Stephenson method, the number of unknows do not increase with dimensions. Besides, it is noteworthy that the condition number of the coefficient matrix increases at a rate of $O(h^{-2})$ in both 2D and 3D. We also validate the performance of the proposed genuine HOC methods through nontrivial examples.

math.NA↗

Progressive Residual Extraction based Pre-training for Speech Representation Learning

Self-supervised learning (SSL) has garnered significant attention in speech processing, excelling in linguistic tasks such as speech recognition. However, jointly improving the performance of pre-trained models on various downstream tasks, each requiring different speech information, poses significant challenges. To this purpose, we propose a progressive residual extraction based self-supervised learning method, named ProgRE. Specifically, we introduce two lightweight and specialized task modules into an encoder-style SSL backbone to enhance its ability to extract pitch variation and speaker information from speech. Furthermore, to prevent the interference of reinforced pitch variation and speaker information with irrelevant content information learning, we residually remove the information extracted by these two modules from the main branch. The main branch is then trained using HuBERT's speech masking prediction to ensure the performance of the Transformer's deep-layer features on content tasks. In this way, we can progressively extract pitch variation, speaker, and content representations from the input speech. Finally, we can combine multiple representations with diverse speech information using different layer weights to obtain task-specific representations for various downstream tasks. Experimental results indicate that our proposed method achieves joint performance improvements on various tasks, such as speaker identification, speech recognition, emotion recognition, speech enhancement, and voice conversion, compared to excellent SSL methods such as wav2vec2.0, HuBERT, and WavLM.

eess.AS↗

Privacy Amplification via Shuffling: Unified, Simplified, and Tightened

The shuffle model of differential privacy provides promising privacy-utility balances in decentralized, privacy-preserving data analysis. However, the current analyses of privacy amplification via shuffling lack both tightness and generality. To address this issue, we propose the \emph{variation-ratio reduction} as a comprehensive framework for privacy amplification in both single-message and multi-message shuffle protocols. It leverages two new parameterizations: the total variation bounds of local messages and the probability ratio bounds of blanket messages, to determine indistinguishability levels. Our theoretical results demonstrate that our framework provides tighter bounds, especially for local randomizers with extremal probability design, where our bounds are exactly tight. Additionally, variation-ratio reduction complements parallel composition in the shuffle model, yielding enhanced privacy accounting for popular sampling-based randomizers employed in statistical queries (e.g., range queries, marginal queries, and frequent itemset mining). Empirical findings demonstrate that our numerical amplification bounds surpass existing ones, conserving up to $30\%$ of the budget for single-message protocols, $75\%$ for multi-message ones, and a striking $75\%$-$95\%$ for parallel composition. Our bounds also result in a remarkably efficient $\tilde{O}(n)$ algorithm that numerically amplifies privacy in less than $10$ seconds for $n=10^8$ users.

cs.CR↗

Shadows, Quasinormal Modes, and Optical Appearances of Black Holes in Horndeski Theory

This work describes the motion of photons in black hole (BH) spacetimes within the framework of Horndeski theory. We focus on the shadows, quasinormal modes (QNMs) and optical appearances of BHs surrounded by geometrically thin accretion disks. The QNMs of BHs are calculated by the WKB method and the eikonal limit, respectively. Using Event Horizon Telescope (EHT) observations of $\mathrm{M} 87^*$ and $\mathrm{Sgr} \mathrm{A}^*$, we can constrain the parameter in Horndeski theory to a small range. Based on the constraint, we obtain the frequency ranges of the fundamental modes for $\mathrm{M} 87^*$ and $\mathrm{Sgr} \mathrm{A}^*$ in Horndeski theory. By exploring the optical appearances of BHs, we find that for the current resolution of the EHT, it primarily captures direct emission. This work advances our understanding of the observational characteristics of BHs in Horndeski theory and constrains Horndeski theory by EHT observations of $\mathrm{M} 87^*$ and $\mathrm{Sgr} \mathrm{A}^*$.

gr-qc↗

Effectiveness Study of Calibration and Correction Algorithms on the Prototype of the POLAR-2/LPD Detector

Gaseous X-ray polarimetry refers to a class of detectors used for measuring the polarization of soft X-rays. The systematic effects of such detectors introduce residual modulation, leading to systematic biases in the polarization detection results of the source. This paper discusses the systematic effects and their calibration and correction using the Gas Microchannel Plate-Pixel Detector (GMPD) prototype for POLAR-2/Low-Energy X-ray Polarization Detector (LPD). Additionally, we propose an algorithm that combines parameterization with Monte Carlo simulation and Bayesian iteration to eliminate residual modulation. The residual modulation after data correction at different energy points has been reduced to below 1%, and a good linear relationship is observed between the polarization degree and modulation degree. The improvement in modulation degree after correction ranges from 2% to 15%, and the results exceed those of the Imaging X-Ray Polarimetry Explorer (IXPE) above 5 keV.

astro-ph.IM↗

PointSCNet: Point Cloud Structure and Correlation Learning Based on Space Filling Curve-Guided Sampling

Geometrical structures and the internal local region relationship, such as symmetry, regular array, junction, etc., are essential for understanding a 3D shape. This paper proposes a point cloud feature extraction network named PointSCNet, to capture the geometrical structure information and local region correlation information of a point cloud. The PointSCNet consists of three main modules: the space-filling curve-guided sampling module, the information fusion module, and the channel-spatial attention module. The space-filling curve-guided sampling module uses Z-order curve coding to sample points that contain geometrical correlation. The information fusion module uses a correlation tensor and a set of skip connections to fuse the structure and correlation information. The channel-spatial attention module enhances the representation of key points and crucial feature channels to refine the network. The proposed PointSCNet is evaluated on shape classification and part segmentation tasks. The experimental results demonstrate that the PointSCNet outperforms or is on par with state-of-the-art methods by learning the structure and correlation of point clouds effectively.

cs.CV↗

ParamReL: Learning Parameter Space Representation via Progressively Encoding Bayesian Flow Networks

The recently proposed Bayesian Flow Networks~(BFNs) show great potential in modeling parameter spaces, offering a unified strategy for handling continuous, discretized, and discrete data. However, BFNs cannot learn high-level semantic representation from the parameter space since {common encoders, which encode data into one static representation, cannot capture semantic changes in parameters.} This motivates a new direction: learning semantic representations hidden in the parameter spaces to characterize mixed-typed noisy data. {Accordingly, we propose a representation learning framework named ParamReL, which operates in the parameter space to obtain parameter-wise latent semantics that exhibit progressive structures. Specifically, ParamReL proposes a \emph{self-}encoder to learn latent semantics directly from parameters, rather than from observations. The encoder is then integrated into BFNs, enabling representation learning with various formats of observations. Mutual information terms further promote the disentanglement of latent semantics and capture meaningful semantics simultaneously.} We illustrate {conditional generation and reconstruction} in ParamReL via expanding BFNs, and extensive {quantitative} experimental results demonstrate the {superior effectiveness} of ParamReL in learning parameter representation.

cs.LG↗

Are You Copying My Prompt? Protecting the Copyright of Vision Prompt for VPaaS via Watermark

Visual Prompt Learning (VPL) differs from traditional fine-tuning methods in reducing significant resource consumption by avoiding updating pre-trained model parameters. Instead, it focuses on learning an input perturbation, a visual prompt, added to downstream task data for making predictions. Since learning generalizable prompts requires expert design and creation, which is technically demanding and time-consuming in the optimization process, developers of Visual Prompts as a Service (VPaaS) have emerged. These developers profit by providing well-crafted prompts to authorized customers. However, a significant drawback is that prompts can be easily copied and redistributed, threatening the intellectual property of VPaaS developers. Hence, there is an urgent need for technology to protect the rights of VPaaS developers. To this end, we present a method named \textbf{WVPrompt} that employs visual prompt watermarking in a black-box way. WVPrompt consists of two parts: prompt watermarking and prompt verification. Specifically, it utilizes a poison-only backdoor attack method to embed a watermark into the prompt and then employs a hypothesis-testing approach for remote verification of prompt ownership. Extensive experiments have been conducted on three well-known benchmark datasets using three popular pre-trained models: RN50, BIT-M, and Instagram. The experimental results demonstrate that WVPrompt is efficient, harmless, and robust to various adversarial operations.

cs.CR↗

Comparison and application of different post-Newtonian models for inspiralling stellar-mass binary black holes with space-based GW detectors

Space-based gravitational wave (GW) detectors are expected to detect the stellar-mass binary black holes (SBBHs) inspiralling in the low-frequency band, which exist in several years before the merger. Accurate GW waveforms in the inspiral phase are crucial for the detection and analysis of those SBBHs. In our study, based on post-Newtonian (PN) models, we investigate the differences in the detection, accuracy requirement, and parameter estimation of SBBHs in the cases of LISA, Taiji, and their joint detection. We find that low-order PN models are sufficient for simulating low-mass ($\le 50\ \mathrm{M}_\odot$) SBBHs population. Moreover, for detectable SBBHs in space-based GW detectors, over 90% of the GW signals from low-order PN models meet accuracy requirement. Additionally, different PN models do not exhibit significant differences in Bayesian inference. Our research provides a comprehensive reference for balancing computational resources and the desired accuracy of GW waveform generation. It highlights the suitability of low-order PN models for simulating SBBHs and emphasizes their potential in the detection and parameter estimation of SBBHs.

gr-qc↗

Incremental Learning with Concept Drift Detection and Prototype-based Embeddings for Graph Stream Classification

Data stream mining aims at extracting meaningful knowledge from continually evolving data streams, addressing the challenges posed by nonstationary environments, particularly, concept drift which refers to a change in the underlying data distribution over time. Graph structures offer a powerful modelling tool to represent complex systems, such as, critical infrastructure systems and social networks. Learning from graph streams becomes a necessity to understand the dynamics of graph structures and to facilitate informed decision-making. This work introduces a novel method for graph stream classification which operates under the general setting where a data generating process produces graphs with varying nodes and edges over time. The method uses incremental learning for continual model adaptation, selecting representative graphs (prototypes) for each class, and creating graph embeddings. Additionally, it incorporates a loss-based concept drift detection mechanism to recalculate graph prototypes when drift is detected.

cs.LG↗

$\operatorname{SL}(n)$ contravariant function-valued valuations on polytopes

We present a complete classification of $\operatorname{SL}(n)$ contravariant, $C(\mathbb{R}^n\setminus\{o\})$-valued valuations on polytopes, without any additional assumptions.It extends the previous results of the second author [Int. Math. Res. Not. 2020] which have a good connection with the $L_p$ and Orlicz Brunn-Minkowski theory. Additionally, our results deduce a complete classification of $\operatorname{SL}(n)$ contravariant symmetric-tensor-valued valuations on polytopes.

math.MG↗