Jingya Wang

Jingya Wang

Auto-generated profile, based on publicly available information

Jingya Wang

ShanghaiTech University, Shanghai, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
23 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
HLHongxia Li
Hongxia Li
ZCZhongyi Cai
Zhongyi Cai
JWJingya Wang
Jingya Wang
JTJiangnan Tang
Jiangnan Tang
Weiping DingWeiping Ding
Weiping Ding
YSYe Shi
Ye Shi
Federated learning is an emerging learning paradigm where multiple clients collaboratively train a machine learning model in a privacy-preserving manner. Personalized federated learning extends this paradigm to overcome heterogeneity across clients by learning personalized models. Recently, there have been some initial attempts to apply transformers to federated learning. However, the impacts of federated learning algorithms on self-attention have not yet been studied. In this article, we investigate this relationship and reveal that federated averaging (FedAvg) algorithms actually have a negative impact on self-attention in cases of data heterogeneity, which limits the capabilities of the transformer model in federated learning settings. To address this issue, we propose FedTP, a novel transformer-based federated learning framework that learns personalized self-attention for each client while aggregating the other parameters among the clients. Instead of using a vanilla personalization mechanism that maintains personalized self-attention layers of each client locally, we develop a learn-to-personalize mechanism to further encourage the cooperation among clients and to increase the scalability and generalization of FedTP. Specifically, we achieve this by learning a hypernetwork on the server that outputs the personalized projection matrices of self-attention layers to generate clientwise queries, keys, and values. Furthermore, we present the generalization bound for FedTP with the learn-to-personalize mechanism. Extensive experiments verify that FedTP with the learn-to-personalize mechanism yields state-of-the-art performance in the non-IID scenarios. Our code is available online https://github.com/zhyczy/FedTP.

17 May 2021 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
FLFang Liu
Fang Liu
JWJingya Wang
Jingya Wang
XTXu Tang
Xu Tang
JLJia Liu
Jia Liu
XZXiangrong Zhang
Xiangrong Zhang
LXLiang Xiao
Liang Xiao
Polarimetric synthetic aperture radar (PolSAR) image classification is one of the hottest issues in remote sensing, where studies on pixel-level information and relationship are of great significance. In this article, graph convolutional network (GCN) is employed to accomplish this pixel-level task benefiting from its excellent capability in structure exploration and information propagation between different pixels. To reduce the communication burden between various PolSAR pixels and high computational cost for the whole PolSAR image, an adaptive GCN (AdapGCN) consisting of pixel-centered subgraphs is proposed in this article. In the AdapGCN, a data-adaptive kernel and a spatial-adaptive kernel are introduced to, respectively, model data structure and spatial structure for PolSAR image. Moreover, a multiscale learning structure is integrated to further explore complicated relations between pixels. Extensive comparative evaluations validate the superiority of our new AdapGCN model for PolSAR image classification over a wide range of state-of-the-art methods on three challenging benchmarks.

23 June 2024
Verified
Conference Paper
Open access
YCYuyang Chen
Yuyang Chen
YWYiwen Wu
Yiwen Wu
JWJingya Wang
Jingya Wang
TWTao Wu
Tao Wu
XHXuming He
Xuming He
HGHao Geng
Hao Geng
Layout hotspot detection approaches are challenged by the time-to-market constraint and complex designs under rapid downscaling of technology nodes. Pattern matching and learning-based detectors are proposed as quick detection methods. These layout image-based detectors use images transformed from binary database files of layout like GDSII as their inputs. Italy leads to foreground information (e.g., metal polygons) loss and even distortion when shrinking the image size to fit the approach input. Moreover, plenty of irrelevant background information such as non-polygon pixels is also fed into the model, which hinders the fitting of the model and results in a waste of computational resources. In this work, for the first time, we propose a new layout hotspot detection paradigm, where hotspots are directly detected on binary database files by exploiting a hierarchical GDS semantic representation scheme and a well-designed pre-trained natural language processing (NLP) model. Compared with state-of-the-art (SOTA) works, the proposed detector achieves better results on both the ICCAD2012 metal layer benchmark and the more challenging ICCAD2020 via layer benchmark, which demonstrates the effectiveness and efficiency.

28 October 2024
Verified
Conference Paper
Open access
XHXiao Han
Xiao Han
YRYiming Ren
Yiming Ren
PCPeishan Cong
Peishan Cong
YSYujing Sun
Yujing Sun
JWJingya Wang
Jingya Wang
YMYuexin Ma
Yuexin Ma
Human gait recognition is crucial in multimedia, enabling identification through walking patterns without direct interaction, enhancing the integration across various media forms in real-world applications like smart homes, healthcare and non-intrusive security. LiDAR's ability to capture depth makes it pivotal for robotic perception and holds promise for real-world gait recognition. In this paper, based on a single LiDAR, we present the Hierarchical Multi-representation Feature Interaction Network (HMRNet) for robust gait recognition. Prevailing LiDAR-based gait datasets primarily derive from controlled settings with predefined trajectory, remaining a gap with real-world scenarios. To facilitate LiDAR-based gait recognition research, we introduce FreeGait, a comprehensive gait dataset from large-scale, unconstrained settings, enriched with multi-modal and varied 2D/3D data. Notably, our approach achieves state-of-the-art performance on prior dataset (SUSTech1K) and on FreeGait. https://4dvlab.github.io/project_page/FreeGait.html

4 January 2023 in Computer Vision and Image Understanding
Verified
Journal Article
Closed access
YDYiqun Duan
Yiqun Duan
ZWZhen Wang
Zhen Wang
YLYi Li
Yi Li
JWJingya Wang
Jingya Wang

27 November 2012 in IET Communications
Verified
Journal Article
Closed access
WZW. Zhang
W. Zhang
JWJ. Wang
J. Wang
HWH. Wang
H. Wang
YLY.Y. Liu
Y.Y. Liu
ZJZ. Jiang
Z. Jiang
SWS.Q. Wu
S.Q. Wu
Algebraic soft-decision decoding (ASD) of Reed–Solomon (RS) codes can obtain significant coding gain over the hard-decision decoding with polynomial complexity. Compared with other ASD algorithms, the low-complexity chase (LCC) decoding testing 2η test vectors has less computation complexity with similar or better coding gain. To reduce the latency of the interpolation, one major step of the LCC decoding, multiple interpolators can be applied and the pipelined architecture is usually adopted to make the throughput of the decoder higher. However, for application specific integrated circuit (ASIC) implementation and practical applications, the area and power consumption of the pipelined decoder are not preferable. This study proposes a modified serial LCC decoder architecture which reduces the power consumption and hardware requirement while keeping the shortest critical path as one adder, one multiplexer and one multiplier. As major contributions of this study, a novel re-encoder and erasure decoder block and an improved way to compute syndromes are proposed to reduce the whole latency of the decoder. For a (458, 410) RS code over Galois Field (GF)(210) with η=8, the hardware requirement and power consumption of the proposed LCC decoder are reduced by 23 and 25% than those of the common pipelined counterparts, respectively.