Searcharxiv⌕ Search

arXiv subjects

Xiao Zhang

Publications and source records attributed to Xiao Zhang.

At least 325 records · Page 18Linked to original sources

Reinforcement Re-ranking with 2D Grid-based Recommendation Panels

Modern recommender systems usually present items as a streaming, one-dimensional ranking list. Recently there is a trend in e-commerce that the recommended items are organized grid-based panels with two dimensions where users can view the items in both vertical and horizontal directions. Presenting items in grid-based result panels poses new challenges to recommender systems because existing models are all designed to output sequential lists while the slots in a grid-based panel have no explicit order. Directly converting the item rankings into grids (e.g., pre-defining an order on the slots) overlooks the user-specific behavioral patterns on grid-based panels and inevitably hurts the user experiences. To address this issue, we propose a novel Markov decision process (MDP) to place the items in 2D grid-based result panels at the final re-ranking stage of the recommender systems. The model, referred to as Panel-MDP, takes an initial item ranking from the early stages as the input. Then, it defines \emph{the MDP discrete time steps as the ranks in the initial ranking list, and the actions as the prediction of the user-item preference and the selection of the slots}. At each time step, Panel-MDP sequentially executes two sub-actions: first deciding whether the current item in the initial ranking list is preferred by the user; then selecting a slot for placing the item if preferred, or skipping the item otherwise. The process is continued until all of the panel slots are filled. The reinforcement learning algorithm of PPO is employed to implement and learn the parameters in the Panel-MDP. Simulation and experiments on a dataset collected from a widely-used e-commerce app demonstrated the superiority of Panel-MDP in terms of recommending 2D grid-based result panels.

cs.IR↗

What Distributions are Robust to Indiscriminate Poisoning Attacks for Linear Learners?

We study indiscriminate poisoning for linear learners where an adversary injects a few crafted examples into the training data with the goal of forcing the induced model to incur higher test error. Inspired by the observation that linear learners on some datasets are able to resist the best known attacks even without any defenses, we further investigate whether datasets can be inherently robust to indiscriminate poisoning attacks for linear learners. For theoretical Gaussian distributions, we rigorously characterize the behavior of an optimal poisoning attack, defined as the poisoning strategy that attains the maximum risk of the induced model at a given poisoning budget. Our results prove that linear learners can indeed be robust to indiscriminate poisoning if the class-wise data distributions are well-separated with low variance and the size of the constraint set containing all permissible poisoning points is also small. These findings largely explain the drastic variation in empirical attack performance of the state-of-the-art poisoning attacks on linear learners across benchmark datasets, making an important initial step towards understanding the underlying reasons some learning tasks are vulnerable to data poisoning attacks.

cs.LG↗

How to Fine-tune the Model: Unified Model Shift and Model Bias Policy Optimization

Designing and deriving effective model-based reinforcement learning (MBRL) algorithms with a performance improvement guarantee is challenging, mainly attributed to the high coupling between model learning and policy optimization. Many prior methods that rely on return discrepancy to guide model learning ignore the impacts of model shift, which can lead to performance deterioration due to excessive model updates. Other methods use performance difference bound to explicitly consider model shift. However, these methods rely on a fixed threshold to constrain model shift, resulting in a heavy dependence on the threshold and a lack of adaptability during the training process. In this paper, we theoretically derive an optimization objective that can unify model shift and model bias and then formulate a fine-tuning process. This process adaptively adjusts the model updates to get a performance improvement guarantee while avoiding model overfitting. Based on these, we develop a straightforward algorithm USB-PO (Unified model Shift and model Bias Policy Optimization). Empirical results show that USB-PO achieves state-of-the-art performance on several challenging benchmark tasks.

cs.LG↗

Reward Imputation with Sketching for Contextual Batched Bandits

Contextual batched bandit (CBB) is a setting where a batch of rewards is observed from the environment at the end of each episode, but the rewards of the non-executed actions are unobserved, resulting in partial-information feedback. Existing approaches for CBB often ignore the rewards of the non-executed actions, leading to underutilization of feedback information. In this paper, we propose an efficient approach called Sketched Policy Updating with Imputed Rewards (SPUIR) that completes the unobserved rewards using sketching, which approximates the full-information feedbacks. We formulate reward imputation as an imputation regularized ridge regression problem that captures the feedback mechanisms of both executed and non-executed actions. To reduce time complexity, we solve the regression problem using randomized sketching. We prove that our approach achieves an instantaneous regret with controllable bias and smaller variance than approaches without reward imputation. Furthermore, our approach enjoys a sublinear regret bound against the optimal policy. We also present two extensions, a rate-scheduled version and a version for nonlinear rewards, making our approach more practical. Experimental results show that SPUIR outperforms state-of-the-art baselines on synthetic, public benchmark, and real-world datasets.

cs.LG↗

Handling Data Heterogeneity in Federated Learning via Knowledge Distillation and Fusion

Federated learning (FL) supports distributed training of a global machine learning model across multiple devices with the help of a central server. However, data heterogeneity across different devices leads to the client model drift issue and results in model performance degradation and poor model fairness. To address the issue, we design Federated learning with global-local Knowledge Fusion (FedKF) scheme in this paper. The key idea in FedKF is to let the server return the global knowledge to be fused with the local knowledge in each training round so that the local model can be regularized towards the global optima. Therefore, the client model drift issue can be mitigated. In FedKF, we first propose the active-inactive model aggregation technique that supports a precise global knowledge representation. Then, we propose a data-free knowledge distillation (KD) approach to enable each client model to learn the global knowledge (embedded in the global model) while each client model can still learn the local knowledge (embedded in the local dataset) simultaneously, thereby realizing the global-local knowledge fusion process. The theoretical analysis and intensive experiments demonstrate the superiority of FedKF over previous solutions.

cs.LG↗

Structural Adversarial Objectives for Self-Supervised Representation Learning

Within the framework of generative adversarial networks (GANs), we propose objectives that task the discriminator for self-supervised representation learning via additional structural modeling responsibilities. In combination with an efficient smoothness regularizer imposed on the network, these objectives guide the discriminator to learn to extract informative representations, while maintaining a generator capable of sampling from the domain. Specifically, our objectives encourage the discriminator to structure features at two levels of granularity: aligning distribution characteristics, such as mean and variance, at coarse scales, and grouping features into local clusters at finer scales. Operating as a feature learner within the GAN framework frees our self-supervised system from the reliance on hand-crafted data augmentation schemes that are prevalent across contrastive representation learning methods. Across CIFAR-10/100 and an ImageNet subset, experiments demonstrate that equipping GANs with our self-supervised objectives suffices to produce discriminators which, evaluated in terms of representation learning, compete with networks trained by contrastive learning approaches.

cs.CV↗

Electronic and optical properties of 4H Si from first principles

The cubic polytype of silicon (Si) is the most commercialized semiconductor material and finds applications in numerous electronic and optoelectronic devices such as solar cells. However, recent reports on the synthesis of the hexagonal 4H Si polytype have attracted the attention of the scientific community to understand its functional properties. Here we report the electronic, vibrational, and optical properties of the 4H Si polytype obtained with predictive first-principles calculations. We find that, compared to the cubic polytype, 4H Si shows a slightly narrower indirect gap by $\sim$ 0.05 eV. By calculating its direct and phonon-assisted optical spectra, we show that 4H Si exhibits a stronger absorption coefficient than cubic Si across the visible and IR spectral regions. We further evaluate the short-circuit current density of textured thin-films, and we demonstrate that 4H Si can achieve the same short-circuit current density for a five times thinner film compared to the cubic polytype. Our work demonstrates the advantages of 4H Si for thin-film silicon-based solar-cell applications.

cond-mat.mtrl-sci↗

PINF: Continuous Normalizing Flows for Physics-Constrained Deep Learning

The normalization constraint on probability density poses a significant challenge for solving the Fokker-Planck equation. Normalizing Flow, an invertible generative model leverages the change of variables formula to ensure probability density conservation and enable the learning of complex data distributions. In this paper, we introduce Physics-Informed Normalizing Flows (PINF), a novel extension of continuous normalizing flows, incorporating diffusion through the method of characteristics. Our method, which is mesh-free and causality-free, can efficiently solve high dimensional time-dependent and steady-state Fokker-Planck equations.

cs.LG↗

Global Controllability Criteria and Motion Planning of Regular Affine Systems With Drifts

In this article, we give a condition for the global controllability of affine nonlinear control systems with drifts on Euclidean spaces. Under regularity assumptions, the condition is necessary and sufficient in the codimension-1 and codimension-2 cases, and holds for systems of higher codimensions under mild restrictions. We then investigate motion planning problems for codimension-1 affine systems, and give proof of the global existence of the lift to control curves for certain drifted systems using the homotopy continuation method.

math.OC↗

Real-Time Joint Simulation of LiDAR Perception and Motion Planning for Automated Driving

Real-time perception and motion planning are two crucial tasks for autonomous driving. While there are many research works focused on improving the performance of perception and motion planning individually, it is still not clear how a perception error may adversely impact the motion planning results. In this work, we propose a joint simulation framework with LiDAR-based perception and motion planning for real-time automated driving. Taking the sensor input from the CARLA simulator with additive noise, a LiDAR perception system is designed to detect and track all surrounding vehicles and to provide precise orientation and velocity information. Next, we introduce a new collision bound representation that relaxes the communication cost between the perception module and the motion planner. A novel collision checking algorithm is implemented using line intersection checking that is more efficient for long distance range in comparing to the traditional method of occupancy grid. We evaluate the joint simulation framework in CARLA for urban driving scenarios. Experiments show that our proposed automated driving system can execute at 25 Hz, which meets the real-time requirement. The LiDAR perception system has high accuracy within 20 meters when evaluated with the ground truth. The motion planning results in consistent safe distance keeping when tested in CARLA urban driving scenarios.

cs.RO↗

Sarrus-inspired Deployable Polyhedral Mechanisms

Deployable polyhedral mechanisms (DPMs) have witnessed flourishing growth in recent years because of their potential applications in robotics, space exploration, structure engineering, etc. This paper firstly presents the construction, mobility and kinematics of a family of Sarrus-inspired deployable polyhedral mechanisms. By carrying out expansion operation and implanting Sarrus linkages along the straight-line motion paths, deployable tetrahedral, cubic and dodecahedral mechanisms are identified and constructed following tetrahedral, octahedral and icosahedral symmetry, respectively. Three paired transformations with synchronized radial motion between Platonic and Archimedean polyhedrons are revealed, and their significant symmetric properties are perfectly remained in each work configuration. Subsequently, with assistant of equivalent prismatic joints, the equivalent analysis strategy for mobility of multiloop polyhedral mechanisms is proposed to significantly simplify the calculation process. This paper hence presents the construction method and equivalent analysis of the Sarrus-inspired DPMs that are not only valuable in theoretical investigation, but also have great potential in practical applications such as mechanical metamaterials, deployable architectures and space exploration.

cs.RO↗

Uncovering ChatGPT's Capabilities in Recommender Systems

The debut of ChatGPT has recently attracted the attention of the natural language processing (NLP) community and beyond. Existing studies have demonstrated that ChatGPT shows significant improvement in a range of downstream NLP tasks, but the capabilities and limitations of ChatGPT in terms of recommendations remain unclear. In this study, we aim to conduct an empirical analysis of ChatGPT's recommendation ability from an Information Retrieval (IR) perspective, including point-wise, pair-wise, and list-wise ranking. To achieve this goal, we re-formulate the above three recommendation policies into a domain-specific prompt format. Through extensive experiments on four datasets from different domains, we demonstrate that ChatGPT outperforms other large language models across all three ranking policies. Based on the analysis of unit cost improvements, we identify that ChatGPT with list-wise ranking achieves the best trade-off between cost and performance compared to point-wise and pair-wise ranking. Moreover, ChatGPT shows the potential for mitigating the cold start problem and explainable recommendation. To facilitate further explorations in this area, the full code and detailed original results are open-sourced at https://github.com/rainym00d/LLM4RS.

cs.IR↗

HyperBandit: Contextual Bandit with Hypernewtork for Time-Varying User Preferences in Streaming Recommendation

In real-world streaming recommender systems, user preferences often dynamically change over time (e.g., a user may have different preferences during weekdays and weekends). Existing bandit-based streaming recommendation models only consider time as a timestamp, without explicitly modeling the relationship between time variables and time-varying user preferences. This leads to recommendation models that cannot quickly adapt to dynamic scenarios. To address this issue, we propose a contextual bandit approach using hypernetwork, called HyperBandit, which takes time features as input and dynamically adjusts the recommendation model for time-varying user preferences. Specifically, HyperBandit maintains a neural network capable of generating the parameters for estimating time-varying rewards, taking into account the correlation between time features and user preferences. Using the estimated time-varying rewards, a bandit policy is employed to make online recommendations by learning the latent item contexts. To meet the real-time requirements in streaming recommendation scenarios, we have verified the existence of a low-rank structure in the parameter matrix and utilize low-rank factorization for efficient training. Theoretically, we demonstrate a sublinear regret upper bound against the best policy. Extensive experiments on real-world datasets show that the proposed HyperBandit consistently outperforms the state-of-the-art baselines in terms of accumulated rewards.

cs.IR↗

KuaiSAR: A Unified Search And Recommendation Dataset

The confluence of Search and Recommendation (S&R) services is vital to online services, including e-commerce and video platforms. The integration of S&R modeling is a highly intuitive approach adopted by industry practitioners. However, there is a noticeable lack of research conducted in this area within academia, primarily due to the absence of publicly available datasets. Consequently, a substantial gap has emerged between academia and industry regarding research endeavors in joint optimization using user behavior data from both S&R services. To bridge this gap, we introduce the first large-scale, real-world dataset KuaiSAR of integrated Search And Recommendation behaviors collected from Kuaishou, a leading short-video app in China with over 350 million daily active users. Previous research in this field has predominantly employed publicly available semi-synthetic datasets and simulated, with artificially fabricated search behaviors. Distinct from previous datasets, KuaiSAR contains genuine user behaviors, including the occurrence of each interaction within either search or recommendation service, and the users' transitions between the two services. This work aids in joint modeling of S&R, and utilizing search data for recommender systems (and recommendation data for search engines). Furthermore, due to the various feedback labels associated with user-video interactions, KuaiSAR also supports a broad range of tasks, including intent recommendation, multi-task learning, and modeling of long sequential multi-behavioral patterns. We believe this dataset will serve as a catalyst for innovative research and bridge the gap between academia and industry in understanding the S&R services in practical, real-world applications.

cs.IR↗

Upgrading Urban Water Storage System: Achieving Water Conservation, Power Generation, Carbon Reduction, and Water Quality Enhancement

Beijing is a megacity with a population of over 20 million. It has a massive demand for water and electricity and is responsible for achieving carbon neutrality. However, Beijing is in a highly arid region, and its local electricity production supply is less than 30% of the demand. The city's carbon neutrality goal also faces enormous challenges. To address these problems, this paper proposes a plan to cover the Beijing area's surface reservoirs and water channels with solar panels. The results show that the plan is expected to save an average of 383 million m3 of water per year (which can meet the annual water needs of 2.13 million households), generate 72.6 billion kWh of electricity (which can meet the annual electricity needs of 25.23 million households), reduce carbon dioxide emissions by 6.84 billion kg (equivalent to the annual carbon dioxide absorption of 3.1 billion mature trees), and reduce the concentration of one carcinogenic substance, microcystin, by 97.3%, while also addressing the issue of bromate. The results strongly suggest the potential social and economic value of using solar panels to cover surface reservoirs and water channels. Field control experiments and related research should be actively promoted.

physics.soc-ph↗

Molecular environment of the thermal composite supernova remnant G352.7$-$0.1

Galactic supernova remnants (SNRs) play an important role in our understanding of supernovae and their feedback on the interstellar environment. SNR G352.7$-$0.1 is special for its thermal composite morphology and double-ring structure. We have performed spectroscopic mapping in $^{12}$CO and $^{13}$CO $J=2$-1 lines toward G352.7$-$0.1 with the Atacama Pathfinder Experiment telescope. Broad $^{12}$CO lines are found in the northeastern ring at a local-standard-of-rest velocity range of $\sim-50$-$-30$ km s$^{-1}$, suggesting that the remnant is interacting with molecular clouds (MCs) at $\sim-51$ km s$^{-1}$. Thus, we adopt a distance of $\sim10.5$ kpc for this SNR. The momentum and kinetic energy of the shocked gas along the line of sight are estimated to be $\sim10^2{\rm M_{sun}}$ km s$^{-1}$ and $\sim10^{46}$ erg, respectively. We also find an expanding structure around the remnant, which is possibly related to the wind-blown bubble of the progenitor star. From the Fermi-LAT data in an energy range of 0.1-500 GeV, we find no gamma-ray counterparts of G352.7$-$0.1.

astro-ph.HE↗

Controllable Multi-Objective Re-ranking with Policy Hypernetworks

Multi-stage ranking pipelines have become widely used strategies in modern recommender systems, where the final stage aims to return a ranked list of items that balances a number of requirements such as user preference, diversity, novelty etc. Linear scalarization is arguably the most widely used technique to merge multiple requirements into one optimization objective, by summing up the requirements with certain preference weights. Existing final-stage ranking methods often adopt a static model where the preference weights are determined during offline training and kept unchanged during online serving. Whenever a modification of the preference weights is needed, the model has to be re-trained, which is time and resources inefficient. Meanwhile, the most appropriate weights may vary greatly for different groups of targeting users or at different time periods (e.g., during holiday promotions). In this paper, we propose a framework called controllable multi-objective re-ranking (CMR) which incorporates a hypernetwork to generate parameters for a re-ranking model according to different preference weights. In this way, CMR is enabled to adapt the preference weights according to the environment changes in an online manner, without retraining the models. Moreover, we classify practical business-oriented tasks into four main categories and seamlessly incorporate them in a new proposed re-ranking model based on an Actor-Evaluator framework, which serves as a reliable real-world testbed for CMR. Offline experiments based on the dataset collected from Taobao App showed that CMR improved several popular re-ranking models by using them as underlying models. Online A/B tests also demonstrated the effectiveness and trustworthiness of CMR.

cs.IR↗

Anomalous fractal scaling in two-dimensional electric networks

Much of the qualitative nature of physical systems can be predicted from the way it scales with system size. Contrary to the continuum expectation, we observe a profound deviation from logarithmic scaling in the impedance of a two-dimensional $LC$ circuit network. We find this anomalous impedance contribution to sensitively depend on the number of nodes $N$ in a curious erratic manner, and experimentally demonstrate its robustness against perturbations from the contact and parasitic impedance of individual components. This impedance anomaly is traced back to a generalized resonance condition reminiscent of the Harper's equation for electronic lattice transport in a magnetic field, even though our circuit network does not involve magnetic translation symmetry. It exhibits an emergent fractal parametric structure of anomalous impedance peaks for different $N$ that cannot be reconciled with continuum theory and does not correspond to regular waveguide resonant behavior. This anomalous fractal scaling extends to the transport properties of generic systems described by a network Laplacian whenever a resonance frequency scale is simultaneously present.

cond-mat.mes-hall↗