paper-with-me

홈 › Papers

Attack Impact Evaluation by Exact Convexification through State Space Augmentation

2022-03-31 · Hampei Sasahara, Takashi Tanaka, Henrik Sandberg

We address the attack impact evaluation problem for control system security. We formulate the problem as a Markov decision process with a temporally joint chance constraint that forces the adversary to avoid being detected throughout the considered time period. Owing to the joint constraint, the optimal control policy depends not only on the current state but also on the entire history, which leads to the explosion of the search space and makes the problem generally intractable. It is shown that whether an alarm has been triggered or not, in addition to the current state is sufficient for specifying the optimal decision at each time step. Augmentation of the information to the state space induces an equivalent convex optimization problem, which is tractable using standard solvers.

📄 PDF Abstract BibTeX arXiv:2203.16803

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sparse and Smooth Signal Estimation: Convexification of L0 Formulations

2018-11-06 · Alper Atamturk, Andres Gomez, Shaoning Han

Signal estimation problems with smoothness and sparsity priors can be naturally modeled as quadratic optimization with $\ell_0$-"norm" constraints. Since such problems are non-convex and hard-to-solve, the standard appro…

Yuille-Poggio's Flow and Global Minimizer of Polynomials through Convexification by Heat Evolution

2023-01-01 · Qiao Wang

This study examines the convexification version of the backward differential flow algorithm for the global minimization of polynomials, introduced by O. Arikan \textit{et al} in \cite{ABK}. It investigates why this appro…

Memory Efficient Full-gradient Attacks (MEFA) Framework for Adversarial Defense Evaluations

2026-05-07 · Yuan Du, Mitchel Hill, HanQin Cai arxiv

This work studies the robust evaluation of iterative stochastic purification defenses under white-box adversarial attacks. Our key technical insight is that gradient checkpointing makes exact end-to-end gradient computat…

Adversarial Defense

GPU-Accelerated Continuous-Time Successive Convexification for Contact-Implicit Legged Locomotion

2026-04-11 · Samuel C. Buckner, Purnanand Elango arxiv

Contact-implicit trajectory optimization (CITO) enables the automatic discovery of contact sequences, but most methods rely on fine time discretization to capture all contact events accurately, which increases problem si…

Explainability Matters: Backdoor Attacks on Medical Imaging

2020-12-30 · Munachiso Nwadike, Takumi Miyawaki, Esha Sarkar, Michail Maniatakos 외

Deep neural networks have been shown to be vulnerable to backdoor attacks, which could be easily introduced to the training set prior to model training. Recent work has focused on investigating backdoor attacks on natura…

Diagnostic