arXiv subjects

Di Wang

Publications and source records attributed to Di Wang.

At least 361 records · Page 20Linked to original sources

arXiv2024

Topological diagram analysis of $\mathcal{B}_{c\overline 3}\to \mathcal{B}_{10}M$ decays in the $SU(3)_F$ limit and beyond

Charm baryon decay plays an important role in studying non-perturbative baryonic transitions. Compared to other hadron multiplets, the flavor symmetry of baryon decuplet is more simple and attractive. In this work, we study the topological amplitudes of charmed baryon decays into decuplet baryon in the flavor symmetry and the linear $SU(3)_F$ breaking. It is found most of topological diagrams are suppressed by the Körner-Pati-Woo theorem in the $SU(3)_F$ limit. Only two independent amplitudes contributing to the $\mathcal{B}_{c\overline 3}\to \mathcal{B}_{10}M$ decays, with one dominating the branching fractions. The Lee-Yang parameters of all $\mathcal{B}_{c\overline 3}\to \mathcal{B}_{10}M$ modes are the same in the $SU(3)_F$ limit, and there are only four possible values for the CP asymmetries. After including the first-order $SU(3)_F$ breaking effects, the $Ξ^+_c\to Σ^{* +}\overline K^0$ and $Ξ^+_c\to Ξ^{* 0}π^+$ decays have non-zero branching fractions. The number of free parameter contributing to the $\mathcal{B}_{c\overline 3}\to \mathcal{B}_{10}M$ decays in the linear $SU(3)_F$ breaking is smaller than the available data. The $SU(3)_F$ breaking part of the quark loop diagram can be extracted by global fitting of branching fractions, which could help us understand the CP violation in charm sector. Additionally, some new isospin equations are proposed to test the Körner-Pati-Woo theorem.

hep-ph↗

arXiv2024

Component-based Sketching for Deep ReLU Nets

Deep learning has made profound impacts in the domains of data mining and AI, distinguished by the groundbreaking achievements in numerous real-world applications and the innovative algorithm design philosophy. However, it suffers from the inconsistency issue between optimization and generalization, as achieving good generalization, guided by the bias-variance trade-off principle, favors under-parameterized networks, whereas ensuring effective convergence of gradient-based algorithms demands over-parameterized networks. To address this issue, we develop a novel sketching scheme based on deep net components for various tasks. Specifically, we use deep net components with specific efficacy to build a sketching basis that embodies the advantages of deep networks. Subsequently, we transform deep net training into a linear empirical risk minimization problem based on the constructed basis, successfully avoiding the complicated convergence analysis of iterative algorithms. The efficacy of the proposed component-based sketching is validated through both theoretical analysis and numerical experiments. Theoretically, we show that the proposed component-based sketching provides almost optimal rates in approximating saturated functions for shallow nets and also achieves almost optimal generalization error bounds. Numerically, we demonstrate that, compared with the existing gradient-based training methods, component-based sketching possesses superior generalization performance with reduced training costs.

cs.LG↗

arXiv2024

Isospin sum rules for the nonleptonic $B$ decays

Isospin symmetry, as the most precise flavor symmetry, can be used to extract information about hadronic dynamics. The effective Hamiltonian for bottom quark weak decay is zero under the isospin lowering operators $I_-^n$, which allows us to generate isospin sum rules through several master formulas. In this work, we derive the master formulas of isospin sum rules for the two- and three-body non-leptonic decays of $B$ mesons. Numerous new isospin sum rules, especially those involving three or more decay channels, are proposed. The isospin sum rules can be used to test isospin symmetry and provide hints the isospin partners of exotic hadrons in $B$ decays. It is found ten percent isospin breaking only in decay modes involving two vector mesons, indicating the complex dynamics of vector mesons. Besides, the isospin analysis suggests the charm tetraquark resonances might be observed in the $ B^- \to J/Ψπ^-\overline K^0$, $\overline B^0 \to J/Ψ\overline K^0ϕ$, and $\overline B^0\to D^0\overline D^0\overline K^0$ modes.

hep-ph↗

arXiv2024

MQA-KEAL: Multi-hop Question Answering under Knowledge Editing for Arabic Language

Large Language Models (LLMs) have demonstrated significant capabilities across numerous application domains. A key challenge is to keep these models updated with latest available information, which limits the true potential of these models for the end-applications. Although, there have been numerous attempts for LLMs Knowledge Editing (KE), i.e., to edit the LLMs prior knowledge and in turn test it via Multi-hop Question Answering (MQA), yet so far these studies are primarily focused on English language. To bridge this gap, in this paper we propose: Multi-hop Questioning Answering under Knowledge Editing for Arabic Language (MQA-KEAL). MQA-KEAL stores knowledge edits as structured knowledge units in the external memory. In order to solve multi-hop question, it first uses task-decomposition to decompose the question into smaller sub-problems. Later for each sub-problem, it iteratively queries the external memory and/or target LLM in order to generate the final response. In addition, we also contribute MQUAKE-AR (Arabic translation of English benchmark MQUAKE), as well as a new benchmark MQA-AEVAL for rigorous performance evaluation of MQA under KE for Arabic language. Experimentation evaluation reveals MQA-KEAL outperforms the baseline models by a significant margin.

cs.CL↗

arXiv2024

Multiple Rotation Averaging with Constrained Reweighting Deep Matrix Factorization

Multiple rotation averaging plays a crucial role in computer vision and robotics domains. The conventional optimization-based methods optimize a nonlinear cost function based on certain noise assumptions, while most previous learning-based methods require ground truth labels in the supervised training process. Recognizing the handcrafted noise assumption may not be reasonable in all real-world scenarios, this paper proposes an effective rotation averaging method for mining data patterns in a learning manner while avoiding the requirement of labels. Specifically, we apply deep matrix factorization to directly solve the multiple rotation averaging problem in unconstrained linear space. For deep matrix factorization, we design a neural network model, which is explicitly low-rank and symmetric to better suit the background of multiple rotation averaging. Meanwhile, we utilize a spanning tree-based edge filtering to suppress the influence of rotation outliers. What's more, we also adopt a reweighting scheme and dynamic depth selection strategy to further improve the robustness. Our method synthesizes the merit of both optimization-based and learning-based methods. Experimental results on various datasets validate the effectiveness of our proposed method.

cs.CV↗

arXiv2024

Efficiently Expanding Receptive Fields: Local Split Attention and Parallel Aggregation for Enhanced Large-scale Point Cloud Semantic Segmentation

Expanding the receptive field in a deep learning model for large-scale 3D point cloud segmentation is an effective technique for capturing rich contextual information, which consequently enhances the network's ability to learn meaningful features. However, this often leads to increased computational complexity and risk of overfitting, challenging the efficiency and effectiveness of the learning paradigm. To address these limitations, we propose the Local Split Attention Pooling (LSAP) mechanism to effectively expand the receptive field through a series of local split operations, thus facilitating the acquisition of broader contextual knowledge. Concurrently, it optimizes the computational workload associated with attention-pooling layers to ensure a more streamlined processing workflow. Based on LSAP, a Parallel Aggregation Enhancement (PAE) module is introduced to enable parallel processing of data using both 2D and 3D neighboring information to further enhance contextual representations within the network. In light of the aforementioned designs, we put forth a novel framework, designated as LSNet, for large-scale point cloud semantic segmentation. Extensive evaluations demonstrated the efficacy of seamlessly integrating the proposed PAE module into existing frameworks, yielding significant improvements in mean intersection over union (mIoU) metrics, with a notable increase of up to 11%. Furthermore, LSNet demonstrated superior performance compared to state-of-the-art semantic segmentation networks on three benchmark datasets, including S3DIS, Toronto3D, and SensatUrban. It is noteworthy that our method achieved a substantial speedup of approximately 38.8% compared to those employing similar-sized receptive fields, which serves to highlight both its computational efficiency and practical utility in real-world large-scale scenes.

cs.CV↗

arXiv2024

The MAGPI Survey: the evolution and drivers of gas turbulence in intermediate-redshift galaxies

We measure the ionised gas velocity dispersions of star-forming galaxies in the MAGPI survey ($z\sim0.3$) and compare them with galaxies in the SAMI ($z\sim0.05$) and KROSS ($z\sim1$) surveys to investigate how the ionised gas velocity dispersion evolves. For the first time, we use a consistent method that forward models galaxy kinematics from $z=0$ to $z=1$. This method accounts for spatial substructure in emission line flux and beam smearing. We investigate the correlation between gas velocity dispersion and galaxy properties to understand the mechanisms that drive gas turbulence. We find that in both MAGPI and SAMI galaxies, the gas velocity dispersion more strongly correlates with the star-formation rate surface density ($Σ_{\rm SFR}$) than with a variety of other physical properties, and the average gas velocity dispersion is similar, at the same $Σ_{\rm SFR}$, for SAMI, MAGPI and KROSS galaxies. The results indicate that mechanisms related to $Σ_{\rm SFR}$ could be the dominant driver of gas turbulence from $z\sim1$ to $z\sim0$, for example, stellar feedback and/or gravitational instability. The gas velocity dispersion of MAGPI galaxies is also correlated with the non-rotational motion of the gas, illustrating that in addition to star-formation feedback, gas transportation and accretion may also contribute to the gas velocity dispersion for galaxies at $z\sim 0.3$. KROSS galaxies only have a moderate correlation between gas velocity dispersion and $Σ_{\rm SFR}$ and a higher scatter of gas velocity dispersion with respect to $Σ_{\rm SFR}$, in agreement with the suggestion that other mechanisms, such as gas transportation and accretion, are relatively more important at higher redshift galaxies.

astro-ph.GA↗

arXiv2024

HMoE: Heterogeneous Mixture of Experts for Language Modeling

Mixture of Experts (MoE) offers remarkable performance and computational efficiency by selectively activating subsets of model parameters. Traditionally, MoE models use homogeneous experts, each with identical capacity. However, varying complexity in input data necessitates experts with diverse capabilities, while homogeneous MoE hinders effective expert specialization and efficient parameter utilization. In this study, we propose a novel Heterogeneous Mixture of Experts (HMoE), where experts differ in size and thus possess diverse capacities. This heterogeneity allows for more specialized experts to handle varying token complexities more effectively. To address the imbalance in expert activation, we propose a novel training objective that encourages the frequent activation of smaller experts, enhancing computational efficiency and parameter utilization. Extensive experiments demonstrate that HMoE achieves lower loss with fewer activated parameters and outperforms conventional homogeneous MoE models on various pre-training evaluation benchmarks. Codes will be released upon acceptance.

cs.CL↗

arXiv2024

Incremental Structure Discovery of Classification via Sequential Monte Carlo

Gaussian Processes (GPs) provide a powerful framework for making predictions and understanding uncertainty for classification with kernels and Bayesian non-parametric learning. Building such models typically requires strong prior knowledge to define preselect kernels, which could be ineffective for online applications of classification that sequentially process data because features of data may shift during the process. To alleviate the requirement of prior knowledge used in GPs and learn new features from data that arrive successively, this paper presents a novel method to automatically discover models of classification on complex data with little prior knowledge. Our method adapts a recently proposed technique for GP-based time-series structure discovery, which integrates GPs and Sequential Monte Carlo (SMC). We extend the technique to handle extra latent variables in GP classification, such that our method can effectively and adaptively learn a-priori unknown structures of classification from continuous input. In addition, our method adapts new batch of data with updated structures of models. Our experiments show that our method is able to automatically incorporate various features of kernels on synthesized data and real-world data for classification. In the experiments of real-world data, our method outperforms various classification methods on both online and offline setting achieving a 10\% accuracy improvement on one benchmark.

cs.LG↗

arXiv2024

Auto-bidding and Auctions in Online Advertising: A Survey

In this survey, we summarize recent developments in research fueled by the growing adoption of automated bidding strategies in online advertising. We explore the challenges and opportunities that have arisen as markets embrace this autobidding and cover a range of topics in this area, including bidding algorithms, equilibrium analysis and efficiency of common auction formats, and optimal auction design.

cs.GT↗

arXiv2024

Privacy Amplification via Shuffling: Unified, Simplified, and Tightened

The shuffle model of differential privacy provides promising privacy-utility balances in decentralized, privacy-preserving data analysis. However, the current analyses of privacy amplification via shuffling lack both tightness and generality. To address this issue, we propose the \emph{variation-ratio reduction} as a comprehensive framework for privacy amplification in both single-message and multi-message shuffle protocols. It leverages two new parameterizations: the total variation bounds of local messages and the probability ratio bounds of blanket messages, to determine indistinguishability levels. Our theoretical results demonstrate that our framework provides tighter bounds, especially for local randomizers with extremal probability design, where our bounds are exactly tight. Additionally, variation-ratio reduction complements parallel composition in the shuffle model, yielding enhanced privacy accounting for popular sampling-based randomizers employed in statistical queries (e.g., range queries, marginal queries, and frequent itemset mining). Empirical findings demonstrate that our numerical amplification bounds surpass existing ones, conserving up to $30\%$ of the budget for single-message protocols, $75\%$ for multi-message ones, and a striking $75\%$-$95\%$ for parallel composition. Our bounds also result in a remarkably efficient $\tilde{O}(n)$ algorithm that numerically amplifies privacy in less than $10$ seconds for $n=10^8$ users.

cs.CR↗

arXiv2024

A Case for Application-Aware Space Radiation Tolerance in Orbital Computing

We are witnessing a surge in the use of commercial off-the-shelf (COTS) hardware for cost-effective in-orbit computing, such as deep neural network (DNN) based on-satellite sensor data processing, Earth object detection, and task decision.However, once exposed to harsh space environments, COTS hardware is vulnerable to cosmic radiation and suffers from exhaustive single-event upsets (SEUs) and multi-unit upsets (MCUs), both threatening the functionality and correctness of in-orbit computing.Existing hardware and system software protections against radiation are expensive for resource-constrained COTS nanosatellites and overwhelming for upper-layer applications due to their requirement for heavy resource redundancy and frequent reboots. Instead, we make a case for cost-effective space radiation tolerance using application domain knowledge. Our solution for the on-satellite DNN tasks, \name, exploits the uneven SEU/MCU sensitivity across DNN layers and MCUs' spatial correlation for lightweight radiation-tolerant in-orbit AI computing. Our extensive experiments using Chaohu-1 SAR satellite payloads and a hardware-in-the-loop, real data-driven space radiation emulator validate that RedNet can suppress the influence of radiation errors to $\approx$ 0 and accelerate the on-satellite DNN inference speed by 8.4%-33.0% at negligible extra costs.

cs.ET↗

arXiv2024

First Measurement of the $ν_e$ and $ν_μ$ Interaction Cross Sections at the LHC with FASER's Emulsion Detector

This paper presents the first results of the study of high-energy electron and muon neutrino charged-current interactions in the FASER$ν$ emulsion/tungsten detector of the FASER experiment at the LHC. A subset of the FASER$ν$ volume, which corresponds to a target mass of 128.6~kg, was exposed to neutrinos from the LHC $pp$ collisions with a centre-of-mass energy of 13.6~TeV and an integrated luminosity of 9.5 fb$^{-1}$. Applying stringent selections requiring electrons with reconstructed energy above 200~GeV, four electron neutrino interaction candidate events are observed with an expected background of $0.025^{+0.015}_{-0.010}$, leading to a statistical significance of 5.2$σ$. This is the first direct observation of electron neutrino interactions at a particle collider. Eight muon neutrino interaction candidate events are also detected, with an expected background of $0.22^{+0.09}_{-0.07}$, leading to a statistical significance of 5.7$σ$. The signal events include neutrinos with energies in the TeV range, the highest-energy electron and muon neutrinos ever detected from an artificial source. The energy-independent part of the interaction cross section per nucleon is measured over an energy range of 560--1740 GeV (520--1760 GeV) for $ν_e$ ($ν_μ$) to be $(1.2_{-0.7}^{+0.8}) \times 10^{-38}~\mathrm{cm}^{2}\,\mathrm{GeV}^{-1}$ ($(0.5\pm0.2) \times 10^{-38}~\mathrm{cm}^{2}\,\mathrm{GeV}^{-1}$), consistent with Standard Model predictions. These are the first measurements of neutrino interaction cross sections in those energy ranges.

hep-ex↗

arXiv2024

Deep Reinforcement Learning for Sequential Combinatorial Auctions

Revenue-optimal auction design is a challenging problem with significant theoretical and practical implications. Sequential auction mechanisms, known for their simplicity and strong strategyproofness guarantees, are often limited by theoretical results that are largely existential, except for certain restrictive settings. Although traditional reinforcement learning methods such as Proximal Policy Optimization (PPO) and Soft Actor-Critic (SAC) are applicable in this domain, they struggle with computational demands and convergence issues when dealing with large and continuous action spaces. In light of this and recognizing that we can model transitions differentiable for our settings, we propose using a new reinforcement learning framework tailored for sequential combinatorial auctions that leverages first-order gradients. Our extensive evaluations show that our approach achieves significant improvement in revenue over both analytical baselines and standard reinforcement learning algorithms. Furthermore, we scale our approach to scenarios involving up to 50 agents and 50 items, demonstrating its applicability in complex, real-world auction settings. As such, this work advances the computational tools available for auction design and contributes to bridging the gap between theoretical results and practical implementations in sequential auction design.

cs.GT↗

arXiv2024

Toward Precise Robotic Weed Flaming Using a Mobile Manipulator with a Flamethrower

Robotic weed flaming is a new and environmentally friendly approach to weed removal in the agricultural field. Using a mobile manipulator equipped with a flamethrower, we design a new system and algorithm to enable effective weed flaming, which requires robotic manipulation with a soft and deformable end effector, as the thermal coverage of the flame is affected by dynamic or unknown environmental factors such as gravity, wind, atmospheric pressure, fuel tank pressure, and pose of the nozzle. System development includes overall design, hardware integration, and software pipeline. To enable precise weed removal, the greatest challenge is to detect and predict dynamic flame coverage in real time before motion planning, which is quite different from a conventional rigid gripper in grasping or a spray gun in painting. Based on the images from two onboard infrared cameras and the pose information of the flamethrower nozzle on a mobile manipulator, we propose a new dynamic flame coverage model. The flame model uses a center-arc curve with a Gaussian cross-section model to describe the flame coverage in real time. The experiments have demonstrated the working system and shown that our model and algorithm can achieve a mean average precision (mAP) of more than 76\% in the reprojected images during online prediction.

cs.RO↗

arXiv2024

Releasing Malevolence from Benevolence: The Menace of Benign Data on Machine Unlearning

Machine learning models trained on vast amounts of real or synthetic data often achieve outstanding predictive performance across various domains. However, this utility comes with increasing concerns about privacy, as the training data may include sensitive information. To address these concerns, machine unlearning has been proposed to erase specific data samples from models. While some unlearning techniques efficiently remove data at low costs, recent research highlights vulnerabilities where malicious users could request unlearning on manipulated data to compromise the model. Despite these attacks' effectiveness, perturbed data differs from original training data, failing hash verification. Existing attacks on machine unlearning also suffer from practical limitations and require substantial additional knowledge and resources. To fill the gaps in current unlearning attacks, we introduce the Unlearning Usability Attack. This model-agnostic, unlearning-agnostic, and budget-friendly attack distills data distribution information into a small set of benign data. These data are identified as benign by automatic poisoning detection tools due to their positive impact on model training. While benign for machine learning, unlearning these data significantly degrades model information. Our evaluation demonstrates that unlearning this benign data, comprising no more than 1% of the total training data, can reduce model accuracy by up to 50%. Furthermore, our findings show that well-prepared benign data poses challenges for recent unlearning techniques, as erasing these synthetic instances demands higher resources than regular data. These insights underscore the need for future research to reconsider "data poisoning" in the context of machine unlearning.

cs.CR↗

arXiv2024

The orbital evolution of the tidally stripped star and disk-driven stable mass transfer for QPEs in GSN 069

The origin of the quasi-periodic eruptions (QPEs) is possibly mass loss at the periastron of a body moving around the supermassive black hole (SMBH) in a high eccentric orbit. Such a tidally stripped star is expected to radiate gravitational wave thereby leading to shrinkage of the periastron distance, and thus will eventually be disrupted by the SMBH in the previous studies. This scenario predicts a gradually increasing mass transfer, contradicting the long term evolution of the observed intensity of the QPEs in GSN 069.In this paper, we first revisited the orbital evolution of the stripped star. Then we suggested a model of a tidal stripped WD moving inside an accretion disk for QPEs in GSN 069.We found the effect of the mass transfer finally dominates the orbital evolution, resulting in the stripped star finally escaping the SMBH rather than being disrupted by it. The drag force by the disk can effectively reduce mass transfer and thus explain the observed long term evolution in the intensity of the QPEs in GSN 069. The disk is likely a fallback disk of the tidal disruption event in GSN 069. Considering the evolution of its accretion rate, the increase in the intensity of the latest eruption can also be explained.

astro-ph.HE↗

arXiv2024

Quantum teleportation between a continuous-variable optical qumode and a discrete-variable solid-state qubit

Quantum teleportation is a fundamental ingredient for quantum information science and technology. In particular, the ability to perform quantum teleportation between quantum systems of different natures and encoding types is crucial for building complex systems, such as distributed quantum internet. Here we propose a scheme to teleport a continuous variable optical qubit, encoded in an optical qumode by means of a superposed coherent state, onto a discrete variable solid-state qubit, associated with a single nitrogen-vacancy center spin in diamond, via a hybrid entanglement. By using a newly developed method for Bell-state measurement, which relies only on light homodyne detection and spin polarization measurement, near-deterministic and -perfect quantum teleportation can be achieved for large coherent-state amplitude input. Taking noise effects into account, we find that the average teleportation fidelity can still exceed the classical limit, enabling substantial teleportation distances under realistic experimental conditions.

quant-ph↗