Alert button
Picture for Jian Xu

Jian Xu

Alert button

A Comprehensive Dynamic Simulation Framework for Coupled Neuromusculoskeletal-Exoskeletal Systems

Nov 04, 2023
Wei Jin, Jiaqi Liu, Qiwei Zhang, Xiaoxu Zhang, Qining Wang, Hongbin Fang, Jian Xu

The modeling and simulation of coupled neuromusculoskeletal-exoskeletal systems play a crucial role in human biomechanical analysis, as well as in the design and control of exoskeletons. However, conventional dynamic simulation frameworks have limitations due to their reliance on experimental data and their inability to capture comprehensive biomechanical signals and dynamic responses. To address these challenges, we introduce an optimization-based dynamic simulation framework that integrates a complete neuromusculoskeletal feedback loop, rigid-body dynamics, human-exoskeleton interaction, and foot-ground contact. Without relying on experimental measurements or empirical data, our framework employs a stepwise optimization process to determine muscle reflex parameters, taking into account multidimensional criteria. This allows the framework to generate a full range of kinematic and biomechanical signals, including muscle activations, muscle forces, joint torques, etc., which are typically challenging to measure experimentally. To validate the effectiveness of the framework, we compare the simulated results with experimental data obtained from a healthy subject wearing an exoskeleton while walking at different speeds (0.9, 1.0, and 1.1 m/s) and terrains (flat and uphill). The results demonstrate that our framework can effectively and accurately capture the qualitative differences in muscle activity associated with different functions, as well as the evolutionary patterns of muscle activity and kinematic signals under varying walking conditions. The simulation framework we propose has the potential to facilitate gait analysis and performance evaluation of coupled human-exoskeleton systems, as well as enable efficient and cost-effective testing of novel exoskeleton designs and control strategies.

* 50 pages, 11 figures, 4 tables 
Viaarxiv icon

Robust Representation Learning for Unified Online Top-K Recommendation

Oct 24, 2023
Minfang Lu, Yuchen Jiang, Huihui Dong, Qi Li, Ziru Xu, Yuanlin Liu, Lixia Wu, Haoyuan Hu, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng

Figure 1 for Robust Representation Learning for Unified Online Top-K Recommendation
Figure 2 for Robust Representation Learning for Unified Online Top-K Recommendation
Figure 3 for Robust Representation Learning for Unified Online Top-K Recommendation
Figure 4 for 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.

* 14 pages, 6 figures, submitted to ICDE 
Viaarxiv icon

Type-aware Decoding via Explicitly Aggregating Event Information for Document-level Event Extraction

Oct 16, 2023
Gang Zhao, Yidong Shi, Shudong Lu, Xinjie Yang, Guanting Dong, Jian Xu, Xiaocheng Gong, Si Li

Document-level event extraction (DEE) faces two main challenges: arguments-scattering and multi-event. Although previous methods attempt to address these challenges, they overlook the interference of event-unrelated sentences during event detection and neglect the mutual interference of different event roles during argument extraction. Therefore, this paper proposes a novel Schema-based Explicitly Aggregating~(SEA) model to address these limitations. SEA aggregates event information into event type and role representations, enabling the decoding of event records based on specific type-aware representations. By detecting each event based on its event type representation, SEA mitigates the interference caused by event-unrelated information. Furthermore, SEA extracts arguments for each role based on its role-aware representations, reducing mutual interference between different roles. Experimental results on the ChFinAnn and DuEE-fin datasets show that SEA outperforms the SOTA methods.

* Submitted to ICASSP 2024 
Viaarxiv icon

Data-driven mode shape selection and model-based vibration suppression of 3-RRR parallel manipulator with flexible actuation links

Oct 10, 2023
Dingxu Guo, Jian Xu, Shu Zhang

Figure 1 for Data-driven mode shape selection and model-based vibration suppression of 3-RRR parallel manipulator with flexible actuation links
Figure 2 for Data-driven mode shape selection and model-based vibration suppression of 3-RRR parallel manipulator with flexible actuation links
Figure 3 for Data-driven mode shape selection and model-based vibration suppression of 3-RRR parallel manipulator with flexible actuation links
Figure 4 for Data-driven mode shape selection and model-based vibration suppression of 3-RRR parallel manipulator with flexible actuation links

The mode shape function is difficult to determine in modeling manipulators with flexible links using the assumed mode method. In this paper, for a planar 3-RRR parallel manipulator with flexible actuation links, we provide a data-driven method to identify the mode shape of the flexible links and propose a model-based controller for the vibration suppression. By deriving the inverse kinematics of the studied mechanism in analytical form, the dynamic model is established by using the assumed mode method. To select the mode shape function, the software of multi-body system dynamics is used to simulate the dynamic behavior of the mechanism, and then the data-driven method which combines the DMD and SINDy algorithms is employed to identify the reasonable mode shape functions for the flexible links. To suppress the vibration of the flexible links, a state observer for the end-effector is constructed by a neural network, and the model-based control law is designed on this basis. In comparison with the model-free controller, the proposed controller with developed dynamic model has promising performance in terms of tracking accuracy and vibration suppression.

Viaarxiv icon

Neural Operator Variational Inference based on Regularized Stein Discrepancy for Deep Gaussian Processes

Sep 22, 2023
Jian Xu, Shian Du, Junmei Yang, Qianli Ma, Delu Zeng

Figure 1 for Neural Operator Variational Inference based on Regularized Stein Discrepancy for Deep Gaussian Processes
Figure 2 for Neural Operator Variational Inference based on Regularized Stein Discrepancy for Deep Gaussian Processes
Figure 3 for Neural Operator Variational Inference based on Regularized Stein Discrepancy for Deep Gaussian Processes
Figure 4 for Neural Operator Variational Inference based on Regularized Stein Discrepancy for Deep Gaussian Processes

Deep Gaussian Process (DGP) models offer a powerful nonparametric approach for Bayesian inference, but exact inference is typically intractable, motivating the use of various approximations. However, existing approaches, such as mean-field Gaussian assumptions, limit the expressiveness and efficacy of DGP models, while stochastic approximation can be computationally expensive. To tackle these challenges, we introduce Neural Operator Variational Inference (NOVI) for Deep Gaussian Processes. NOVI uses a neural generator to obtain a sampler and minimizes the Regularized Stein Discrepancy in L2 space between the generated distribution and true posterior. We solve the minimax problem using Monte Carlo estimation and subsampling stochastic optimization techniques. We demonstrate that the bias introduced by our method can be controlled by multiplying the Fisher divergence with a constant, which leads to robust error control and ensures the stability and precision of the algorithm. Our experiments on datasets ranging from hundreds to tens of thousands demonstrate the effectiveness and the faster convergence rate of the proposed method. We achieve a classification accuracy of 93.56 on the CIFAR10 dataset, outperforming SOTA Gaussian process methods. Furthermore, our method guarantees theoretically controlled prediction error for DGP models and demonstrates remarkable performance on various datasets. We are optimistic that NOVI has the potential to enhance the performance of deep Bayesian nonparametric models and could have significant implications for various practical applications

Viaarxiv icon

Double Normalizing Flows: Flexible Bayesian Gaussian Process ODEs Learning

Sep 17, 2023
Jian Xu, Shian Du, Junmei Yang, Xinghao Ding, John Paisley, Delu Zeng

Figure 1 for Double Normalizing Flows: Flexible Bayesian Gaussian Process ODEs Learning
Figure 2 for Double Normalizing Flows: Flexible Bayesian Gaussian Process ODEs Learning
Figure 3 for Double Normalizing Flows: Flexible Bayesian Gaussian Process ODEs Learning
Figure 4 for Double Normalizing Flows: Flexible Bayesian Gaussian Process ODEs Learning

Recently, Gaussian processes have been utilized to model the vector field of continuous dynamical systems. Bayesian inference for such models \cite{hegde2022variational} has been extensively studied and has been applied in tasks such as time series prediction, providing uncertain estimates. However, previous Gaussian Process Ordinary Differential Equation (ODE) models may underperform on datasets with non-Gaussian process priors, as their constrained priors and mean-field posteriors may lack flexibility. To address this limitation, we incorporate normalizing flows to reparameterize the vector field of ODEs, resulting in a more flexible and expressive prior distribution. Additionally, due to the analytically tractable probability density functions of normalizing flows, we apply them to the posterior inference of GP ODEs, generating a non-Gaussian posterior. Through these dual applications of normalizing flows, our model improves accuracy and uncertainty estimates for Bayesian Gaussian Process ODEs. The effectiveness of our approach is demonstrated on simulated dynamical systems and real-world human motion data, including tasks such as time series prediction and missing data recovery. Experimental results indicate that our proposed method effectively captures model uncertainty while improving accuracy.

Viaarxiv icon

CHORD: Category-level Hand-held Object Reconstruction via Shape Deformation

Aug 21, 2023
Kailin Li, Lixin Yang, Haoyu Zhen, Zenan Lin, Xinyu Zhan, Licheng Zhong, Jian Xu, Kejian Wu, Cewu Lu

Figure 1 for CHORD: Category-level Hand-held Object Reconstruction via Shape Deformation
Figure 2 for CHORD: Category-level Hand-held Object Reconstruction via Shape Deformation
Figure 3 for CHORD: Category-level Hand-held Object Reconstruction via Shape Deformation
Figure 4 for CHORD: Category-level Hand-held Object Reconstruction via Shape Deformation

In daily life, humans utilize hands to manipulate objects. Modeling the shape of objects that are manipulated by the hand is essential for AI to comprehend daily tasks and to learn manipulation skills. However, previous approaches have encountered difficulties in reconstructing the precise shapes of hand-held objects, primarily owing to a deficiency in prior shape knowledge and inadequate data for training. As illustrated, given a particular type of tool, such as a mug, despite its infinite variations in shape and appearance, humans have a limited number of 'effective' modes and poses for its manipulation. This can be attributed to the fact that humans have mastered the shape prior of the 'mug' category, and can quickly establish the corresponding relations between different mug instances and the prior, such as where the rim and handle are located. In light of this, we propose a new method, CHORD, for Category-level Hand-held Object Reconstruction via shape Deformation. CHORD deforms a categorical shape prior for reconstructing the intra-class objects. To ensure accurate reconstruction, we empower CHORD with three types of awareness: appearance, shape, and interacting pose. In addition, we have constructed a new dataset, COMIC, of category-level hand-object interaction. COMIC contains a rich array of object instances, materials, hand interactions, and viewing directions. Extensive evaluation shows that CHORD outperforms state-of-the-art approaches in both quantitative and qualitative measures. Code, model, and datasets are available at https://kailinli.github.io/CHORD.

* To be presented at ICCV 2023, Paris 
Viaarxiv icon

Multi-Scenario Ranking with Adaptive Feature Learning

Jun 29, 2023
Yu Tian, Bofang Li, Si Chen, Xubin Li, Hongbo Deng, Jian Xu, Bo Zheng, Qian Wang, Chenliang Li

Figure 1 for Multi-Scenario Ranking with Adaptive Feature Learning
Figure 2 for Multi-Scenario Ranking with Adaptive Feature Learning
Figure 3 for Multi-Scenario Ranking with Adaptive Feature Learning
Figure 4 for Multi-Scenario Ranking with Adaptive Feature Learning

Recently, Multi-Scenario Learning (MSL) is widely used in recommendation and retrieval systems in the industry because it facilitates transfer learning from different scenarios, mitigating data sparsity and reducing maintenance cost. These efforts produce different MSL paradigms by searching more optimal network structure, such as Auxiliary Network, Expert Network, and Multi-Tower Network. It is intuitive that different scenarios could hold their specific characteristics, activating the user's intents quite differently. In other words, different kinds of auxiliary features would bear varying importance under different scenarios. With more discriminative feature representations refined in a scenario-aware manner, better ranking performance could be easily obtained without expensive search for the optimal network structure. Unfortunately, this simple idea is mainly overlooked but much desired in real-world systems.Further analysis also validates the rationality of adaptive feature learning under a multi-scenario scheme. Moreover, our A/B test results on the Alibaba search advertising platform also demonstrate that Maria is superior in production environments.

* 10 pages, 
Viaarxiv icon

Personalized Federated Learning with Feature Alignment and Classifier Collaboration

Jun 20, 2023
Jian Xu, Xinyi Tong, Shao-Lun Huang

Figure 1 for Personalized Federated Learning with Feature Alignment and Classifier Collaboration
Figure 2 for Personalized Federated Learning with Feature Alignment and Classifier Collaboration
Figure 3 for Personalized Federated Learning with Feature Alignment and Classifier Collaboration
Figure 4 for Personalized Federated Learning with Feature Alignment and Classifier Collaboration

Data heterogeneity is one of the most challenging issues in federated learning, which motivates a variety of approaches to learn personalized models for participating clients. One such approach in deep neural networks based tasks is employing a shared feature representation and learning a customized classifier head for each client. However, previous works do not utilize the global knowledge during local representation learning and also neglect the fine-grained collaboration between local classifier heads, which limit the model generalization ability. In this work, we conduct explicit local-global feature alignment by leveraging global semantic knowledge for learning a better representation. Moreover, we quantify the benefit of classifier combination for each client as a function of the combining weights and derive an optimization problem for estimating optimal weights. Finally, extensive evaluation results on benchmark datasets with various heterogeneous data scenarios demonstrate the effectiveness of our proposed method. Code is available at https://github.com/JianXu95/FedPAC

* ICLR 2023, fix some typos and add the code link 
Viaarxiv icon

Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao

Jun 06, 2023
Jingyue Gao, Shuguang Han, Han Zhu, Siran Yang, Yuning Jiang, Jian Xu, Bo Zheng

Figure 1 for Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao
Figure 2 for Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao
Figure 3 for Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao
Figure 4 for Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao

Click-Through Rate (CTR) prediction serves as a fundamental component in online advertising. A common practice is to train a CTR model on advertisement (ad) impressions with user feedback. Since ad impressions are purposely selected by the model itself, their distribution differs from the inference distribution and thus exhibits sample selection bias (SSB) that affects model performance. Existing studies on SSB mainly employ sample re-weighting techniques which suffer from high variance and poor model calibration. Another line of work relies on costly uniform data that is inadequate to train industrial models. Thus mitigating SSB in industrial models with a uniform-data-free framework is worth exploring. Fortunately, many platforms display mixed results of organic items (i.e., recommendations) and sponsored items (i.e., ads) to users, where impressions of ads and recommendations are selected by different systems but share the same user decision rationales. Based on the above characteristics, we propose to leverage recommendations samples as a free lunch to mitigate SSB for ads CTR model (Rec4Ad). After elaborating data augmentation, Rec4Ad learns disentangled representations with alignment and decorrelation modules for enhancement. When deployed in Taobao display advertising system, Rec4Ad achieves substantial gains in key business metrics, with a lift of up to +6.6\% CTR and +2.9\% RPM.

Viaarxiv icon