Searcharxiv⌕ Search

arXiv subjects

Bo Zhang

Publications and source records attributed to Bo Zhang.

At least 469 records · Page 26Linked to original sources

Large Language Models for Supply Chain Optimization

Supply chain operations traditionally involve a variety of complex decision making problems. Over the last few decades, supply chains greatly benefited from advances in computation, which allowed the transition from manual processing to automation and cost-effective optimization. Nonetheless, business operators still need to spend substantial efforts in explaining and interpreting the optimization outcomes to stakeholders. Motivated by the recent advances in Large Language Models (LLMs), we study how this disruptive technology can help bridge the gap between supply chain automation and human comprehension and trust thereof. We design OptiGuide -- a framework that accepts as input queries in plain text, and outputs insights about the underlying optimization outcomes. Our framework does not forgo the state-of-the-art combinatorial optimization technology, but rather leverages it to quantitatively answer what-if scenarios (e.g., how would the cost change if we used supplier B instead of supplier A for a given demand?). Importantly, our design does not require sending proprietary data over to LLMs, which can be a privacy concern in some circumstances. We demonstrate the effectiveness of our framework on a real server placement scenario within Microsoft's cloud supply chain. Along the way, we develop a general evaluation benchmark, which can be used to evaluate the accuracy of the LLM output in other scenarios.

cs.AI↗

Cross-Element Combinatorial Selection for Multi-Element Creative in Display Advertising

The effectiveness of ad creatives is greatly influenced by their visual appearance. Advertising platforms can generate ad creatives with different appearances by combining creative elements provided by advertisers. However, with the increasing number of ad creative elements, it becomes challenging to select a suitable combination from the countless possibilities. The industry's mainstream approach is to select individual creative elements independently, which often overlooks the importance of interaction between creative elements during the modeling process. In response, this paper proposes a Cross-Element Combinatorial Selection framework for multiple creative elements, termed CECS. In the encoder process, a cross-element interaction is adopted to dynamically adjust the expression of a single creative element based on the current candidate creatives. In the decoder process, the creative combination problem is transformed into a cascade selection problem of multiple creative elements. A pointer mechanism with a cascade design is used to model the associations among candidates. Comprehensive experiments on real-world datasets show that CECS achieved the SOTA score on offline metrics. Moreover, the CECS algorithm has been deployed in our industrial application, resulting in a significant 6.02% CTR and 10.37% GMV lift, which is beneficial to the business.

cs.IR↗

A Collaborative Transfer Learning Framework for Cross-domain Recommendation

In the recommendation systems, there are multiple business domains to meet the diverse interests and needs of users, and the click-through rate(CTR) of each domain can be quite different, which leads to the demand for CTR prediction modeling for different business domains. The industry solution is to use domain-specific models or transfer learning techniques for each domain. The disadvantage of the former is that the data from other domains is not utilized by a single domain model, while the latter leverage all the data from different domains, but the fine-tuned model of transfer learning may trap the model in a local optimum of the source domain, making it difficult to fit the target domain. Meanwhile, significant differences in data quantity and feature schemas between different domains, known as domain shift, may lead to negative transfer in the process of transferring. To overcome these challenges, we propose the Collaborative Cross-Domain Transfer Learning Framework (CCTL). CCTL evaluates the information gain of the source domain on the target domain using a symmetric companion network and adjusts the information transfer weight of each source domain sample using the information flow network. This approach enables full utilization of other domain data while avoiding negative migration. Additionally, a representation enhancement network is used as an auxiliary task to preserve domain-specific features. Comprehensive experiments on both public and real-world industrial datasets, CCTL achieved SOTA score on offline metrics. At the same time, the CCTL algorithm has been deployed in Meituan, bringing 4.37% CTR and 5.43% GMV lift, which is significant to the business.

cs.IR↗

Graph Based Long-Term And Short-Term Interest Model for Click-Through Rate Prediction

Click-through rate (CTR) prediction aims to predict the probability that the user will click an item, which has been one of the key tasks in online recommender and advertising systems. In such systems, rich user behavior (viz. long- and short-term) has been proved to be of great value in capturing user interests. Both industry and academy have paid much attention to this topic and propose different approaches to modeling with long-term and short-term user behavior data. But there are still some unresolved issues. More specially, (1) rule and truncation based methods to extract information from long-term behavior are easy to cause information loss, and (2) single feedback behavior regardless of scenario to extract information from short-term behavior lead to information confusion and noise. To fill this gap, we propose a Graph based Long-term and Short-term interest Model, termed GLSM. It consists of a multi-interest graph structure for capturing long-term user behavior, a multi-scenario heterogeneous sequence model for modeling short-term information, then an adaptive fusion mechanism to fused information from long-term and short-term behaviors. Comprehensive experiments on real-world datasets, GLSM achieved SOTA score on offline metrics. At the same time, the GLSM algorithm has been deployed in our industrial application, bringing 4.9% CTR and 4.3% GMV lift, which is significant to the business.

cs.IR↗

Amplification trojan network: Attack deep neural networks by amplifying their inherent weakness

Recent works found that deep neural networks (DNNs) can be fooled by adversarial examples, which are crafted by adding adversarial noise on clean inputs. The accuracy of DNNs on adversarial examples will decrease as the magnitude of the adversarial noise increase. In this study, we show that DNNs can be also fooled when the noise is very small under certain circumstances. This new type of attack is called Amplification Trojan Attack (ATAttack). Specifically, we use a trojan network to transform the inputs before sending them to the target DNN. This trojan network serves as an amplifier to amplify the inherent weakness of the target DNN. The target DNN, which is infected by the trojan network, performs normally on clean data while being more vulnerable to adversarial examples. Since it only transforms the inputs, the trojan network can hide in DNN-based pipelines, e.g. by infecting the pre-processing procedure of the inputs before sending them to the DNNs. This new type of threat should be considered in developing safe DNNs.

cs.CR↗

NaSGEC: a Multi-Domain Chinese Grammatical Error Correction Dataset from Native Speaker Texts

We introduce NaSGEC, a new dataset to facilitate research on Chinese grammatical error correction (CGEC) for native speaker texts from multiple domains. Previous CGEC research primarily focuses on correcting texts from a single domain, especially learner essays. To broaden the target domain, we annotate multiple references for 12,500 sentences from three native domains, i.e., social media, scientific writing, and examination. We provide solid benchmark results for NaSGEC by employing cutting-edge CGEC models and different training data. We further perform detailed analyses of the connections and gaps between our domains from both empirical and statistical views. We hope this work can inspire future studies on an important but under-explored direction--cross-domain GEC.

cs.CL↗

Network pharmacology on the mechanism of Yi Qi Tong Qiao Pill inhibiting allergic rhinitis

Objective: The purpose of this study is to reveal the mechanism of action of Yi Qi Tong Qiao Pill (YQTQP) in the treatment of allergic rhinitis (AR), as well as establish a paradigm for the researches on traditional Chinese medicine (TCM) from systematic perspective. Methods: Based on the data collected from TCM-related and disease-related databases, target profiles of compounds in YQTQP were calculated through network-based algorithms and holistic targets of TQTQP was constructed. Network target analysis was performed to explore the potential mechanisms of YQTQP in the treatment of AR and the mechanisms were classified into different modules according to their biological functions. Besides, animal and clinical experiments were conducted to validate our findings inferred from Network target analysis. Results: Network target analysis showed that YQTQP targeted 12 main pathways or biological processes related to AR, represented by those related to IL-4, IFN-γ, TNF-α and IL-13. These results could be classified into 3 biological modules, including regulation of immune and inflammation, epithelial barrier disorder and cell adhesion. Finally, a series of experiments composed of animal and clinical experiments, proved our findings and confirmed that YQTQP could improve related symptoms of AR, like permeability of nasal mucosa epithelium. Conclusion: A combination of Network target analysis and the experimental validation indicated that YQTQP was effective in the treatment of AR and might provide a new insight on revealing the mechanism of TCM against diseases.

q-bio.QM↗

A method for automated regression test in scientific computing libraries: illustration with SPHinXsys

Scientific computing libraries, either being in-house or open-source, have experienced enormous progress in both engineering and scientific research. It is therefore essential to ensure that the modifications in the source code aroused by bug fixing or new feature development wouldn't compromise the accuracy and functionality that has already been validated and verified. With this in mind, this paper introduces a method for developing and implementing an automatic regression test environment and takes the open-source multi-physics library SPHinXsys \cite{zhang2021sphinxsys} as an example. Firstly, the reference database for each benchmark test is generated from monitored data by multiple executions. This database contains the maximum variation range of metrics for different types of strategies, i.e., time-averaged method, ensemble-averaged method as well as the dynamic time warping method, covering the uncertainty arising from parallel computing, particle relaxation, physical instabilities, etc. Then, new results obtained after source code modification will be tested with them according to a curve-similarity based comparison. Whenever the source code is updated, the regression test will be carried out automatically for all test cases and used to report the validity of the current results. This regression test environment has already been implemented in all dynamics test cases released in SPHinXsys, including fluid dynamics, solid mechanics, fluid-structure interaction, thermal and mass diffusion, reaction-diffusion, and their multi-physics coupling, and shows good capability for testing various problems. It's worth noting that while the present test environment is built and implemented for a specific scientific computing library, its underlying principle is generic and can be applied to many others.

physics.comp-ph↗

Direct imaging methods for reconstructing a locally rough interface from phaseless total-field data or phased far-field data

This paper is concerned with the problem of inverse scattering of time-harmonic acoustic plane waves by a two-layered medium with a locally rough interface in 2D. A direct imaging method is proposed to reconstruct the locally rough interface from the phaseless total-field data measured on the upper half of the circle with a large radius at a fixed frequency or from the phased far-field data measured on the upper half of the unit circle at a fixed frequency. The presence of the locally rough interface poses challenges in the theoretical analysis of the imaging methods. To address these challenges, a technically involved asymptotic analysis is provided for the relevant oscillatory integrals involved in the imaging methods, based mainly on the techniques and results in our recent work [L. Li, J. Yang, B. Zhang and H. Zhang, arXiv:2208.00456] on the uniform far-field asymptotics of the scattered field for acoustic scattering in a two-layered medium. Finally, extensive numerical experiments are conducted to demonstrate the feasibility and robustness of our imaging algorithms.

math.NA↗

Uni3D: A Unified Baseline for Multi-dataset 3D Object Detection

Current 3D object detection models follow a single dataset-specific training and testing paradigm, which often faces a serious detection accuracy drop when they are directly deployed in another dataset. In this paper, we study the task of training a unified 3D detector from multiple datasets. We observe that this appears to be a challenging task, which is mainly due to that these datasets present substantial data-level differences and taxonomy-level variations caused by different LiDAR types and data acquisition standards. Inspired by such observation, we present a Uni3D which leverages a simple data-level correction operation and a designed semantic-level coupling-and-recoupling module to alleviate the unavoidable data-level and taxonomy-level differences, respectively. Our method is simple and easily combined with many 3D object detection baselines such as PV-RCNN and Voxel-RCNN, enabling them to effectively learn from multiple off-the-shelf 3D datasets to obtain more discriminative and generalizable representations. Experiments are conducted on many dataset consolidation settings including Waymo-nuScenes, nuScenes-KITTI, Waymo-KITTI, and Waymo-nuScenes-KITTI consolidations. Their results demonstrate that Uni3D exceeds a series of individual detectors trained on a single dataset, with a 1.04x parameter increase over a selected baseline detector. We expect this work will inspire the research of 3D generalization since it will push the limits of perceptual performance.

cs.CV↗

VLBI Astrometry of Radio Stars to Link Radio and Optical Celestial Reference Frames. I. HD 199178 $\&$ AR Lacertae

To accurately link the radio and optical Celestial Reference Frames (CRFs) at optical bright end, i.e., with Gaia G band magnitude < 13, increasing number and improving sky distribution of radio stars with accurate astrometric parameters from both Very Long Baseline Interferometry (VLBI) and Gaia measurements are mandatory. We selected two radio stars HD 199178 and AR Lacertae as the target for a pilot program for the frame link, using the Very Long Baseline Array (VLBA) at 15 GHz at six epochs spanning about 1 year, to measure their astrometric parameters. The measured parallax of HD 199178 is $8.949 \pm 0.059$ mas and the proper motion is $μ_αcos δ= 26.393 \pm 0.093$, $μ_δ= -0.950 \pm 0.083~mas~yr^{-1}$, while the parallax of AR Lac is $23.459 \pm 0.094$ mas and the proper motion is $μ_αcos δ= -51.906 \pm 0.138$, $μ_δ= 46.732 \pm 0.131~mas~yr^{-1}$. Our VLBI measured astrometric parameters have accuracies about 4-5 times better than the corresponding historic VLBI measurements and comparable accuracies with those from Gaia, validating the feasibility of frame link using radio stars. With the updated astrometric parameters for these two stars, there is a 25% reduction of the uncertainties on the Y axis for both orientation and spin parameters.

astro-ph.SR↗

TREBUCHET: Fully Homomorphic Encryption Accelerator for Deep Computation

Secure computation is of critical importance to not only the DoD, but across financial institutions, healthcare, and anywhere personally identifiable information (PII) is accessed. Traditional security techniques require data to be decrypted before performing any computation. When processed on untrusted systems the decrypted data is vulnerable to attacks to extract the sensitive information. To address these vulnerabilities Fully Homomorphic Encryption (FHE) keeps the data encrypted during computation and secures the results, even in these untrusted environments. However, FHE requires a significant amount of computation to perform equivalent unencrypted operations. To be useful, FHE must significantly close the computation gap (within 10x) to make encrypted processing practical. To accomplish this ambitious goal the TREBUCHET project is leading research and development in FHE processing hardware to accelerate deep computations on encrypted data, as part of the DARPA MTO Data Privacy for Virtual Environments (DPRIVE) program. We accelerate the major secure standardized FHE schemes (BGV, BFV, CKKS, FHEW, etc.) at >=128-bit security while integrating with the open-source PALISADE and OpenFHE libraries currently used in the DoD and in industry. We utilize a novel tile-based chip design with highly parallel ALUs optimized for vectorized 128b modulo arithmetic. The TREBUCHET coprocessor design provides a highly modular, flexible, and extensible FHE accelerator for easy reconfiguration, deployment, integration and application on other hardware form factors, such as System-on-Chip or alternate chip areas.

cs.CR↗

Modulated non-collinear magnetic structure of (Co$_{0.97}$$^{57}$Fe$_{0.03}$)$_{4}$Nb$_{2}$O$_{9}$ as revealed by Mössbauer spectroscopy

In this work, we present detailed $^{57}$Fe Mössbauer spectroscopy investigations of (Co$_{0.97}$$^{57}$Fe$_{0.03}$)$_{4}$Nb$_{2}$O$_{9}$ compound to study its possible magnetic structures. We have shown that the previously reported magnetic structures can not satisfactorily describe our low temperature Mössbauer spectra. Therefore, in combination with theoretical calculations, we have proposed a modulated helicoidal magnetic structure that can be used to simulate the whole series of our low temperature Mössbauer spectra. Our results suggest that the combination of previously reported different magnetic structures are only approximations of the average magnetic structure from our modulated helicoidal model. We anticipate that the proposed modulated non-collinear magnetic structure might shed light on the understanding of the complex magnetoelectric effects observed in this system.

cond-mat.str-el↗

Delving into Shape-aware Zero-shot Semantic Segmentation

Thanks to the impressive progress of large-scale vision-language pretraining, recent recognition models can classify arbitrary objects in a zero-shot and open-set manner, with a surprisingly high accuracy. However, translating this success to semantic segmentation is not trivial, because this dense prediction task requires not only accurate semantic understanding but also fine shape delineation and existing vision-language models are trained with image-level language descriptions. To bridge this gap, we pursue \textbf{shape-aware} zero-shot semantic segmentation in this study. Inspired by classical spectral methods in the image segmentation literature, we propose to leverage the eigen vectors of Laplacian matrices constructed with self-supervised pixel-wise features to promote shape-awareness. Despite that this simple and effective technique does not make use of the masks of seen classes at all, we demonstrate that it out-performs a state-of-the-art shape-aware formulation that aligns ground truth and predicted edges during training. We also delve into the performance gains achieved on different datasets using different backbones and draw several interesting and conclusive observations: the benefits of promoting shape-awareness highly relates to mask compactness and language embedding locality. Finally, our method sets new state-of-the-art performance for zero-shot semantic segmentation on both Pascal and COCO, with significant margins. Code and models will be accessed at https://github.com/Liuxinyv/SAZS.

cs.CV↗

Enhancing Personalized Ranking With Differentiable Group AUC Optimization

AUC is a common metric for evaluating the performance of a classifier. However, most classifiers are trained with cross entropy, and it does not optimize the AUC metric directly, which leaves a gap between the training and evaluation stage. In this paper, we propose the PDAOM loss, a Personalized and Differentiable AUC Optimization method with Maximum violation, which can be directly applied when training a binary classifier and optimized with gradient-based methods. Specifically, we construct the pairwise exponential loss with difficult pair of positive and negative samples within sub-batches grouped by user ID, aiming to guide the classifier to pay attention to the relation between hard-distinguished pairs of opposite samples from the perspective of independent users. Compared to the origin form of pairwise exponential loss, the proposed PDAOM loss not only improves the AUC and GAUC metrics in the offline evaluation, but also reduces the computation complexity of the training objective. Furthermore, online evaluation of the PDAOM loss on the 'Guess What You Like' feed recommendation application in Meituan manifests 1.40% increase in click count and 0.65% increase in order count compared to the baseline model, which is a significant improvement in this well-developed online life service recommendation system.

cs.LG↗

The Stellar Spectra Factory (SSF) Based On SLAM

In this work, we present Stellar Spectra Factory (SSF), a tool to generate empirical-based stellar spectra from arbitrary stellar atmospheric parameters. The relative flux-calibrated empirical spectra can be predicted by SSF given arbitrary effective temperature, surface gravity, and metallicity. SSF constructs the interpolation approach based on the SLAM, using ATLAS-A library as the training dataset. SSF is composed of 4 data-driven sub-models to predict empirical stellar spectra. SSF-N can generate spectra from A to K type and some M giant stars, covering 3700 < Teff < 8700 K, 0 < logg < 6 dex, and -1.5 < [M/H] < 0.5 dex. SSF-gM is mainly used to predict M giant spectra with 3520 < Teff < 4000K and -1.5 < [M/H] < 0.4 dex. SSF-dM is for generating M dwarf spectra with 3295 < Teff < 4040K, -1.0 < [M/H] < 0.1 dex. And SSF-B can predict B-type spectra with 9000 < Teff < 24000K and -5.2< MG < 1.5 mag. The accuracy of the predicted spectra is validated by comparing the flux of predicted spectra to those with same stellar parameters selected from the known spectral libraries, MILES and MaStar. The averaged difference of flux over optical wavelength between the predicted spectra and the corresponding ones in MILES and MaStar is less than 5%. More verification is conducted between the magnitudes calculated from the integration of the predicted spectra and the observations in PS1 and APASS bands with the same stellar parameters. No significant systematic difference is found between the predicted spectra and the photomatric observations. The uncertainty is 0.08mag in r band for SSF-gM when comparing with the stars with the same stellar parameters selected from PS1. And the uncertainty becomes 0.31mag in i band for SSF-dM when comparing with the stars with the same stellar parameters selected from APASS.

astro-ph.SR↗

Subsampling-Based Modified Bayesian Information Criterion for Large-Scale Stochastic Block Models

Identifying the number of communities is a fundamental problem in community detection, which has received increasing attention recently. However, rapid advances in technology have led to the emergence of large-scale networks in various disciplines, thereby making existing methods computationally infeasible. To address this challenge, we propose a novel subsampling-based modified Bayesian information criterion (SM-BIC) for identifying the number of communities in a network generated via the stochastic block model and degree-corrected stochastic block model. We first propose a node-pair subsampling method to extract an informative subnetwork from the entire network, and then we derive a purely data-driven criterion to identify the number of communities for the subnetwork. In this way, the SM-BIC can identify the number of communities based on the subsampled network instead of the entire dataset. This leads to important computational advantages over existing methods. We theoretically investigate the computational complexity and identification consistency of the SM-BIC. Furthermore, the advantages of the SM-BIC are demonstrated by extensive numerical studies.

stat.ME↗

Prediction method of cigarette draw resistance based on correlation analysis

The cigarette draw resistance monitoring method is incomplete and single, and the lacks correlation analysis and preventive modeling, resulting in substandard cigarettes in the market. To address this problem without increasing the hardware cost, in this paper, multi-indicator correlation analysis is used to predict cigarette draw resistance. First, the monitoring process of draw resistance is analyzed based on the existing quality control framework, and optimization ideas are proposed. In addition, for the three production units, the cut tobacco supply (VE), the tobacco rolling (SE), and the cigarette-forming (MAX), direct and potential factors associated with draw resistance are explored, based on the linear and non-linear correlation analysis. Then, the correlates of draw resistance are used as inputs for the machine learning model, and the predicted values of draw resistance are used as outputs. Finally, this research also innovatively verifies the practical application value of draw resistance prediction: the distribution characteristics of substandard cigarettes are analyzed based on the prediction results, the time interval of substandard cigarettes being produced is determined, the probability model of substandard cigarettes being sampled is derived, and the reliability of the prediction result is further verified by the example. The results show that the prediction model based on correlation analysis has good performance in three months of actual production.

stat.AP↗