Searcharxiv⌕ Search

arXiv subjects

Cong Zhang

Publications and source records attributed to Cong Zhang.

At least 109 records · Page 6Linked to original sources
arXiv2024

SCALM: Towards Semantic Caching for Automated Chat Services with Large Language Models

Large Language Models (LLMs) have become increasingly popular, transforming a wide range of applications across various domains. However, the real-world effectiveness of their query cache systems has not been thoroughly investigated. In this work, we for the first time conducted an analysis on real-world human-to-LLM interaction data, identifying key challenges in existing caching solutions for LLM-based chat services. Our findings reveal that current caching methods fail to leverage semantic connections, leading to inefficient cache performance and extra token costs. To address these issues, we propose SCALM, a new cache architecture that emphasizes semantic analysis and identifies significant cache entries and patterns. We also detail the implementations of the corresponding cache storage and eviction strategies. Our evaluations show that SCALM increases cache hit ratios and reduces operational costs for LLMChat services. Compared with other state-of-the-art solutions in GPTCache, SCALM shows, on average, a relative increase of 63% in cache hit ratio and a relative improvement of 77% in tokens savings.

cs.CL↗
arXiv2024

Investigating differences in lab-quality and remote recording methods with dynamic acoustic measures

Increasingly, phonetic research utilizes data collected from participants who record themselves on readily available devices. Though such recordings are convenient, their suitability for acoustic analysis remains an open question, especially regarding how the individual methods affect acoustic measures over time. We used Quantile Generalized Additive Mixed Models (QGAMMs) to analyze measures of F0, intensity, and the first and second formants, comparing files recorded using a laboratory-standard recording method (Zoom H6 Recorder with an external microphone), to three remote recording methods, (1) the Awesome Voice Recorder application on a smartphone (AVR), (2) the Zoom meeting application with default settings (Zoom-default), and (3) the Zoom meeting application with the "Turn on Original Sound" setting (Zoom-raw). A linear temporal alignment issue was observed for the Zoom methods over the course of the long, recording session files. However, the difference was not significant for utterance-length files. F0 was reliably measured using all methods. Intensity and formants presented non-linear differences across methods that could not be corrected for simply. Overall, the AVR files were most similar to the H6's, and so AVR is deemed to be a more reliable recording method than either Zoom-default or Zoom-raw.

cs.SD↗
arXiv2024

Multi-view Content-aware Indexing for Long Document Retrieval

Long document question answering (DocQA) aims to answer questions from long documents over 10k words. They usually contain content structures such as sections, sub-sections, and paragraph demarcations. However, the indexing methods of long documents remain under-explored, while existing systems generally employ fixed-length chunking. As they do not consider content structures, the resultant chunks can exclude vital information or include irrelevant content. Motivated by this, we propose the Multi-view Content-aware indexing (MC-indexing) for more effective long DocQA via (i) segment structured document into content chunks, and (ii) represent each content chunk in raw-text, keywords, and summary views. We highlight that MC-indexing requires neither training nor fine-tuning. Having plug-and-play capability, it can be seamlessly integrated with any retrievers to boost their performance. Besides, we propose a long DocQA dataset that includes not only question-answer pair, but also document structure and answer scope. When compared to state-of-art chunking schemes, MC-indexing has significantly increased the recall by 42.8%, 30.0%, 23.9%, and 16.3% via top k= 1.5, 3, 5, and 10 respectively. These improved scores are the average of 8 widely used retrievers (2 sparse and 6 dense) via extensive experiments.

cs.CL↗
arXiv2024

Large-scale Array for Radio Astronomy on the Farside

At the Royal Society meeting in 2023, we have mainly presented our lunar orbit array concept called DSL, and also briefly introduced a concept of a lunar surface array, LARAF. As the DSL concept had been presented before, in this article we introduce the LARAF. We propose to build an array in the far side of the Moon, with a master station which handles the data collection and processing, and 20 stations with maximum baseline of 10 km. Each station consists 12 membrane antenna units, and the stations are connected to the master station by power line and optical fiber. The array will make interferometric observation in the 0.1-50 MHz band during the lunar night, powered by regenerated fuel cells (RFCs). The whole array can be carried to the lunar surface with a heavy rocket mission, and deployed with a rover in 8 months. Such an array would be an important step in the long term development of lunar based ultralong wavelength radio astronomy. It has a sufficiently high sensitivity to observe many radio sources in the sky, though still short of the dark age fluctuations. We discuss the possible options in the power supply, data communication, deployment, etc.

astro-ph.IM↗
arXiv2024

Decision-making with Speculative Opponent Models

Opponent modelling has proven effective in enhancing the decision-making of the controlled agent by constructing models of opponent agents. However, existing methods often rely on access to the observations and actions of opponents, a requirement that is infeasible when such information is either unobservable or challenging to obtain. To address this issue, we introduce Distributional Opponent-aided Multi-agent Actor-Critic (DOMAC), the first speculative opponent modelling algorithm that relies solely on local information (i.e., the controlled agent's observations, actions, and rewards). Specifically, the actor maintains a speculated belief about the opponents using the tailored speculative opponent models that predict the opponents' actions using only local information. Moreover, DOMAC features distributional critic models that estimate the return distribution of the actor's policy, yielding a more fine-grained assessment of the actor's quality. This thus more effectively guides the training of the speculative opponent models that the actor depends upon. Furthermore, we formally derive a policy gradient theorem with the proposed opponent models. Extensive experiments under eight different challenging multi-agent benchmark tasks within the MPE, Pommerman and StarCraft Multiagent Challenge (SMAC) demonstrate that our DOMAC successfully models opponents' behaviours and delivers superior performance against state-of-the-art methods with a faster convergence speed.

cs.AI↗
arXiv2024

First Demonstration of 25λ x 10 Gb/s C+L Band Classical / DV-QKD Co-Existence Over Single Bidirectional Fiber Link

As quantum key distribution has reached the maturity level for practical deployment, questions about the co-integration with existing classical communication systems are of utmost importance. To this end we demonstrate how the co-propagation of classical and quantum signals can benefit from the development of novel hollow-core fibers. We demonstrate a secure key rate of 330 bit/s for a quantum channel at 1538 nm in the presence of 25 x 10 Gb/s classical channels, transmitted at an aggregated launch power of 12 dBm, spanning over the C+L-band in the same hollow-core fiber link. Furthermore, we show the co-integration of the classical key-distillation channel onto this fiber link, turning it into a bidirectional fiber link and thereby mitigating the need for multiple fibers. We believe this to be an important step towards the deployment and integration of hollow-core fibers together with DV-QKD for the inherently secure telecom network of the future.

quant-ph↗
arXiv2024

Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop Scheduling

Recent studies in using deep reinforcement learning (DRL) to solve Job-shop scheduling problems (JSSP) focus on construction heuristics. However, their performance is still far from optimality, mainly because the underlying graph representation scheme is unsuitable for modelling partial solutions at each construction step. This paper proposes a novel DRL-guided improvement heuristic for solving JSSP, where graph representation is employed to encode complete solutions. We design a Graph Neural-Network-based representation scheme, consisting of two modules to effectively capture the information of dynamic topology and different types of nodes in graphs encountered during the improvement process. To speed up solution evaluation during improvement, we present a novel message-passing mechanism that can evaluate multiple solutions simultaneously. We prove that the computational complexity of our method scales linearly with problem size. Experiments on classic benchmarks show that the improvement policy learned by our method outperforms state-of-the-art DRL-based methods by a large margin.

cs.LG↗
arXiv2024

Cosmological Dynamics from Covariant Loop Quantum Gravity with Scalar Matter

We study homogenous and isotropic quantum cosmology using the spinfoam formalism of Loop Quantum Gravity (LQG). We define a coupling of a scalar field to the 4-dimensional Lorentzian Engle-Pereira-Rovelli-Livine (EPRL) spinfoam model. We employ the numerical method of complex critical points to investigate the model on two different simplicial complexes: the triangulations of a single hypercube and two connected hypercubes. We find nontrivial implications for the effective cosmological dynamics. In the single-hypercube model, the numerical results suggest an effective Friedmann equation with a scalar density that contains higher-order derivatives and a scalar potential. The scalar potential plays a role similar to a positive cosmological constant and drives an accelerated expansion of the universe. The double-hypercubes model resembles a symmetric cosmic bounce, and a similar effective Friedmann equation emerges with higher-order derivative terms in the effective scalar density, whereas the scalar potential becomes negligible.

gr-qc↗
arXiv2023

Conformally Invariant Brans-Dicke Loop Quantum Cosmology: A Quantum Geometric Model of Linking Theory

The loop quantization of the conformal Brans-Dicke cosmology is explored in the spatially flat and Bianchi-I setting. The scalar and conformal constraints governing the canonical model are quantized using the loop techniques. The physical Hilbert space of quantum spacetimes satisfying both quantum constraints is then obtained by incorporating the quantum geometric features. The Schrödinger cosmic evolutions are derived with the relational Heisenberg observables describing the dynamical degrees of freedom with respect to the chosen reference degrees of freedom, with the latter providing the physical coordinates for the spatial hypersurfaces and the conformal scales. We show that the emerging Schrödinger theories contain not only the loop quantum cosmology of GR, but also that of the so-called shape dynamics. The exact dictionary between the two theories is achieved via the underlying physical Hilbert space possessing the additional (loop-corrected) conformal symmetry.

gr-qc↗
arXiv2023

Evaluation of Infrastructure-based Warning System on Driving Behaviors-A Roundabout Study

Smart intersections have the potential to improve road safety with sensing, communication, and edge computing technologies. Perception sensors installed at a smart intersection can monitor the traffic environment in real time and send infrastructure-based warnings to nearby travelers through V2X communication. This paper investigated how infrastructure-based warnings can influence driving behaviors and improve roundabout safety through a driving-simulator study - a challenging driving scenario for human drivers. A co-simulation platform integrating Simulation of Urban Mobility (SUMO) and Webots was developed to serve as the driving simulator. A real-world roundabout in Ann Arbor, Michigan was built in the co-simulation platform as the study area, and the merging scenarios were investigated. 36 participants were recruited and asked to navigate the roundabout under three danger levels (e.g., low, medium, high) and three collision warning designs (e.g., no warning, warning issued 1 second in advance, warning issued 2 seconds in advance). Results indicated that advanced warnings can significantly enhance safety by minimizing potential risks compared to scenarios without warnings. Earlier warnings enabled smoother driver responses and reduced abrupt decelerations. In addition, a personalized intention prediction model was developed to predict drivers' stop-or-go decisions when the warning is displayed. Among all tested machine learning models, the XGBoost model achieved the highest prediction accuracy with a precision rate of 95.56% and a recall rate of 97.73%.

cs.HC↗
arXiv2023

Automatic detection of boosted Higgs boson and top quark jets in an event image

We build a deep neural network based on the Mask R-CNN framework to detect the Higgs jets and top quark jets in any event image. We propose an algorithm to assign the top quark final states at the ground truth level so that the network can be trained in a supervised manner. A new jet branch is added to the network, which uses constituent information to predict the four-momenta of the original parton, thus intrinsically implementing the pileup mitigation. The network can predict both the shapes and the momenta of target jets. We show that the network surpasses the LorentzNet in top and Higgs tagging and the PELICAN network in momentum regression for certain cases, in terms of reconstruction efficiency and accuracy. We also show that the performance of the network does not degrade much when applied to events of a process different from the trained one and to events with overlapping jets.

hep-ph↗
arXiv2023

Semi-supervised Medical Image Segmentation via Query Distribution Consistency

Semi-supervised learning is increasingly popular in medical image segmentation due to its ability to leverage large amounts of unlabeled data to extract additional information. However, most existing semi-supervised segmentation methods focus only on extracting information from unlabeled data. In this paper, we propose a novel Dual KMax UX-Net framework that leverages labeled data to guide the extraction of information from unlabeled data. Our approach is based on a mutual learning strategy that incorporates two modules: 3D UX-Net as our backbone meta-architecture and KMax decoder to enhance the segmentation performance. Extensive experiments on the Atrial Segmentation Challenge dataset have shown that our method can significantly improve performance by merging unlabeled data. Meanwhile, our framework outperforms state-of-the-art semi-supervised learning methods on 10\% and 20\% labeled settings. Code located at: https://github.com/Rows21/DK-UXNet.

cs.CV↗
arXiv2023

Collaborative Camouflaged Object Detection: A Large-Scale Dataset and Benchmark

In this paper, we provide a comprehensive study on a new task called collaborative camouflaged object detection (CoCOD), which aims to simultaneously detect camouflaged objects with the same properties from a group of relevant images. To this end, we meticulously construct the first large-scale dataset, termed CoCOD8K, which consists of 8,528 high-quality and elaborately selected images with object mask annotations, covering 5 superclasses and 70 subclasses. The dataset spans a wide range of natural and artificial camouflage scenes with diverse object appearances and backgrounds, making it a very challenging dataset for CoCOD. Besides, we propose the first baseline model for CoCOD, named bilateral-branch network (BBNet), which explores and aggregates co-camouflaged cues within a single image and between images within a group, respectively, for accurate camouflaged object detection in given images. This is implemented by an inter-image collaborative feature exploration (CFE) module, an intra-image object feature search (OFS) module, and a local-global refinement (LGR) module. We benchmark 18 state-of-the-art models, including 12 COD algorithms and 6 CoSOD algorithms, on the proposed CoCOD8K dataset under 5 widely used evaluation metrics. Extensive experiments demonstrate the effectiveness of the proposed method and the significantly superior performance compared to other competitors. We hope that our proposed dataset and model will boost growth in the COD community. The dataset, model, and results will be available at: https://github.com/zc199823/BBNet--CoCOD.

cs.CV↗
arXiv2023

Homography matrix based trajectory planning method for robot uncalibrated visual servoing

In view of the classical visual servoing trajectory planning method which only considers the camera trajectory, this paper proposes one homography matrix based trajectory planning method for robot uncalibrated visual servoing. Taking the robot-end-effector frame as one generic case, eigenvalue decomposition is utilized to calculate the infinite homography matrix of the robot-end-effector trajectory, and then the image feature-point trajectories corresponding to the camera rotation is obtained, while the image feature-point trajectories corresponding to the camera translation is obtained by the homography matrix. According to the additional image corresponding to the robot-end-effector rotation, the relationship between the robot-end-effector rotation and the variation of the image feature-points is obtained, and then the expression of the image trajectories corresponding to the optimal robot-end-effector trajectories (the rotation trajectory of the minimum geodesic and the linear translation trajectory) are obtained. Finally, the optimal image trajectories of the uncalibrated visual servoing controller is modified to track the image trajectories. Simulation experiments show that, compared with the classical IBUVS method, the proposed trajectory planning method can obtain the shortest path of any frame and complete the robot visual servoing task with large initial pose deviation.

cs.RO↗
arXiv2023

The thermodynamics of isolated horizons in loop quantum gravity

The statistical mechanical calculation of the thermodynamical properties of non-rotating isolated horizons are studied in the loop quantum gravity framework. By employing the Hawking temperature and horizon mass of isolated horizons as physical inputs, the microcanonical ensemble associated with the system are well established. As a result, the black hole entropy and other thermodynamical quantities can be computed and consistent with well-known Hawking's semiclassical analysis. Moreover, the value of the Immirzi parameter of loop quantum gravity for {higher dimensional case and 4-dimensional U(1) case are} also obtained.

gr-qc↗
arXiv2023

Boosting indirect detection of a secluded dark matter sector

Dark Matter (DM) residing in a secluded sector with suppressed portal interaction could evade direct detections and collider searches. The indirect detections provide the most robust probe to this scenario. Depending on the structure of the dark sector, novel DM annihilation spectra are possible. The dark shower is a common phenomenon for particles in the dark sector which take part in strong interactions and are boosted. In terms of simplified two-component DM models with vector portal interaction and pseudoscalar portal interaction, we study the dark showering effects for DM indirect detection. In those models, the heavier DM component which dominates the relic density annihilates into boosted lighter species. Together with the large coupling through which the lighter DM annihilates away in the early universe, the showered spectra provide as the smoking gun for the DM existence. Considering bounds obtained by the AMS-02 positron data and Fermi-LAT measurement of gamma-ray from the dwarf galaxies, we find the dark shower could open a new region of sensitivity that can not be probed before.

hep-ph↗
arXiv2023

Shadow and stability of quantum-corrected black holes

Recently the quantum Oppenheimer-Snyder gravitational collapse model has been proposed in loop quantum gravity, providing quantum-corrected Schwarzschild spacetimes as the exterior of the collapsing dust ball. In this paper, the quantum gravity effects on the black hole shadows in this model are studied, and the stability of the quantum-corrected black holes is also analyzed by calculating the quasinormal modes. It turns out that the quantum correction always shrinks the radius of shadows, and the quantum-corrected black holes are stable against the scalar and vector perturbations.

gr-qc↗
arXiv2023

One Quarter Each (on Average) Ensures Proportionality

We consider the problem of fair allocation of $m$ indivisible items to a group of $n$ agents with subsidy (money). Our work mainly focuses on the allocation of chores but most of our results extend to the allocation of goods as well. We consider the case when agents have (general) additive cost functions. Assuming that the maximum cost of an item to an agent can be compensated by one dollar, we show that a total of $n/4$ dollars of subsidy suffices to ensure a proportional allocation. Moreover, we show that $n/4$ is tight in the sense that there exists an instance with $n$ agents for which every proportional allocation requires a total subsidy of at least $n/4$. We also consider the weighted case and show that a total subsidy of $(n-1)/2$ suffices to ensure a weighted proportional allocation.

cs.GT↗