Search

Consider the problems of computing the Augustin information and a R\'{e}nyi information measure of statistical independence, previously explored by Lapidoth and Pfister (\textit{IEEE Information Theory Workshop}, 2018) and Tomamichel and Hayashi (\textit{IEEE Trans. Inf. Theory}, 64(2):1064--1082, 2018). Both quantities are defined as solutions to optimization problems and lack closed-form expressions. This paper analyzes two iterative algorithms: Augustin's fixed-point iteration for computing the Augustin information, and the algorithm by Kamatsuka et al. (arXiv:2404.10950) for the R\'{e}nyi information measure. Previously, it was only known that these algorithms converge asymptotically. We establish the linear convergence of Augustin's algorithm for the Augustin information of order $\alpha \in (1/2, 1) \cup (1, 3/2)$ and Kamatsuka et al.'s algorithm for the R\'{e}nyi information measure of order $\alpha \in [1/2, 1) \cup (1, \infty)$, using Hilbert's projective metric., Comment: 15 pages

We propose the first comprehensive approach for modeling and analyzing the spatiotemporal shape variability in tree-like 4D objects, i.e., 3D objects whose shapes bend, stretch, and change in their branching structure over time as they deform, grow, and interact with their environment. Our key contribution is the representation of tree-like 3D shapes using Square Root Velocity Function Trees (SRVFT). By solving the spatial registration in the SRVFT space, which is equipped with an L2 metric, 4D tree-shaped structures become time-parameterized trajectories in this space. This reduces the problem of modeling and analyzing 4D tree-like shapes to that of modeling and analyzing elastic trajectories in the SRVFT space, where elasticity refers to time warping. In this paper, we propose a novel mathematical representation of the shape space of such trajectories, a Riemannian metric on that space, and computational tools for fast and accurate spatiotemporal registration and geodesics computation between 4D tree-shaped structures. Leveraging these building blocks, we develop a full framework for modelling the spatiotemporal variability using statistical models and generating novel 4D tree-like structures from a set of exemplars. We demonstrate and validate the proposed framework using real 4D plant data.

This paper addresses the challenges of efficiently fine-tuning large language models (LLMs) by exploring data efficiency and hyperparameter optimization. We investigate the minimum data required for effective fine-tuning and propose a novel hyperparameter optimization method that leverages early-stage model performance. Our experiments demonstrate that fine-tuning with as few as 200 samples can improve model accuracy from 70\% to 88\% in a product attribute extraction task. We identify a saturation point of approximately 6,500 samples, beyond which additional data yields diminishing returns. Our proposed bayesian hyperparameter optimization method, which evaluates models at 20\% of total training time, correlates strongly with final model performance, with 4 out of 5 top early-stage models remaining in the top 5 at completion. This approach led to a 2\% improvement in accuracy over baseline models when evaluated on an independent test set. These findings offer actionable insights for practitioners, potentially reducing computational load and dependency on extensive datasets while enhancing overall performance of fine-tuned LLMs.

Dynamic Scene Graph Generation (DSGG) focuses on identifying visual relationships within the spatial-temporal domain of videos. Conventional approaches often employ multi-stage pipelines, which typically consist of object detection, temporal association, and multi-relation classification. However, these methods exhibit inherent limitations due to the separation of multiple stages, and independent optimization of these sub-problems may yield sub-optimal solutions. To remedy these limitations, we propose a one-stage end-to-end framework, termed OED, which streamlines the DSGG pipeline. This framework reformulates the task as a set prediction problem and leverages pair-wise features to represent each subject-object pair within the scene graph. Moreover, another challenge of DSGG is capturing temporal dependencies, we introduce a Progressively Refined Module (PRM) for aggregating temporal context without the constraints of additional trackers or handcrafted trajectories, enabling end-to-end optimization of the network. Extensive experiments conducted on the Action Genome benchmark demonstrate the effectiveness of our design. The code and models are available at \url{https://github.com/guanw-pku/OED}., Comment: Accepted by CVPR'24

Recently, the Belle and LHCb Collaborations have measured the $\Lambda^+_c \to p K^- \pi^+$ decay and reported the $p K^-$ invariant mass distribution, which shows a clear cusp structure around the $\eta \Lambda$ threshold. In this work, we have analyzed this process by considering the triangle mechanism and the $S$-wave pseudoscalar meson-octet baryon interactions within the chiral unitary approach, which dynamically generate the $\Lambda(1670)$. Our results are in good agreement with the Belle measurements, which implies that the cusp structure around $\eta\Lambda$ threshold could be associated with the $\Lambda(1670)$ with the molecular nature.

Motivated by the Belle measurements of the process $\Lambda_c^+\to \eta\pi^+\Lambda$, we investigate this process by considering the contributions from the $\Lambda(1670)$, $a_0(980)$, and $\Sigma(1385)$. In addition, we also consider the predicted low-lying baryon $\Sigma^*(1/2^-)$. Our results involving the $\Sigma^*(1/2^-)$ are favored by fitting to the Belle data of the $\eta\Lambda$ and $\pi^+\Lambda$ invariant mass distributions. Furthermore, we predict the $\eta\pi^+$ invariant mass distribution and the angular distribution $d\Gamma/d{\rm cos}\theta$, which are significantly different depending on whether or not the contribution from the $\Sigma^*(1/2^-)$ is considered. Finally, we show that, with the contribution from the $\Sigma^*(1/2^-)$, the calculated Dalizt plot agrees with the Belle measurements. Future precise measurements of the process $\Lambda_c^+\to \eta\pi^+\Lambda$ could shed further light on the existence of the low-lying $\Sigma^*(1/2^-)$., Comment: 11 pages, 14 figures, comments are welcome

Inspired by the newly observed $X(2085)$ by the BESIII Collaboration, we study the strong decay behaviors of excited axialvector strange mesons within the quark pair creation model. Our results indicate that the $K_1(1793)/K_1(1861)$ can be regarded as the same $K_1(2P)$ state, and the $K_1(1911)$ is assigned as the $K_1(2P^\prime)$ state. Considering the mass, spin-parity, and decay behaviors, we interpret the newly observed $X(2085)$ as the radially excited $K_1(3P)$ state, which mainly decays into the $\rho(1450) K$, $\omega(1420)K$, $\pi K^*(1410)$, $\rho K_1(1270)$, and $\rho K^*(892)$ final states. Also, the width of $K_1(3P^\prime)$ state is predicted to be about 300 MeV, which can be searched for by future experiments. We expect that present calculations can help us to better understand the nature of the $X(2085)$ structure.

Despite the significant success achieved by deep learning methods in medical image segmentation, researchers still struggle in the computer-aided diagnosis of abdominal lymph nodes due to the complex abdominal environment, small and indistinguishable lesions, and limited annotated data. To address these problems, we present a pipeline that integrates the conditional diffusion model for lymph node generation and the nnU-Net model for lymph node segmentation to improve the segmentation performance of abdominal lymph nodes through synthesizing a diversity of realistic abdominal lymph node data. We propose LN-DDPM, a conditional denoising diffusion probabilistic model (DDPM) for lymph node (LN) generation. LN-DDPM utilizes lymph node masks and anatomical structure masks as model conditions. These conditions work in two conditioning mechanisms: global structure conditioning and local detail conditioning, to distinguish between lymph nodes and their surroundings and better capture lymph node characteristics. The obtained paired abdominal lymph node images and masks are used for the downstream segmentation task. Experimental results on the abdominal lymph node datasets demonstrate that LN-DDPM outperforms other generative methods in the abdominal lymph node image synthesis and better assists the downstream abdominal lymph node segmentation task.

Primordial black holes (PBHs) are the plausible candidates for the cosmological dark matter. Theoretically, PBHs with masses $M_{\rm PBH}$ in the range of $4\times10^{14}\sim 10^{17}\,{\rm g}$ can emit sub-GeV electrons and positrons through Hawking radiation. Some of these particles could undergo diffusive reacceleration during propagation in the Milky Way, potentially reaching energies up to the GeV level observed by AMS-02. In this work, we utilize AMS-02 data to constrain the PBH abundance $f_{\rm PBH}$ by employing the reacceleration mechanism. Under the assumption of a monochromatic PBH mass distribution, our findings reveal that the limit is stricter than that derived from Voyager 1 data. This difference is particularly pronounced when $M_{\rm PBH}\lesssim10^{15}\,{\rm g}$, exceeding an order of magnitude. The constraints are even more robust in a more realistic scenario involving a log-normal mass distribution of PBHs. Moreover, we explore the impact of varying propagation parameters and solar modulation potential within reasonable ranges, and find that such variations have minimal effects on the final results., Comment: 6 pages, 3 figures

Fiber optic networks are used worldwide and have been regarded as excellent media for transmitting time-frequency (TF) signals. In the past decades, fiber-based TF synchronization techniques have been extensively studied. Instruments based on these techniques have been successfully applied. With the increasing application of TF synchronization instruments, their security has become an important issue. Unfortunately, the security risks of fiber-based frequency synchronization (FbFS) instruments have been overlooked. This paper proposes a frequency tampering method called "frequency lens". On a 200 km fiber link, we demonstrate a frequency tampering scenario using a frequency lens-enabled frequency tampering module (FTM). On the user side, the frequency value of the recovered 100 MHz signal can be stealthily altered within a range of 100 MHz-100 Hz to 100 MHz+100 Hz, while the frequency dissemination stability of the system remains normal. Related to this tampering risk, potential hazards in three different application scenarios, which rely on precise frequency references, are analyzed. Two countermeasures are also proposed to solve this tampering risk.

In this paper, we delve into the rapidly evolving challenge of misinformation detection, with a specific focus on the nuanced manipulation of narrative frames - an under-explored area within the AI community. The potential for Generative AI models to generate misleading narratives underscores the urgency of this problem. Drawing from communication and framing theories, we posit that the presentation or 'framing' of accurate information can dramatically alter its interpretation, potentially leading to misinformation. We highlight this issue through real-world examples, demonstrating how shifts in narrative frames can transmute fact-based information into misinformation. To tackle this challenge, we propose an innovative approach leveraging the power of pre-trained Large Language Models and deep neural networks to detect misinformation originating from accurate facts portrayed under different frames. These advanced AI techniques offer unprecedented capabilities in identifying complex patterns within unstructured data critical for examining the subtleties of narrative frames. The objective of this paper is to bridge a significant research gap in the AI domain, providing valuable insights and methodologies for tackling framing-induced misinformation, thus contributing to the advancement of responsible and trustworthy AI technologies. Several experiments are intensively conducted and experimental results explicitly demonstrate the various impact of elements of framing theory proving the rationale of applying framing theory to increase the performance in misinformation detection., Comment: 17 pages, 9 figures, 7 tables

We propose a Riemannian gradient descent with the Poincar\'e metric to compute the order-$\alpha$ Augustin information, a widely used quantity for characterizing exponential error behaviors in information theory. We prove that the algorithm converges to the optimum at a rate of $\mathcal{O}(1 / T)$. As far as we know, this is the first algorithm with a non-asymptotic optimization error guarantee for all positive orders. Numerical experimental results demonstrate the empirical efficiency of the algorithm. Our result is based on a novel hybrid analysis of Riemannian gradient descent for functions that are geodesically convex in a Riemannian metric and geodesically smooth in another., Comment: 17 pages, 2 figures, ISIT 2024

We present a novel, deep-learning based method -- dubbed Galactic-Seismology Substructures and Streams Hunter, or GS$^{3}$ Hunter for short, to search for substructures and streams in stellar kinematics data. GS$^{3}$ Hunter relies on a combined application of Siamese Neural Networks to transform the phase space information and the K-means algorithm for the clustering. As a validation test, we apply GS$^{3}$ Hunter to a subset of the Feedback in Realistic Environments (FIRE) cosmological simulations. The stellar streams and substructures thus identified are in good agreement with corresponding results reported earlier by the FIRE team. In the same vein, we apply our method to a subset of local halo stars from the Gaia Early Data Release 3 and GALAH DR3 datasets, and recover several, previously known dynamical groups, such as Thamnos 1+2, Hot Thick Disk, ED-1, L-RL3, Helmi 1+2, and Gaia-Sausage-Enceladus, Sequoia, VRM, Cronus, Nereus. Finally, we apply our method without fine-tuning to a subset of K-giant stars located in the inner halo region, obtained from the LAMOST Data Release 5 (DR5) dataset. We recover three, previously known structures (Sagittarius, Hercules-Aquila Cloud, and the Virgo Overdensity), but we also discover a number of new substructures. We anticipate that GS$^{3}$ Hunter will become a useful tool for the community dedicated to the search of stellar streams and structures in the Milky Way (MW) and the Local group, thus helping advance our understanding of the stellar inner and outer halos, and of the assembly and tidal stripping history in and around the MW., Comment: 41 pages, 34 figures, 3 tables. Accepted for Publication in the Astrophysical Journal

Multi-Stage Classifier (MSC) - several classifiers working sequentially in an arranged order and classification decision is partially made at each step - is widely used in industrial applications for various resource limitation reasons. The classifiers of a multi-stage process are usually Neural Network (NN) models trained independently or in their inference order without considering the signals from the latter stages. Aimed at two-stage binary classification process, the most common type of MSC, we propose a novel training framework, named Feedback Training. The classifiers are trained in an order reverse to their actual working order, and the classifier at the later stage is used to guide the training of initial-stage classifier via a sample weighting method. We experimentally show the efficacy of our proposed approach, and its great superiority under the scenario of few-shot training.

In this study we estimate the stellar ages of LAMOST DR8 Red Giant Branch (RGB) stars based on the Gradient Boosting Decision Tree algorithm (GBDT). We used 2,643 RGB stars extracted from the APOKASC-2 astero-seismological catalog as training data-set. After selecting the parameterses ([$\alpha$/Fe], [C/Fe], T$_{eff}$, [N/Fe], [C/H], log g) highly correlated with age using GBDT, we apply the same GBDT method to the new catalog of more than 590,000 stars classified as RGB stars. The test data-set shows that the median relative error is around 11.6$\%$ for the method. We also compare the predicted ages of RGB stars with other studies (e.g., based on APOGEE), and find systematic differences. The final uncertainty is about 15 to 30$\%$ compared to open clusters' ages. Then we present the spatial distribution of the RGB sample having an age determination, which could recreate the expected result, and discuss systematic biases. All these diagnostics show that one can apply the GBDT method to other stellar samples to estimate atmospheric parameters and age., Comment: 17 pages, 17 figures, Accepted for publication in The Astrophysical Journal

Recently, the LHCb Collaboration has measured the processes $B^0\to\bar{D}^0D_s^+\pi^-$ and $B^+\to\bar{D}^0D_s^+\pi^+$, where the $D_s^+\pi^-$ and $D_s^+\pi^+$ invariant mass distributions show the significant signals of two new open-flavor tetraquark states $T_{c\bar{s}}(2900)^0$ and $T_{c\bar{s}}(2900)^{++}$, as the two of the isospin triplet. In this work, we have investigated the process $\Lambda_b\to K^0D^0\Lambda$ by taking into account the intermediate nucleon resonance $N^*(1535)$ and the tetraquark state $T_{c\bar{s}}(2900)^0$, which could be dynamically generated by the interactions of the $D^*K^*/D^*_s\rho$ and the pseoduscalar mesons-octet baryons, respectively. Our results show that a clear peak of the open-flavor tetraquark $T_{c\bar{s}}(2900)$ may appear in the $K^0D^0$ invariant mass distribution of the process $\Lambda_b\to K^0D^0\Lambda$, which could be tested by future experiments., Comment: 9 pages, 11 figures, 1 table

The application of asymmetric drift (AD) tomography across different populations provides valuable insights into the kinematics, dynamics, and rotation curves of the Galactic disk. By leveraging common stars identified in both the LAMOST and Gaia surveys, alongside Gaia DR3's circular velocity curve, we conducted a qualitative exploration of asymmetric drift distributions within the Galactic disk spanning distances from 8 to 16 kpc. In the R-Z plane, we observed that the asymmetric drift is minimal near the mid-plane of the Galactic disk and gradually increases with vertical distance, resulting in a distinctive ``horn" shape. Additionally, our analysis revealed that populations with higher [$\alpha$/Fe] ratios exhibit greater asymmetric drift compared to those with lower [$\alpha$/Fe] ratios. Specifically, we found the asymmetric drift around the solar location to be approximately 6 km s$^{-1}$, with a median value of 16 km s$^{-1}$ across the entire sample. Notably, the median asymmetric drift in the northern region of the Galactic disk (20 km s$^{-1}$) surpasses that in the southern region (13 km s$^{-1}$), with errors remaining within 2 km s$^{-1}$. Furthermore, our investigation into mono-age stellar populations unveiled that older stellar populations tend to exhibit larger asymmetric drift and velocity dispersion, aligning closely with predictions from previous numerical models. Finally, based on chemical compositions, we observed that the median asymmetric drift of the thick disk significantly exceeds that of the thin disk and found that star formation within the thick disk primarily occurred earlier than 8-10 billion years, whereas the thin disk's predominant star formation period spanned 6-8 billion years ago., Comment: 14 pages and 17 figures. The Open Journal of Astrophysics. AD analysis is the key target and the time scale picture of the milky way disk are also revealed here in another point of view, see the Fig. 9

Nowadays, open-source large language models like LLaMA have emerged. Recent developments have incorporated supervised fine-tuning (SFT) and reinforcement learning fine-tuning (RLFT) to align these models with human goals. However, SFT methods treat all training data with mixed quality equally, while RLFT methods require high-quality pairwise or ranking-based preference data. In this study, we present a novel framework, named OpenChat, to advance open-source language models with mixed-quality data. Specifically, we consider the general SFT training data, consisting of a small amount of expert data mixed with a large proportion of sub-optimal data, without any preference labels. We propose the C(onditioned)-RLFT, which regards different data sources as coarse-grained reward labels and learns a class-conditioned policy to leverage complementary data quality information. Interestingly, the optimal policy in C-RLFT can be easily solved through single-stage, RL-free supervised learning, which is lightweight and avoids costly human preference labeling. Through extensive experiments on three standard benchmarks, our openchat-13b fine-tuned with C-RLFT achieves the highest average performance among all 13b open-source language models. Moreover, we use AGIEval to validate the model generalization performance, in which only openchat-13b surpasses the base model. Finally, we conduct a series of analyses to shed light on the effectiveness and robustness of OpenChat. Our code, data, and models are publicly available at https://github.com/imoneoi/openchat and https://huggingface.co/openchat.

The maintenance and repair of optical fiber networks often requires the discrimination of underground cables among a group of buried ones. Presently, the methods commonly used are either inefficient or harmful to the fiber cable. In this paper, we evaluate the effectiveness of fiber optic vibration sensing method on underground fiber cable discrimination. We find that the typical vibration sensing method-distributed acoustic sensing (DAS) is not suitable for fiber cable discrimination. Especially for long distance scenario, due to "frequency grafting" effect, the DAS method will give a false response on the spectrum of knock events during cable discrimination process. In response, we propose an underground fiber cable discrimination method based on laser interferometer, and demonstrate it on the 40-km urban fiber cable connecting Tsinghua University and Yongding Road. It can give an obvious and real response to the knock event, and can be used in practical applications.

Recurrent spiking neural networks (RSNNs) hold great potential for advancing artificial general intelligence, as they draw inspiration from the biological nervous system and show promise in modeling complex dynamics. However, the widely-used surrogate gradient-based training methods for RSNNs are inherently inaccurate and unfriendly to neuromorphic hardware. To address these limitations, we propose the evolving connectivity (EC) framework, an inference-only method for training RSNNs. The EC framework reformulates weight-tuning as a search into parameterized connection probability distributions, and employs Natural Evolution Strategies (NES) for optimizing these distributions. Our EC framework circumvents the need for gradients and features hardware-friendly characteristics, including sparse boolean connections and high scalability. We evaluate EC on a series of standard robotic locomotion tasks, where it achieves comparable performance with deep neural networks and outperforms gradient-trained RSNNs, even solving the complex 17-DoF humanoid task. Additionally, the EC framework demonstrates a two to three fold speedup in efficiency compared to directly evolving parameters. By providing a performant and hardware-friendly alternative, the EC framework lays the groundwork for further energy-efficient applications of RSNNs and advances the development of neuromorphic devices.

The rapid growth of information on the Internet has led to an overwhelming amount of opinions and comments on various activities, products, and services. This makes it difficult and time-consuming for users to process all the available information when making decisions. Text summarization, a Natural Language Processing (NLP) task, has been widely explored to help users quickly retrieve relevant information by generating short and salient content from long or multiple documents. Recent advances in pre-trained language models, such as ChatGPT, have demonstrated the potential of Large Language Models (LLMs) in text generation. However, LLMs require massive amounts of data and resources and are challenging to implement as offline applications. Furthermore, existing text summarization approaches often lack the ``adaptive" nature required to capture diverse aspects in opinion summarization, which is particularly detrimental to users with specific requirements or preferences. In this paper, we propose an Aspect-adaptive Knowledge-based Opinion Summarization model for product reviews, which effectively captures the adaptive nature required for opinion summarization. The model generates aspect-oriented summaries given a set of reviews for a particular product, efficiently providing users with useful information on specific aspects they are interested in, ensuring the generated summaries are more personalized and informative. Extensive experiments have been conducted using real-world datasets to evaluate the proposed model. The results demonstrate that our model outperforms state-of-the-art approaches and is adaptive and efficient in generating summaries that focus on particular aspects, enabling users to make well-informed decisions and catering to their diverse interests and preferences., Comment: 21 pages, 4 figures, 7 tables

The pose adjustment (PA) with a pose-only visual representation has been proven equivalent to the bundle adjustment (BA), while significantly improving the computational efficiency. However, the pose-only solution has not yet been properly considered in a tightly-coupled visual-inertial state estimator (VISE) with a normal configuration for real-time navigation. In this study, we propose a tightly-coupled LiDAR-enhanced VISE, named PO-VINS, with a full pose-only form for visual and LiDAR-depth measurements. Based on the pose-only visual representation, we derive the analytical depth uncertainty, which is then employed for rejecting LiDAR depth outliers. Besides, we propose a multi-state constraint (MSC)-based LiDAR-depth measurement model with a pose-only form, to balance efficiency and robustness. The pose-only visual and LiDAR-depth measurements and the IMU-preintegration measurements are tightly integrated under the factor graph optimization framework to perform efficient and accurate state estimation. Exhaustive experimental results on private and public datasets indicate that the proposed PO-VINS yields improved or comparable accuracy to sate-of-the-art methods. Compared to the baseline method LE-VINS, the state-estimation efficiency of PO-VINS is improved by 33% and 56% on the laptop PC and the onboard ARM computer, respectively. Besides, PO-VINS yields higher accuracy and robustness than LE-VINS by employing the proposed uncertainty-based outlier-culling method and the MSC-based measurement model for LiDAR depth., Comment: 17 pages, 13 figures, 8 tables

3D cross-modal retrieval is gaining attention in the multimedia community. Central to this topic is learning a joint embedding space to represent data from different modalities, such as images, 3D point clouds, and polygon meshes, to extract modality-invariant and discriminative features. Hence, the performance of cross-modal retrieval methods heavily depends on the representational capacity of this embedding space. Existing methods treat all instances equally, applying the same penalty strength to instances with varying degrees of difficulty, ignoring the differences between instances. This can result in ambiguous convergence or local optima, severely compromising the separability of the feature space. To address this limitation, we propose an Instance-Variant loss to assign different penalty strengths to different instances, improving the space separability. Specifically, we assign different penalty weights to instances positively related to their intra-class distance. Simultaneously, we reduce the cross-modal discrepancy between features by learning a shared weight vector for the same class data from different modalities. By leveraging the Gaussian RBF kernel to evaluate sample similarity, we further propose an Intra-Class loss function that minimizes the intra-class distance among same-class instances. Extensive experiments on three 3D cross-modal datasets show that our proposed method surpasses recent state-of-the-art approaches.