Search

Quantum mechanics empowers the emergence of quantum advantages in various fields, including quantum algorithms. Quantum PageRank is a promising tool for a future quantum internet. Recently, arbitrary phase rotations (APR) have been introduced in the underlying Szegedy's quantum walk of quantum PageRank algorithm. In this work, we thoroughly study the role APR plays in quantum PageRank. We discover the versatility resulting from quantumness. Specifically, we discover the emergence of a cluster phenomenon in rankings considering the rotation phases, i.e. the existence of similar clusters in the distribution of the rankings and their fidelity with the corresponding classical PageRanks, the ranking distribution variance, the coherence and entanglement of PageRank states, and the power law parameter in the ranking distributions on a scale-free network concerning the two rotation phases. Furthermore, we propose an alternate quantum PageRank with APR which provides an extra tunnel for the analysis of PageRank. We also study the PageRank on the trackback graph of a scale-free graph for the investigation of network information traffic tracking. We demonstrate the rich cluster diversity formed in our alternate quantum PageRank, which offers a novel perspective on the quantum versatility of PageRank. Our results present the quantum-enabled perspective for PageRanking and shed light on the design and application of practical quantum PageRank algorithms., Comment: 12pages

Existing click-through rate (CTR) prediction works have studied the role of feature interaction through a variety of techniques. Each interaction technique exhibits its own strength, and solely using one type could constrain the model's capability to capture the complex feature relationships, especially for industrial large-scale data with enormous users and items. Recent research shows that effective CTR models often combine an MLP network with a dedicated feature interaction network in a two-parallel structure. However, the interplay and cooperative dynamics between different streams or branches remain under-researched. In this work, we introduce a novel Multi-Branch Cooperation Network (MBCnet) which enables multiple branch networks to collaborate with each other for better complex feature interaction modeling. Specifically, MBCnet consists of three branches: the Expert-based Feature Grouping and Crossing (EFGC) branch that promotes the model's memorization ability of specific feature fields, the low rank Cross Net branch and Deep branch to enhance both explicit and implicit feature crossing for improved generalization. Among branches, a novel cooperation scheme is proposed based on two principles: branch co-teaching and moderate differentiation. Branch co-teaching encourages well-learned branches to support poorly-learned ones on specific training samples. Moderate differentiation advocates branches to maintain a reasonable level of difference in their feature representations. The cooperation strategy improves learning through mutual knowledge sharing via co-teaching and boosts the discovery of diverse feature interactions across branches. Extensive experiments on large-scale industrial datasets and online A/B test demonstrate MBCnet's superior performance, delivering a 0.09 point increase in CTR, 1.49% growth in deals, and 1.62% rise in GMV. Core codes will be released soon., Comment: 10 pages

Explaining the decision-making processes of Artificial Intelligence (AI) models is crucial for addressing their "black box" nature, particularly in tasks like image classification. Traditional eXplainable AI (XAI) methods typically rely on unimodal explanations, either visual or textual, each with inherent limitations. Visual explanations highlight key regions but often lack rationale, while textual explanations provide context without spatial grounding. Further, both explanation types can be inconsistent or incomplete, limiting their reliability. To address these challenges, we propose a novel Multimodal Explanation-Guided Learning (MEGL) framework that leverages both visual and textual explanations to enhance model interpretability and improve classification performance. Our Saliency-Driven Textual Grounding (SDTG) approach integrates spatial information from visual explanations into textual rationales, providing spatially grounded and contextually rich explanations. Additionally, we introduce Textual Supervision on Visual Explanations to align visual explanations with textual rationales, even in cases where ground truth visual annotations are missing. A Visual Explanation Distribution Consistency loss further reinforces visual coherence by aligning the generated visual explanations with dataset-level patterns, enabling the model to effectively learn from incomplete multimodal supervision. We validate MEGL on two new datasets, Object-ME and Action-ME, for image classification with multimodal explanations. Experimental results demonstrate that MEGL outperforms previous approaches in prediction accuracy and explanation quality across both visual and textual domains. Our code will be made available upon the acceptance of the paper.

Cardiovascular diseases (CVDs) present significant challenges for early and accurate diagnosis. While cardiac magnetic resonance imaging (CMR) is the gold standard for assessing cardiac function and diagnosing CVDs, its high cost and technical complexity limit accessibility. In contrast, electrocardiography (ECG) offers promise for large-scale early screening. This study introduces CardiacNets, an innovative model that enhances ECG analysis by leveraging the diagnostic strengths of CMR through cross-modal contrastive learning and generative pretraining. CardiacNets serves two primary functions: (1) it evaluates detailed cardiac function indicators and screens for potential CVDs, including coronary artery disease, cardiomyopathy, pericarditis, heart failure and pulmonary hypertension, using ECG input; and (2) it enhances interpretability by generating high-quality CMR images from ECG data. We train and validate the proposed CardiacNets on two large-scale public datasets (the UK Biobank with 41,519 individuals and the MIMIC-IV-ECG comprising 501,172 samples) as well as three private datasets (FAHZU with 410 individuals, SAHZU with 464 individuals, and QPH with 338 individuals), and the findings demonstrate that CardiacNets consistently outperforms traditional ECG-only models, substantially improving screening accuracy. Furthermore, the generated CMR images provide valuable diagnostic support for physicians of all experience levels. This proof-of-concept study highlights how ECG can facilitate cross-modal insights into cardiac function assessment, paving the way for enhanced CVD screening and diagnosis at a population level., Comment: 23 pages, 8 figures

The goal of this work is to study occurrences of non-unique solutions in dual-energy CT (DECT) for objects containing water and a contrast agent. Previous studies of the Jacobian of nonlinear systems identified that a vanishing Jacobian determinant indicates the existence of multiple solutions to the system. Vanishing Jacobian determinants are identified for DECT setups by simulating intensity data for practical thickness ranges of water and contrast agent. Once existence is identified, non-unique solutions are found by simulating scan data and finding intensity contours with that intersect multiple times. With this process non-unique solutions are found for DECT setups scanning iodine and gadolinium, including setups using tube potentials in practical ranges. Non-unique solutions demonstrate a large range of differences and can result in significant discrepancies between recovered and true material mapping., Comment: Proceedings paper for accepted contribution to the 8th International Conference on Image Formation in X-Ray Computed Tomography

Learning a reward model (RM) from human preferences has been an important component in aligning large language models (LLMs). The canonical setup of learning RMs from pairwise preference data is rooted in the classic Bradley-Terry (BT) model that accepts binary feedback, i.e., the label being either Response 1 is better than Response 2, or the opposite. Such a setup inevitably discards potentially useful samples (such as "tied" between the two responses) and loses more fine-grained information (such as "slightly better"). In this paper, we propose a framework for learning RMs under ordinal feedback which generalizes the case of binary preference feedback to any arbitrary granularity. Specifically, we first identify a marginal unbiasedness condition, which generalizes the assumption of the BT model in the existing binary feedback setting. The condition validates itself via the sociological concept of the wisdom of the crowd. Under the condition, we develop a natural probability model for pairwise preference data under ordinal feedback and analyze its properties. We prove the statistical benefits of ordinal feedback in terms of reducing the Rademacher complexity compared to the case of binary feedback. The proposed learning objective and the theory also extend to hinge loss and direct policy optimization (DPO). In particular, the theoretical analysis may be of independent interest when applying to a seemingly unrelated problem of knowledge distillation to interpret the bias-variance trade-off therein. The framework also sheds light on writing guidance for human annotators. Our numerical experiments validate that fine-grained feedback leads to better reward learning for both in-distribution and out-of-distribution settings. Further experiments show that incorporating a certain proportion of samples with tied preference boosts RM learning.

Despite the impressive performance of large multimodal models (LMMs) in high-level visual tasks, their capacity for image quality assessment (IQA) remains limited. One main reason is that LMMs are primarily trained for high-level tasks (e.g., image captioning), emphasizing unified image semantics extraction under varied quality. Such semantic-aware yet quality-insensitive perception bias inevitably leads to a heavy reliance on image semantics when those LMMs are forced for quality rating. In this paper, instead of retraining or tuning an LMM costly, we propose a training-free debiasing framework, in which the image quality prediction is rectified by mitigating the bias caused by image semantics. Specifically, we first explore several semantic-preserving distortions that can significantly degrade image quality while maintaining identifiable semantics. By applying these specific distortions to the query or test images, we ensure that the degraded images are recognized as poor quality while their semantics remain. During quality inference, both a query image and its corresponding degraded version are fed to the LMM along with a prompt indicating that the query image quality should be inferred under the condition that the degraded one is deemed poor quality.This prior condition effectively aligns the LMM's quality perception, as all degraded images are consistently rated as poor quality, regardless of their semantic difference.Finally, the quality scores of the query image inferred under different prior conditions (degraded versions) are aggregated using a conditional probability model. Extensive experiments on various IQA datasets show that our debiasing framework could consistently enhance the LMM performance and the code will be publicly available.

The Perfect Domination Problem (PDP), a classical challenge in combinatorial optimization, has significant applications in real-world scenarios, such as wireless and social networks. Over several decades of research, the problem has been demonstrated to be NP-complete across numerous graph classes. With the recent advancements in quantum computing, there has been a surge in the development of quantum algorithms aimed at addressing NP-complete problems, including the Quantum Approximate Optimization Algorithm (QAOA). However, the applicability of quantum algorithms to the PDP, as well as their efficacy in solving it, remains largely unexplored. This study represents a pioneering effort to apply QAOA, with a limited number of layers, to address the PDP. Comprehensive testing and analysis were conducted across 420 distinct parameter combinations. Experimental results indicate that QAOA successfully identified the correct Perfect Dominating Set (PDS) in 82 cases, including 17 instances where the optimal PDS was computed. Furthermore, it was observed that with appropriate parameter settings, the approximation ratio could achieve a value close to 0.9. These findings underscore the potential of QAOA as a viable approach for solving the PDP, signifying an important milestone that introduces this problem into the realm of quantum computing., Comment: 25 pages, 13 figures

In the context of quantum electrodynamics, the decay of false vacuum leads to the production of electron-positron pair, a phenomenon known as the Schwinger effect. In practical experimental scenarios, producing a pair requires an extremely strong electric field, thus suppressing the production rate and making this process very challenging to observe. Here we report an experimental investigation, in a cold-atom quantum simulator, of the effect of the background field on pair production from the infinite-mass vacuum in a $1+1$D $\mathrm{U}(1)$ lattice gauge theory. The ability to tune the background field allows us to study pair production in a large production rate regime. Furthermore, we find that the energy spectrum of the time-evolved observables in the zero mass limit displays excitation peaks analogous to bosonic modes in the Schwinger model. Our work opens the door to quantum-simulation experiments that can controllably tune the production of pairs and manipulate their far-from-equilibrium dynamics.

Using the AdS/CFT correspondence, this paper investigates the holographic images of a charged black hole within the context of Lorentz symmetry breaking massive gravity. The photon rings, luminosity-deformed rings, or light points from various observational perspectives are obtained. We also study the influences of both the chemical potential and temperature on the Einstein ring. Unlike the previous work, which primarily examines the effect of chemical potential on ring radius at high temperatures and find no change in the radius with varying chemical potential, we also investigate the effect of chemical potential on the ring radius at low temperature besides at high temperature. Our findings indicate that at low temperatures, the photon ring radius decreases with increasing of chemical potential, while at high temperatures, the results are consistent with previous studies. Additionally, we explore the impact of the model parameter {\lambda} on the Einstein ring radius and find the the ring radius increases as the model parameter {\lambda} increases. More interestingly, for the large chemical potential, u = 1, the temperature dependence of the photon ring radius is reversed for {\lambda} = 2 and {\lambda} = 4. Conversely, for a small chemical potential u = 0.1, the temperature dependence of the Einstein ring stays the same as {\lambda} = 2 and {\lambda} = 4., Comment: 15 pages, 26 figuers

Transcatheter tricuspid valve replacement (TTVR) is the latest treatment for tricuspid regurgitation and is in the early stages of clinical adoption. Intelligent robotic approaches are expected to overcome the challenges of surgical manipulation and widespread dissemination, but systems and protocols with high clinical utility have not yet been reported. In this study, we propose a complete solution that includes a passive stabilizer, robotic drive, detachable delivery catheter and valve manipulation mechanism. Working towards autonomy, a hybrid augmented intelligence approach based on reinforcement learning, Monte Carlo probabilistic maps and human-robot co-piloted control was introduced. Systematic tests in phantom and first-in-vivo animal experiments were performed to verify that the system design met the clinical requirement. Furthermore, the experimental results confirmed the advantages of co-piloted control over conventional master-slave control in terms of time efficiency, control efficiency, autonomy and stability of operation. In conclusion, this study provides a comprehensive pathway for robotic TTVR and, to our knowledge, completes the first animal study that not only successfully demonstrates the application of hybrid enhanced intelligence in interventional robotics, but also provides a solution with high application value for a cutting-edge procedure.

Modeling feature interactions plays a crucial role in accurately predicting click-through rates (CTR) in advertising systems. To capture the intricate patterns of interaction, many existing models employ matrix-factorization techniques to represent features as lower-dimensional embedding vectors, enabling the modeling of interactions as products between these embeddings. In this paper, we propose a general framework called IPA to systematically unify these models. Our framework comprises three key components: the Interaction Function, which facilitates feature interaction; the Layer Pooling, which constructs higher-level interaction layers; and the Layer Aggregator, which combines the outputs of all layers to serve as input for the subsequent classifier. We demonstrate that most existing models can be categorized within our framework by making specific choices for these three components. Through extensive experiments and a dimensional collapse analysis, we evaluate the performance of these choices. Furthermore, by leveraging the most powerful components within our framework, we introduce a novel model that achieves competitive results compared to state-of-the-art CTR models. PFL gets significant GMV lift during online A/B test in Tencent's advertising platform and has been deployed as the production model in several primary scenarios.

The challenge in LLM-based video understanding lies in preserving visual and semantic information in long videos while maintaining a memory-affordable token count. However, redundancy and correspondence in videos have hindered the performance potential of existing methods. Through statistical learning on current datasets, we observe that redundancy occurs in both repeated and answer-irrelevant frames, and the corresponding frames vary with different questions. This suggests the possibility of adopting dynamic encoding to balance detailed video information preservation with token budget reduction. To this end, we propose a dynamic cooperative network, DynFocus, for memory-efficient video encoding in this paper. Specifically, i) a Dynamic Event Prototype Estimation (DPE) module to dynamically select meaningful frames for question answering; (ii) a Compact Cooperative Encoding (CCE) module that encodes meaningful frames with detailed visual appearance and the remaining frames with sketchy perception separately. We evaluate our method on five publicly available benchmarks, and experimental results consistently demonstrate that our method achieves competitive performance., Comment: 8 pages, 6 figures

We present cosmological constraints on deviations from general relativity (GR) from the first-year of clustering observations from the Dark Energy Spectroscopic Instrument (DESI) in combination with other datasets. We first consider the $\mu(a,k)$-$\Sigma(a,k)$ modified gravity (MG) parametrization (as well as $\eta(a,k)$) in flat $\Lambda$CDM and $w_0 w_a$CDM backgrounds. Using a functional form for time-only evolution gives $\mu_0= 0.11^{+0.44}_{-0.54}$ from DESI(FS+BAO)+BBN and a wide prior on $n_{s}$. Using DESI(FS+BAO)+CMB+DESY3+DESY5-SN, we obtain $\mu_0 = 0.05\pm 0.22$ and $\Sigma_0 = 0.009\pm 0.045$ in the $\Lambda$CDM background. In $w_0 w_a$CDM, we obtain $\mu_0 =-0.24^{+0.32}_{-0.28}$ and $\Sigma_0 = 0.006\pm 0.043$, consistent with GR, and we still find a preference of the data for dynamical dark energy with $w_0>-1$ and $w_a<0$. We then use binned forms in the two backgrounds starting with two bins in redshift and then combining them with two bins in scale for a total of 4 and 8 MG parameters, respectively. All MG parameters are found consistent with GR. We also find that the tension reported for $\Sigma_0$ with GR when using Planck PR3 goes away when we use the recent LoLLiPoP+HiLLiPoP likelihoods. As noted previously, this seems to indicate that the tension is related to the CMB lensing anomaly in PR3 which is also alleviated when using these likelihoods. We then constrain the class of Horndeski theory in the effective field theory of dark energy. We consider both EFT-basis and $\alpha$-basis. Assuming a power law parametrization for the function $\Omega$, which controls non-minimal coupling, we obtain $\Omega_0 = 0.0120^{+0.0021}_{-0.013}$ and $s_0 = 0.99^{+0.54}_{-0.20}$ from DESI(FS+BAO)+DESY5SN+CMB in a $\Lambda$CDM background. Similar results are obtained when using the $\alpha$-basis, where we constrain $c_M<1.24$, and are all consistent with GR. [Abridged.], Comment: 52 pages, 10 figures. This DESI Collaboration Publication is part of the 2024 publication series using the first year of observations (see https://data.desi.lbl.gov/doc/papers/)

We present cosmological results from the measurement of clustering of galaxy, quasar and Lyman-$\alpha$ forest tracers from the first year of observations with the Dark Energy Spectroscopic Instrument (DESI Data Release 1). We adopt the full-shape (FS) modeling of the power spectrum, including the effects of redshift-space distortions, in an analysis which has been validated in a series of supporting papers. In the flat $\Lambda$CDM cosmological model, DESI (FS+BAO), combined with a baryon density prior from Big Bang Nucleosynthesis and a weak prior on the scalar spectral index, determines matter density to $\Omega_\mathrm{m}=0.2962\pm 0.0095$, and the amplitude of mass fluctuations to $\sigma_8=0.842\pm 0.034$. The addition of the cosmic microwave background (CMB) data tightens these constraints to $\Omega_\mathrm{m}=0.3056\pm 0.0049$ and $\sigma_8=0.8121\pm 0.0053$, while further addition of the the joint clustering and lensing analysis from the Dark Energy Survey Year-3 (DESY3) data leads to a 0.4% determination of the Hubble constant, $H_0 = (68.40\pm 0.27)\,{\rm km\,s^{-1}\,Mpc^{-1}}$. In models with a time-varying dark energy equation of state, combinations of DESI (FS+BAO) with CMB and type Ia supernovae continue to show the preference, previously found in the DESI DR1 BAO analysis, for $w_0>-1$ and $w_a<0$ with similar levels of significance. DESI data, in combination with the CMB, impose the upper limits on the sum of the neutrino masses of $\sum m_\nu < 0.071\,{\rm eV}$ at 95% confidence. DESI data alone measure the modified-gravity parameter that controls the clustering of massive particles, $\mu_0=0.11^{+0.45}_{-0.54}$, while the combination of DESI with the CMB and the clustering and lensing analysis from DESY3 constrains both modified-gravity parameters, giving $\mu_0 = 0.04\pm 0.22$ and $\Sigma_0 = 0.044\pm 0.047$, in agreement with general relativity. [Abridged.], Comment: This DESI Collaboration Key Publication is part of the 2024 publication series using the first year of observations (see https://data.desi.lbl.gov/doc/papers/). 55 pages, 10 figures

We present the samples of galaxies and quasars used for DESI 2024 cosmological analyses, drawn from the DESI Data Release 1 (DR1). We describe the construction of large-scale structure (LSS) catalogs from these samples, which include matched sets of synthetic reference `randoms' and weights that account for variations in the observed density of the samples due to experimental design and varying instrument performance. We detail how we correct for variations in observational completeness, the input `target' densities due to imaging systematics, and the ability to confidently measure redshifts from DESI spectra. We then summarize how remaining uncertainties in the corrections can be translated to systematic uncertainties for particular analyses. We describe the weights added to maximize the signal-to-noise of DESI DR1 2-point clustering measurements. We detail measurement pipelines applied to the LSS catalogs that obtain 2-point clustering measurements in configuration and Fourier space. The resulting 2-point measurements depend on window functions and normalization constraints particular to each sample, and we present the corrections required to match models to the data. We compare the configuration- and Fourier-space 2-point clustering of the data samples to that recovered from simulations of DESI DR1 and find they are, generally, in statistical agreement to within 2\% in the inferred real-space over-density field. The LSS catalogs, 2-point measurements, and their covariance matrices will be released publicly with DESI DR1., Comment: This DESI Collaboration Key Publication is part of the 2024 publication series using the first year of observations (see https://data.desi.lbl.gov/doc/papers/)

We present the measurements and cosmological implications of the galaxy two-point clustering using over 4.7 million unique galaxy and quasar redshifts in the range $0.1

Robotic manipulation refers to the autonomous handling and interaction of robots with objects using advanced techniques in robotics and artificial intelligence. The advent of powerful tools such as large language models (LLMs) and large vision-language models (LVLMs) has significantly enhanced the capabilities of these robots in environmental perception and decision-making. However, the introduction of these intelligent agents has led to security threats such as jailbreak attacks and adversarial attacks. In this research, we take a further step by proposing a backdoor attack specifically targeting robotic manipulation and, for the first time, implementing backdoor attack in the physical world. By embedding a backdoor visual language model into the visual perception module within the robotic system, we successfully mislead the robotic arm's operation in the physical world, given the presence of common items as triggers. Experimental evaluations in the physical world demonstrate the effectiveness of the proposed backdoor attack., Comment: Initial version with preliminary results. We welcome any feedback or suggestions

Audio data, often synchronized with video frames, plays a crucial role in guiding the audience's visual attention. Incorporating audio information into video saliency prediction tasks can enhance the prediction of human visual behavior. However, existing audio-visual saliency prediction methods often directly fuse audio and visual features, which ignore the possibility of inconsistency between the two modalities, such as when the audio serves as background music. To address this issue, we propose a novel relevance-guided audio-visual saliency prediction network dubbed AVRSP. Specifically, the Relevance-guided Audio-Visual feature Fusion module (RAVF) dynamically adjusts the retention of audio features based on the semantic relevance between audio and visual elements, thereby refining the integration process with visual features. Furthermore, the Multi-scale feature Synergy (MS) module integrates visual features from different encoding stages, enhancing the network's ability to represent objects at various scales. The Multi-scale Regulator Gate (MRG) could transfer crucial fusion information to visual features, thus optimizing the utilization of multi-scale visual features. Extensive experiments on six audio-visual eye movement datasets have demonstrated that our AVRSP network achieves competitive performance in audio-visual saliency prediction.

Properties of layered superconductors can vary drastically when thinned down from bulk to monolayer, owing to the reduced dimensionality and weakened interlayer coupling. In transition metal dichalcogenides (TMDs), the inherent symmetry breaking effect in atomically thin crystals prompts novel states of matter, such as Ising superconductivity with an extraordinary in-plane upper critical field. Here, we demonstrate that two-dimensional (2D) superconductivity resembling those in atomic layers but with more fascinating behaviours can be realized in the bulk crystals of two new TMD-based superconductors Ba0.75ClTaS2 and Ba0.75ClTaSe2. They comprise an alternating stack of H-type TMD layers and Ba-Cl layers. In both materials, intrinsic 2D superconductivity develops below a Berezinskii-Kosterlitz-Thouless transition. The upper critical field along ab plane exceeds the Pauli limit (Hp); in particular, Ba0.75ClTaSe2 exhibits an extremely high in plane Hc2 (14Hp) and a colossal superconducting anisotropy of 150. Moreover, the temperature-field phase diagram of Ba0.75ClTaSe2 under an in-plane magnetic field contains a large phase regime of vortex dissipation, which can be ascribed to the Josephson vortex motion, signifying an unprecedentedly strong fluctuation effect in TMD-based superconductors. Our results provide a new path towards the establishment of 2D superconductivity and novel exotic quantum phases in bulk crystals of TMD-based superconductors., Comment: Accepted by JACS

The $C\!P$ asymmetry and branching fraction of the CKM-suppressed decay $B^+\!\to J\mskip -3mu/\mskip -2mu\psi\,\pi^+$ are precisely measured relative to the favoured decay $B^+\!\to J\mskip -3mu/\mskip -2mu\psi\,K^+$, using a sample of proton-proton collision data corresponding to an integrated luminosity of $5.4~\mathrm{fb}^{-1}$ recorded at center-of-mass energy of $13~\mathrm{TeV}$ during 2016--2018. The results of the $C\!P$ asymmetry difference and branching fraction ratio are \begin{align*} \Delta\mathcal{A}^{C\!P} &\equiv \mathcal{A}^{C\!P}(B^+ \to J\mskip -3mu/\mskip -2mu\psi\,\pi^+) - \mathcal{A}^{C\!P}(B^+ \to J\mskip -3mu/\mskip -2mu\psi\,K^+) = (1.29 \pm 0.49 \pm 0.08) \times 10^{-2}, \end{align*} \begin{equation*} \mathcal{R}_{\pi/K} \equiv \frac{\mathcal{B}(B^+ \!\to J\mskip -3mu/\mskip -2mu\psi\,\pi^+)}{\mathcal{B}(B^+ \!\to J\mskip -3mu/\mskip -2mu\psi\,K^+)} = (3.852 \pm 0.022 \pm 0.018) \times 10^{-2}. \end{equation*} where the first uncertainties are statistical and the second systematic. A combination with previous LHCb results based on data collected at $7$ and $8~\mathrm{TeV}$ in 2011 and 2012 yields $\Delta\mathcal{A}^{C\!P} = (1.42 \pm 0.43 \pm 0.08) \times 10^{-2}$ and $\mathcal{R}_{\pi/K} = (3.846 \pm 0.018 \pm 0.018) \times 10^{-2}$. The combined $\Delta\mathcal{A}^{C\!P}$ value deviates from zero by 3.2 standard deviations, providing the first evidence for direct $C\!P$ violation in the amplitudes of beauty decays to charmonium final states., Comment: 18 pages, 2 figures, no conference or journal information All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/1623/ (LHCb public pages)

Large Language Models (LLMs) have demonstrated remarkable success across a wide range of tasks and domains. However, their performance in low-resource language translation, particularly when translating into these languages, remains underexplored. This gap poses significant challenges, as linguistic barriers hinder the cultural preservation and development of minority communities. To address this issue, this paper introduces a novel retrieval-based method that enhances translation quality for low-resource languages by focusing on key terms, which involves translating keywords and retrieving corresponding examples from existing data. To evaluate the effectiveness of this method, we conducted experiments translating from English into three low-resource languages: Cherokee, a critically endangered indigenous language of North America; Tibetan, a historically and culturally significant language in Asia; and Manchu, a language with few remaining speakers. Our comparison with the zero-shot performance of GPT-4o and LLaMA 3.1 405B, highlights the significant challenges these models face when translating into low-resource languages. In contrast, our retrieval-based method shows promise in improving both word-level accuracy and overall semantic understanding by leveraging existing resources more effectively.

The increased model capacity of Diffusion Transformers (DiTs) and the demand for generating higher resolutions of images and videos have led to a significant rise in inference latency, impacting real-time performance adversely. While prior research has highlighted the presence of high similarity in activation values between adjacent diffusion steps (referred to as redundancy) and proposed various caching mechanisms to mitigate computational overhead, the exploration of redundancy in existing literature remains limited, with findings often not generalizable across different DiT models. This study aims to address this gap by conducting a comprehensive investigation into redundancy across a broad spectrum of mainstream DiT models. Our experimental analysis reveals substantial variations in the distribution of redundancy across diffusion steps among different DiT models. Interestingly, within a single model, the redundancy distribution remains stable regardless of variations in input prompts, step counts, or scheduling strategies. Given the lack of a consistent pattern across diverse models, caching strategies designed for a specific group of models may not easily transfer to others. To overcome this challenge, we introduce a tool for analyzing the redundancy of individual models, enabling subsequent research to develop tailored caching strategies for specific model architectures. The project is publicly available at https://github.com/xdit-project/DiTCacheAnalysis., Comment: 9 pages including reference

Large Language Models (LLMs) exhibit remarkable capabilities in handling multiple tasks across domains due to their emergent properties. These capabilities are further augmented during the Supervised Fine-Tuning (SFT) phase. Despite their potential, existing work mainly focuses on domain-specific enhancements during fine-tuning, the challenge of which lies in catastrophic forgetting of knowledge across other domains. In this study, we introduce VersaTune, a novel data composition framework designed for enhancing LLMs' overall multi-ability performances during fine-tuning. We categorize knowledge into distinct domains including law, medicine, finance, science, code. We begin with detecting the distribution of domain-specific knowledge within the base model, followed by the composition of training data that aligns with the model's existing knowledge distribution. During the fine-tuning process, weights of different domains are dynamically adjusted based on their learnable potential and forgetting degree. Experimental results demonstrate that VersaTune achieves significant improvements in multi-domain performance, with a 35.21% enhancement in comprehensive multi-domain tasks. Additionally, in scenarios where specific domain optimization is required, VersaTune reduces the degradation of performance in other domains by 38.77%, without compromising the target domain's training efficacy.

We present~\emph{KV-Tandem}, a modular architecture for building LSM-based storage engines on top of simple, non-ordered persistent key-value stores (KVSs). KV-Tandem enables advanced functionalities such as range queries and snapshot reads, while maintaining the native KVS performance for random reads and writes. Its modular design offers better performance trade-offs compared to previous KV-separation solutions, which struggle to decompose the monolithic LSM structure. Central to KV-Tandem is~\emph{LSM bypass} -- a novel algorithm that offers a fast path to basic operations while ensuring the correctness of advanced APIs. We implement KV-Tandem in \emph{XDP-Rocks}, a RocksDB-compatible storage engine that leverages the XDP KVS and incorporates practical design optimizations for real-world deployment. Through extensive microbenchmark and system-level comparisons, we demonstrate that XDP-Rocks achieves 3x to 4x performance improvements over RocksDB across various workloads. XDP-Rocks is already deployed in production, delivering significant operator cost savings consistent with these performance gains.

This paper provides a comprehensive survey of the latest research on multilingual large language models (MLLMs). MLLMs not only are able to understand and generate language across linguistic boundaries, but also represent an important advancement in artificial intelligence. We first discuss the architecture and pre-training objectives of MLLMs, highlighting the key components and methodologies that contribute to their multilingual capabilities. We then discuss the construction of multilingual pre-training and alignment datasets, underscoring the importance of data quality and diversity in enhancing MLLM performance. An important focus of this survey is on the evaluation of MLLMs. We present a detailed taxonomy and roadmap covering the assessment of MLLMs' cross-lingual knowledge, reasoning, alignment with human values, safety, interpretability and specialized applications. Specifically, we extensively discuss multilingual evaluation benchmarks and datasets, and explore the use of LLMs themselves as multilingual evaluators. To enhance MLLMs from black to white boxes, we also address the interpretability of multilingual capabilities, cross-lingual transfer and language bias within these models. Finally, we provide a comprehensive review of real-world applications of MLLMs across diverse domains, including biology, medicine, computer science, mathematics and law. We showcase how these models have driven innovation and improvements in these specialized fields while also highlighting the challenges and opportunities in deploying MLLMs within diverse language communities and application scenarios. We listed the paper related in this survey and publicly available at https://github.com/tjunlp-lab/Awesome-Multilingual-LLMs-Papers.

Various linear complexity models, such as Linear Transformer (LinFormer), State Space Model (SSM), and Linear RNN (LinRNN), have been proposed to replace the conventional softmax attention in Transformer structures. However, the optimal design of these linear models is still an open question. In this work, we attempt to answer this question by finding the best linear approximation to softmax attention from a theoretical perspective. We start by unifying existing linear complexity models as the linear attention form and then identify three conditions for the optimal linear attention design: 1) Dynamic memory ability; 2) Static approximation ability; 3) Least parameter approximation. We find that none of the current linear models meet all three conditions, resulting in suboptimal performance. Instead, we propose Meta Linear Attention (MetaLA) as a solution that satisfies these conditions. Our experiments on Multi-Query Associative Recall (MQAR) task, language modeling, image classification, and Long-Range Arena (LRA) benchmark demonstrate that MetaLA is more effective than the existing linear models.

Artificial Intelligence (AI) has become essential in modern healthcare, with large language models (LLMs) offering promising advances in clinical decision-making. Traditional model-based approaches, including those leveraging in-context demonstrations and those with specialized medical fine-tuning, have demonstrated strong performance in medical language processing but struggle with real-time adaptability, multi-step reasoning, and handling complex medical tasks. Agent-based AI systems address these limitations by incorporating reasoning traces, tool selection based on context, knowledge retrieval, and both short- and long-term memory. These additional features enable the medical AI agent to handle complex medical scenarios where decision-making should be built on real-time interaction with the environment. Therefore, unlike conventional model-based approaches that treat medical queries as isolated questions, medical AI agents approach them as complex tasks and behave more like human doctors. In this paper, we study the choice of the backbone LLM for medical AI agents, which is the foundation for the agent's overall reasoning and action generation. In particular, we consider the emergent o1 model and examine its impact on agents' reasoning, tool-use adaptability, and real-time information retrieval across diverse clinical scenarios, including high-stakes settings such as intensive care units (ICUs). Our findings demonstrate o1's ability to enhance diagnostic accuracy and consistency, paving the way for smarter, more responsive AI tools that support better patient outcomes and decision-making efficacy in clinical practice.

Conversational Recommender Systems (CRSs) aim to provide personalized recommendations through dynamically capturing user preferences in interactive conversations. Conventional CRSs often extract user preferences as hidden representations, which are criticized for their lack of interpretability. This diminishes the transparency and trustworthiness of the recommendation process. Recent works have explored combining the impressive capabilities of Large Language Models (LLMs) with the domain-specific knowledge of Knowledge Graphs (KGs) to generate human-understandable recommendation explanations. Despite these efforts, the integration of LLMs and KGs for CRSs remains challenging due to the modality gap between unstructured dialogues and structured KGs. Moreover, LLMs pre-trained on large-scale corpora may not be well-suited for analyzing user preferences, which require domain-specific knowledge. In this paper, we propose COMPASS, a plug-and-play framework that synergizes LLMs and KGs to unveil user preferences, enhancing the performance and explainability of existing CRSs. To address integration challenges, COMPASS employs a two-stage training approach: first, it bridges the gap between the structured KG and natural language through an innovative graph entity captioning pre-training mechanism. This enables the LLM to transform KG entities into concise natural language descriptions, allowing them to comprehend domain-specific knowledge. Following, COMPASS optimizes user preference modeling via knowledge-aware instruction fine-tuning, where the LLM learns to reason and summarize user preferences from both dialogue histories and KG-augmented context. This enables COMPASS to perform knowledge-aware reasoning and generate comprehensive and interpretable user preferences that can seamlessly integrate with existing CRS models for improving recommendation performance and explainability.

Fine-tuning large language models (LLMs) poses significant memory challenges, as the back-propagation process demands extensive resources, especially with growing model sizes. Recent work, MeZO, addresses this issue using a zeroth-order (ZO) optimization method, which reduces memory consumption by matching the usage to the inference phase. However, MeZO experiences slow convergence due to varying curvatures across model parameters. To overcome this limitation, we introduce HELENE, a novel scalable and memory-efficient optimizer that integrates annealed A-GNB gradients with a diagonal Hessian estimation and layer-wise clipping, serving as a second-order pre-conditioner. This combination allows for faster and more stable convergence. Our theoretical analysis demonstrates that HELENE improves convergence rates, particularly for models with heterogeneous layer dimensions, by reducing the dependency on the total parameter space dimension. Instead, the method scales with the largest layer dimension, making it highly suitable for modern LLM architectures. Experimental results on RoBERTa-large and OPT-1.3B across multiple tasks show that HELENE achieves up to a 20x speedup compared to MeZO, with average accuracy improvements of 1.5%. Furthermore, HELENE remains compatible with both full parameter tuning and parameter-efficient fine-tuning (PEFT), outperforming several state-of-the-art optimizers. The codes will be released after reviewing.

Hierarchical Archimedean copulas (HACs) are multivariate uniform distributions constructed by nesting Archimedean copulas into one another, and provide a flexible approach to modeling non-exchangeable data. However, this flexibility in the model structure may lead to over-fitting when the model estimation procedure is not performed properly. In this paper, we examine the problem of structure estimation and more generally on the selection of a parsimonious model from the hypothesis testing perspective. Formal tests for structural hypotheses concerning HACs have been lacking so far, most likely due to the restrictions on their associated parameter space which hinders the use of standard inference methodology. Building on previously developed asymptotic methods for these non-standard parameter spaces, we provide an asymptotic stochastic representation for the maximum likelihood estimators of (potentially) overparametrized HACs, which we then use to formulate a likelihood ratio test for certain common structural hypotheses. Additionally, we also derive analytical expressions for the first- and second-order partial derivatives of two-level HACs based on Clayton and Gumbel generators, as well as general numerical approximation schemes for the Fisher information matrix.

Recently, by studying an explicit basis, K\"ock and Laurent give the decomposition of the $\overline{\mathbb{F}}_q[\mathrm{SL}_2(\mathbb{F}_q)]$-module of holomorphic forms on the Drinfeld curve. We present a crystalline cohomological proof of this decomposition, without specifying a basis., Comment: 4 pages

In this article, we study the effect of invisible neutrino decay of the third neutrino state for accelerator neutrino experiments at two different baselines, 1300 km with a liquid argon time projection chamber (LArTPC) detector (similar to DUNE) and 2588 km with a water Cherenkov detector (similar to P2O). For such baselines, the matter effect starts to become important. Our aim is to ascertain the sensitivity to mass hierarchy and octant of $\theta_{23}$ in these two experiments in the presence of a decaying neutrino state. We compare and contrast the results of the two experimental setups. We find that, in general, hierarchy sensitivity decreases in the presence of decay. However, if we consider decay only in the opposite hierarchy (test scenario), in the 2588 km setup, the hierarchy sensitivity with the true hierarchy as IH is larger than the no decay case. We also study the dependence of hierarchy sensitivity with true $\theta_{23}$. We find that the dominant muon background in P2O plays an important role in how the hierarchy sensitivity depends on $\theta_{23}$. The octant sensitivity for both setups increases in the presence of decay except for the LArTPC setup in case true $\theta_{23}=49^\circ$. To understand the octant sensitivity results in the two setups, we check the synergy in sensitivity between electron and muon channels as a function of test $\theta_{23}$. We also study the degeneracies in the test $\theta_{23}-\delta_{CP}$ plane and find that combined analysis of the two setups removes all the degeneracies in the test $\theta_{23}-\delta_{CP}$ plane at $5\sigma$ significance., Comment: v1: 23 pages, 12 captioned figures, 3 tables

In this paper, we explore the integration of Large Language Models (LLMs) with Retrieval-Augmented Generation (RAG) to enhance automated design and software development in the automotive industry. We present two case studies: a standardization compliance chatbot and a design copilot, both utilizing RAG to provide accurate, context-aware responses. We evaluate four LLMs-GPT-4o, LLAMA3, Mistral, and Mixtral -- comparing their answering accuracy and execution time. Our results demonstrate that while GPT-4 offers superior performance, LLAMA3 and Mistral also show promising capabilities for local deployment, addressing data privacy concerns in automotive applications. This study highlights the potential of RAG-augmented LLMs in improving design workflows and compliance in automotive engineering., Comment: Conference paper accepted in IEEE FLLM 2024

Audience feedback is crucial for refining video content, yet it typically comes after publication, limiting creators' ability to make timely adjustments. To bridge this gap, we introduce SimTube, a generative AI system designed to simulate audience feedback in the form of video comments before a video's release. SimTube features a computational pipeline that integrates multimodal data from the video-such as visuals, audio, and metadata-with user personas derived from a broad and diverse corpus of audience demographics, generating varied and contextually relevant feedback. Furthermore, the system's UI allows creators to explore and customize the simulated comments. Through a comprehensive evaluation-comprising quantitative analysis, crowd-sourced assessments, and qualitative user studies-we show that SimTube's generated comments are not only relevant, believable, and diverse but often more detailed and informative than actual audience comments, highlighting its potential to help creators refine their content before release.

In the Architecture Engineering & Construction (AEC) industry, how design behaviors impact design quality remains unclear. This study proposes a novel approach, which, for the first time, identifies and quantitatively describes the relationship between design behaviors and quality of design based on Building Information Modeling (BIM). Real-time collection and log mining are integrated to collect raw data of design behaviors. Feature engineering and various machine learning models are then utilized for quantitative modeling and interpretation. Results confirm an existing quantifiable relationship which can be learned by various models. The best-performing model using Extremely Random Trees achieved an R2 value of 0.88 on the test set. Behavioral features related to designer's skill level and changes of design intentions are identified to have significant impacts on design quality. These findings deepen our understanding of the design process and help forming BIM designs with better quality.

Observing and analyzing children's social behaviors is crucial for the early diagnosis of Autism Spectrum Disorders (ASD). This work focuses on automatically detecting ASD using computer vision techniques and large language models (LLMs). Existing methods typically rely on supervised learning. However, the scarcity of ASD diagnostic datasets and the lack of interpretability in diagnostic results significantly limits its clinical application. To address these challenges, we introduce a novel unsupervised approach based on script-centric behavior understanding. Our pipeline converts video content into scripts that describe the behavior of characters, leveraging the generalizability of large language models to detect ASD in a zero-shot or few-shot manner. Specifically, we propose a scripts transcription module for multimodal behavior data textualization and a domain prompts module to bridge LLMs. Our method achieves an accuracy of 92.00\% in diagnosing ASD in children with an average age of 24 months, surpassing the performance of supervised learning methods by 3.58\% absolutely. Extensive experiments confirm the effectiveness of our approach and suggest its potential for advancing ASD research through LLMs., Comment: 5 pages, 4 figures, submitted to ICASSP 2025

To address the time-scale limitations in molecular dynamics (MD) simulations, numerous enhanced sampling methods have been developed to expedite the exploration of complex free energy landscapes. A commonly employed approach accelerates the sampling of degrees of freedom associated with predefined collective variables (CVs), which typically tends to traverse the entire CV range. However, in many scenarios, the focus of interest is on specific regions within the CV space. In this paper, we introduce a novel "sinking" approach that enables enhanced sampling of arbitrary areas within the CV space. We begin by proposing a gridded convolutional approximation that productively replicates the effects of metadynamics, a powerful CV-based enhanced sampling technique. Building on this, we present the SinkMeta method, which "sinks" the interior bias potential to create a restraining potential "cliff" at the grid edges. This technique can confine the exploration of CVs in MD simulations to a predefined area. Our experimental results demonstrate that SinkMeta requires minimal sampling steps to estimate the free energy landscape for CV subspaces of various shapes and dimensions, including irregular two-dimensional regions and one-dimensional pathways between metastable states. We believe that SinkMeta will pioneer a new paradigm for sampling partial phase spaces, especially offering an efficient and flexible solution for sampling minimum free energy paths in high-dimensional spaces., Comment: 26 pages, 5 figures

The first measurement of $\phi(1020)$ meson production in fixed-target $p$Ne collisions at $\sqrt{s_{NN}}=68.5$ GeV is presented. The $\phi(1020)$ mesons are reconstructed in their $K^{+}K^{-}$ decay in a data sample consisting of proton collisions on neon nuclei at rest, corresponding to an integrated luminosity of $21.7 \pm 1.4$ nb$^{-1}$, collected by the LHCb detector at CERN. The $\phi(1020)$ production cross-section in the centre-of-mass rapidity range of $-1.8

Training a policy in a source domain for deployment in the target domain under a dynamics shift can be challenging, often resulting in performance degradation. Previous work tackles this challenge by training on the source domain with modified rewards derived by matching distributions between the source and the target optimal trajectories. However, pure modified rewards only ensure the behavior of the learned policy in the source domain resembles trajectories produced by the target optimal policies, which does not guarantee optimal performance when the learned policy is actually deployed to the target domain. In this work, we propose to utilize imitation learning to transfer the policy learned from the reward modification to the target domain so that the new policy can generate the same trajectories in the target domain. Our approach, Domain Adaptation and Reward Augmented Imitation Learning (DARAIL), utilizes the reward modification for domain adaptation and follows the general framework of generative adversarial imitation learning from observation (GAIfO) by applying a reward augmented estimator for the policy optimization step. Theoretically, we present an error bound for our method under a mild assumption regarding the dynamics shift to justify the motivation of our method. Empirically, our method outperforms the pure modified reward method without imitation learning and also outperforms other baselines in benchmark off-dynamics environments., Comment: Published at Neurips 2024

This paper investigates the generalizations and applications of weakly $p$-K\"ahler hyperbolic manifolds., Comment: Comments are welcome!

The Travelling Salesman Problem (TSP) remains a fundamental challenge in combinatorial optimization, inspiring diverse algorithmic strategies. This paper revisits the "heatmap + Monte Carlo Tree Search (MCTS)" paradigm that has recently gained traction for learning-based TSP solutions. Within this framework, heatmaps encode the likelihood of edges forming part of the optimal tour, and MCTS refines this probabilistic guidance to discover optimal solutions. Contemporary approaches have predominantly emphasized the refinement of heatmap generation through sophisticated learning models, inadvertently sidelining the critical role of MCTS. Our extensive empirical analysis reveals two pivotal insights: 1) The configuration of MCTS strategies profoundly influences the solution quality, demanding meticulous tuning to leverage their full potential; 2) Our findings demonstrate that a rudimentary and parameter-free heatmap, derived from the intrinsic $k$-nearest nature of TSP, can rival or even surpass the performance of complicated heatmaps, with strong generalizability across various scales. Empirical evaluations across various TSP scales underscore the efficacy of our approach, achieving competitive results. These observations challenge the prevailing focus on heatmap sophistication, advocating a reevaluation of the paradigm to harness both components synergistically. Our code is available at: https://github.com/LOGO-CUHKSZ/rethink_mcts_tsp.

AstroSage-Llama-3.1-8B is a domain-specialized natural-language AI assistant tailored for research in astronomy, astrophysics, and cosmology. Trained on the complete collection of astronomy-related arXiv papers from 2007-2024 along with millions of synthetically-generated question-answer pairs and other astronomical literature, AstroSage-Llama-3.1-8B demonstrates remarkable proficiency on a wide range of questions. AstroSage-Llama-3.1-8B scores 80.9% on the AstroMLab-1 benchmark, greatly outperforming all models -- proprietary and open-weight -- in the 8-billion parameter class, and performing on par with GPT-4o. This achievement demonstrates the potential of domain specialization in AI, suggesting that focused training can yield capabilities exceeding those of much larger, general-purpose models. AstroSage-Llama-3.1-8B is freely available, enabling widespread access to advanced AI capabilities for astronomical education and research.

To analyze the holographic multipartite entanglement structure, we study the upper bound for holographic $n$-partite information $(-1)^n I_n$ that $n-1$ fixed boundary subregions participate together with an arbitrary region $E$. In general cases, we could find regions $E$ that make $I_n$ approach the upper bound. For $n=3$, we show that the upper bound of $-I_3$ is given by a quantity that we name the entanglement of state-constrained purification $EoSP(A:B)$. For $n\geq4$, we find that the upper bound of $I_n$ is finite in holographic CFT$_{1+1}$ but has UV divergences in higher dimensions, which reveals a fundamental difference in the entanglement structure in different dimensions. When $(-1)^n I_n$ reaches the information-theoretical upper bound, we argue that ( I_n ) fully accounts for multipartite global entanglement in these upper bound critical points, in contrast to usual cases where $I_n$ is not a perfect measure for multipartite entanglement. We further show that these results suggest that fewer-partite entanglement fully emerges from more-partite entanglement, and any $n-1$ distant regions are fully $n$-partite entangling in higher dimensions., Comment: 9 pages, 4 figures

While 3D content generation has advanced significantly, existing methods still face challenges with input formats, latent space design, and output representations. This paper introduces a novel 3D generation framework that addresses these challenges, offering scalable, high-quality 3D generation with an interactive Point Cloud-structured Latent space. Our framework employs a Variational Autoencoder (VAE) with multi-view posed RGB-D(epth)-N(ormal) renderings as input, using a unique latent space design that preserves 3D shape information, and incorporates a cascaded latent diffusion model for improved shape-texture disentanglement. The proposed method, GaussianAnything, supports multi-modal conditional 3D generation, allowing for point cloud, caption, and single/multi-view image inputs. Notably, the newly proposed latent space naturally enables geometry-texture disentanglement, thus allowing 3D-aware editing. Experimental results demonstrate the effectiveness of our approach on multiple datasets, outperforming existing methods in both text- and image-conditioned 3D generation., Comment: project page: https://nirvanalan.github.io/projects/GA/

We present JanusFlow, a powerful framework that unifies image understanding and generation in a single model. JanusFlow introduces a minimalist architecture that integrates autoregressive language models with rectified flow, a state-of-the-art method in generative modeling. Our key finding demonstrates that rectified flow can be straightforwardly trained within the large language model framework, eliminating the need for complex architectural modifications. To further improve the performance of our unified model, we adopt two key strategies: (i) decoupling the understanding and generation encoders, and (ii) aligning their representations during unified training. Extensive experiments show that JanusFlow achieves comparable or superior performance to specialized models in their respective domains, while significantly outperforming existing unified approaches across standard benchmarks. This work represents a step toward more efficient and versatile vision-language models.

By exploiting discrete signal processing and simulating brain neuron communication, Spiking Neural Networks (SNNs) offer a low-energy alternative to Artificial Neural Networks (ANNs). However, existing SNN models, still face high computational costs due to the numerous time steps as well as network depth and scale. The tens of billions of neurons and trillions of synapses in the human brain are developed from only 20,000 genes, which inspires us to design an efficient genetic encoding strategy that dynamic evolves to regulate large-scale deep SNNs at low cost. Therefore, we first propose a genetically scaled SNN encoding scheme that incorporates globally shared genetic interactions to indirectly optimize neuronal encoding instead of weight, which obviously brings about reductions in parameters and energy consumption. Then, a spatio-temporal evolutionary framework is designed to optimize the inherently initial wiring rules. Two dynamic regularization operators in the fitness function evolve the neuronal encoding to a suitable distribution and enhance information quality of the genetic interaction respectively, substantially accelerating evolutionary speed and improving efficiency. Experiments show that our approach compresses parameters by approximately 50\% to 80\%, while outperforming models on the same architectures by 0.21\% to 4.38\% on CIFAR-10, CIFAR-100 and ImageNet. In summary, the consistent trends of the proposed genetically encoded spatio-temporal evolution across different datasets and architectures highlight its significant enhancements in terms of efficiency, broad scalability and robustness, demonstrating the advantages of the brain-inspired evolutionary genetic coding for SNN optimization.

DNSSEC, a DNS security extension, is essential to accurately translating domain names to IP addresses. Digital signatures provide the foundation for this reliable translation, however, the evolution of 'Quantum Computers' has made traditional digital signatures vulnerable. In light of this, NIST has recently selected potential post-quantum digital signatures that can operate on conventional computers and resist attacks made with Quantum Computers. Since these post-quantum digital signatures are still in their early stages of development, replacing pre-quantum digital signature schemes in DNSSEC with post-quantum candidates is risky until the post-quantum candidates have undergone a thorough security analysis. Given this, herein, we investigate the viability of employing 'Double-Signatures' in DNSSEC, combining a post-quantum digital signature and a classic one. The rationale is that double-signatures will offer protection against quantum threats on conventional signature schemes as well as unknown non-quantum attacks on post-quantum signature schemes, hence even if one fails the other provides security guarantees. However, the inclusion of two signatures in the DNSSEC response message doesn't bode well with the maximum allowed size of DNSSEC responses (i.e., 1232B, a limitation enforced by MTU of physical links). To counter this issue, we leverage a way to do application-layer fragmentation of DNSSEC responses with two signatures. We implement our solution on top of OQS-BIND and through experiments show that the addition of two signatures in DNSSEC and application-layer fragmentation of all relevant resource records and their reassembly does not have any substantial impact on the efficiency of the resolution process and thus is suitable for the interim period at least until the quantum computers are fully realized.

In this work, we study the inverse spectral problem, using the Weyl matrix as the input data, for the matrix Schrodinger operator on the half-line with the boundary condition being the form of the most general self-adjoint. We prove the uniqueness theorem, and derive the main equation and prove its solvability, which yields a theoretical reconstruction algorithm of the inverse problem., Comment: 16pages

Nonreciprocal interaction between two spatially separated subsystems plays a crucial role in signal processing and quantum networks. Here, we propose an efficient scheme to achieve nonreciprocal interaction and entanglement between two qubits by combining coherent and dissipative couplings in a superconducting platform, where two coherently coupled transmon qubits simultaneously interact with a transmission line waveguide. The coherent interaction between the transmon qubits can be achieved via capacitive coupling or via an intermediary cavity mode, while the dissipative interaction is induced by the transmission line via reservoir engineering. With high tunability of superconducting qubits, their positions along the transmission line can be adjusted to tune the dissipative coupling, enabling to tailor reciprocal and nonreciprocal interactions between the qubits. A fully nonreciprocal interaction can be achieved when the separation between the two qubits is $(4n+3)\lambda_{0} /4$, where $n$ is an integer and $\lambda_{0}$ is the photon wavelength. This nonreciprocal interaction enables the generation of nonreciprocal entanglement between the two transmon qubits. Furthermore, applying a drive field to one of the qubit can stabilize the system into a nonreciprocal steady-state entangled state. Remarkably, the nonreciprocal interaction in this work does not rely on the presence of nonlinearity or complex configurations, which has more potential applications in designing nonreciprocal quantum devices, processing quantum information, and building quantum networks., Comment: 11 pages, 7 figures