Search

To improve the theoretical prediction power for synthesizing superheavy elements beyond Og, a Bayesian uncertainty quantification method is employed to evaluate the uncertainty of the calculated evaporation residue cross sections (ERCS) for the first time. The key parameters of the dinuclear system (DNS) model, such as the diffusion parameter $\textit{a}$, the damping factor $E_\mathrm{d}$, and the level-density parameter ratio $a_\mathrm{f}/a_\mathrm{n}$ are systematically constrained by the Bayesian analysis of recent ERCS data. One intriguing behavior is shown that the optimal incident energies (OIE) corresponding to the largest ERCS weakly depend on the fission process. We also find that these parameters are strongly correlated and the uncertainty propagation considering the parameters independently is not reasonable. The 2$\sigma$ confidence level of posterior distributions for $a = 0.58_{-0.01}^{+0.01}$ fm, $E_\mathrm{d} = 21.9_{-8.6}^{+8.8}$ MeV, and $a_\mathrm{f}/a_\mathrm{n} = 1.044_{-0.059}^{+0.061}$ are obtained. Furthermore, the confidence levels of the ERCS and OIE for synthesizing Z = 119 via the reactions($^{54}\mathrm{Cr}+^{243}\mathrm{Am}$), (${}^{50}\mathrm{Ti}+{}^{249}\mathrm{Bk}$), and (${}^{51}\mathrm{V}+{}^{248}\mathrm{Cm}$) are predicted. This work sets the stage for future analyses to explore the OIE and reaction systems for the synthesis of superheavy elements., Comment: 7 pages, 4 pages

Traditionally, results given by the direct numerical simulation (DNS) of Navier-Stokes equations are widely regarded as reliable benchmark solutions of turbulence, as long as grid spacing is fine enough (i.e. less than the minimum Kolmogorov scale) and time-step is small enough, say, satisfying the Courant-Friedrichs-Lewy condition. Is this really true? In this paper a two-dimensional sustained turbulent Kolmogorov flow is investigated numerically by the two numerical methods with detailed comparisons: one is the traditional `direct numerical simulation' (DNS), the other is the `clean numerical simulation' (CNS). The results given by DNS are a kind of mixture of the false numerical noise and the true physical solution, which however are mostly at the same order of magnitude due to the butterfly-effect of chaos. On the contrary, the false numerical noise of the results given by CNS is much smaller than the true physical solution of turbulence in a long enough interval of time so that a CNS result is very close to the true physical solution and thus can be used as a benchmark solution. It is found that numerical noise as a kind of artificial tiny disturbances can lead to huge deviations at large scale on the two-dimensional Kolmogorov turbulence, not only quantitatively (even in statistics) but also qualitatively (such as symmetry of flow). Thus, fine enough spatial grid spacing with small enough time-step alone cannot guarantee the validity of the DNS: it is only a necessary condition but not sufficient. This finding might challenge some assumptions in investigation of turbulence. So, DNS results of a few sustained turbulent flows might have huge deviations on both of small and large scales from the true solution of Navier-Stokes equations even in statistics. Hopefully, CNS as a new tool to investigate turbulent flows more accurately than DNS could bring us some new discoveries., Comment: 27 pages, 18 figures

In recent astronomical observations, an almost dark galaxy, designated as Nube, has unveiled an intriguing anomaly in its stellar distribution. Specifically, Nube exhibits an exceptionally low central brightness, with the 2D half-light radius of its stars far exceeding the typical values found in dwarf galaxies, and even surpassing those observed in ultra-diffuse galaxies (UDGs). This phenomenon is difficult to explain within the framework of cold dark matter (CDM). Meanwhile, due to its ultralight particle mass, fuzzy dark matter (FDM) exhibits a de Broglie wavelength on the order of kiloparsecs under the typical velocities of galaxies. The interference between different modes of the FDM wave gives rise to fluctuations in the gravitational field, which can lead to the dynamical heating of stars within galaxies, resulting in an expansion of their spatial distribution. In this paper, we aim to interpret the anomalous stellar distribution observed in Nube as a consequence of the dynamical heating effect induced by FDM. Our findings suggest that a FDM particle mass around $1-2\times 10^{-23}$ eV can effectively account for this anomaly. And we propose that the FDM dynamical heating effect provides a new insight into understanding the formation of field UDGs., Comment: 10 pages, 3 figures

When zooming between dual cameras on a mobile, noticeable jumps in geometric content and image color occur in the preview, inevitably affecting the user's zoom experience. In this work, we introduce a new task, ie, dual-camera smooth zoom (DCSZ) to achieve a smooth zoom preview. The frame interpolation (FI) technique is a potential solution but struggles with ground-truth collection. To address the issue, we suggest a data factory solution where continuous virtual cameras are assembled to generate DCSZ data by rendering reconstructed 3D models of the scene. In particular, we propose a novel dual-camera smooth zoom Gaussian Splatting (ZoomGS), where a camera-specific encoding is introduced to construct a specific 3D model for each virtual camera. With the proposed data factory, we construct a synthetic dataset for DCSZ, and we utilize it to fine-tune FI models. In addition, we collect real-world dual-zoom images without ground-truth for evaluation. Extensive experiments are conducted with multiple FI methods. The results show that the fine-tuned FI models achieve a significant performance improvement over the original ones on DCSZ task. The datasets, codes, and pre-trained models will be publicly available., Comment: 24

Personality Recognition in Conversation (PRC) aims to identify the personality traits of speakers through textual dialogue content. It is essential for providing personalized services in various applications of Human-Computer Interaction (HCI), such as AI-based mental therapy and companion robots for the elderly. Most recent studies analyze the dialog content for personality classification yet overlook two major concerns that hinder their performance. First, crucial implicit factors contained in conversation, such as emotions that reflect the speakers' personalities are ignored. Second, only focusing on the input dialog content disregards the semantic understanding of personality itself, which reduces the interpretability of the results. In this paper, we propose Affective Natural Language Inference (Affective-NLI) for accurate and interpretable PRC. To utilize affectivity within dialog content for accurate personality recognition, we fine-tuned a pre-trained language model specifically for emotion recognition in conversations, facilitating real-time affective annotations for utterances. For interpretability of recognition results, we formulate personality recognition as an NLI problem by determining whether the textual description of personality labels is entailed by the dialog content. Extensive experiments on two daily conversation datasets suggest that Affective-NLI significantly outperforms (by 6%-7%) state-of-the-art approaches. Additionally, our Flow experiment demonstrates that Affective-NLI can accurately recognize the speaker's personality in the early stages of conversations by surpassing state-of-the-art methods with 22%-34%., Comment: Accepted by IEEE PerCom 2024

Despite the effectiveness of data selection for large language models (LLMs) during pretraining and instruction fine-tuning phases, improving data efficiency in supervised fine-tuning (SFT) for specialized domains poses significant challenges due to the complexity of fine-tuning data. To bridge this gap, we introduce an effective and scalable data selection method for SFT, SmallToLarge (S2L), which leverages training trajectories from small models to guide the data selection for larger models. We demonstrate through extensive experiments that S2L significantly improves data efficiency in SFT for mathematical problem-solving, reducing the training data to just 11% of the original MathInstruct dataset (Yue et al., 2023) to match full dataset performance while outperforming state-of-the-art data selection algorithms by an average of 4.7% across 6 in- and out-domain evaluation datasets. Remarkably, selecting only 50K data for SFT, S2L achieves a 32.7% accuracy on the most challenging MATH (Hendrycks et al., 2021) benchmark, improving Phi-2 (Li et al., 2023b) by 16.6%. In clinical text summarization on the MIMIC-III dataset (Johnson et al., 2016), S2L again outperforms training on the full dataset using only 50% of the data. Notably, S2L can perform data selection using a reference model 40x smaller than the target model, proportionally reducing the cost of data selection.

High-dimensional quantum entanglement characterizes the entanglement of quantum systems within a larger Hilbert space, introducing more intricate and complex correlations among the entangled particles' states. The high-dimensional Greenberger-Horne-Zeilinger (GHZ) state, symbolic of this type of entanglement, is of significant importance in various quantum information processing applications. This study proposes integrating a neutral atom platform with quantum reservoir engineering to generate a high-dimensional GHZ state deterministically. Leveraging the advantages of neutral atoms in a modified unconventional Rydberg pumping mechanism, combined with controlled dissipation, we achieve a three-dimensional GHZ state with a fidelity surpassing 99\% through multiple pump and dissipation cycles. This innovative approach paves the way for experimentally feasible, deterministic preparation of high-dimensional GHZ states in Rydberg atom systems, thereby advancing the capabilities of quantum information processing., Comment: Accepted by Applied Physics Letters, 7 pages, 5 figures

Data diversity and abundance are essential for improving the performance and generalization of models in natural language processing and 2D vision. However, 3D vision domain suffers from the lack of 3D data, and simply combining multiple 3D datasets for pretraining a 3D backbone does not yield significant improvement, due to the domain discrepancies among different 3D datasets that impede effective feature learning. In this work, we identify the main sources of the domain discrepancies between 3D indoor scene datasets, and propose Swin3D++, an enhanced architecture based on Swin3D for efficient pretraining on multi-source 3D point clouds. Swin3D++ introduces domain-specific mechanisms to Swin3D's modules to address domain discrepancies and enhance the network capability on multi-source pretraining. Moreover, we devise a simple source-augmentation strategy to increase the pretraining data scale and facilitate supervised pretraining. We validate the effectiveness of our design, and demonstrate that Swin3D++ surpasses the state-of-the-art 3D pretraining methods on typical indoor scene understanding tasks. Our code and models will be released at https://github.com/microsoft/Swin3D, Comment: technical report

Li ion diffusion is fundamentally a thermally activated ion hopping process. Recently, soft lattice, anharmonic phonon and paddlewheel mechanism have been proposed to potentially benefit the ion transport, while the understanding of vibrational couplings of mobile ion and anions is still limited but essential. Herein, we access the ionic conductivity, the stability and the lattice dynamics in LiM(SeO3)2 (M =Al, Ga, In, Sc, Y, and La) with two types of oxygen anions within LiO4 polyhedron, namely edge-shared and corner-shared, the prototype of which, LiGa(SeO3)2, has been experimentally synthesized. We studied in detail the anharmonic and harmonic phonon interactions, as well as couplings between vibrations of edge-bonded or corner-bonded anions in Li polyanions and Li ion diffusion. As M changing from Sc to La, anharmonic phonons increase alongside reduced activation energy for Li diffusion. Phonon modes involving edge-bonded oxygen anions contribute more to Li migration than corner-bonded oxygen anions, owing to greater atomic interactions between Li ions and edge-bonded anions. Thus, rather than the overall lattice softness, attentions shall be paid to reduce the frequency of the critical phonons contributing to Li ion diffusions as well as to increase the anharmonicity, for the design of Li ion superionic conductors for all-solid-state-batteries.

In the era of modern education, addressing cross-school learner diversity is crucial, especially in personalized recommender systems for elective course selection. However, privacy concerns often limit cross-school data sharing, which hinders existing methods' ability to model sparse data and address heterogeneity effectively, ultimately leading to suboptimal recommendations. In response, we propose HFRec, a heterogeneity-aware hybrid federated recommender system designed for cross-school elective course recommendations. The proposed model constructs heterogeneous graphs for each school, incorporating various interactions and historical behaviors between students to integrate context and content information. We design an attention mechanism to capture heterogeneity-aware representations. Moreover, under a federated scheme, we train individual school-based models with adaptive learning settings to recommend tailored electives. Our HFRec model demonstrates its effectiveness in providing personalized elective recommendations while maintaining privacy, as it outperforms state-of-the-art models on both open-source and real-world datasets.

In quantum multiparameter estimation, multiple to-be-estimated parameters are encoded in a quantum dynamics system by a unitary evolution. As the parameters vary, the system may undergo a topological phase transition (TPT). In this paper, we investigate two SU(2) TPT models and propose the singular behavior of the quantum metric tensor around the TPT point as a tool for the simultaneous optimal estimation of multiple parameters. We find that the proposed TPT sensing protocol can achieve the same metrology performance as the quantum-control-enhanced one. Moreover, the probe state of the TPT sensing protocol is only the ground state of the Hamiltonian rather than the entangled state required in the control-enhanced one. In addition, an adaptive multiparameter estimation strategy is developed for updating the estimated values until the desired quantum Cram\'er-Rao bound is approached. Our work reinforces the connection between quantum multiparameter estimation and topology physics, with potential inspiration for quantum critical metrology., Comment: 16 pages, 6 figures, 1 table

Compared with only pursuing recommendation accuracy, the explainability of a recommendation model has drawn more attention in recent years. Many graph-based recommendations resort to informative paths with the attention mechanism for the explanation. Unfortunately, these attention weights are intentionally designed for model accuracy but not explainability. Recently, some researchers have started to question attention-based explainability because the attention weights are unstable for different reproductions, and they may not always align with human intuition. Inspired by the counterfactual reasoning from causality learning theory, we propose a novel explainable framework targeting path-based recommendations, wherein the explainable weights of paths are learned to replace attention weights. Specifically, we design two counterfactual reasoning algorithms from both path representation and path topological structure perspectives. Moreover, unlike traditional case studies, we also propose a package of explainability evaluation solutions with both qualitative and quantitative methods. We conduct extensive experiments on three real-world datasets, the results of which further demonstrate the effectiveness and reliability of our method., Comment: accepted by TKDE

Mechanical degrees of freedom are natural candidates for continuous-variable quantum information processing and bosonic quantum simulations. These applications, however, require the engineering of squeezing and nonlinearities in the quantum regime. Here we demonstrate ground state squeezing of a gigahertz-frequency mechanical resonator coupled to a superconducting qubit. This is achieved by parametrically driving the qubit, which results in an effective two-phonon drive. In addition, we show that the resonator mode inherits a nonlinearity from the off-resonant coupling with the qubit, which can be tuned by controlling the detuning. We thus realize a mechanical squeezed Kerr oscillator, where we demonstrate the preparation of non-Gaussian quantum states of motion with Wigner function negativities and high quantum Fisher information. This shows that our results also have applications in quantum metrology and sensing.

This paper presents an Exploratory 3D Dance generation framework, E3D2, designed to address the exploration capability deficiency in existing music-conditioned 3D dance generation models. Current models often generate monotonous and simplistic dance sequences that misalign with human preferences because they lack exploration capabilities. The E3D2 framework involves a reward model trained from automatically-ranked dance demonstrations, which then guides the reinforcement learning process. This approach encourages the agent to explore and generate high quality and diverse dance movement sequences. The soundness of the reward model is both theoretically and experimentally validated. Empirical experiments demonstrate the effectiveness of E3D2 on the AIST++ dataset. Project Page: https://sites.google.com/view/e3d2., Comment: AAAI-24

In some quantum gravity (QG) theories, Lorentz symmetry may be broken above the Planck scale. The Lorentz invariance violation (LIV) may induce observable effects at low energies and be detected at high energy astrophysical measurements. The Large High Altitude Air Shower Observatory(LHAASO) has detected the onset, rise, and decay phases of the afterglow of GRB 221009A, covering a wide energy range of photons approximately from $0.2$ to $18$ TeV. This observation provides an excellent opportunity to study the Lorentz invariance violation effect. In this study, we simultaneously utilize the data from the KM2A and WCDA detectors of LHAASO, and apply two event by event methods, namely the pair view method and maximum likelihood method, to investigate LIV. We obtain stringent constraints on the QG energy scale. For instance, through the maximum likelihood method, we determine the 95$\%$ confidence level lower limits to be $E_{QG,1} > 14.7 (6.5)\times 10^{19}$GeV for the subluminal (superluminal) scenario of $n = 1$, and $E_{QG,2} > 12.0 (7.2)\times 10^{11}$GeV for the subluminal (superluminal) scenario of $n = 2$. We find that the rapid rise and slow decay behaviors of the afterglow can impose strong constraints on the subluminal scenario, while the constraints are weaker for the superluminal scenario., Comment: 11 pages, 6 figures.Accepted for publication in JCAP

The stability of ecological systems is a fundamental concept in ecology, which offers profound insights into species coexistence, biodiversity, and community persistence. In this article, we provide a systematic and comprehensive review on the theoretical frameworks for analyzing the stability of ecological systems. Notably, we survey various stability notions, including linear stability, sign stability, diagonal stability, D-stability, total stability, sector stability, structural stability, and higher-order stability. For each of these stability notions, we examine necessary or sufficient conditions for achieving such stability and demonstrate the intricate interplay of these conditions on the network structures of ecological systems. Finally, we explore the future prospects of these stability notions.

Semantic scene completion (SSC) aims to predict the semantic occupancy of each voxel in the entire 3D scene from limited observations, which is an emerging and critical task for autonomous driving. Recently, many studies have turned to camera-based SSC solutions due to the richer visual cues and cost-effectiveness of cameras. However, existing methods usually rely on sophisticated and heavy 3D models to directly process the lifted 3D features that are not discriminative enough for clear segmentation boundaries. In this paper, we adopt the dense-sparse-dense design and propose an end-to-end camera-based SSC framework, termed SGN, to diffuse semantics from the semantic- and occupancy-aware seed voxels to the whole scene based on geometry prior and occupancy information. By designing hybrid guidance (sparse semantic and geometry guidance) and effective voxel aggregation for spatial occupancy and geometry priors, we enhance the feature separation between different categories and expedite the convergence of semantic diffusion. Extensive experimental results on the SemanticKITTI dataset demonstrate the superiority of our SGN over existing state-of-the-art methods.

Code datasets, often collected from diverse and uncontrolled sources such as GitHub, potentially suffer from quality issues, thereby affecting the performance and training efficiency of Large Language Models (LLMs) optimized for code generation. Previous studies demonstrated the benefit of using embedding spaces for data pruning, but they mainly focused on duplicate removal or increasing variety, and in other modalities, such as images. Our work focuses on using embeddings to identify and remove "low-quality" code data. First, we explore features of "low-quality" code in embedding space, through the use of synthetic corruptions. Armed with this knowledge, we devise novel pruning metrics that operate in embedding space to identify and remove low-quality entries in the Stack dataset. We demonstrate the benefits of this synthetic corruption informed pruning (SCIP) approach on the well-established HumanEval and MBPP benchmarks, outperforming existing embedding-based methods. Importantly, we achieve up to a 3% performance improvement over no pruning, thereby showing the promise of insights from synthetic corruptions for data pruning., Comment: 12 pages, 4 figures, Oral Presentation at 3rd Workshop on Efficient Natural Language and Speech Processing (ENLSP-III), NeurIPS 2023

Heavy-ion collisions at near-barrier energies provide a crucial pathway for investigating nucleon correlations and clustering structures. Recent experimental results showed that the valence neutrons in light projectiles obviously enhance the $\alpha$ transfer. This finding is extremely puzzled and fascinating, because it violates the ground-state $Q$ value systematics unexpectedly. In this work, the time-dependent Hartree-Fock approach is utilized to investigate the cluster transfer. By comparing the reactions $^{12,14}$C + $^{209}$Bi, we discover that above puzzling behavior is because of the strong correlation between isospin diffusion and clustering. Our calculations clearly show that the equilibrium of neutron-to-proton ratio strongly inhibits the clustering. This work opens a prospect for investigating the clustering in open quantum system.

In this work, we propose an end-to-end adaptive sampling neural network (MMPDE-Net) based on the moving mesh method, which can adaptively generate new sampling points by solving the moving mesh PDE. This model focuses on improving the quality of sampling points generation. Moreover, we develop an iterative algorithm based on MMPDE-Net, which makes the sampling points more precise and controllable. Since MMPDE-Net is a framework independent of the deep learning solver, we combine it with physics-informed neural networks (PINN) to propose moving sampling PINN (MS-PINN) and demonstrate its effectiveness by error analysis under some assumptions. Finally, we demonstrate the performance improvement of MS-PINN compared to PINN through numerical experiments of four typical examples, which numerically verify the effectiveness of our method.

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.

This paper presents FlowSUM, a normalizing flows-based variational encoder-decoder framework for Transformer-based summarization. Our approach tackles two primary challenges in variational summarization: insufficient semantic information in latent representations and posterior collapse during training. To address these challenges, we employ normalizing flows to enable flexible latent posterior modeling, and we propose a controlled alternate aggressive training (CAAT) strategy with an improved gate mechanism. Experimental results show that FlowSUM significantly enhances the quality of generated summaries and unleashes the potential for knowledge distillation with minimal impact on inference time. Furthermore, we investigate the issue of posterior collapse in normalizing flows and analyze how the summary quality is affected by the training strategy, gate initialization, and the type and number of normalizing flows used, offering valuable insights for future research.

POI recommendation is practically important to facilitate various Location-Based Social Network services, and has attracted rising research attention recently. Existing works generally assume the available POI check-ins reported by users are the ground-truth depiction of user behaviors. However, in real application scenarios, the check-in data can be rather unreliable due to both subjective and objective causes including positioning error and user privacy concerns, leading to significant negative impacts on the performance of the POI recommendation. To this end, we investigate a novel problem of robust POI recommendation by considering the uncertainty factors of the user check-ins, and proposes a Bayes-enhanced Multi-view Attention Network. Specifically, we construct personal POI transition graph, the semantic-based POI graph and distance-based POI graph to comprehensively model the dependencies among the POIs. As the personal POI transition graph is usually sparse and sensitive to noise, we design a Bayes-enhanced spatial dependency learning module for data augmentation from the local view. A Bayesian posterior guided graph augmentation approach is adopted to generate a new graph with collaborative signals to increase the data diversity. Then both the original and the augmented graphs are used for POI representation learning to counteract the data uncertainty issue. Next, the POI representations of the three view graphs are input into the proposed multi-view attention-based user preference learning module. By incorporating the semantic and distance correlations of POIs, the user preference can be effectively refined and finally robust recommendation results are achieved. The results of extensive experiments show that BayMAN significantly outperforms the state-of-the-art methods in POI recommendation when the available check-ins are incomplete and noisy.

We study the batched best arm identification (BBAI) problem, where the learner's goal is to identify the best arm while switching the policy as less as possible. In particular, we aim to find the best arm with probability $1-\delta$ for some small constant $\delta>0$ while minimizing both the sample complexity (total number of arm pulls) and the batch complexity (total number of batches). We propose the three-batch best arm identification (Tri-BBAI) algorithm, which is the first batched algorithm that achieves the optimal sample complexity in the asymptotic setting (i.e., $\delta\rightarrow 0$) and runs only in at most $3$ batches. Based on Tri-BBAI, we further propose the almost optimal batched best arm identification (Opt-BBAI) algorithm, which is the first algorithm that achieves the near-optimal sample and batch complexity in the non-asymptotic setting (i.e., $\delta>0$ is arbitrarily fixed), while enjoying the same batch and sample complexity as Tri-BBAI when $\delta$ tends to zero. Moreover, in the non-asymptotic setting, the complexity of previous batch algorithms is usually conditioned on the event that the best arm is returned (with a probability of at least $1-\delta$), which is potentially unbounded in cases where a sub-optimal arm is returned. In contrast, the complexity of Opt-BBAI does not rely on such an event. This is achieved through a novel procedure that we design for checking whether the best arm is eliminated, which is of independent interest., Comment: 32 pages, 1 figure, 3 tables

Privacy is a key principle for developing ethical AI technologies, but how does including AI technologies in products and services change privacy risks? We constructed a taxonomy of AI privacy risks by analyzing 321 documented AI privacy incidents. We codified how the unique capabilities and requirements of AI technologies described in those incidents generated new privacy risks, exacerbated known ones, or otherwise did not meaningfully alter the risk. We present 12 high-level privacy risks that AI technologies either newly created (e.g., exposure risks from deepfake pornography) or exacerbated (e.g., surveillance risks from collecting training data). One upshot of our work is that incorporating AI technologies into a product can alter the privacy risks it entails. Yet, current approaches to privacy-preserving AI/ML (e.g., federated learning, differential privacy, checklists) only address a subset of the privacy risks arising from the capabilities and data requirements of AI.

As one class of the most important objects in the universe, magnetars can produce a lot of different frequency bursts including X-ray bursts. In \cite{2022ApJS..260...24C}, 75 X-ray bursts produced by magnetar SGR J1935+2154 during an active period in 2020 are published, including the duration and net photon counts of each burst, and waiting time based on the trigger time difference. In this paper, we utilize the power-law model, $dN(x)/dx\propto (x+x_0)^{-\alpha_x}$, to fit the cumulative distributions of these parameters. It can be found that all the cumulative distributions can be well fitted, which can be interpreted by a self-organizing criticality theory. Furthermore, we check whether this phenomenon still exist in different energy bands and find that there is no obvious evolution. These findings further confirm that the X-ray bursts from magnetars are likely to be generated by some self-organizing critical process, which can be explained by a possible magnetic reconnection scenario in magnetars., Comment: 6 pages, 1 figure and 3 tables; published in Research in Astronomy and Astrophysics

Dataset distillation aims to minimize the time and memory needed for training deep networks on large datasets, by creating a small set of synthetic images that has a similar generalization performance to that of the full dataset. However, current dataset distillation techniques fall short, showing a notable performance gap when compared to training on the original data. In this work, we are the first to argue that using just one synthetic subset for distillation will not yield optimal generalization performance. This is because the training dynamics of deep networks drastically change during the training. Hence, multiple synthetic subsets are required to capture the training dynamics at different phases of training. To address this issue, we propose Progressive Dataset Distillation (PDD). PDD synthesizes multiple small sets of synthetic images, each conditioned on the previous sets, and trains the model on the cumulative union of these subsets without requiring additional training time. Our extensive experiments show that PDD can effectively improve the performance of existing dataset distillation methods by up to 4.3%. In addition, our method for the first time enable generating considerably larger synthetic datasets., Comment: Preprint

Designing effective positional encodings for graphs is key to building powerful graph transformers and enhancing message-passing graph neural networks. Although widespread, using Laplacian eigenvectors as positional encodings faces two fundamental challenges: (1) \emph{Non-uniqueness}: there are many different eigendecompositions of the same Laplacian, and (2) \emph{Instability}: small perturbations to the Laplacian could result in completely different eigenspaces, leading to unpredictable changes in positional encoding. Despite many attempts to address non-uniqueness, most methods overlook stability, leading to poor generalization on unseen graph structures. We identify the cause of instability to be a ``hard partition'' of eigenspaces. Hence, we introduce Stable and Expressive Positional Encodings (SPE), an architecture for processing eigenvectors that uses eigenvalues to ``softly partition'' eigenspaces. SPE is the first architecture that is (1) provably stable, and (2) universally expressive for basis invariant functions whilst respecting all symmetries of eigenvectors. Besides guaranteed stability, we prove that SPE is at least as expressive as existing methods, and highly capable of counting graph structures. Finally, we evaluate the effectiveness of our method on molecular property prediction, and out-of-distribution generalization tasks, finding improved generalization compared to existing positional encoding methods. Our code is available at \url{https://github.com/Graph-COM/SPE}., Comment: ICLR 2023

Vision-Language Models (VLMs) are pretrained on large, diverse, and noisy web-crawled datasets. This underscores the critical need for dataset pruning, as the quality of these datasets is strongly correlated with the performance of VLMs on downstream tasks. Using CLIPScore from a pretrained model to only train models using highly-aligned samples is one of the most successful methods for pruning. We argue that this approach suffers from multiple limitations including: false positives and negatives due to CLIP's pretraining on noisy labels. We propose a pruning signal, Sieve, that employs synthetic captions generated by image-captioning models pretrained on small, diverse, and well-aligned image-text pairs to evaluate the alignment of noisy image-text pairs. To bridge the gap between the limited diversity of generated captions and the high diversity of alternative text (alt-text), we estimate the semantic textual similarity in the embedding space of a language model pretrained on unlabeled text corpus. Using DataComp, a multimodal dataset filtering benchmark, when evaluating on 38 downstream tasks, our pruning approach, surpasses CLIPScore by 2.6\% and 1.7\% on medium and large scale respectively. In addition, on retrieval tasks, Sieve leads to a significant improvement of 2.7% and 4.5% on medium and large scale respectively., Comment: Accepted in CVPR 2024

The plateau phase in the radio afterglows has been observed in very few gamma-ray bursts (GRBs), and 27 radio light curves with plateau phase were acquired from the published literature in this article. We obtain the related parameters of the radio plateau, such as temporal indexes during the plateau phase ($\alpha_1$ and $\alpha_2$), break time ($\Tbz$) and the corresponding radio flux ($F_{\rm b}$). The two parameter Dainotti relation between the break time of the plateau and the corresponding break luminosity ($\Lbz$) in radio band is $\Lbz \propto \Tbz^{-1.20\pm0.24}$. Including the isotropic energy $\Eiso$ and the peak energy $\Epi$, the three parameter correlations for the radio plateaus are written as $\Lbz \propto \Tbz^{-1.01 \pm 0.24} \Eiso^{0.18 \pm 0.09}$ and $\Lbz \propto \Tbz^{-1.18 \pm 0.27} \Epi^{0.05 \pm 0.28}$, respectively. The correlations are less consistent with that of X-ray and optical plateaus, implying that radio plateaus may have a different physical mechanism. The typical frequencies crossing the observational band may be a reasonable hypothesis that causes the breaks of the radio afterglows. We calibrate GRBs empirical luminosity correlations as standard candle for constraining cosmological parameters, and find that our samples can constrain the flat $\Lambda$CDM model well, while are not sensitive to non-flat ${\Lambda}$CDM model. By combining GRBs with other probes, such as SN and CMB, the constraints on cosmological parameters are $\om = 0.297\pm0.006$ for the flat ${\Lambda}$CDM model and $\om = 0.283\pm0.008$, $\oL = 0.711\pm0.006$ for the non-flat ${\Lambda}$CDM model, respectively., Comment: 16 pages, 6 figures and 6 tables, accepted for publication in ApJ

Symmetrical NMR spectroscopy constitutes a vital branch of multidimensional NMR spectroscopy, providing a powerful tool for the structural elucidation of biological macromolecules. Non-Uniform Sampling (NUS) serves as an effective strategy for averting the prohibitive acquisition time of multidimensional NMR spectroscopy by only sampling a few points according to NUS sampling schedules and reconstructing missing points via algorithms. However, current sampling schedules are unable to maintain the accurate recovery of cross peaks that are weak but important. In this work, we propose a novel sampling schedule termed as SCPG (Symmetrical Copy Poisson Gap) and employ CS (Compressed Sensing) methods for reconstruction. We theoretically prove that the symmetrical constraint, apart from sparsity, is implicitly implemented when SCPG is combined with CS methods. The simulated and experimental data substantiate the advantage of SCPG over state-of-the-art 2D Woven PG in the NUS reconstruction of symmetrical NMR spectroscopy., Comment: 30 pages, 6 figures

Autonomous driving has long grappled with the need for precise absolute localization, making full autonomy elusive and raising the capital entry barriers for startups. This study delves into the feasibility of local trajectory planning for level-2+ (L2+) semi-autonomous vehicles without the dependence on accurate absolute localization. Instead, we emphasize the estimation of the pose change between consecutive planning frames from motion sensors and integration of relative locations of traffic objects to the local planning problem under the ego car's local coordinate system, therefore eliminating the need for an absolute localization. Without the availability of absolute localization for correction, the measurement errors of speed and yaw rate greatly affect the estimation accuracy of the relative pose change between frames. We proved that the feasibility/stability of the continuous planning problem under such motion sensor errors can be guaranteed at certain defined conditions. This was achieved by formulating it as a Lyapunov-stability analysis problem. Moreover, a simulation pipeline was developed to further validate the proposed local planning method. Simulations were conducted at two traffic scenes with different error settings for speed and yaw rate measurements. The results substantiate the proposed framework's functionality even under relatively inferior sensor errors. We also experiment the stability limits of the planned results under abnormally larger motion sensor errors. The results provide a good match to the previous theoretical analysis. Our findings suggested that precise absolute localization may not be the sole path to achieving reliable trajectory planning, eliminating the necessity for high-accuracy dual-antenna GPS as well as the high-fidelity maps for SLAM localization., Comment: 11 pages, 13 figures, github url: https://github.com/codezs09/l2_frenet_planner

Precursors provide important clues to the nature of gamma-ray burst (GRB) central engines and can be used to contain GRB physical processes. In this letter, we study the self-organized criticality in precursors of long GRBs in the third Swift/BAT Catalog. We investigate the differential and cumulative size distributions of 100 precursors, including peak flux, duration, rise time, decay time, and quiescent time with the Markov Chain Monte Carlo technique. It is found that all of the distributions can be well described by power-law models and understood within the physical framework of a self-organized criticality system. In addition, we inspect the cumulative distribution functions of the size differences with a q-Gaussian function. The scale-invariance structures of precursors further strengthen our findings. Particularly, similar analyses are made in 127 main bursts. The results show that both precursors and main bursts can be attributed to an self-organized criticality system with the spatial dimension S = 3 and driven by the similar magnetically dominated process., Comment: Accepted for publication in ApJL

Multi-behavior recommendation algorithms aim to leverage the multiplex interactions between users and items to learn users' latent preferences. Recent multi-behavior recommendation frameworks contain two steps: fusion and prediction. In the fusion step, advanced neural networks are used to model the hierarchical correlations between user behaviors. In the prediction step, multiple signals are utilized to jointly optimize the model with a multi-task learning (MTL) paradigm. However, recent approaches have not addressed the issue caused by imbalanced data distribution in the fusion step, resulting in the learned relationships being dominated by high-frequency behaviors. In the prediction step, the existing methods use a gate mechanism to directly aggregate expert information generated by coupling input, leading to negative information transfer. To tackle these issues, we propose a Parallel Knowledge Enhancement Framework (PKEF) for multi-behavior recommendation. Specifically, we enhance the hierarchical information propagation in the fusion step using parallel knowledge (PKF). Meanwhile, in the prediction step, we decouple the representations to generate expert information and introduce a projection mechanism during aggregation to eliminate gradient conflicts and alleviate negative transfer (PME). We conduct comprehensive experiments on three real-world datasets to validate the effectiveness of our model. The results further demonstrate the rationality and effectiveness of the designed PKF and PME modules. The source code and datasets are available at https://github.com/MC-CV/PKEF., Comment: Accepted by CIKM 2023

There is growing recognition that the network structures arising from interactions between different entities in physical, social and biological systems fundamentally alter the evolutionary outcomes. Previous paradigm exploring evolutionary game dynamics has assumed that individuals update their strategies at an identical rate, reporting that structurally heterogeneous networks -- despite their ubiquity in real systems -- generally hinder the emergence of collective cooperation compared to their homogeneous counterparts. Here we solve this paradox by creating a new paradigm where individuals on arbitrary networks are allowed to update strategies at arbitrary, personalized rates, and provide the precise condition under which universal collective cooperation is favored. We find that when individuals' update rates vary inversely with their number of connections, heterogeneous networks actually outperform homogeneous ones in promoting cooperation. This surprising property of such "doubly heterogeneous" networks cautions against the conventional wisdom that heterogeneous networks are antagonistic to cooperation. We further develop an efficient protocol for optimizing the promotion of cooperation by tuning individuals' update rates in any structure. Our findings highlight that personalized interaction dynamics, beyond structure, in complex networks are fundamental to understanding and promoting collective cooperation., Comment: 10 pages, 5 figures

Kilonovae are a rare class of astrophysical transients powered by the radioactive decay of nuclei heavier than iron, synthesized in the merger of two compact objects. Over the first few days, the kilonova evolution is dominated by a large number of radioactive isotopes contributing to the heating rate. On timescales of weeks to months, its behavior is predicted to differ depending on the ejecta composition and merger remnant. However, late-time observations of known kilonovae are either missing or limited. Here we report observations of a luminous red transient with a quasi-thermal spectrum, following an unusual gamma-ray burst of long duration. We classify this thermal emission as a kilonova and track its evolution up to two months after the burst. At these late times, the recession of the photospheric radius and the rapidly-decaying bolometric luminosity ($L_{\rm bol}\propto t^{-2.7\pm 0.4}$) support the recombination of lanthanide-rich ejecta as they cool., Comment: 47 pages, 14 figures, 9 tables; submitted; a minor typo fixed