paper-with-me

홈 › Papers

Efficient Optimization Algorithms for Linear Adversarial Training

2024-10-16 · Antônio H. Ribeiro, Thomas B. Schön, Dave Zahariah, Francis Bach

Adversarial training can be used to learn models that are robust against perturbations. For linear models, it can be formulated as a convex optimization problem. Compared to methods proposed in the context of deep learning, leveraging the optimization structure allows significantly faster convergence rates. Still, the use of generic convex solvers can be inefficient for large-scale problems. Here, we propose tailored optimization algorithms for the adversarial training of linear models, which render large-scale regression and classification problems more tractable. For regression problems, we propose a family of solvers based on iterative ridge regression and, for classification, a family of solvers based on projected gradient descent. The methods are based on extended variable reformulations of the original problem. We illustrate their efficiency in numerical examples.

📄 PDF Abstract BibTeX arXiv:2410.12677

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Similar Papers 제목 키워드 기반

Online Nonstochastic Control with Adversarial and Static Constraints

2023-02-05 · Xin Liu, Zixian Yang, Lei Ying

This paper studies online nonstochastic control problems with adversarial and static constraints. We propose online nonstochastic control algorithms that achieve both sublinear regret and sublinear adversarial constraint…

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization

2024-03-15 · Mohammad Pedramfar, Yididiya Y. Nadew, Christopher J. Quinn, Vaneet Aggarwal

This paper introduces unified projection-free Frank-Wolfe type algorithms for adversarial continuous DR-submodular optimization, spanning scenarios such as full information and (semi-)bandit feedback, monotone and non-mo…

Adaptive versus Standard Descent Methods and Robustness Against Adversarial Examples

2019-11-09 · Marc Khoury

Adversarial examples are a pervasive phenomenon of machine learning models where seemingly imperceptible perturbations to the input lead to misclassifications for otherwise statistically accurate models. In this paper we…

Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits

2020-12-01 · NeurIPS 2020 12 · Shinji Ito, Shuichi Hirahara, Tasuku Soma, Yuichi Yoshida

We propose novel algorithms with first- and second-order regret bounds for adversarial linear bandits. These regret bounds imply that our algorithms perform well when there is an action achieving a small cumulative loss …

Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting

2022-02-04 · J. Jon Ryu, Alankrita Bhatt, Young-Han Kim

A class of parameter-free online linear optimization algorithms is proposed that harnesses the structure of an adversarial sequence by adapting to some side information. These algorithms combine the reduction technique o…