Cover Image

Bridging Batch and Streaming Estimations to System Identification under Adversarial Attacks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kim, Jihun, Lavaei, Javad
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Systems and Control 93B30, 90C15, 90C25, 49J52
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

System Identification from Partial Observations under Adversarial Attacks
by: Kim, Jihun, et al.
Published: (2025)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

On the Necessity of Two-Stage Estimation for Learning Dynamical Systems under Both Noise and Node-Wise Attacks
by: Kim, Jihun, et al.
Published: (2026)

Huber-based Robust System Identification with Near-Optimal Guarantees Across Independent and Adversarial Regimes
by: Kim, Jihun, et al.
Published: (2026)

On the Sharp Input-Output Analysis of Nonlinear Systems under Adversarial Attacks
by: Kim, Jihun, et al.
Published: (2025)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
by: Mashkoorzadeh, Feryal, et al.
Published: (2026)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
by: Ma, Chiyu, et al.
Published: (2026)

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods
by: Gebken, Bennet
Published: (2024)

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

Finding directional stationary points of DC programs
by: Thi, Hoai An Le, et al.
Published: (2026)

Switching Network System Identification via Convex Optimizations
by: Iwasaki, Kaito, et al.
Published: (2025)

Optimal Methods for Unknown Piecewise Smooth Problems I: Convex Optimization
by: Lin, Zhenwei, et al.
Published: (2026)

Directional Subdifferentials at Infinity and Its Applications
by: Kien, Le Ngoc, et al.
Published: (2025)

Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2022)

Isolated calmness of perturbation mappings in generalized nonlinear programming and local superlinear convergence of Newton-type methods
by: Benko, Matúš, et al.
Published: (2024)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

A third order dynamical system for generalized monotone equation
by: Hai, Pham Viet, et al.
Published: (2024)

Stratification for Nonlinear Semidefinite Programming
by: Bao, Chenglong, et al.
Published: (2026)

On the directional asymptotic approach in optimization theory
by: Benko, Matúš, et al.
Published: (2024)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

Isolated Calmness in Regularized Convex Optimization
by: Nghia, Tran T. A., et al.
Published: (2026)

Geometric characterizations of Lipschitz stability for convex optimization problems
by: Nghia, Tran T. A.
Published: (2024)

Lipschitz stability of least-squares problems regularized by functions with $\mathcal{C}^2$-cone reducible conjugates
by: Cui, Ying, et al.
Published: (2024)

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
by: Van Tuyen, Nguyen
Published: (2025)

The landscape of deterministic and stochastic optimal control problems: One-shot Optimization versus Dynamic Programming
by: Kim, Jihun, et al.
Published: (2024)

Learning Hybrid Dynamics via Convex Optimizations
by: Iwasaki, Kaito, et al.
Published: (2025)

Globally convergent homotopies for discrete-time optimal control
by: Esterhuizen, Willem, et al.
Published: (2023)

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
by: Chen, Liang, et al.
Published: (2024)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)