Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
Fuente:
arXiv
Saved in:
| Main Authors: | Roith, Tim, Bungert, Leon, Wacker, Philipp |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Adversarial flows: A gradient flow characterization of adversarial attacks
by: Weigand, Lukas, et al.
Published: (2024)
by: Weigand, Lukas, et al.
Published: (2024)
On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
by: Gfrerer, Helmut, et al.
Published: (2024)
by: Gfrerer, Helmut, et al.
Published: (2024)
A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)
by: Yuan, Ya-xiang, et al.
Published: (2024)
On the role of semismoothness in nonsmooth numerical analysis: Theory
by: Gfrerer, H., et al.
Published: (2024)
by: Gfrerer, H., et al.
Published: (2024)
Polarized consensus-based dynamics for optimization and sampling
by: Bungert, Leon, et al.
Published: (2022)
by: Bungert, Leon, et al.
Published: (2022)
On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent
by: Laumont, Rémi, et al.
Published: (2022)
by: Laumont, Rémi, et al.
Published: (2022)
Stiefel optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2025)
by: Lai, Zehua, et al.
Published: (2025)
Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)
by: De Marchi, Alberto
Published: (2023)
The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
by: Azizian, Waïss, et al.
Published: (2022)
by: Azizian, Waïss, et al.
Published: (2022)
Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)
by: Lai, Zehua, et al.
Published: (2024)
Inexact FPPA for the $\ell_0$ Sparse Regularization Problem
by: Fang, Ronglong, et al.
Published: (2024)
by: Fang, Ronglong, et al.
Published: (2024)
An adaptive framework for first-order gradient methods
by: Hu, Xiaozhe, et al.
Published: (2026)
by: Hu, Xiaozhe, et al.
Published: (2026)
Preconditioned subgradient method for composite optimization: overparameterization and fast convergence
by: Díaz, Mateo, et al.
Published: (2025)
by: Díaz, Mateo, et al.
Published: (2025)
Stochastic optimization over proximally smooth sets
by: Davis, Damek, et al.
Published: (2020)
by: Davis, Damek, et al.
Published: (2020)
A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^p$-regularization, $p\in (0,1)$
by: Antil, Harbir, et al.
Published: (2025)
by: Antil, Harbir, et al.
Published: (2025)
Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
by: Chen, Jiaxin, et al.
Published: (2024)
by: Chen, Jiaxin, et al.
Published: (2024)
Stochastic Mirror Descent for Convex Optimization with Consensus Constraints
by: Borovykh, Anastasia, et al.
Published: (2022)
by: Borovykh, Anastasia, et al.
Published: (2022)
Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)
by: Fayed, Hatem
Published: (2024)
A Grover-compatible manifold optimization algorithm for quantum search
by: Lai, Zhijian, et al.
Published: (2025)
by: Lai, Zhijian, et al.
Published: (2025)
Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions
by: Bento, G. C., et al.
Published: (2024)
by: Bento, G. C., et al.
Published: (2024)
A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)
by: Lin, Yizun, et al.
Published: (2024)
A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)
by: Curtis, Frank E., et al.
Published: (2025)
A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)
by: Dai, Yutong, et al.
Published: (2024)
Error Bound Analysis for the Regularized Loss of Deep Linear Neural Networks
by: Chen, Po, et al.
Published: (2025)
by: Chen, Po, et al.
Published: (2025)
Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
by: Borghi, Giacomo, et al.
Published: (2025)
by: Borghi, Giacomo, et al.
Published: (2025)
Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
by: Walwil, Iyad, et al.
Published: (2025)
by: Walwil, Iyad, et al.
Published: (2025)
Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)
by: Deng, Kangkang, et al.
Published: (2024)
Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)
by: Deng, Kangkang, et al.
Published: (2025)
Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)
by: Marumo, Naoki
Published: (2025)
Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)
by: Zhou, Juan, et al.
Published: (2024)
General Constrained Matrix Optimization
by: Garner, Casey, et al.
Published: (2024)
by: Garner, Casey, et al.
Published: (2024)
Spectrally Constrained Optimization
by: Garner, Casey, et al.
Published: (2023)
by: Garner, Casey, et al.
Published: (2023)
Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)
by: Yang, Xiangyu, et al.
Published: (2021)
Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
by: Beddrich, Jonas, et al.
Published: (2024)
by: Beddrich, Jonas, et al.
Published: (2024)
An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
by: Ferreira, Orizon P., et al.
Published: (2024)
by: Ferreira, Orizon P., et al.
Published: (2024)
Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
by: László, Szilárd Csaba
Published: (2025)
by: László, Szilárd Csaba
Published: (2025)
A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)
by: Zhou, Junpeng, et al.
Published: (2025)
Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)
by: Zhang, Chenyu, et al.
Published: (2023)
On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
by: Song, Mengmeng, et al.
Published: (2024)
by: Song, Mengmeng, et al.
Published: (2024)
Consensus-Based Optimization Methods Converge Globally
by: Fornasier, Massimo, et al.
Published: (2021)
by: Fornasier, Massimo, et al.
Published: (2021)
Similar Items
-
Adversarial flows: A gradient flow characterization of adversarial attacks
by: Weigand, Lukas, et al.
Published: (2024) -
On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
by: Gfrerer, Helmut, et al.
Published: (2024) -
A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024) -
On the role of semismoothness in nonsmooth numerical analysis: Theory
by: Gfrerer, H., et al.
Published: (2024) -
Polarized consensus-based dynamics for optimization and sampling
by: Bungert, Leon, et al.
Published: (2022)