Jieming Ke

Jieming Ke

Auto-generated profile, based on publicly available information

Jieming Ke

State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
9 January 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JWJimin Wang
Jimin Wang
JKJieming Ke
Jieming Ke
JZJi-Feng Zhang
Ji-Feng Zhang
This paper investigates the differentially private bipartite consensus problem over signed networks. To solve this problem, a new algorithm is proposed by adding noises with time-varying variances to the cooperative-competitive interactive information. In order to achieve the privacy protection, the variances of the added noises are allowed to increase, which are substantially different from the existing works. In addition, the variances of the added noises can be either decaying or constant. By using a time-varying step-size based on the stochastic approximation method, we show that the algorithm converges in mean-square and almost-surely even with increasing privacy noises. We further develop a method to design the step-size and the noise parameter, affording the algorithm to achieve the average bipartite consensus with the desired accuracy and the predefined differential privacy level. Moreover, we give the mean-square and almost-sure convergence rates of the algorithm, and the privacy level with different forms of the privacy noises. We also reveal the trade-off between the accuracy and the privacy, and extend the results to local differential privacy. Finally, a numerical example verifies the theoretical results and demonstrates the algorithm's superiority against existing methods.

13 May 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JKJieming Ke
Jieming Ke
YWYing Wang
Ying Wang
YZYanlong Zhao
Yanlong Zhao
JZJi-Feng Zhang
Ji-Feng Zhang
This paper investigates the online identification problem of binary-valued moving average systems. A stochastic approximation-based algorithm without projections or truncations is proposed. To analyze the convergence property of the algorithm, the distribution tail of the parameter estimate is proved to be exponentially convergent through an auxiliary stochastic process. Under uniform persistent excitations, the almost sure and mean square convergence of the algorithm is obtained. When the step-size coefficient is properly selected, the almost sure and mean square convergence rates are proved to reach $ O(\sqrt{\ln \ln k/k})$ and $ O(1/k)$ respectively, where $ k$ is the sample size. A numerical example is given to demonstrate the effectiveness of the proposed algorithm and theoretical results.

21 October 2024 in Systems & Control Letters
Verified
Journal Article
Closed access
JKJieming Ke
Jieming Ke
YZYanlong Zhao
Yanlong Zhao
JZJi-Feng Zhang
Ji-Feng Zhang

30 January 2023 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
JKJieming Ke
Jieming Ke
JWJimin Wang
Jimin Wang
JZJi-Feng Zhang
Ji-Feng Zhang
This paper investigates the differentiated output-based privacy-preserving average consensus problem over digraphs. A new stochastic obfuscation algorithm is proposed to achieve better privacy-preserving effect. When the output messages for at least one out-neighbour are not leaked, the algorithm can be designed to achieve any pre-given consensus accuracy and privacy-preserving level simultaneously by properly selecting the private weights. Even if all the output messages are leaked, the algorithm can still ensure that each agent’s initial state is protected to a certain extent. The mean square convergence of the algorithm is proved. The efficiency of the algorithm is verified by a numerical example.

11 April 2025 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
JKJieming Ke
Jieming Ke
XLXiaodong Lu
Xiaodong Lu
YZYanlong Zhao
Yanlong Zhao
JZJi-Feng Zhang
Ji-Feng Zhang
The paper investigates the distributed estimation problem under low data rate communications. Based on the signal-comparison (SC) consensus protocol under binary-valued communications, a new consensus+innovations type distributed estimation algorithm is proposed. First, the high-dimensional estimates are compressed into binary-valued messages by using a periodic compressive strategy, dithering noises, and a sign function. Next, based on the dithering noises and expanding triggering thresholds, a new stochastic event-triggered mechanism is proposed to reduce the communication frequency. Then, a modified SC consensus protocol is applied to fuse the neighborhood information. Finally, a stochastic approximation estimation algorithm is used to process innovations. The proposed SC-based algorithm has the advantages of high effectiveness and low communication cost. For the effectiveness, the estimates of the SC-based algorithm converge to the true value in the almost sure and mean square sense, and a polynomial almost sure convergence rate is also obtained. For the communication cost, the local and global average data rates decay to zero at a polynomial rate. The trade-off between the convergence rate and the communication cost is established through event-triggered coefficients. A better convergence rate can be achieved by decreasing event-triggered coefficients, while a lower communication cost can be achieved by increasing event-triggered coefficients. A simulation example is given to demonstrate the theoretical results.

3 February 2026 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JKJieming Ke
Jieming Ke
JWJimin Wang
Jimin Wang
JZJi-Feng Zhang
Ji-Feng Zhang
This paper focuses on the privacy-preserving distributed estimation problem with a limited data rate, where the observations are the sensitive information. Specifically, a binary-valued quantizer-based privacy-preserving distributed estimation algorithm is developed, which improves the algorithm's privacy-preserving capability and simultaneously reduces the communication costs. The algorithm's privacy-preserving capability, measured by the Fisher information matrix, is dynamically enhanced over time. Notably, the Fisher information matrix of the output signals with respect to the sensitive information converges to zero at a polynomial rate, and the improvement in privacy brought by the quantizers is quantitatively characterized as a multiplicative effect. Regarding the communication costs, each sensor transmits only 1 bit of information to its neighbours at each time step. Additionally, the assumption on the negligible quantization error for real-valued messages is not required. While achieving the requirements of privacy preservation and reducing communication costs, the algorithm ensures that its estimates converge almost surely to the true value of the unknown parameter by establishing a co-design guideline for the time-varying privacy noises and step-sizes. A polynomial almost sure convergence rate is obtained, and then the trade-off between privacy and convergence rate is established. Numerical examples demonstrate the main results.