Search

Using $(27.12\pm0.14) \times 10^{8}$ $\psi(2S)$ events collected by the BESIII detector operating at BEPCII, we search for the decay $\eta_c(2S)\to p\bar{p}$ via the process $\psi(2S)\to \gamma\eta_c(2S)$, and only find a signal with a significance of $1.7\,\sigma$. The upper limit of the product branching fraction at the 90% confidence level is determined to be $\mathcal{B}(\psi(2S)\to \gamma\eta_c(2S))\times \mathcal{B}(\eta_c(2S)\to p\bar{p})<2.4\times 10^{-7}$. The branching fractions of $\chi_{cJ}\to p\bar{p}~(J=0,1,2)$ are also measured to be $\mathcal{B}(\chi_{c0}\to p\bar{p})=(2.51\pm0.02\pm0.08)\times 10^{-4}$, $\mathcal{B}(\chi_{c1}\to p\bar{p})=(8.16\pm0.09\pm0.25)\times 10^{-4}$, and $\mathcal{B}(\chi_{c2}\to p\bar{p})=(8.33\pm0.09\pm0.22)\times 10^{-4}$, where the first uncertainty is statistical and the second systematic.

In this paper, we present the first multi-modal FHE accelerator based on a unified architecture, which efficiently supports CKKS, TFHE, and their conversion scheme within a single accelerator. To achieve this goal, we first analyze the theoretical foundations of the aforementioned schemes and highlight their composition from a finite number of arithmetic kernels. Then, we investigate the challenges for efficiently supporting these kernels within a unified architecture, which include 1) concurrent support for NTT and FFT, 2) maintaining high hardware utilization across various polynomial lengths, and 3) ensuring consistent performance across diverse arithmetic kernels. To tackle these challenges, we propose a novel FHE accelerator named Trinity, which incorporates algorithm optimizations, hardware component reuse, and dynamic workload scheduling to enhance the acceleration of CKKS, TFHE, and their conversion scheme. By adaptive select the proper allocation of components for NTT and MAC, Trinity maintains high utilization across NTTs with various polynomial lengths and imbalanced arithmetic workloads. The experiment results show that, for the pure CKKS and TFHE workloads, the performance of our Trinity outperforms the state-of-the-art accelerator for CKKS (SHARP) and TFHE (Morphling) by 1.49x and 4.23x, respectively. Moreover, Trinity achieves 919.3x performance improvement for the FHE-conversion scheme over the CPU-based implementation. Notably, despite the performance improvement, the hardware overhead of Trinity is only 85% of the summed circuit areas of SHARP and Morphling., Comment: To be appeared in MICRO 2024. The first ASIC-based FHE accelerator which supports both CKKS, TFHE and their conversions. Provide new SOTA performance record for CKKS, TFHE and conversion

Using (2712.4 $\pm$ 14.3)$\times 10^{6}$ $\psi(3686)$ events collected with the BESIII detector at BEPCII, a partial wave analysis of the decay $\psi(3686) \to \phi \eta \eta' $ is performed with the covariant tensor approach. An axial-vector state with a mass near 2.3 $\rm GeV/c^2$ is observed for the first time. Its mass and width are measured to be 2316 $\pm 9_{\mathrm{stat}} \pm 30_{\mathrm{syst}}\,\rm MeV/c^2$ and 89 $\pm 15_{\mathrm{stat}} \pm 26_{\mathrm{syst}}\,\rm MeV$, respectively. The product branching fractions of $\mathcal{B}(\psi(3686) \to X(2300) \eta') \mathcal{B}(X(2300)\to \phi \eta)$ and $\mathcal{B}(\psi(3686) \to X(2300) \eta)\mathcal{B}(X(2300)\to \phi \eta')$ are determined to be (4.8 $\pm 1.3_{\mathrm{stat}} \pm 0.7_{\mathrm{syst}})\times 10^{-6}$ and (2.2 $\pm 0.7_{\mathrm{stat}} \pm 0.7_{\mathrm{syst}})\times 10^{-6}$, respectively. The branching fraction $\mathcal{B}(\psi(3686) \to \phi \eta \eta')$ is measured for the first time to be (3.14$\pm0.17_{\mathrm{stat}}\pm0.24_{\mathrm{syst}})\times10^{-5}$. The first uncertainties are statistical and the second are systematic.

Alzheimer's Disease (AD) detection has emerged as a promising research area that employs machine learning classification models to distinguish between individuals with AD and those without. Unlike conventional classification tasks, we identify within-class variation as a critical challenge in AD detection: individuals with AD exhibit a spectrum of cognitive impairments. Given that many AD detection tasks lack fine-grained labels, simplistic binary classification may overlook two crucial aspects: within-class differences and instance-level imbalance. The former compels the model to map AD samples with varying degrees of impairment to a single diagnostic label, disregarding certain changes in cognitive function. While the latter biases the model towards overrepresented severity levels. This work presents early efforts to address these challenges. We propose two novel methods: Soft Target Distillation (SoTD) and Instance-level Re-balancing (InRe), targeting two problems respectively. Experiments on the ADReSS and ADReSSo datasets demonstrate that the proposed methods significantly improve detection accuracy. Further analysis reveals that SoTD effectively harnesses the strengths of multiple component models, while InRe substantially alleviates model over-fitting. These findings provide insights for developing more robust and reliable AD detection models.

Multi-talker speech recognition (MTASR) faces unique challenges in disentangling and transcribing overlapping speech. To address these challenges, this paper investigates the role of Connectionist Temporal Classification (CTC) in speaker disentanglement when incorporated with Serialized Output Training (SOT) for MTASR. Our visualization reveals that CTC guides the encoder to represent different speakers in distinct temporal regions of acoustic embeddings. Leveraging this insight, we propose a novel Speaker-Aware CTC (SACTC) training objective, based on the Bayes risk CTC framework. SACTC is a tailored CTC variant for multi-talker scenarios, it explicitly models speaker disentanglement by constraining the encoder to represent different speakers' tokens at specific time frames. When integrated with SOT, the SOT-SACTC model consistently outperforms standard SOT-CTC across various degrees of speech overlap. Specifically, we observe relative word error rate reductions of 10% overall and 15% on low-overlap speech. This work represents an initial exploration of CTC-based enhancements for MTASR tasks, offering a new perspective on speaker disentanglement in multi-talker speech recognition.

Recent advancements in large language models (LLMs) have revolutionized various domains, bringing significant progress and new opportunities. Despite progress in speech-related tasks, LLMs have not been sufficiently explored in multi-talker scenarios. In this work, we present a pioneering effort to investigate the capability of LLMs in transcribing speech in multi-talker environments, following versatile instructions related to multi-talker automatic speech recognition (ASR), target talker ASR, and ASR based on specific talker attributes such as sex, occurrence order, language, and keyword spoken. Our approach utilizes WavLM and Whisper encoder to extract multi-faceted speech representations that are sensitive to speaker characteristics and semantic context. These representations are then fed into an LLM fine-tuned using LoRA, enabling the capabilities for speech comprehension and transcription. Comprehensive experiments reveal the promising performance of our proposed system, MT-LLM, in cocktail party scenarios, highlighting the potential of LLM to handle speech-related tasks based on user instructions in such complex settings.

Recommender systems aim to capture users' personalized preferences from the cast amount of user behaviors, making them pivotal in the era of information explosion. However, the presence of the dynamic preference, the "information cocoons", and the inherent feedback loops in recommendation make users interact with a limited number of items. Conventional recommendation algorithms typically focus on the positive historical behaviors, while neglecting the essential role of negative feedback in user interest understanding. As a promising but easy-to-ignored area, negative sampling is proficients in revealing the genuine negative aspect inherent in user behaviors, emerging as an inescapable procedure in recommendation. In this survey, we first discuss the role of negative sampling in recommendation and thoroughly analyze challenges that consistently impede its progress. Then, we conduct an extensive literature review on the existing negative sampling strategies in recommendation and classify them into five categories with their discrepant techniques. Finally, we detail the insights of the tailored negative sampling strategies in diverse recommendation scenarios and outline an overview of the prospective research directions toward which the community may engage and benefit., Comment: 38 pages, 9 figures; Under review

Mass distribution of black holes identified through X-ray emission suggests a paucity of black holes in the mass range of 3 to 5 solar masses. Modified theories have been devised to explain this mass gap, and it is suggested that natal kicks during supernova explosion can more easily disrupt binaries with lower mass black holes. Although recent LIGO observations reveal the existence of compact remnants within this mass gap, the question of whether low-mass black holes can exist in binaries remains a matter of debate. Such a system is expected to be noninteracting without X-ray emission, and can be searched for using radial velocity and astrometric methods. Here we report Gaia DR3 3425577610762832384, a wide binary system including a red giant star and an unseen object, exhibiting an orbital period of approximately 880 days and near-zero eccentricity. Through the combination of radial velocity measurements from LAMOST and astrometric data from Gaia DR2 and DR3 catalogs, we determine a mass of $3.6^{+0.8}_{-0.5}$ $M_{\odot}$ of the unseen component. This places the unseen companion within the mass gap, strongly suggesting the existence of binary systems containing low-mass black holes. More notably, the formation of its surprisingly wide circular orbit challenges current binary evolution and supernova explosion theories., Comment: Published in Nature Astronomy, see https://www.nature.com/articles/s41550-024-02359-9

Axion-like particles (ALPs) and dark photons (DPs) are viable dark matter particle candidates. We have searched for possible ALP/DP signals in the PandaX-4T liquid xenon detector using 94.8 days of data. A binned likelihood fit is constructed to search for possible mono-energetic peaks induced by the absorption processes between ALPs/DPs and atomic electrons of xenon. A detailed temporal model of decays associated with xenon isotopes is introduced to constrain the number of background events. No signal excess over background expectations is observed, and we have established the most stringent exclusion limits for most ALP/DP masses ranging from 150 keV/$c^2$ to 1 MeV/$c^2$.

The Mixture of Experts (MoE) is an advanced model architecture in the industry that combines multiple specialized expert models from various domains into a single supermodel. This approach enables the model to scale without significantly increasing the computational costs of training and inference, while maximizing model performance. However, current distributed training frameworks do not consider the ultimate optimization of communication, especially for large base models. This paper proposes a network-traffic-aware parallel optimization method that selects the optimal parallel strategy based on the communication volume, and the training cluster's inter-node and intra-node network topologies. Compared to the DeepSpeed, MoNTA achieves an 8x increase in AllToAll communication performance under 8-card tensor parallelism. Compared to the baseline, training a 2x70B model using 16 A800 cards, with an 8K sequence, results in a 13% overall latency performance improvement. Project Page: https://github.com/EnflameTechnology/DeepSpeed.

One of the important factors of profitability is the volume of transactions. An accurate prediction of the future transaction volume becomes a pivotal factor in shaping corporate operations and decision-making processes. E-commerce has presented manufacturers with convenient sales channels to, with which the sales can increase dramatically. In this study, we introduce a solution that leverages the XGBoost model to tackle the challenge of predict-ing sales for consumer electronics products on the Amazon platform. Initial-ly, our attempts to solely predict sales volume yielded unsatisfactory results. However, by replacing the sales volume data with sales range values, we achieved satisfactory accuracy with our model. Furthermore, our results in-dicate that XGBoost exhibits superior predictive performance compared to traditional models.

Recent development in Artificial Intelligence (AI) models has propelled their application in scientific discovery, but the validation and exploration of these discoveries require subsequent empirical experimentation. The concept of self-driving laboratories promises to automate and thus boost the experimental process following AI-driven discoveries. However, the transition of experimental protocols, originally crafted for human comprehension, into formats interpretable by machines presents significant challenges, which, within the context of specific expert domain, encompass the necessity for structured as opposed to natural language, the imperative for explicit rather than tacit knowledge, and the preservation of causality and consistency throughout protocol steps. Presently, the task of protocol translation predominantly requires the manual and labor-intensive involvement of domain experts and information technology specialists, rendering the process time-intensive. To address these issues, we propose a framework that automates the protocol translation process through a three-stage workflow, which incrementally constructs Protocol Dependence Graphs (PDGs) that approach structured on the syntax level, completed on the semantics level, and linked on the execution level. Quantitative and qualitative evaluations have demonstrated its performance at par with that of human experts, underscoring its potential to significantly expedite and democratize the process of scientific discovery by elevating the automation capabilities within self-driving laboratories., Comment: In Advances in Neural Information Processing Systems (NeurIPS'24)

In recent years, bundle recommendation systems have gained significant attention in both academia and industry due to their ability to enhance user experience and increase sales by recommending a set of items as a bundle rather than individual items. This survey provides a comprehensive review on bundle recommendation, beginning by a taxonomy for exploring product bundling. We classify it into two categories based on bundling strategy from various application domains, i.e., discriminative and generative bundle recommendation. Then we formulate the corresponding tasks of the two categories and systematically review their methods: 1) representation learning from bundle and item levels and interaction modeling for discriminative bundle recommendation; 2) representation learning from item level and bundle generation for generative bundle recommendation. Subsequently, we survey the resources of bundle recommendation including datasets and evaluation metrics, and conduct reproducibility experiments on mainstream models. Lastly, we discuss the main challenges and highlight the promising future directions in the field of bundle recommendation, aiming to serve as a useful resource for researchers and practitioners. Our code and datasets are publicly available at https://github.com/WUT-IDEA/bundle-recommendation-survey.

This paper proposes a new data-driven methodology for predicting intervals of post-fault voltage trajectories in power systems. We begin by introducing the Quantile Attention-Fourier Deep Operator Network (QAF-DeepONet), designed to capture the complex dynamics of voltage trajectories and reliably estimate quantiles of the target trajectory without any distributional assumptions. The proposed operator regression model maps the observed portion of the voltage trajectory to its unobserved post-fault trajectory. Our methodology employs a pre-training and fine-tuning process to address the challenge of limited data availability. To ensure data privacy in learning the pre-trained model, we use merging via federated learning with data from neighboring buses, enabling the model to learn the underlying voltage dynamics from such buses without directly sharing their data. After pre-training, we fine-tune the model with data from the target bus, allowing it to adapt to unique dynamics and operating conditions. Finally, we integrate conformal prediction into the fine-tuned model to ensure coverage guarantees for the predicted intervals. We evaluated the performance of the proposed methodology using the New England 39-bus test system considering detailed models of voltage and frequency controllers. Two metrics, Prediction Interval Coverage Probability (PICP) and Prediction Interval Normalized Average Width (PINAW), are used to numerically assess the model's performance in predicting intervals. The results show that the proposed approach offers practical and reliable uncertainty quantification in predicting the interval of post-fault voltage trajectories.

Percolation is a cornerstone concept in physics, providing crucial insights into critical phenomena and phase transitions. In this study, we adopt a kinetic perspective to reveal the scaling behaviors of higher-order gaps in the largest cluster across various percolation models, spanning from latticebased to network systems, encompassing both continuous and discontinuous percolation. Our results uncover an inherent self-similarity in the dynamical process both for critical and supercritical phase, characterized by two independent Fisher exponents, respectively. Utilizing a scaling ansatz, we propose a novel scaling relation that links the discovered Fisher exponents with other known critical exponents. Additionally, we demonstrate the application of our theory to real systems, showing its practical utility in extracting the corresponding Fisher exponents. These findings enrich our understanding of percolation dynamics and highlight the robust and universal scaling laws that transcend individual models and extend to broader classes of complex systems., Comment: 4.5 + 6 pages ; 4 + 12 figures

This paper presents a novel approach for simulating plasma instabilities in tokamak plasmas using the piecewise field-aligned finite element method in combination with the particle-in-cell method. Our method traditionally aligns the computational grid but defines the basis functions in piecewise field-aligned coordinates to avoid grid deformation while naturally representing the field-aligned mode structures. This scheme is formulated and implemented numerically. It also applied to the unstructured triangular meshes in principle. We have conducted linear benchmark tests, which agree well with previous results and traditional schemes. Furthermore, multiple-$n$ simulations are also carried out as a proof of principle, demonstrating the efficiency of this scheme in nonlinear turbulence simulations within the framework of the finite element method., Comment: 27 pages, 10 figures, 20th edition of the European Fusion Theory Conference (EFTC 2023), 8th Asia-Pacific Conference on Plasma Physics(AAPPS-DPP2024)

We demonstrate a chip-integrated emission spectroscope capable of retrieving the temperature of the light sources. It consists of a single photon detector with low dark counts and a sweeping on-chip filter with 2 pm spectral resolution in the visible and near-infrared regimes. With wildfire sensing applications in mind, we test our system with a hollow cathode lamp to simulate the K-line emission, and show how the models of Doppler and collision broadening in the plasma can be used for temperature retrieval. With favorable device parameters, high spectral resolution, and a novel temperature retrieval capability, our technique may find broad applications in environmental monitoring, astrophysics, plasma physics, and so on., Comment: 12 pages, 13 figures

Recently, reconfigurable intelligent surface (RIS) has been widely used to enhance the performance of millimeter wave (mmWave) communication systems, making beam alignment more challenging. To ensure efficient communication, this paper proposes a novel intelligent angle map-based beam alignment scheme for both general user equipments (UEs) and RIS-aided UEs simultaneously in a fast and effective way. Specifically, we construct a beam alignment architecture that utilizes only angular information. To obtain the angle information, the currently hottest seq2seq model - the Transformer - is introduced to offline learn the relationship between UE geographic location and the corresponding optimal beam direction. Based on the powerful machine learning model, the location-angle mapping function, i.e., the angle map, can be built. As long as the location information of UEs is available, the angle map can make the acquisition of beam alignment angles effortless. In the simulation, we utilize a ray-tracing-based dataset to verify the performance of the proposed scheme. It is demonstrated that the proposed scheme can achieve high-precision beam alignment and remarkable system performance without any beam scanning.

Instruction-following capabilities in large language models (LLMs) have significantly progressed, enabling more complex user interactions through detailed prompts. However, retrieval systems have not matched these advances, most of them still relies on traditional lexical and semantic matching techniques that fail to fully capture user intent. Recent efforts have introduced instruction-aware retrieval models, but these primarily focus on intrinsic content relevance, which neglects the importance of customized preferences for broader document-level attributes. This study evaluates the instruction-following capabilities of various retrieval models beyond content relevance, including LLM-based dense retrieval and reranking models. We develop InfoSearch, a novel retrieval evaluation benchmark spanning six document-level attributes: Audience, Keyword, Format, Language, Length, and Source, and introduce novel metrics -- Strict Instruction Compliance Ratio (SICR) and Weighted Instruction Sensitivity Evaluation (WISE) to accurately assess the models' responsiveness to instructions. Our findings reveal that while reranking models generally surpass retrieval models in instruction following, they still face challenges in handling certain attributes. Moreover, although instruction fine-tuning and increased model size lead to better performance, most models fall short of achieving comprehensive instruction compliance as assessed by our benchmark.

With the rapid evolution of Web3.0, cryptocurrency has become a cornerstone of decentralized finance. While these digital assets enable efficient and borderless financial transactions, their pseudonymous nature has also attracted malicious activities such as money laundering, fraud, and other financial crimes. Effective detection of malicious transactions is crucial to maintaining the security and integrity of the Web 3.0 ecosystem. Existing malicious transaction detection methods rely on large amounts of labeled data and suffer from low generalization. Label-efficient and generalizable malicious transaction detection remains a challenging task. In this paper, we propose ShadowEyes, a novel malicious transaction detection method. Specifically, we first propose a generalized graph structure named TxGraph as a representation of malicious transaction, which captures the interaction features of each malicious account and its neighbors. Then we carefully design a data augmentation method tailored to simulate the evolution of malicious transactions to generate positive pairs. To alleviate account label scarcity, we further design a graph contrastive mechanism, which enables ShadowEyes to learn discriminative features effectively from unlabeled data, thereby enhancing its detection capabilities in real-world scenarios. We conduct extensive experiments using public datasets to evaluate the performance of ShadowEyes. The results demonstrate that it outperforms state-of-the-art (SOTA) methods in four typical scenarios. Specifically, in the zero-shot learning scenario, it can achieve an F1 score of 76.98% for identifying gambling transactions, surpassing the SOTA method by12.05%. In the scenario of across-platform malicious transaction detection, ShadowEyes maintains an F1 score of around 90%, which is 10% higher than the SOTA method.

As blockchain applications become increasingly widespread, there is a rising demand for on-chain data queries. However, existing schemes for on-chain data queries face a challenge between verifiability and efficiency. Queries on blockchain databases can compromise the authenticity of the query results, while schemes that utilize on-chain Authenticated Data Structure (ADS) have lower efficiency. To overcome this limitation, we propose an efficient and verifiable on-chain data query framework EVeCA. In our approach, we free the full nodes from the task of ADS maintenance by delegating it to a limited number of nodes, and full nodes verify the correctness of ADS by using challenge-based authentication scheme instead of reconstructing them, which prevents the service providers from maintaining incorrect ADS with overwhelming probability. By carefully designing the ADS verification scheme, EVeCA achieves higher efficiency while remaining resilient against adaptive attacks. Our framework effectively eliminates the need for on-chain ADS maintenance, and allows full nodes to participate in ADS maintenance in a cost-effective way. We demonstrate the effectiveness of the proposed scheme through security analysis and experimental evaluation. Compared to existing schemes, our approach improves ADS maintenance efficiency by about 20*.

In this work, we propose a decoupled support vector regression (SVR) approach for direct canonical polyadic decomposition (CPD) of a potential energy surface (PES) through a set of discrete training energy data. This approach, denoted by CPD-SVR, is able to directly construct the PES in CPD with a more compressed form than previously developed Gaussian process regression (GPR) for CPD, denoted by CPD-GRP ({\it J. Phys. Chem. Lett.} {\bf 13} (2022), 11128). Similar to CPD-GPR, the present CPD-SVR method requires the multi-dimension kernel function in a product of a series of one-dimensional functions. We shall show that, only a small set of support vectors play a role in SVR prediction making CPD-SVR predict lower-rank CPD than CPD-GPR. To save computational cost in determining support vectors, we propose a warm-started (ws) algorithm where a pre-existed crude PES is employed to classify the training data. With the warm-started algorithm, the present CPD-SVR approach is extended to the CPD-ws-SVR approach. Then, we test CPD-ws-SVR and compare it with CPD-GPR through constructions and applications of the PESs of H + H$_2$, H$_2$ + H$_2$, and H$_2$/Cu(111). To this end, the training data are computed by existed PESs. Calculations on H + H$_2$ predict a good agreement of dynamics results among various CPD forms, which are constructed through different approaches.

Machine unlearning (MU) has gained significant attention as a means to remove specific data from trained models without requiring a full retraining process. While progress has been made in unimodal domains like text and image classification, unlearning in multimodal models remains relatively underexplored. In this work, we address the unique challenges of unlearning in CLIP, a prominent multimodal model that aligns visual and textual representations. We introduce CLIPErase, a novel approach that disentangles and selectively forgets both visual and textual associations, ensuring that unlearning does not compromise model performance. CLIPErase consists of three key modules: a Forgetting Module that disrupts the associations in the forget set, a Retention Module that preserves performance on the retain set, and a Consistency Module that maintains consistency with the original model. Extensive experiments on the CIFAR-100 and Flickr30K datasets across four CLIP downstream tasks demonstrate that CLIPErase effectively forgets designated associations in zero-shot tasks for multimodal samples, while preserving the model's performance on the retain set after unlearning.

In this paper, we propose OpenSatMap, a fine-grained, high-resolution satellite dataset for large-scale map construction. Map construction is one of the foundations of the transportation industry, such as navigation and autonomous driving. Extracting road structures from satellite images is an efficient way to construct large-scale maps. However, existing satellite datasets provide only coarse semantic-level labels with a relatively low resolution (up to level 19), impeding the advancement of this field. In contrast, the proposed OpenSatMap (1) has fine-grained instance-level annotations; (2) consists of high-resolution images (level 20); (3) is currently the largest one of its kind; (4) collects data with high diversity. Moreover, OpenSatMap covers and aligns with the popular nuScenes dataset and Argoverse 2 dataset to potentially advance autonomous driving technologies. By publishing and maintaining the dataset, we provide a high-quality benchmark for satellite-based map construction and downstream tasks like autonomous driving., Comment: NeurIPS 2024 D&B Track. Project Page:https://opensatmap.github.io/

Current cardiac cine magnetic resonance image (cMR) studies focus on the end diastole (ED) and end systole (ES) phases, while ignoring the abundant temporal information in the whole image sequence. This is because whole sequence segmentation is currently a tedious process and inaccurate. Conventional whole sequence segmentation approaches first estimate the motion field between frames, which is then used to propagate the mask along the temporal axis. However, the mask propagation results could be prone to error, especially for the basal and apex slices, where through-plane motion leads to significant morphology and structural change during the cardiac cycle. Inspired by recent advances in video object segmentation (VOS), based on spatio-temporal memory (STM) networks, we propose a continuous STM (CSTM) network for semi-supervised whole heart and whole sequence cMR segmentation. Our CSTM network takes full advantage of the spatial, scale, temporal and through-plane continuity prior of the underlying heart anatomy structures, to achieve accurate and fast 4D segmentation. Results of extensive experiments across multiple cMR datasets show that our method can improve the 4D cMR segmentation performance, especially for the hard-to-segment regions., Comment: Accepted to WACV 2025

Using $(10087\pm44)\times 10^{6}$ $J/\psi$ decays collected by the BESIII detector at the BEPCII collider, we search for baryon number violation via $\Lambda-\bar{\Lambda}$ oscillation in the decay $J/\psi \to \Lambda \bar{\Lambda}$. No evidence for $\Lambda-\bar\Lambda$ oscillation is observed. The upper limit on the time-integrated probability of $\Lambda-\bar{\Lambda}$ oscillation is estimated to be $1.4\times 10^{-6}$, corresponding to an oscillation parameter less than $2.1\times 10^{-18}~\mathrm{GeV}$ at $90\%$ confidence level., Comment: 8 pages, 2 figures

Current surgical procedures for spinal cord tumors lack in vivo high-resolution, high-speed multifunctional imaging systems, posing challenges for precise tumor resection and intraoperative decision-making. This study introduces the Fast Adaptive Focus Tracking Robotic Optical Coherence Tomography (FACT-ROCT) system,designed to overcome these obstacles by providing real-time, artifact-free multifunctional imaging of spinal cord tumors during surgery. By integrating cross-scanning, adaptive focus tracking and robotics, the system addresses motion artifacts and resolution degradation from tissue movement, achieving wide-area, high-resolution imaging. We conducted intraoperative imaging on 21 patients, including 13 with spinal gliomas and 8 with other tumors. This study marks the first demonstration of OCT in situ imaging of human spinal cord tumors, providing micrometer-scale in vivo structural images and demonstrating FACT-ROCT's potential to differentiate various tumor types in real-time. Analysis of the attenuation coefficients of spinal gliomas revealed increased heterogeneity with higher malignancy grades. So, we proposed the standard deviation of the attenuation coefficient as a physical marker, achieving over 90% accuracy in distinguishing high- from low-grade gliomas intraoperatively at a threshold. FACT-ROCT even enabled extensive in vivo microvascular imaging of spinal cord tumors, covering 70 mm * 13 mm * 10 mm within 2 minutes. Quantitative vascular tortuosity comparisons confirmed greater tortuosity in higher-grade tumors. The ability to perform extensive vascular imaging and real-time tumor grading during surgery provides critical information for surgical strategy, such as minimizing intraoperative bleeding and optimizing tumor resection while preserving functional tissue.

While Chain of Thought (CoT) prompting approaches have significantly consolidated the reasoning capabilities of large language models (LLMs), they still face limitations that require extensive human effort or have performance needs to be improved. Existing endeavors have focused on bridging these gaps; however, these approaches either hinge on external data and cannot completely eliminate manual effort, or they fall short in effectively directing LLMs to generate high-quality exemplary prompts. To address the said pitfalls, we propose a novel prompt approach for automatic reasoning named \textbf{LBS3}, inspired by curriculum learning which better reflects human learning habits. Specifically, LBS3 initially steers LLMs to recall easy-to-hard proxy queries that are pertinent to the target query. Following this, it invokes a progressive strategy that utilizes exemplary prompts stemmed from easy-proxy queries to direct LLMs in solving hard-proxy queries, enabling the high-quality of the proxy solutions. Finally, our extensive experiments in various reasoning-intensive tasks with varying open- and closed-source LLMs show that LBS3 achieves strongly competitive performance compared to the SOTA baselines.

As Advanced Persistent Threats (APTs) grow increasingly sophisticated, the demand for effective detection methods has intensified. This study addresses the challenge of identifying APT campaign attacks through system event logs. A cascading approach, name SFM, combines Technique hunting and APT campaign attribution. Our approach assumes that real-world system event logs contain a vast majority of normal events interspersed with few suspiciously malicious ones and that these logs are annotated with Techniques of MITRE ATT&CK framework for attack pattern recognition. Then, we attribute APT campaign attacks by aligning detected Techniques with known attack sequences to determine the most likely APT campaign. Evaluations on five real-world APT campaigns indicate that the proposed approach demonstrates reliable performance.

Generative models such as Large Language Models (LLM) and Multimodal Large Language models (MLLMs) trained on massive web corpora can memorize and disclose individuals' confidential and private data, raising legal and ethical concerns. While many previous works have addressed this issue in LLM via machine unlearning, it remains largely unexplored for MLLMs. To tackle this challenge, we introduce Multimodal Large Language Model Unlearning Benchmark (MLLMU-Bench), a novel benchmark aimed at advancing the understanding of multimodal machine unlearning. MLLMU-Bench consists of 500 fictitious profiles and 153 profiles for public celebrities, each profile feature over 14 customized question-answer pairs, evaluated from both multimodal (image+text) and unimodal (text) perspectives. The benchmark is divided into four sets to assess unlearning algorithms in terms of efficacy, generalizability, and model utility. Finally, we provide baseline results using existing generative model unlearning algorithms. Surprisingly, our experiments show that unimodal unlearning algorithms excel in generation and cloze tasks, while multimodal unlearning approaches perform better in classification tasks with multimodal inputs., Comment: 30 pages

From the perspective of resource-theoretic approach, this study explores the quantification of imaginary in quantum physics. We propose a well defined measure of imaginarity, the geometric-like measure of imaginarity. Compared with the usual geometric imaginarity measure, this geometric-like measure of imaginarity exhibits smaller decay difference under quantum noisy channels and higher stability. As applications, we show that both the optimal probability of state transformations from a pure state to an arbitrary mixed state via real operations, and the maximal probability of stochastic-approximate state transformations from a pure state to an arbitrary mixed state via real operations with a given fidelity $f$, are given by the geometric-like measure of imaginarity.

In recent years, quantum computation has been rapidly advancing, driving a technological revolution with significant potential across various sectors, particularly in finance. Despite this, the insurance industry, an essential tool for mitigating unforeseen risks and losses, has received limited attention. This paper provides an initial exploration into the realm of quantum computational insurance and actuarial science. After introducing key insurance models and challenges, we examine quantum algorithms designed to address complex insurance issues. Our study includes experimental and numerical demonstrations of quantum applications in non-life insurance, life insurance, and reinsurance. Additionally, we explore the timeline for quantum insurance, the development of quantum-enhanced insurance products, and the challenges posed by quantum computational advancements., Comment: 10 pages, 5 figures

Online shopping is a complex multi-task, few-shot learning problem with a wide and evolving range of entities, relations, and tasks. However, existing models and benchmarks are commonly tailored to specific tasks, falling short of capturing the full complexity of online shopping. Large Language Models (LLMs), with their multi-task and few-shot learning abilities, have the potential to profoundly transform online shopping by alleviating task-specific engineering efforts and by providing users with interactive conversations. Despite the potential, LLMs face unique challenges in online shopping, such as domain-specific concepts, implicit knowledge, and heterogeneous user behaviors. Motivated by the potential and challenges, we propose Shopping MMLU, a diverse multi-task online shopping benchmark derived from real-world Amazon data. Shopping MMLU consists of 57 tasks covering 4 major shopping skills: concept understanding, knowledge reasoning, user behavior alignment, and multi-linguality, and can thus comprehensively evaluate the abilities of LLMs as general shop assistants. With Shopping MMLU, we benchmark over 20 existing LLMs and uncover valuable insights about practices and prospects of building versatile LLM-based shop assistants. Shopping MMLU can be publicly accessed at https://github.com/KL4805/ShoppingMMLU. In addition, with Shopping MMLU, we host a competition in KDD Cup 2024 with over 500 participating teams. The winning solutions and the associated workshop can be accessed at our website https://amazon-kddcup24.github.io/., Comment: NeurIPS 2024 Datasets and Benchmarks Track Accepted. Modified typos in Figure 9

Entity alignment is crucial for merging knowledge across knowledge graphs, as it matches entities with identical semantics. The standard method matches these entities based on their embedding similarities using semi-supervised learning. However, diverse data sources lead to non-isomorphic neighborhood structures for aligned entities, complicating alignment, especially for less common and sparsely connected entities. This paper presents a soft label propagation framework that integrates multi-source data and iterative seed enhancement, addressing scalability challenges in handling extensive datasets where scale computing excels. The framework uses seeds for anchoring and selects optimal relationship pairs to create soft labels rich in neighborhood features and semantic relationship data. A bidirectional weighted joint loss function is implemented, which reduces the distance between positive samples and differentially processes negative samples, taking into account the non-isomorphic neighborhood structures. Our method outperforms existing semi-supervised approaches, as evidenced by superior results on multiple datasets, significantly improving the quality of entity alignment., Comment: 7, 2 figures

Social relation reasoning aims to identify relation categories such as friends, spouses, and colleagues from images. While current methods adopt the paradigm of training a dedicated network end-to-end using labeled image data, they are limited in terms of generalizability and interpretability. To address these issues, we first present a simple yet well-crafted framework named {\name}, which combines the perception capability of Vision Foundation Models (VFMs) and the reasoning capability of Large Language Models (LLMs) within a modular framework, providing a strong baseline for social relation recognition. Specifically, we instruct VFMs to translate image content into a textual social story, and then utilize LLMs for text-based reasoning. {\name} introduces systematic design principles to adapt VFMs and LLMs separately and bridge their gaps. Without additional model training, it achieves competitive zero-shot results on two databases while offering interpretable answers, as LLMs can generate language-based explanations for the decisions. The manual prompt design process for LLMs at the reasoning phase is tedious and an automated prompt optimization method is desired. As we essentially convert a visual classification task into a generative task of LLMs, automatic prompt optimization encounters a unique long prompt optimization issue. To address this issue, we further propose the Greedy Segment Prompt Optimization (GSPO), which performs a greedy search by utilizing gradient information at the segment level. Experimental results show that GSPO significantly improves performance, and our method also generalizes to different image styles. The code is available at https://github.com/Mengzibin/SocialGPT., Comment: Accepted by NeurIPS 2024. Project page: https://mengzibin.github.io/SocialGPT.github.io/

In applications, an anticipated situation is where the system of interest has never been encountered before and sparse observations can be made only once. Can the dynamics be faithfully reconstructed from the limited observations without any training data? This problem defies any known traditional methods of nonlinear time-series analysis as well as existing machine-learning methods that typically require extensive data from the target system for training. We address this challenge by developing a hybrid transformer and reservoir-computing machine-learning scheme. The key idea is that, for a complex and nonlinear target system, the training of the transformer can be conducted not using any data from the target system, but with essentially unlimited synthetic data from known chaotic systems. The trained transformer is then tested with the sparse data from the target system. The output of the transformer is further fed into a reservoir computer for predicting the long-term dynamics or the attractor of the target system. The power of the proposed hybrid machine-learning framework is demonstrated using a large number of prototypical nonlinear dynamical systems, with high reconstruction accuracy even when the available data is only 20% of that required to faithfully represent the dynamical behavior of the underlying system. The framework provides a paradigm of reconstructing complex and nonlinear dynamics in the extreme situation where training data does not exist and the observations are random and sparse., Comment: 31 pages, 21 figures

Measurements of $CP$ observables and the CKM angle $\gamma$ are performed in $B^{\pm} \to D K^*(892)^{\pm}$ decays, where $D$ represents a superposition of $D^0$ and $\overline{D}{}^0$ states, using the LHCb dataset collected during Run 1 (2011-2012) and Run 2 (2015-2018). A comprehensive study of this channel is presented with the $D$ meson reconstructed in two-body final states $K^{\pm}\pi^{\mp}$, $K^+K^-$ and $\pi^+\pi^-$; four-body final states $K^{\pm}\pi^{\mp}\pi^{\pm}\pi^{\mp}$ and $\pi^+\pi^-\pi^+\pi^-$; and three-body final states $K^0_{S} \pi^+\pi^-$ and $K^0_{S} K^+ K^-$. This analysis includes the first observation of the suppressed $B^{\pm} \to [\pi^+K^-]_D K^{*\pm}$ and $B^{\pm} \to [\pi^+K^-\pi^+\pi^-]_D K^{*\pm}$ decays. The combined result gives $\gamma=(63\pm 13)^\circ$., Comment: 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/3180/ (LHCb public pages)

Large language models (LLMs) have shown great promise in machine translation, but they still struggle with contextually dependent terms, such as new or domain-specific words. This leads to inconsistencies and errors that are difficult to address. Existing solutions often depend on manual identification of such terms, which is impractical given the complexity and evolving nature of language. While Retrieval-Augmented Generation (RAG) could provide some assistance, its application to translation is limited by issues such as hallucinations from information overload. In this paper, we propose CRAT, a novel multi-agent translation framework that leverages RAG and causality-enhanced self-reflection to address these challenges. This framework consists of several specialized agents: the Unknown Terms Identification agent detects unknown terms within the context, the Knowledge Graph (KG) Constructor agent extracts relevant internal knowledge about these terms and retrieves bilingual information from external sources, the Causality-enhanced Judge agent validates the accuracy of the information, and the Translator agent incorporates the refined information into the final output. This automated process allows for more precise and consistent handling of key terms during translation. Our results show that CRAT significantly improves translation accuracy, particularly in handling context-sensitive terms and emerging vocabulary.

Self-trapped excitons (STEs), renowned for their unique radiative properties, have been harnessed in diverse photonic devices. Yet, a full comprehension and manipulation of STEs remain elusive. In this study, we present novel experimental and theoretical evidence of the hybrid nature and optical tuning of the STEs state in Cs2Ag0.4Na0.6InCl6. The detection of Fano resonance in the laser energy-dependent Raman and photoluminescence spectra indicates the emergence of an exciton-phonon hybrid state, a result of the robust quantum interference between the discrete phonon and continuous exciton states. Moreover, we showcase the ability to continuously adjust this hybrid state with the energy and intensity of the laser field. These significant findings lay the foundation for a comprehensive understanding of the nature of STE and its potential for state control.

Low-rank adaption (LoRA) is a widely used parameter-efficient finetuning method for LLM that reduces memory requirements. However, current LoRA optimizers lack transformation invariance, meaning the actual updates to the weights depends on how the two LoRA factors are scaled or rotated. This deficiency leads to inefficient learning and sub-optimal solutions in practice. This paper introduces LoRA-RITE, a novel adaptive matrix preconditioning method for LoRA optimization, which can achieve transformation invariance and remain computationally efficient. We provide theoretical analysis to demonstrate the benefit of our method and conduct experiments on various LLM tasks with different models including Gemma 2B, 7B, and mT5-XXL. The results demonstrate consistent improvements against existing optimizers. For example, replacing Adam with LoRA-RITE during LoRA fine-tuning of Gemma-2B yielded 4.6\% accuracy gain on Super-Natural Instructions and 3.5\% accuracy gain across other four LLM benchmarks (HellaSwag, ArcChallenge, GSM8K, OpenBookQA).

Rendering and reconstruction are long-standing topics in computer vision and graphics. Achieving both high rendering quality and accurate geometry is a challenge. Recent advancements in 3D Gaussian Splatting (3DGS) have enabled high-fidelity novel view synthesis at real-time speeds. However, the noisy and discrete nature of 3D Gaussian primitives hinders accurate surface estimation. Previous attempts to regularize 3D Gaussian normals often degrade rendering quality due to the fundamental disconnect between normal vectors and the rendering pipeline in 3DGS-based methods. Therefore, we introduce Normal-GS, a novel approach that integrates normal vectors into the 3DGS rendering pipeline. The core idea is to model the interaction between normals and incident lighting using the physically-based rendering equation. Our approach re-parameterizes surface colors as the product of normals and a designed Integrated Directional Illumination Vector (IDIV). To optimize memory usage and simplify optimization, we employ an anchor-based 3DGS to implicitly encode locally-shared IDIVs. Additionally, Normal-GS leverages optimized normals and Integrated Directional Encoding (IDE) to accurately model specular effects, enhancing both rendering quality and surface normal precision. Extensive experiments demonstrate that Normal-GS achieves near state-of-the-art visual quality while obtaining accurate surface normals and preserving real-time rendering performance., Comment: 9 pages, 5 figures, accepted at NeurIPS 2024

Text-to-video models have recently undergone rapid and substantial advancements. Nevertheless, due to limitations in data and computational resources, achieving efficient generation of long videos with rich motion dynamics remains a significant challenge. To generate high-quality, dynamic, and temporally consistent long videos, this paper presents ARLON, a novel framework that boosts diffusion Transformers with autoregressive models for long video generation, by integrating the coarse spatial and long-range temporal information provided by the AR model to guide the DiT model. Specifically, ARLON incorporates several key innovations: 1) A latent Vector Quantized Variational Autoencoder (VQ-VAE) compresses the input latent space of the DiT model into compact visual tokens, bridging the AR and DiT models and balancing the learning complexity and information density; 2) An adaptive norm-based semantic injection module integrates the coarse discrete visual units from the AR model into the DiT model, ensuring effective guidance during video generation; 3) To enhance the tolerance capability of noise introduced from the AR inference, the DiT model is trained with coarser visual latent tokens incorporated with an uncertainty sampling module. Experimental results demonstrate that ARLON significantly outperforms the baseline OpenSora-V1.2 on eight out of eleven metrics selected from VBench, with notable improvements in dynamic degree and aesthetic quality, while delivering competitive results on the remaining three and simultaneously accelerating the generation process. In addition, ARLON achieves state-of-the-art performance in long video generation. Detailed analyses of the improvements in inference efficiency are presented, alongside a practical application that demonstrates the generation of long videos using progressive text prompts. See demos of ARLON at \url{http://aka.ms/arlon}.

For a twist knot $\mathcal{K}_{p'}$, let $M$ be the closed $3$-manifold obtained by doing $(p, q)$ Dehn-filling along $\mathcal{K}_{p'}$. In this article, we prove that Chen-Yang's volume conjecture holds for sufficiently large $|p| + |q|$ and $|p'|$ for $M$. In the proof, we construct a new ideal triangulation of the Whitehead link complement which is different from Thurston's triangulation. Our triangulation has led to some new discoveries regarding symmetry, including insights into ``sister manifolds'' as introduced by Hodgson, Meyerhoff, and Weeks., Comment: 58 pages, 34 figures

The existence of a mass gap of $3-5\,M_{\odot}$ between the heaviest neutron stars (NSs) and the lightest black holes (BHs), inferred from the BH mass distribution in low mass X-ray binaries (LMXBs), has been suggested for decades. The recently reported gravitational-wave source GW230529 has been confidently identified as a NSBH merger, with the BH mass falling within this lower mass gap. This detection provides strong evidence against the existence of the latter and introduces new implications for the coalescing NSBH population, including a revised BH mass distribution and an updated local merger rate. In this study, we employ POSYDON, a binary population synthesis code that integrates detailed single- and binary-star models, to investigate coalescing NSBH binaries formed through isolated binary evolution. In particular, we focus on the BH mass distribution of the intrinsic NSBH merger population. We find that, with a high common-envelope efficiency of $\alpha_{\rm{CE}} =2 $, the BH masses in NSBH mergers concentrate in the lower mass gap, aligning more closely with observations. However, after accounting for the constraints of the selection bias against mass-gap BHs in LMXBs, which suggests that the maximum NS birth mass is below $\simeq 2\,M_{\odot}$, we find that introducing a high $\alpha_{\rm{CE}}$ is not required to match observations. Additionally, we explore the impact of core-collapse supernova kicks. Finally, we present the property distributions of observable NSBH mergers from our simulation and find that they match well with the observations. We find that the fraction of electromagnetic counterparts in observable populations is $\approx 4-30\%$, depending on different NS equations of state. Future detections of coalescing NSBH binaries would provide invaluable insights into SN mechanisms, common envelope evolution, and NS physics., Comment: 9 pages, 4 figures. Comments are welcome!

The potential of using Large Language Models (LLMs) themselves to evaluate LLM outputs offers a promising method for assessing model performance across various contexts. Previous research indicates that LLM-as-a-judge exhibits a strong correlation with human judges in the context of general instruction following. However, for instructions that require specialized knowledge, the validity of using LLMs as judges remains uncertain. In our study, we applied a mixed-methods approach, conducting pairwise comparisons in which both subject matter experts (SMEs) and LLMs evaluated outputs from domain-specific tasks. We focused on two distinct fields: dietetics, with registered dietitian experts, and mental health, with clinical psychologist experts. Our results showed that SMEs agreed with LLM judges 68% of the time in the dietetics domain and 64% in mental health when evaluating overall preference. Additionally, the results indicated variations in SME-LLM agreement across domain-specific aspect questions. Our findings emphasize the importance of keeping human experts in the evaluation process, as LLMs alone may not provide the depth of understanding required for complex, knowledge specific tasks. We also explore the implications of LLM evaluations across different domains and discuss how these insights can inform the design of evaluation workflows that ensure better alignment between human experts and LLMs in interactive systems.

Accurately predicting the dynamic responses of building structures under seismic loads is essential for ensuring structural safety and minimizing potential damage. This critical aspect of structural analysis allows engineers to evaluate how structures perform under various loading conditions, facilitating informed design and safety decisions. Traditional methods, which rely on complex finite element models often struggle with balancing computational efficiency and accuracy. To address this challenge, we introduce SeisGPT, a data-driven, large physics-informed model that leverages deep neural networks based on the Generative Pre-trained Transformer (GPT) architecture. SeisGPT is designed to predict, in real-time the dynamic behavior of building structures under seismic forces. Trained on a diverse corpus of seismic data and structural engineering principles, it instantly generates predictive responses, including displacement, acceleration, and inter-story drift, with high accuracy and computational efficiency. Its adaptability across various building typologies and seismic intensities makes this framework a valuable tool for designing robust structures and assessing seismic risk. Through comprehensive validation, this approach exhibits superior performance, offering engineers and researchers a powerful tool for assessing seismic response and informing resilient design strategies. This innovative framework represents a significant advancement in seismic engineering practice, with potential applications in mitigating seismic hazards and enhancing structural resilience., Comment: 23 pages, 6 figures

As conversational AI systems increasingly permeate the socio-emotional realms of human life, they bring both benefits and risks to individuals and society. Despite extensive research on detecting and categorizing harms in AI systems, less is known about the harms that arise from social interactions with AI chatbots. Through a mixed-methods analysis of 35,390 conversation excerpts shared on r/replika, an online community for users of the AI companion Replika, we identified six categories of harmful behaviors exhibited by the chatbot: relational transgression, verbal abuse and hate, self-inflicted harm, harassment and violence, mis/disinformation, and privacy violations. The AI contributes to these harms through four distinct roles: perpetrator, instigator, facilitator, and enabler. Our findings highlight the relational harms of AI chatbots and the danger of algorithmic compliance, enhancing the understanding of AI harms in socio-emotional interactions. We also provide suggestions for designing ethical and responsible AI systems that prioritize user safety and well-being.

By analyzing $e^{+}e^{-}$ collision data with an integrated luminosity of 7.9~fb$^{-1}$ collected with the BESIII detector at the center-of-mass energy of 3.773~GeV, the branching fraction of $D^+\to\tau^+\nu_{\tau}$ is determined as $\mathcal{B}=(9.9\pm 1.1_\mathrm{stat}\pm 0.5_\mathrm{syst})\times10^{-4}$. Taking the most precise result $\mathcal{B}(D^+\to\mu^+\nu_{\mu})=(3.981\pm 0.079_\mathrm{stat}\pm0.040_\mathrm{syst})\times10^{-4}$, we determine $R_{\tau/\mu} = \Gamma(D^+\to\tau^+\nu_{\tau})/\Gamma(D^+\to\mu^+\nu_{\mu})= 2.49\pm0.31$, achieving a factor of two improvement in precision compared to the previous BESIII result. This measurement is in agreement with the standard model prediction of lepton flavor universality within one standard deviation.

GPT-4o is an autoregressive omni model that accepts as input any combination of text, audio, image, and video, and generates any combination of text, audio, and image outputs. It's trained end-to-end across text, vision, and audio, meaning all inputs and outputs are processed by the same neural network. GPT-4o can respond to audio inputs in as little as 232 milliseconds, with an average of 320 milliseconds, which is similar to human response time in conversation. It matches GPT-4 Turbo performance on text in English and code, with significant improvement on text in non-English languages, while also being much faster and 50\% cheaper in the API. GPT-4o is especially better at vision and audio understanding compared to existing models. In line with our commitment to building AI safely and consistent with our voluntary commitments to the White House, we are sharing the GPT-4o System Card, which includes our Preparedness Framework evaluations. In this System Card, we provide a detailed look at GPT-4o's capabilities, limitations, and safety evaluations across multiple categories, focusing on speech-to-speech while also evaluating text and image capabilities, and measures we've implemented to ensure the model is safe and aligned. We also include third-party assessments on dangerous capabilities, as well as discussion of potential societal impacts of GPT-4o's text and vision capabilities.

For self-similar sets $X,Y\subseteq \mathbb{R}$, we obtain new results towards the affine embeddings conjecture of Feng-Huang-Rao (2014), and the equivalent weak intersections conjecture. We show that the conjecture holds when the defining maps of $X,Y$ have algebraic contraction ratios, and also for arbitrary $Y$ when the maps defining $X$ have algebraic-contraction ratios and there are sufficiently many of them relative to the number of maps defining $Y$. We also show that it holds for a.e. choice of the corresponding contraction ratios, and obtain bounds on the packing dimension of the exceptional parameters. Key ingredients in our argument include a new renormalization procedure in the space of embeddings, and Orponen's projection Theorem for Assouad dimension (2021)., Comment: 28 pages