arXiv subjects

Da Xu

Publications and source records attributed to Da Xu.

At least 37 records · Page 2Linked to original sources

arXiv2023

Observation of a superradiant phase transition with emergent cat states

Superradiant phase transitions (SPTs) are important for understanding light-matter interactions at the quantum level, and play a central role in criticality-enhanced quantum sensing. So far, SPTs have been observed in driven-dissipative systems, but the emergent light fields did not show any nonclassical characteristic due to the presence of strong dissipation. Here we report an experimental demonstration of the SPT featuring the emergence of a highly nonclassical photonic field, realized with a resonator coupled to a superconducting qubit, implementing the quantum Rabi model. We fully characterize the light-matter state by Wigner matrix tomography. The measured matrix elements exhibit quantum interference intrinsic of a photonic mesoscopic superposition, and reveal light-matter entanglement

quant-ph↗

arXiv2023

On the cancellation-free antipode formula for the Malvenuto-Reutenauer Hopf Algebra

For the Malvenuto-Reutenauer Hopf algebra of permutations, we provide a cancellation-free antipode formula for any permutation of the form $ab1\cdots(b-1)(b+1)\cdots(a-1)(a+1)\cdots n$, which starts with the decreasing sequence $ab$ and ends with the increasing sequence $1\cdots(b-1)(b+1)\cdots(a-1)(a+1)\cdots n$, where $1\leq b<a\leq n$. As a consequence, we confirm two conjectures posed by Carolina Benedetti and Bruce E. Sagan.

math.CO↗

arXiv2023

Quantum control of a single magnon in a macroscopic spin system

Non-classical quantum states are the pivotal features of a quantum system that differs from its classical counterpart. However, the generation and coherent control of quantum states in a macroscopic spin system remain an outstanding challenge. Here we experimentally demonstrate the quantum control of a single magnon in a macroscopic spin system (i.e., 1~mm-diameter yttrium-iron-garnet sphere) coupled to a superconducting qubit via a microwave cavity. By tuning the qubit frequency {\it in situ} via the Autler-Townes effect, we manipulate this single magnon to generate its non-classical quantum states, including the single-magnon state and the superposition state of a single magnon and vacuum. Moreover, we confirm the deterministic generation of these non-classical states by Wigner tomography. Our experiment offers the first reported deterministic generation of the non-classical quantum states in a macroscopic spin system and paves a way to explore its promising applications in quantum engineering.

quant-ph↗

arXiv2023

Pretrained Embeddings for E-commerce Machine Learning: When it Fails and Why?

The use of pretrained embeddings has become widespread in modern e-commerce machine learning (ML) systems. In practice, however, we have encountered several key issues when using pretrained embedding in a real-world production system, many of which cannot be fully explained by current knowledge. Unfortunately, we find that there is a lack of a thorough understanding of how pre-trained embeddings work, especially their intrinsic properties and interactions with downstream tasks. Consequently, it becomes challenging to make interactive and scalable decisions regarding the use of pre-trained embeddings in practice. Our investigation leads to two significant discoveries about using pretrained embeddings in e-commerce applications. Firstly, we find that the design of the pretraining and downstream models, particularly how they encode and decode information via embedding vectors, can have a profound impact. Secondly, we establish a principled perspective of pre-trained embeddings via the lens of kernel analysis, which can be used to evaluate their predictability, interactively and scalably. These findings help to address the practical challenges we faced and offer valuable guidance for successful adoption of pretrained embeddings in real-world production. Our conclusions are backed by solid theoretical reasoning, benchmark experiments, as well as online testings.

cs.LG↗

arXiv2022

Reinforcement-learning-based control of convectively-unstable flows

This work reports the application of a model-free deep-reinforcement-learning-based (DRL) flow control strategy to suppress perturbations evolving in the 1-D linearised Kuramoto-Sivashinsky (KS) equation and 2-D boundary layer flows. The former is commonly used to model the disturbance developing in flat-plate boundary layer flows. These flow systems are convectively unstable, being able to amplify the upstream disturbance, and are thus difficult to control. The control action is implemented through a volumetric force at a fixed position and the control performance is evaluated by the reduction of perturbation amplitude downstream. We first demonstrate the effectiveness of the DRL-based control in the KS system subjected to a random upstream noise. The amplitude of perturbation monitored downstream is significantly reduced and the learnt policy is shown to be robust to both measurement and external noise. One of our focuses is to optimally place sensors in the DRL control using the gradient-free particle swarm optimisation algorithm. After the optimisation process for different numbers of sensors, a specific eight-sensor placement is found to yield the best control performance. The optimised sensor placement in the KS equation is applied directly to control 2-D Blasius boundary layer flows and can efficiently reduce the downstream perturbation energy. Via flow analyses, the control mechanism found by DRL is the opposition control. Besides, it is found that when the flow instability information is embedded in the reward function of DRL to penalise the instability, the control performance can be further improved in this convectively-unstable flow.

physics.flu-dyn↗

arXiv2022

Causal Structure Learning with Recommendation System

A fundamental challenge of recommendation systems (RS) is understanding the causal dynamics underlying users' decision making. Most existing literature addresses this problem by using causal structures inferred from domain knowledge. However, there are numerous phenomenons where domain knowledge is insufficient, and the causal mechanisms must be learnt from the feedback data. Discovering the causal mechanism from RS feedback data is both novel and challenging, since RS itself is a source of intervention that can influence both the users' exposure and their willingness to interact. Also for this reason, most existing solutions become inappropriate since they require data collected free from any RS. In this paper, we first formulate the underlying causal mechanism as a causal structural model and describe a general causal structure learning framework grounded in the real-world working mechanism of RS. The essence of our approach is to acknowledge the unknown nature of RS intervention. We then derive the learning objective from our framework and propose an augmented Lagrangian solver for efficient optimization. We conduct both simulation and real-world experiments to demonstrate how our approach compares favorably to existing solutions, together with the empirical analysis from sensitivity and ablation studies.

cs.IR↗

arXiv2022

Deep Learning Based Page Creation for Improving E-Commerce Organic Search Traffic

Organic search comprises a large portion of the total traffic for e-commerce companies. One approach to expand company's exposure on organic search channel lies on creating landing pages having broader coverage on customer intentions. In this paper, we present a transformer language model based organic channel page management system aiming at increasing prominence of the company's overall clicks on the channel. Our system successfully handles the creation and deployment process of millions of new landing pages. We show and discuss the real-world performances of state-of-the-art language representation learning method, and reveal how we find them as the production-optimal solutions.

cs.CL↗

arXiv2022

Pointwise error estimates of compact difference scheme for mixed-type time-fractional Burgers' equation

In this paper, based on the developed nonlinear fourth-order operator and method of order reduction, a novel fourth-order compact difference scheme is constructed for the mixed-type time-fractional Burgers' equation, from which $L_1$-discretization formula is employed to deal with the terms of fractional derivative, and the nonlinear convection term is discretized by nonlinear compact difference operator. Then a fully discrete compact difference scheme can be established by approximating spatial second-order derivative with classic compact difference formula. The convergence and stability are rigorously proved in the $L^{\infty}$-norm by the energy argument and mathematical induction. Finally, several numerical experiments are provided to verify the theoretical analysis.

math.NA↗

arXiv2022

A three-dimensional dynamic mode decomposition analysis of wind farm flow aerodynamics

High-fidelity large-eddy simulations are suitable to obtain insight into the complex flow dynamics in extended wind farms. In order to better understand these flow dynamics, we use dynamic mode decomposition (DMD) to analyze and reconstruct the flow field in large-scale numerically simulated wind farms by large-eddy simulations (LES). Different wind farm layouts are considered, and we find that a combination of horizontal and vertical staggering leads to improved wind farm performance compared to traditional horizontal staggering. We analyze the wind farm flows using the amplitude selection (AP) and sparsity-promoting (SP method) DMD approach. We find that the AP method tends to select modes with a small length scale and a high frequency, while the SP method selects large coherent structures with low frequency. The latter are somewhat reminiscent of modes obtained using proper orthogonal decomposition (POD). We find that a relatively limited number of SP-DMD modes is sufficient to accurately reconstruct the flow field in the entire wind farm, whereas the AP-DMD method requires more modes to achieve an accurate reconstruction. Thus, the SP-DMD method has a smaller performance loss compared to the AP-DMD method in terms of the reconstruction of the flow field.

physics.flu-dyn↗

arXiv2022

From Intervention to Domain Transportation: A Novel Perspective to Optimize Recommendation

The interventional nature of recommendation has attracted increasing attention in recent years. It particularly motivates researchers to formulate learning and evaluating recommendation as causal inference and data missing-not-at-random problems. However, few take seriously the consequence of violating the critical assumption of overlapping, which we prove can significantly threaten the validity and interpretation of the outcome. We find a critical piece missing in the current understanding of information retrieval (IR) systems: as interventions, recommendation not only affects the already observed data, but it also interferes with the target domain (distribution) of interest. We then rephrase optimizing recommendation as finding an intervention that best transports the patterns it learns from the observed domain to its intervention domain. Towards this end, we use domain transportation to characterize the learning-intervention mechanism of recommendation. We design a principled transportation-constraint risk minimization objective and convert it to a two-player minimax game. We prove the consistency, generalization, and excessive risk bounds for the proposed objective, and elaborate how they compare to the current results. Finally, we carry out extensive real-data and semi-synthetic experiments to demonstrate the advantage of our approach, and launch online testing with a real-world IR system.

cs.IR↗

arXiv2022

Towards the D-Optimal Online Experiment Design for Recommender Selection

Selecting the optimal recommender via online exploration-exploitation is catching increasing attention where the traditional A/B testing can be slow and costly, and offline evaluations are prone to the bias of history data. Finding the optimal online experiment is nontrivial since both the users and displayed recommendations carry contextual features that are informative to the reward. While the problem can be formalized via the lens of multi-armed bandits, the existing solutions are found less satisfactorily because the general methodologies do not account for the case-specific structures, particularly for the e-commerce recommendation we study. To fill in the gap, we leverage the \emph{D-optimal design} from the classical statistics literature to achieve the maximum information gain during exploration, and reveal how it fits seamlessly with the modern infrastructure of online inference. To demonstrate the effectiveness of the optimal designs, we provide semi-synthetic simulation studies with published code and data for reproducibility purposes. We then use our deployment example on Walmart.com to fully illustrate the practical insights and effectiveness of the proposed methods.

cs.IR↗

arXiv2022

Tutorial: Modern Theoretical Tools for Understanding and Designing Next-generation Information Retrieval System

In the relatively short history of machine learning, the subtle balance between engineering and theoretical progress has been proved critical at various stages. The most recent wave of AI has brought to the IR community powerful techniques, particularly for pattern recognition. While many benefits from the burst of ideas as numerous tasks become algorithmically feasible, the balance is tilting toward the application side. The existing theoretical tools in IR can no longer explain, guide, and justify the newly-established methodologies. The consequences can be suffering: in stark contrast to how the IR industry has envisioned modern AI making life easier, many are experiencing increased confusion and costs in data manipulation, model selection, monitoring, censoring, and decision making. This reality is not surprising: without handy theoretical tools, we often lack principled knowledge of the pattern recognition model's expressivity, optimization property, generalization guarantee, and our decision-making process has to rely on over-simplified assumptions and human judgments from time to time. Time is now to bring the community a systematic tutorial on how we successfully adapt those tools and make significant progress in understanding, designing, and eventually productionize impactful IR systems. We emphasize systematicity because IR is a comprehensive discipline that touches upon particular aspects of learning, causal inference analysis, interactive (online) decision-making, etc. It thus requires systematic calibrations to render the actual usefulness of the imported theoretical tools to serve IR problems, as they usually exhibit unique structures and definitions. Therefore, we plan this tutorial to systematically demonstrate our learning and successful experience of using advanced theoretical tools for understanding and designing IR systems.

cs.IR↗

arXiv2022

On the Advances and Challenges of Adaptive Online Testing

In recent years, the interest in developing adaptive solutions for online testing has grown significantly in the industry. While the advances related to this relative new technology have been developed in multiple domains, it lacks in the literature a systematic and complete treatment of the procedure that involves exploration, inference, and analysis. This short paper aims to develop a comprehensive understanding of adaptive online testing, including various building blocks and analytical results. We also address the latest developments, research directions, and challenges that have been less mentioned in the literature.

stat.ME↗

arXiv2022

Towards Robust Off-policy Learning for Runtime Uncertainty

Off-policy learning plays a pivotal role in optimizing and evaluating policies prior to the online deployment. However, during the real-time serving, we observe varieties of interventions and constraints that cause inconsistency between the online and offline settings, which we summarize and term as runtime uncertainty. Such uncertainty cannot be learned from the logged data due to its abnormality and rareness nature. To assert a certain level of robustness, we perturb the off-policy estimators along an adversarial direction in view of the runtime uncertainty. It allows the resulting estimators to be robust not only to observed but also unexpected runtime uncertainties. Leveraging this idea, we bring runtime-uncertainty robustness to three major off-policy learning methods: the inverse propensity score method, reward-model method, and doubly robust method. We theoretically justify the robustness of our methods to runtime uncertainty, and demonstrate their effectiveness using both the simulation and the real-world online experiments.

cs.LG↗

arXiv2022

Clutter Edges Detection Algorithms for Structured Clutter Covariance Matrices

This letter deals with the problem of clutter edge detection and localization in training data. To this end, the problem is formulated as a binary hypothesis test assuming that the ranks of the clutter covariance matrix are known, and adaptive architectures are designed based on the generalized likelihood ratio test to decide whether the training data within a sliding window contains a homogeneous set or two heterogeneous subsets. In the design stage, we utilize four different covariance matrix structures (i.e., Hermitian, persymmetric, symmetric, and centrosymmetric) to exploit the a priori information. Then, for the case of unknown ranks, the architectures are extended by devising a preliminary estimation stage resorting to the model order selection rules. Numerical examples based on both synthetic and real data highlight that the proposed solutions possess superior detection and localization performance with respect to the competitors that do not use any a priori information.

eess.SP↗

arXiv2021

Observation of magnon cross-Kerr effect in cavity magnonics

When there is a certain amount of field inhomogeneity, the biased ferrimagnetic crystal will exhibit the higher-order magnetostatic (HMS) mode in addition to the uniform-precession Kittel mode. In cavity magnonics, we show both experimentally and theoretically the cross-Kerr-type interaction between the Kittel mode and HMS mode. When the Kittel mode is driven to generate a certain number of excitations, the HMS mode displays a corresponding frequency shift and vice versa. The cross-Kerr effect is caused by an exchange interaction between these two spin-wave modes. Utilizing the cross-Kerr effect, we realize and integrate a multi-mode cavity magnonic system with only one yttrium iron garnet (YIG) sphere. Our results will bring new methods to magnetization dynamics studies and pave a way for novel cavity magnonic devices by including the magnetostatic mode-mode interaction as an operational degree of freedom.

quant-ph↗

arXiv2021

Ground-state cooling of multiple near-degenerate mechanical modes

We propose a general and experimentally feasible approach to realize simultaneous ground-state cooling of arbitrary number of near-degenerate, or even fully degenerate mechanical modes, overcoming the limit imposed by the formation of mechanical dark modes. Multiple optical modes are employed to provide different dissipation channels that prevent complete destructive interference of the cooling pathway, and thus eliminating the dark modes. The cooling rate and limit are explicitly specified, in which the distinguishability of the optical modes to the mechanical modes is found to be critical for an efficient cooling process. In a realistic multi-mode optomechanical system, ground-state cooling of all mechanical modes is demonstrated by sequentially introducing optical drives, proving the feasibility and scalability of the proposed scheme. The work may provide new insights in preparing and manipulating multiple quantum states in macroscopic systems.

quant-ph↗

arXiv2021

Rethinking Neural vs. Matrix-Factorization Collaborative Filtering: the Theoretical Perspectives

The recent work by Rendle et al. (2020), based on empirical observations, argues that matrix-factorization collaborative filtering (MCF) compares favorably to neural collaborative filtering (NCF), and conjectures the dot product's superiority over the feed-forward neural network as similarity function. In this paper, we address the comparison rigorously by answering the following questions: 1. what is the limiting expressivity of each model; 2. under the practical gradient descent, to which solution does each optimization path converge; 3. how would the models generalize under the inductive and transductive learning setting. Our results highlight the similar expressivity for the overparameterized NCF and MCF as kernelized predictors, and reveal the relation between their optimization paths. We further show their different generalization behaviors, where MCF and NCF experience specific tradeoff and comparison in the transductive and inductive collaborative filtering setting. Lastly, by showing a novel generalization result, we reveal the critical role of correcting exposure bias for model evaluation in the inductive setting. Our results explain some of the previously observed conflicts, and we provide synthetic and real-data experiments to shed further insights to this topic.

cs.IR↗