Variational Encrypted Model Predictive Control

• URL: http://arxiv.org/abs/2603.19450v1
• Date: Thu, 19 Mar 2026 20:23:52 GMT
• Title: Variational Encrypted Model Predictive Control
• Abstract summary: We develop a variational encrypted model predictive control protocol whose online execution relies only on encrypted operations.<n>The proposed approach reformulates the MPC problem into a sampling-based estimator, in which the decryption of the quadratic cost is naturally handled by tilting the sampling distribution.<n>We analyze the effect of encryption-induced errors on optimality, and simulation results demonstrate the practical applicability of the proposed method.
• Score: 1.3416169841532526
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a variational encrypted model predictive control (VEMPC) protocol whose online execution relies only on encrypted polynomial operations. The proposed approach reformulates the MPC problem into a sampling-based estimator, in which the computation of the quadratic cost is naturally handled by tilting the sampling distribution, thus reducing online encrypted computation. The resulting protocol requires no additional communication rounds or intermediate decryption, and scales efficiently through two complementary levels of parallelism. We analyze the effect of encryption-induced errors on optimality, and simulation results demonstrate the practical applicability of the proposed method.

Related papers

• Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control [0.0]
  The proposed protocol is provably secure under standard lattice-based cryptographic assumptions.<n>We demonstrate the feasibility of the protocol by applying it to the secure implementation of a linear control law.
  arXiv  Detail & Related papers  (2026-03-24T06:51:51Z)
• Resource-Optimal Importance Sampling for Randomized Quantum Algorithms [3.797867929356259]
  We introduce a general framework for applying classical importance sampling to randomized quantum protocols.<n>Given a cost function for running quantum circuits, the proposed approach minimizes a net-cost figure of merit.<n>We extend the framework to scenarios where the quantum computation is subject to errors arising from algorithmic approximations or from physical noise.
  arXiv  Detail & Related papers  (2026-03-13T18:17:33Z)
• Physical Layer Deception based on Semantic Distortion [58.38604209714828]
  Physical layer deception (PLD) is a framework that integrates physical layer security (PLS) with deception techniques.<n>We extend this framework to a semantic communication model and conduct a theoretical analysis using semantic distortion as the performance metric.
  arXiv  Detail & Related papers  (2025-10-16T18:23:35Z)
• One-Step Flow Policy Mirror Descent [52.31612487608593]
  Flow Policy Mirror Descent (FPMD) is an online RL algorithm that enables 1-step sampling during flow policy inference.<n>Our approach exploits a theoretical connection between the distribution variance and the discretization error of single-step sampling in straight flow matching models.
  arXiv  Detail & Related papers  (2025-07-31T15:51:10Z)
• Towards Optimal Multi-draft Speculative Decoding [102.67837141152232]
  Multi-Draft Speculative Decoding (MDSD) is a recent approach where, when generating each token, a small draft model generates multiple drafts.<n>This paper discusses the dual of the optimal transport problem, providing a way to efficiently compute the optimal acceptance rate.
  arXiv  Detail & Related papers  (2025-02-26T03:22:44Z)
• Model Predictive Control via On-Policy Imitation Learning [28.96122879515294]
  We develop new sample complexity results and performance guarantees for data-driven Model Predictive Control. Our algorithm uses the structure of constrained linear MPC, and our analysis uses the properties of the explicit MPC solution to theoretically bound the number of online MPC trajectories needed to achieve optimal performance.
  arXiv  Detail & Related papers  (2022-10-17T16:06:06Z)
• Sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm [62.997667081978825]
  We propose a computationally efficient and powerful Bayesian approach for sparse high-dimensional linear regression. Minimal prior assumptions on the parameters are used through the use of plug-in empirical Bayes estimates. The proposed approach is implemented in the R package probe.
  arXiv  Detail & Related papers  (2022-09-16T19:15:50Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Algorithms for the Communication of Samples [9.442139459221783]
  We propose two new coding schemes with practical advantages over previous approaches. First, we introduce ordered random coding (ORC) which uses a simple trick to reduce the coding cost of previous approaches. Second, we describe a hybrid coding scheme which uses dithered quantization to efficiently communicate samples from distributions with bounded support.
  arXiv  Detail & Related papers  (2021-10-25T11:04:01Z)
• Covert Model Poisoning Against Federated Learning: Algorithm Design and Optimization [76.51980153902774]
  Federated learning (FL) is vulnerable to external attacks on FL models during parameters transmissions. In this paper, we propose effective MP algorithms to combat state-of-the-art defensive aggregation mechanisms. Our experimental results demonstrate that the proposed CMP algorithms are effective and substantially outperform existing attack mechanisms.
  arXiv  Detail & Related papers  (2021-01-28T03:28:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.