arXiv subjects

Peng Wang

Publications and source records attributed to Peng Wang.

At least 523 records · Page 29Linked to original sources

arXiv2024

Observation of period-doubling Bloch oscillations

Bloch oscillations refer to the periodic oscillation of a wavepacket in a lattice under a constant force. Typically, the oscillation has a fundamental period that corresponds to the wavepacket traversing the first Brillouin zone once. Here we demonstrate, both theoretically and experimentally, the optical Bloch oscillations where the wavepacket must traverse the first Brillouin zone twice to complete a full cycle, resulting in a period of oscillation that is two times longer than that of usual Bloch oscillations. The unusual Bloch oscillations arise due to the band crossing of valley-Hall topological edge states at the Brillouin boundary for zigzag domain walls between two staggered honeycomb lattices with inverted on-site energy detuning, which are protected by the glide-reflection symmetry of the underlying structures. Our work sheds light on the direct detection of band crossings resulting from intrinsic symmetries that extend beyond the fundamental translational symmetry in topological systems.

physics.optics↗

arXiv2024

Efficient Adaptation of Large Vision Transformer via Adapter Re-Composing

The advent of high-capacity pre-trained models has revolutionized problem-solving in computer vision, shifting the focus from training task-specific models to adapting pre-trained models. Consequently, effectively adapting large pre-trained models to downstream tasks in an efficient manner has become a prominent research area. Existing solutions primarily concentrate on designing lightweight adapters and their interaction with pre-trained models, with the goal of minimizing the number of parameters requiring updates. In this study, we propose a novel Adapter Re-Composing (ARC) strategy that addresses efficient pre-trained model adaptation from a fresh perspective. Our approach considers the reusability of adaptation parameters and introduces a parameter-sharing scheme. Specifically, we leverage symmetric down-/up-projections to construct bottleneck operations, which are shared across layers. By learning low-dimensional re-scaling coefficients, we can effectively re-compose layer-adaptive adapters. This parameter-sharing strategy in adapter design allows us to significantly reduce the number of new parameters while maintaining satisfactory performance, thereby offering a promising approach to compress the adaptation cost. We conduct experiments on 24 downstream image classification tasks using various Vision Transformer variants to evaluate our method. The results demonstrate that our approach achieves compelling transfer learning performance with a reduced parameter count. Our code is available at \href{https://github.com/DavidYanAnDe/ARC}{https://github.com/DavidYanAnDe/ARC}.

cs.CV↗

arXiv2024

Enhancing Throughput for TTEthernet via Co-optimizing Routing and Scheduling: An Online Time-Varying Graph-based Method

Time-Triggered Ethernet (TTEthernet) has been widely applied in many scenarios such as industrial internet, automotive electronics, and aerospace, where offline routing and scheduling for TTEthernet has been largely investigated. However, predetermined routes and schedules cannot meet the demands in some agile scenarios, such as smart factories, autonomous driving, and satellite network switching, where the transmission requests join in and leave the network frequently. Thus, we study the online joint routing and scheduling problem for TTEthernet. However, balancing efficient and effective routing and scheduling in an online environment can be quite challenging. To ensure high-quality and fast routing and scheduling, we first design a time-slot expanded graph (TSEG) to model the available resources of TTEthernet over time. The fine-grained representation of TSEG allows us to select a time slot via selecting an edge, thus transforming the scheduling problem into a simple routing problem. Next, we design a dynamic weighting method for each edge in TSEG and further propose an algorithm to co-optimize the routing and scheduling. Our scheme enhances the TTEthernet throughput by co-optimizing the routing and scheduling to eliminate potential conflicts among flow requests, as compared to existing methods. The extensive simulation results show that our scheme runs >400 times faster than standard solutions (i.e., ILP solver), while the gap is only 2% to the optimally scheduled number of flow requests. Besides, as compared to existing schemes, our method can improve the successfully scheduled number of flows by more than 18%.

cs.NI↗

arXiv2024

Timelike entanglement entropy and $T\bar{T}$ deformation

In a previous work arXiv:1811.07758 about the $T\bar{T}$ deformed CFT$_2$, from the consistency requirement of the entanglement entropy theory, we found that in addition to the usual spacelike entanglement entropy, a timelike entanglement entropy must be introduced and treated equally. Inspired by the recent explicit constructions of the timelike entanglement entropy and its bulk dual, we provide a comprehensive analysis of the timelike and spacelike entanglement entropies in the $T\bar{T}$ deformed finite size system and finite temperature system. The results confirm our prediction that in the finite size system only the timelike entanglement entropy receives a correction, while in the finite temperature system only the usual spacelike entanglement entropy gets a correction. These findings affirm the necessity of a complete measure including both spacelike and timelike entanglement entropies.

hep-th↗

arXiv2024

Timelike entanglement entropy in dS$_3$/CFT$_2$

In the context of dS$_3$/CFT$_2$, we propose a timelike entanglement entropy defined by the renormalization group flow. This timelike entanglement entropy is calculated in CFT by using the Callan-Symanzik equation. We find an exact match between this entanglement entropy and the length of a timelike geodesic connecting two different spacelike surfaces in dS$_3$.The counterpart of this entanglement entropy in AdS$_3$ is a spacelike one, also induced by RG flow and extends all the way into the bulk of AdS$_3$. As a result, in both AdS$_3$/CFT$_2$ and dS$_3$/CFT$_2$, there exist exactly three entanglement entropies, providing precisely sufficient information to reconstruct the three-dimensional bulk geometry.

hep-th↗

arXiv2024

Interferometric Signatures of Black Holes with Multiple Photon Spheres

It has been reported that the photon ring structure in black hole images produces strong and universal interferometric signatures on long interferometric baselines, holding promise for measuring black hole parameters and testing general relativity. This paper investigates the interferometric signatures of black holes with one or two photon spheres, specifically within the framework of Einstein-Maxwell-Scalar models. Notably, for black holes possessing two photon spheres, interference between light rays orbiting the inner and outer photon spheres manifests as beat signals in the visibility amplitude, deviating from the universal signatures observed in the single-photon sphere case.

gr-qc↗

arXiv2024

Observations of Orbiting Hot Spots around Scalarized Reissner-Nordström Black Holes

This paper investigates the observational signatures of hot spots orbiting scalarized Reissner-Nordström black holes, which have been reported to possess multiple photon spheres. In contrast to the single-photon sphere case, hot spots orbiting black holes with two photon spheres produce additional image tracks in time integrated images capturing a complete orbit of hot spots. Notably, these newly observed patterns manifest as a distinct second-highest peak in temporal magnitudes when observed at low inclination angles. These findings offer promising observational probes for distinguishing black holes with multiple photon spheres from their single-photon sphere counterparts.

gr-qc↗

arXiv2023

MVDiffusion: Enabling Holistic Multi-view Image Generation with Correspondence-Aware Diffusion

This paper introduces MVDiffusion, a simple yet effective method for generating consistent multi-view images from text prompts given pixel-to-pixel correspondences (e.g., perspective crops from a panorama or multi-view images given depth maps and poses). Unlike prior methods that rely on iterative image warping and inpainting, MVDiffusion simultaneously generates all images with a global awareness, effectively addressing the prevalent error accumulation issue. At its core, MVDiffusion processes perspective images in parallel with a pre-trained text-to-image diffusion model, while integrating novel correspondence-aware attention layers to facilitate cross-view interactions. For panorama generation, while only trained with 10k panoramas, MVDiffusion is able to generate high-resolution photorealistic images for arbitrary texts or extrapolate one perspective image to a 360-degree view. For multi-view depth-to-image generation, MVDiffusion demonstrates state-of-the-art performance for texturing a scene mesh.

cs.CV↗

arXiv2023

Quantitative Measurement of adhesion energy between nanolayers and substrates using a nanowire-supported bridging method

The measurement of adhesion energy between nanolayers and substrates holds significant importance for the design, fabrication, and stability assessment of micro-/nanoscale devices relying on nanolayers. In this study, we propose a nanowire-supported bridging method based on an optical microscope-based nanomanipulation technique to quantitatively measure the adhesion energy between nanolayers and substrates. Using this innovative approach, we conducted adhesion energy measurements between mica nanolayers and Si substrates, revealing a value of approximately 110 J/m2. Additionally, we discuss the applicable conditions of this new method. The proposed technique allows measurements in atmospheric conditions and is, in principle, applicable to all types of nanolayers and substrates. Consequently, it holds promise as a universal method for assessing adhesion energy between nanolayers and substrates, considering environmental factors such as atmosphere and roughness.

physics.app-ph↗

arXiv2023

Probing the thermodynamics of charged Gauss Bonnet AdS black holes with the Lyapunov exponent

In this paper, we investigate the thermodynamic properties of charged AdS Gauss-Bonnet black holes and the associations with the Lyapunov exponent. The chaotic features of the black holes and the isobaric heat capacity characterized by Lyapunov exponent are studied to reveal the stability of black hole phases. With the consideration of both timelike and null geodesic, we find the relationship between Lyapunov exponent and Hawking temperature can fully embody the feature of the Small/Large phase transition and the triple point even further. Then we briefly reveal the properties of Lyapunov exponent as an order parameter and explore the black hole shadow with it.

gr-qc↗

arXiv2023

VadCLIP: Adapting Vision-Language Models for Weakly Supervised Video Anomaly Detection

The recent contrastive language-image pre-training (CLIP) model has shown great success in a wide range of image-level tasks, revealing remarkable ability for learning powerful visual representations with rich semantics. An open and worthwhile problem is efficiently adapting such a strong model to the video domain and designing a robust video anomaly detector. In this work, we propose VadCLIP, a new paradigm for weakly supervised video anomaly detection (WSVAD) by leveraging the frozen CLIP model directly without any pre-training and fine-tuning process. Unlike current works that directly feed extracted features into the weakly supervised classifier for frame-level binary classification, VadCLIP makes full use of fine-grained associations between vision and language on the strength of CLIP and involves dual branch. One branch simply utilizes visual features for coarse-grained binary classification, while the other fully leverages the fine-grained language-image alignment. With the benefit of dual branch, VadCLIP achieves both coarse-grained and fine-grained video anomaly detection by transferring pre-trained knowledge from CLIP to WSVAD task. We conduct extensive experiments on two commonly-used benchmarks, demonstrating that VadCLIP achieves the best performance on both coarse-grained and fine-grained WSVAD, surpassing the state-of-the-art methods by a large margin. Specifically, VadCLIP achieves 84.51% AP and 88.02% AUC on XD-Violence and UCF-Crime, respectively. Code and features are released at https://github.com/nwpu-zxr/VadCLIP.

cs.CV↗

arXiv2023

Teacher Agent: A Knowledge Distillation-Free Framework for Rehearsal-based Video Incremental Learning

Rehearsal-based video incremental learning often employs knowledge distillation to mitigate catastrophic forgetting of previously learned data. However, this method faces two major challenges for video task: substantial computing resources from loading teacher model and limited replay capability from performance-limited teacher model. To address these problems, we first propose a knowledge distillation-free framework for rehearsal-based video incremental learning called \textit{Teacher Agent}. Instead of loading parameter-heavy teacher networks, we introduce an agent generator that is either parameter-free or uses only a few parameters to obtain accurate and reliable soft labels. This method not only greatly reduces the computing requirement but also circumvents the problem of knowledge misleading caused by inaccurate predictions of the teacher model. Moreover, we put forward a self-correction loss which provides an effective regularization signal for the review of old knowledge, which in turn alleviates the problem of catastrophic forgetting. Further, to ensure that the samples in the memory buffer are memory-efficient and representative, we introduce a unified sampler for rehearsal-based video incremental learning to mine fixed-length key video frames. Interestingly, based on the proposed strategies, the network exhibits a high level of robustness against spatial resolution reduction when compared to the baseline. Extensive experiments demonstrate the advantages of our method, yielding significant performance improvements while utilizing only half the spatial resolution of video clips as network inputs in the incremental phases.

cs.CV↗

arXiv2023

Joint Beam Scheduling and Power Optimization for Beam Hopping LEO Satellite Systems

Low earth orbit (LEO) satellite communications can provide ubiquitous and reliable services, making it an essential part of the Internet of Everything network. Beam hopping (BH) is an emerging technology for effectively addressing the issue of low resource utilization caused by the non-uniform spatio-temporal distribution of traffic demands. However, how to allocate multi-dimensional resources in a timely and efficient way for the highly dynamic LEO satellite systems remains a challenge. This paper proposes a joint beam scheduling and power optimization beam hopping (JBSPO-BH) algorithm considering the differences in the geographic distribution of sink nodes. The JBSPO-BH algorithm decouples the original problem into two sub-problems. The beam scheduling problem is modelled as a potential game, and the Nash equilibrium (NE) point is obtained as the beam scheduling strategy. Moreover, the penalty function interior point method is applied to optimize the power allocation. Simulation results show that the JBSPO-BH algorithm has low time complexity and fast convergence and achieves better performance both in throughput and fairness. Compared with greedy-based BH, greedy-based BH with the power optimization, round-robin BH, Max-SINR BH and satellite resource allocation algorithm, the throughput of the proposed algorithm is improved by 44.99%, 20.79%, 156.06%, 15.39% and 8.17%, respectively.

cs.NI↗

arXiv2023

ImageDream: Image-Prompt Multi-view Diffusion for 3D Generation

We introduce "ImageDream," an innovative image-prompt, multi-view diffusion model for 3D object generation. ImageDream stands out for its ability to produce 3D models of higher quality compared to existing state-of-the-art, image-conditioned methods. Our approach utilizes a canonical camera coordination for the objects in images, improving visual geometry accuracy. The model is designed with various levels of control at each block inside the diffusion model based on the input image, where global control shapes the overall object layout and local control fine-tunes the image details. The effectiveness of ImageDream is demonstrated through extensive evaluations using a standard prompt list. For more information, visit our project page at https://Image-Dream.github.io.

cs.CV↗

arXiv2023

Matching Weak Informative Ontologies

Most existing ontology matching methods utilize the literal information to discover alignments. However, some literal information in ontologies may be opaque and some ontologies may not have sufficient literal information. In this paper, these ontologies are named as weak informative ontologies (WIOs) and it is challenging for existing methods to matching WIOs. On one hand, string-based and linguistic-based matching methods cannot work well for WIOs. On the other hand, some matching methods use external resources to improve their performance, but collecting and processing external resources is still time-consuming. To address this issue, this paper proposes a practical method for matching WIOs by employing the ontology structure information to discover alignments. First, the semantic subgraphs are extracted from the ontology graph to capture the precise meanings of ontology elements. Then, a new similarity propagation model is designed for matching WIOs. Meanwhile, in order to avoid meaningless propagation, the similarity propagation is constrained by semantic subgraphs and other conditions. Consequently, the similarity propagation model ensures a balance between efficiency and quality during matching. Finally, the similarity propagation model uses a few credible alignments as seeds to find more alignments, and some useful strategies are adopted to improve the performance. This matching method for WIOs has been implemented in the ontology matching system Lily. Experimental results on public OAEI benchmark datasets demonstrate that Lily significantly outperforms most of the state-of-the-art works in both WIO matching tasks and general ontology matching tasks. In particular, Lily increases the recall by a large margin, while it still obtains high precision of matching results.

cs.AI↗

arXiv2023

Editing Large Language Models: Problems, Methods, and Opportunities

Despite the ability to train capable LLMs, the methodology for maintaining their relevancy and rectifying errors remains elusive. To this end, the past few years have witnessed a surge in techniques for editing LLMs, the objective of which is to efficiently alter the behavior of LLMs within a specific domain without negatively impacting performance across other inputs. This paper embarks on a deep exploration of the problems, methods, and opportunities related to model editing for LLMs. In particular, we provide an exhaustive overview of the task definition and challenges associated with model editing, along with an in-depth empirical analysis of the most progressive methods currently at our disposal. We also build a new benchmark dataset to facilitate a more robust evaluation and pinpoint enduring issues intrinsic to existing techniques. Our objective is to provide valuable insights into the effectiveness and feasibility of each editing technique, thereby assisting the community in making informed decisions on the selection of the most appropriate method for a specific task or context. Code and datasets are available at https://github.com/zjunlp/EasyEdit.

cs.CL↗

arXiv2023

Continual Referring Expression Comprehension via Dual Modular Memorization

Referring Expression Comprehension (REC) aims to localize an image region of a given object described by a natural-language expression. While promising performance has been demonstrated, existing REC algorithms make a strong assumption that training data feeding into a model are given upfront, which degrades its practicality for real-world scenarios. In this paper, we propose Continual Referring Expression Comprehension (CREC), a new setting for REC, where a model is learning on a stream of incoming tasks. In order to continuously improve the model on sequential tasks without forgetting prior learned knowledge and without repeatedly re-training from a scratch, we propose an effective baseline method named Dual Modular Memorization (DMM), which alleviates the problem of catastrophic forgetting by two memorization modules: Implicit-Memory and Explicit-Memory. Specifically, the former module aims to constrain drastic changes to important parameters learned on old tasks when learning a new task; while the latter module maintains a buffer pool to dynamically select and store representative samples of each seen task for future rehearsal. We create three benchmarks for the new CREC setting, by respectively re-splitting three widely-used REC datasets RefCOCO, RefCOCO+ and RefCOCOg into sequential tasks. Extensive experiments on the constructed benchmarks demonstrate that our DMM method significantly outperforms other alternatives, based on two popular REC backbones. We make the source code and benchmarks publicly available to foster future progress in this field: https://github.com/zackschen/DMM.

cs.CV↗

arXiv2023

Revisiting Large Language Models as Zero-shot Relation Extractors

Relation extraction (RE) consistently involves a certain degree of labeled or unlabeled data even if under zero-shot setting. Recent studies have shown that large language models (LLMs) transfer well to new tasks out-of-the-box simply given a natural language prompt, which provides the possibility of extracting relations from text without any data and parameter tuning. This work focuses on the study of exploring LLMs, such as ChatGPT, as zero-shot relation extractors. On the one hand, we analyze the drawbacks of existing RE prompts and attempt to incorporate recent prompt techniques such as chain-of-thought (CoT) to improve zero-shot RE. We propose the summarize-and-ask (\textsc{SumAsk}) prompting, a simple prompt recursively using LLMs to transform RE inputs to the effective question answering (QA) format. On the other hand, we conduct comprehensive experiments on various benchmarks and settings to investigate the capabilities of LLMs on zero-shot RE. Specifically, we have the following findings: (i) \textsc{SumAsk} consistently and significantly improves LLMs performance on different model sizes, benchmarks and settings; (ii) Zero-shot prompting with ChatGPT achieves competitive or superior results compared with zero-shot and fully supervised methods; (iii) LLMs deliver promising performance in extracting overlapping relations; (iv) The performance varies greatly regarding different relations. Different from small language models, LLMs are effective in handling challenge none-of-the-above (NoTA) relation.

cs.AI↗