paper-with-me

홈 › Papers

Stationary Point Losses for Robust Model

2023-02-19 · Weiwei Gao, Dazhi Zhang, Yao Li, Zhichang Guo, Ovanes Petrosian

The inability to guarantee robustness is one of the major obstacles to the application of deep learning models in security-demanding domains. We identify that the most commonly used cross-entropy (CE) loss does not guarantee robust boundary for neural networks. CE loss sharpens the neural network at the decision boundary to achieve a lower loss, rather than pushing the boundary to a more robust position. A robust boundary should be kept in the middle of samples from different classes, thus maximizing the margins from the boundary to the samples. We think this is due to the fact that CE loss has no stationary point. In this paper, we propose a family of new losses, called stationary point (SP) loss, which has at least one stationary point on the correct classification side. We proved that robust boundary can be guaranteed by SP loss without losing much accuracy. With SP loss, larger perturbations are required to generate adversarial examples. We demonstrate that robustness is improved under a variety of adversarial attacks by applying SP loss. Moreover, robust boundary learned by SP loss also performs well on imbalanced datasets.

📄 PDF Abstract BibTeX arXiv:2302.09575

Code (0)

등록된 구현이 없습니다.

Tasks

model

Similar Papers 제목 키워드 기반

Monotonic Transformation Invariant Multi-task Learning

2025-09-28 · Surya Murthy, Kushagra Gupta, Mustafa O. Karabag, David Fridovich-Keil 외 arxiv

Multi-task learning (MTL) algorithms typically rely on schemes that combine different task losses or their gradients through weighted averaging. These methods aim to find Pareto stationary points by using heuristics that…

Multi-Task Learning

Stochastic Recursive Gradient Algorithm for Nonconvex Optimization

2017-05-20 · Lam M. Nguyen, Jie Liu, Katya Scheinberg, Martin Takáč

In this paper, we study and analyze the mini-batch version of StochAstic Recursive grAdient algoritHm (SARAH), a method employing the stochastic recursive gradient, for solving empirical loss minimization for the case of…

Critical Point-Finding Methods Reveal Gradient-Flat Regions of Deep Network Losses

2020-03-23 · Charles G. Frye, James Simon, Neha S. Wadia, Andrew Ligeralde 외

Despite the fact that the loss functions of deep neural networks are highly non-convex, gradient-based optimization algorithms converge to approximately the same performance from many random initial points. One thread of…

Second-order methods

Risk averse non-stationary multi-armed bandits

2021-09-28 · Leo Benac, Frédéric Godin

This paper tackles the risk averse multi-armed bandits problem when incurred losses are non-stationary. The conditional value-at-risk (CVaR) is used as the objective function. Two estimation methods are proposed for this…

Multi-Armed Bandits

Visualising Basins of Attraction for the Cross-Entropy and the Squared Error Neural Network Loss Functions

2019-01-08 · Anna Sergeevna Bosman, Andries Engelbrecht, Mardé Helbig

Quantification of the stationary points and the associated basins of attraction of neural network loss surfaces is an important step towards a better understanding of neural network loss surfaces at large. This work prop…