arXiv subjects

Yuchen Jiang

Publications and source records attributed to Yuchen Jiang.

29 records · Page 2Linked to original sources

arXiv2023

Robust Representation Learning for Unified Online Top-K Recommendation

In large-scale industrial e-commerce, the efficiency of an online recommendation system is crucial in delivering highly relevant item/content advertising that caters to diverse business scenarios. However, most existing studies focus solely on item advertising, neglecting the significance of content advertising. This oversight results in inconsistencies within the multi-entity structure and unfair retrieval. Furthermore, the challenge of retrieving top-k advertisements from multi-entity advertisements across different domains adds to the complexity. Recent research proves that user-entity behaviors within different domains exhibit characteristics of differentiation and homogeneity. Therefore, the multi-domain matching models typically rely on the hybrid-experts framework with domain-invariant and domain-specific representations. Unfortunately, most approaches primarily focus on optimizing the combination mode of different experts, failing to address the inherent difficulty in optimizing the expert modules themselves. The existence of redundant information across different domains introduces interference and competition among experts, while the distinct learning objectives of each domain lead to varying optimization challenges among experts. To tackle these issues, we propose robust representation learning for the unified online top-k recommendation. Our approach constructs unified modeling in entity space to ensure data fairness. The robust representation learning employs domain adversarial learning and multi-view wasserstein distribution learning to learn robust representations. Moreover, the proposed method balances conflicting objectives through the homoscedastic uncertainty weights and orthogonality constraints. Various experiments validate the effectiveness and rationality of our proposed method, which has been successfully deployed online to serve real business scenarios.

cs.IR↗

arXiv2023

Binary Classification with Confidence Difference

Recently, learning with soft labels has been shown to achieve better performance than learning with hard labels in terms of model generalization, calibration, and robustness. However, collecting pointwise labeling confidence for all training examples can be challenging and time-consuming in real-world scenarios. This paper delves into a novel weakly supervised binary classification problem called confidence-difference (ConfDiff) classification. Instead of pointwise labeling confidence, we are given only unlabeled data pairs with confidence difference that specifies the difference in the probabilities of being positive. We propose a risk-consistent approach to tackle this problem and show that the estimation error bound achieves the optimal convergence rate. We also introduce a risk correction approach to mitigate overfitting problems, whose consistency and convergence rate are also proven. Extensive experiments on benchmark data sets and a real-world recommender system data set validate the effectiveness of our proposed approaches in exploiting the supervision information of the confidence difference.

cs.LG↗

arXiv2022

Autoregressive Structured Prediction with Language Models

Recent years have seen a paradigm shift in NLP towards using pretrained language models ({PLM}) for a wide range of tasks. However, there are many difficult design decisions to represent structures (e.g. tagged text, coreference chains) in a way such that they can be captured by PLMs. Prior work on structured prediction with PLMs typically flattens the structured output into a sequence, which limits the quality of structural information being learned and leads to inferior performance compared to classic discriminative models. In this work, we describe an approach to model structures as sequences of actions in an autoregressive manner with PLMs, allowing in-structure dependencies to be learned without any loss. Our approach achieves the new state-of-the-art on all the structured prediction tasks we looked at, namely, named entity recognition, end-to-end relation extraction, and coreference resolution.

cs.CL↗

arXiv2022

In-orbit Radiation Damage Characterization of SiPMs in the GRID-02 CubeSat Detector

Recently, silicon photomultipliers (SiPMs) have been used in several space-borne missions, owing to their solid state, compact size, low operating voltage, and insensitivity to magnetic fields. However, operating SiPMs in space results in radiation damage and degraded performance. In-orbit quantitative studies on these effects are limited. In this study, we present in-orbit SiPM characterization results obtained by the second detector of the Gamma-Ray Integrated Detectors (GRID-02), which was launched on 6 November 2020. An increase in dark current of $\sim$100 $μ$A/year per SiPM chip (model MicroFJ-60035-TSV) at 28.5 V and 5 $^{\circ}$C was observed. Consequently, the overall noise level (sigma) of the GRID-02 detector increased by $\sim$7.5 keV/year. The estimate of this increase is $\sim$40 $μ$A/year per SiPM chip at -20 $^{\circ}$C, highlighting the positive effect of using a cooling system.

physics.ins-det↗

arXiv2022

Symmetry breaking Paradigm In Typical Laminar-Turbulence Transition System

A stationary cylindrical vessel containing a rotating plate near the bottle surface is partially filled with liquid. With the bottom rotating, the shape of the liquid surface would become polygon-like. This polygon vortex phenomenon is an ideal system to demonstrate the Laminar-Turbulent transition process. Within the framework of equilibrium statistical mechanics, a profound comparison with Landau's phase transition theory was applied in the symmetry-breaking aspect to derive the evolution equation of this system phenomenologically. A comparison between theoretical prediction and experimental data is carried out. We concluded a considerably highly matched result, while some exceptions are viewed as the natural result that the experiment breaks through the up-limit of using equilibrium mechanics as an effective theory, namely breaking through the Arnold Tongue. Some extremely complex Non-equilibrium approaches were desired to solve this problem thoroughly in the future. So our method could be viewed as a linear approximation of this theoretical framework.

physics.flu-dyn↗

arXiv2022

Adaptive Domain Interest Network for Multi-domain Recommendation

Industrial recommender systems usually hold data from multiple business scenarios and are expected to provide recommendation services for these scenarios simultaneously. In the retrieval step, the topK high-quality items selected from a large number of corpus usually need to be various for multiple scenarios. Take Alibaba display advertising system for example, not only because the behavior patterns of Taobao users are diverse, but also differentiated scenarios' bid prices assigned by advertisers vary significantly. Traditional methods either train models for each scenario separately, ignoring the cross-domain overlapping of user groups and items, or simply mix all samples and maintain a shared model which makes it difficult to capture significant diversities between scenarios. In this paper, we present Adaptive Domain Interest network that adaptively handles the commonalities and diversities across scenarios, making full use of multi-scenarios data during training. Then the proposed method is able to improve the performance of each business domain by giving various topK candidates for different scenarios during online inference. Specifically, our proposed ADI models the commonalities and diversities for different domains by shared networks and domain-specific networks, respectively. In addition, we apply the domain-specific batch normalization and design the domain interest adaptation layer for feature-level domain adaptation. A self training strategy is also incorporated to capture label-level connections across domains.ADI has been deployed in the display advertising system of Alibaba, and obtains 1.8% improvement on advertising revenue.

cs.IR↗

arXiv2021

Learnable Faster Kernel-PCA for Nonlinear Fault Detection: Deep Autoencoder-Based Realization

Kernel principal component analysis (KPCA) is a well-recognized nonlinear dimensionality reduction method that has been widely used in nonlinear fault detection tasks. As a kernel trick-based method, KPCA inherits two major problems. First, the form and the parameters of the kernel function are usually selected blindly, depending seriously on trial-and-error. As a result, there may be serious performance degradation in case of inappropriate selections. Second, at the online monitoring stage, KPCA has much computational burden and poor real-time performance, because the kernel method requires to leverage all the offline training data. In this work, to deal with the two drawbacks, a learnable faster realization of the conventional KPCA is proposed. The core idea is to parameterize all feasible kernel functions using the novel nonlinear DAE-FE (deep autoencoder based feature extraction) framework and propose DAE-PCA (deep autoencoder based principal component analysis) approach in detail. The proposed DAE-PCA method is proved to be equivalent to KPCA but has more advantage in terms of automatic searching of the most suitable nonlinear high-dimensional space according to the inputs. Furthermore, the online computational efficiency improves by approximately 100 times compared with the conventional KPCA. With the Tennessee Eastman (TE) process benchmark, the effectiveness and superiority of the proposed method is illustrated.

cs.LG↗

arXiv2021

Simulating Photometric Images of Moving Targets with Photon-mapping

We present a novel, easy-to-use method based on the photon-mapping technique to simulate photometric images of moving targets. Realistic images can be created in two passes: photon tracing and image rendering. The nature of light sources, tracking mode of the telescope, point spread function (PSF), and specifications of the CCD are taken into account in the imaging process. Photometric images in a variety of observation scenarios can be generated flexibly. We compared the simulated images with the observed ones. The residuals between them are negligible, and the correlation coefficients between them are high, with a median of $0.9379_{-0.0201}^{+0.0125}$ for 1020 pairs of images, which means a high fidelity and similarity. The method is versatile and can be used to plan future photometry of moving targets, interpret existing observations, and provide test images for image processing algorithms.

astro-ph.IM↗

arXiv2019

BOSH: An Efficient Meta Algorithm for Decision-based Attacks

Adversarial example generation becomes a viable method for evaluating the robustness of a machine learning model. In this paper, we consider hard-label black-box attacks (a.k.a. decision-based attacks), which is a challenging setting that generates adversarial examples based on only a series of black-box hard-label queries. This type of attacks can be used to attack discrete and complex models, such as Gradient Boosting Decision Tree (GBDT) and detection-based defense models. Existing decision-based attacks based on iterative local updates often get stuck in a local minimum and fail to generate the optimal adversarial example with the smallest distortion. To remedy this issue, we propose an efficient meta algorithm called BOSH-attack, which tremendously improves existing algorithms through Bayesian Optimization (BO) and Successive Halving (SH). In particular, instead of traversing a single solution path when searching an adversarial example, we maintain a pool of solution paths to explore important regions. We show empirically that the proposed algorithm converges to a better solution than existing approaches, while the query count is smaller than applying multiple random initializations by a factor of 10.

cs.LG↗

arXiv2019

GRID: a Student Project to Monitor the Transient Gamma-Ray Sky in the Multi-Messenger Astronomy Era

The Gamma-Ray Integrated Detectors (GRID) is a space mission concept dedicated to monitoring the transient gamma-ray sky in the energy range from 10 keV to 2 MeV using scintillation detectors onboard CubeSats in low Earth orbits. The primary targets of GRID are the gamma-ray bursts (GRBs) in the local universe. The scientific goal of GRID is, in synergy with ground-based gravitational wave (GW) detectors such as LIGO and VIRGO, to accumulate a sample of GRBs associated with the merger of two compact stars and study jets and related physics of those objects. It also involves observing and studying other gamma-ray transients such as long GRBs, soft gamma-ray repeaters, terrestrial gamma-ray flashes, and solar flares. With multiple CubeSats in various orbits, GRID is unaffected by the Earth occultation and serves as a full-time and all-sky monitor. Assuming a horizon of 200 Mpc for ground-based GW detectors, we expect to see a few associated GW-GRB events per year. With about 10 CubeSats in operation, GRID is capable of localizing a faint GRB like 170817A with a 90% error radius of about 10 degrees, through triangulation and flux modulation. GRID is proposed and developed by students, with considerable contribution from undergraduate students, and will remain operated as a student project in the future. The current GRID collaboration involves more than 20 institutes and keeps growing. On August 29th, the first GRID detector onboard a CubeSat was launched into a Sun-synchronous orbit and is currently under test.

astro-ph.IM↗

arXiv2016

A Second Order Time Homogenized Model for Sediment Transport

A multi-scale method for the hyperbolic systems governing sediment transport in subcritical case is developed. The scale separation of this problem is due to the fact that the sediment transport is much slower than flow velocity. We first derive a zeroth order homogenized model, and then propose a first order correction. It is revealed that the first order correction for hyperbolic systems has to be applied on the characteristic speed of slow variables in one dimensional case. In two dimensional case, besides the characteristic speed, the source term is also corrected. We develop a second order numerical scheme following the framework of heterogeneous multi-scale method. The numerical results in both one and two dimensional cases demonstrate the effectiveness and efficiency of our method.

math.NA↗