activity
20092026
most citedMaximally Consistent Sampling and the Jaccard Index of Probability Distributions

25 citations · 106 across the 23 of their papers we have counts for

collaborators

26 papers

math.PR2026

A subquadratic upper bound for the mixing time of the Thorp shuffle

Yunjiang Jiang

Let . We prove that the worst-start total-variation mixing time of the full labelled Thorp shuffle satisfies, for every fixed , \[ t_{\mathrm{mix}}(\varepsi…

math.PR2026

Cutoff for the Overhand Shuffle

Yunjiang Jiang

We study the overhand shuffle with a fixed cut probability . In the packet-reversal convention, each gap is cut independently with probability , and each resulting pa…

math.MG2026

A 0.41275 lower bound for the three-dimensional Blaschke-Lebesgue problem

Yunjiang Jiang

We prove that every convex body of constant width satisfies \[ \operatorname{Vol}(K)\ge \frac{1651}{4000}w^3=0.41275\,w^3. \] This improves the certifi…

math.CO2026

Entropy bounds and global couplings for union-closed families

Yunjiang Jiang

We give a computer-assisted proof that every finite union-closed family containing a nonempty set has an element in at least 0.38288525 of its members. The argument combines indepe…

math.PR2026

Resolvent characteristics and quadratic mixing of Kac's walk on

Yunjiang Jiang

We study the coordinate-plane Kac walk on with independent uniform rotation angles. For the unnormalized Hilbert-Schmidt Riemannian distance, we prove that the Was…

cs.IR2023★ 6 cited

Differentiable Retrieval Augmentation via Generative Language Modeling for E-commerce Query Intent Classification

Chenyu Zhao, Yunjiang Jiang, Yiming Qiu +2

Retrieval augmentation, which enhances downstream models by a knowledge retriever and an external corpus instead of by merely increasing the number of model parameters, has been su…

cs.IR2023★ 1 cited

Attention Weighted Mixture of Experts with Contrastive Learning for Personalized Ranking in E-commerce

Juan Gong, Zhenlin Chen, Chaoyi Ma +7

Ranking model plays an essential role in e-commerce search and recommendation. An effective ranking model should give a personalized ranking list for each user according to the use…

cs.IR2022★ 1 cited

Givens Coordinate Descent Methods for Rotation Matrix Learning in Trainable Embedding Indexes

Yunjiang Jiang, Han Zhang, Yiming Qiu +3

Product quantization (PQ) coupled with a space rotation, is widely used in modern approximate nearest neighbor (ANN) search systems to significantly compress the disk storage for e…

cs.IR2022★ 2 cited

Sequential Search with Off-Policy Reinforcement Learning

Dadong Miao, Yanan Wang, Guoyu Tang +6

Recent years have seen a significant amount of interests in Sequential Recommendation (SR), which aims to understand and model the sequential user behaviors and the interactions be…

cs.CL2021★ 14 cited

DSGPT: Domain-Specific Generative Pre-Training of Transformers for Text Generation in E-commerce Title and Review Summarization

Xueying Zhang, Yunjiang Jiang, Yue Shang +5

We propose a novel domain-specific generative pre-training (DS-GPT) method for text generation and apply it to the product titleand review summarization problems on E-commerce mobi…

cs.IR2021★ 24 cited

Joint Learning of Deep Retrieval Model and Product Quantization based Embedding Index

Han Zhang, Hongwei Shen, Yiming Qiu +6

Embedding index that enables fast approximate nearest neighbor(ANN) search, serves as an indispensable component for state-of-the-art deep retrieval systems. Traditional approaches…

cs.IR2021

A unified Neural Network Approach to E-CommerceRelevance Learning

Yunjiang Jiang, Yue Shang, Rui Li +5

Result relevance scoring is critical to e-commerce search user experience. Traditional information retrieval methods focus on keyword matching and hand-crafted or counting-based nu…

cs.IR2021★ 1 cited

From Semantic Retrieval to Pairwise Ranking: Applying Deep Learning in E-commerce Search

Rui Li, Yunjiang Jiang, Wenyun Yang +7

We introduce deep learning models to the two most important stages in product search at JD.com, one of the largest e-commerce platforms in the world. Specifically, we outline the d…

cs.IR2021★ 3 cited

Heterogeneous Network Embedding for Deep Semantic Relevance Match in E-commerce Search

Ziyang Liu, Zhaomeng Cheng, Yunjiang Jiang +5

Result relevance prediction is an essential task of e-commerce search engines to boost the utility of search engines and ensure smooth user experience. The last few years eyewitnes…

cs.LG2020

BERT2DNN: BERT Distillation with Massive Unlabeled Data for Online E-Commerce Search

Yunjiang Jiang, Yue Shang, Ziyang Liu +6

Relevance has significant impact on user experience and business profit for e-commerce search platform. In this work, we propose a data-driven framework for search relevance predic…

cs.IR2020★ 1 cited

Fine-tune BERT for E-commerce Non-Default Search Ranking

Yunjiang Jiang, Yue Shang, Hongwei Shen +2

The quality of non-default ranking on e-commerce platforms, such as based on ascending item price or descending historical sales volume, often suffers from acute relevance problems…

cs.LG2020

Adversarial Mixture Of Experts with Category Hierarchy Soft Constraint

Zhuojian Xiao, Yunjiang jiang, Guoyu Tang +4

Product search is the most common way for people to satisfy their shopping needs on e-commerce websites. Products are typically annotated with one of several broad categorical tags…

cs.IR2020★ 4 cited

Towards Personalized and Semantic Retrieval: An End-to-End Solution for E-commerce Search via Embedding Learning

Han Zhang, Songlin Wang, Kang Zhang +5

Nowadays e-commerce search has become an integral part of many people's shopping routines. Two critical challenges stay in today's e-commerce search: how to retrieve items that are…

cs.DS2018★ 25 cited

Maximally Consistent Sampling and the Jaccard Index of Probability Distributions

Ryan Moulton, Yunjiang Jiang

We introduce simple, efficient algorithms for computing a MinHash of a probability distribution, suitable for both sparse and dense data, with equivalent running times to the state…

math.PR2012★ 11 cited

Cut-off phenomenon in the uniform plane Kac walk

Bob Hough, Yunjiang Jiang

We consider an analogue of the Kac random walk on the special orthogonal group , in which at each step a random rotation is performed in a randomly chosen 2-plane of $\bR^N$…

math.PR2012★ 5 cited

Smallest Gaps Between Eigenvalues of Random Matrices With Complex Ginibre, Wishart and Universal Unitary Ensembles

Dai Shi, Yunjiang Jiang

In this paper we study the limiting distribution of the smallest gaps between eigenvalues of three kinds of random matrices -- the Ginibre ensemble, the Wishart ensemble and th…

math.PR2012★ 1 cited

Mixing time of Metropolis chain based on random transposition walk converging to multivariate Ewens distribution

Yunjiang Jiang

We prove sharp rates of convergence to the Ewens equilibrium distribution for a family of Metropolis algorithms based on the random transposition shuffle on the symmetric group, wi…

math.PR2011

Mixing time upper bound for the uniformized Rosenthal walk on the special orthogonal groups

Yunjiang Jiang

We prove that a uniformized variant of both the Rosenthal walk \cite{Rosenthal} and the Kac random walk \cite{Kac} on SO(n) mixes in $\cO(n^3)$ steps in total variation distance. T…

math.PR2011

Asymptotic spectral independence of Wigner ensembles

Yunjiang Jiang

We consider the joint distribution of eigenvalue clusters of the Wigner ensemble separated by macroscopic distances (i.e., on the same scale as the difference between the edges of…