Jie Ren

Jie Ren

Auto-generated profile, based on publicly available information

Jie Ren

School of Computer Science, Shanghai Jiao Tong University, Shanghai, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2019
Verified
Conference Paper
Closed access
RCRunjin Chen
Runjin Chen
HCHao Chen
Hao Chen
GHGe Huang
Ge Huang
JRJie Ren
Jie Ren
QZQuanshi Zhang
Quanshi Zhang

12 January 2024 in Machine Intelligence Research
Verified
Journal Article
Closed access
PDF file
HZHuilin Zhou
Huilin Zhou
JRJie Ren
Jie Ren
HDHuiqi Deng
Huiqi Deng
XCXu Cheng
Xu Cheng
JZJinpeng Zhang
Jinpeng Zhang
QZQuanshi Zhang
Quanshi Zhang

16 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
RCRui Cao
Rui Cao
YWYihao Wang
Yihao Wang
YLYuxin Liang
Yuxin Liang
LGLing Gao
Ling Gao
JZJie Zheng
Jie Zheng
Zheng WangZheng Wang
Zheng Wang
Contrastive learning is emerging as a powerful technique for extracting knowledge from unlabeled data. This technique requires a balanced mixture of two ingredients: positive (similar) and negative (dissimilar) samples. This is typically achieved by maintaining a queue of negative samples during training. Prior works in the area typically uses a fixed-length negative sample queue, but how the negative sample size affects the model performance remains unclear. The opaque impact of the number of negative samples on performance when employing contrastive learning aroused our in-depth exploration. This paper presents a momentum contrastive learning model with negative sample queue for sentence embedding, namely MoCoSE. We add the prediction layer to the online branch to make the model asymmetric and together with EMA update mechanism of the target branch to prevent the model from collapsing. We define a maximum traceable distance metric, through which we learn to what extent the text contrastive learning benefits from the historical information of negative samples. Our experiments find that the best results are obtained when the maximum traceable distance is at a certain range, demonstrating that there is an optimal range of historical information for a negative sample queue. We evaluate the proposed unsupervised MoCoSE on the semantic text similarity (STS) task and obtain an average Spearman's correlation of $77.27\%$. Source code is available at https://github.com/xbdxwyh/mocose.

1 January 2023 in Mechatronic Systems and Control
Verified
Journal Article
Open access
PDF file
PCpu cuiping
pu cuiping
JRJie Ren
Jie Ren
YZYouwen Zhai
Youwen Zhai
YZYuhang Zhang
Yuhang Zhang
The wheeled mobile robot is a typical uncertain robot system,which has typical nonholonomic characteristics and underdrivecharacteristics with different input and output dimensions.

18 May 2022 in arXiv
Verified
Preprint
Open access
PDF file
XXXiaobo Xia
Xiaobo Xia
WYWenhao Yang
Wenhao Yang
JRJie Ren
Jie Ren
YLYewen Li
Yewen Li
YZYibing Zhan
Yibing Zhan
TLTongliang Liu
Tongliang Liu
Pluralistic image completion focuses on generating both visually realistic and diverse results for image completion. Prior methods enjoy the empirical successes of this task. However, their used constraints for pluralistic image completion are argued to be not well interpretable and unsatisfactory from two aspects. First, the constraints for visual reality can be weakly correlated to the objective of image completion or even redundant. Second, the constraints for diversity are designed to be task-agnostic, which causes the constraints to not work well. In this paper, to address the issues, we propose an end-to-end probabilistic method. Specifically, we introduce a unified probabilistic graph model that represents the complex interactions in image completion. The entire procedure of image completion is then mathematically divided into several sub-procedures, which helps efficient enforcement of constraints. The sub-procedure directly related to pluralistic results is identified, where the interaction is established by a Gaussian mixture model (GMM). The inherent parameters of GMM are task-related, which are optimized adaptively during training, while the number of its primitives can control the diversity of results conveniently. We formally establish the effectiveness of our method and demonstrate it with comprehensive experiments.

15 August 2025 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
QZQuanshi Zhang
Quanshi Zhang
HZHao Zhang
Hao Zhang
YCYiting Chen
Yiting Chen
QRQihan Ren
Qihan Ren
JRJie Ren
Jie Ren
LXLiyao Xiang
Liyao Xiang
This paper focuses on the problem of preventing information leakage in neural networks, i.e., assuming that attackers have obtained intermediate-layer features of a neural network, and preventing attackers from inverting these features to the input with private information. We propose a generic method to slightly revise each arbitrary traditional neural network into a multiary-valued rotation-equivariant neural network (RENN) for preventing information leakage. Specifically, we convert real-valued features in the network into multi-ary features, and each element in the feature vector is a multi-ary number. We hide the input information into a certain phase of the multi-ary feature, and rotate the multi-ary feature for attribute obfuscation in the encryption process. The rotation axis and angle can be considered as the private key. In this way, even when attackers have obtained network parameters and intermediate-layer features, they still cannot extract input information without knowing the rotation information. More crucially, the encryption operation does not damage the spatial correlations between features, so that the encrypted features can be easily processed by convolution operations in the neural network without difficulties. In order to implement successful encryption and decryption, the RENN is designed to satisfy the rotation equivariance property. To this end, we propose a set of rules to revise classic operations in the neural network to ensure the rotation equivariance property. Besides, we prove that the $d$-ary RENN is downward compatible with the $d^{\prime }$-ary RENN when $d^{\prime }< d$. In experiments, the RENN significantly boosts the capacity of preventing information leakage, yet with only mild degradation of classification accuracy, compared to traditional neural networks. Besides, the computational cost is much less than the homomorphic encryption.