Related papers: Robust SVM Optimization in Banach spaces

In this paper, we begin by constructing global linear maps on (n-2)-dimensional subspaces, derived from the local continuity of linear transformations among central sections of a convex body. Using these linear maps, we subsequently…

Here we consider a perturbation of continuous mappings on Banach spaces and investigate their image under various conditions. Consequently, we study the solvability of some classes of equations and inclusions. For these, we start by the…

This paper addresses the study and characterizations of variational convexity of extended-real-valued functions on Banach spaces. This notion has been recently introduced by Rockafellar, and its importance has been already realized and…

In this paper there is proposed a generalized version of the SVM for binary classification problems in the case of using an arbitrary transformation x -> y. An approach similar to the classic SVM method is used. The problem is widely…

The soft-margin support vector machine (SVM) is a ubiquitous tool for prediction of binary-response data. However, the SVM is characterized entirely via a numerical optimization problem, rather than a probability model, and thus does not…

We establish the existence of fixed points for set-valued maps defined on metric spaces and satisfying a pointwise or a local version of Banach's contraction property. As an application, we demonstrate the existence of Nash equilibrium in a…

A wide variety of machine learning algorithms such as support vector machine (SVM), minimax probability machine (MPM), and Fisher discriminant analysis (FDA), exist for binary classification. The purpose of this paper is to provide a…

Nash equilibrium} (NE) can be stated as a formal theorem on a multilinear form, free of game theory terminology. On the other hand, inspired by this formalism, we state and prove a {\it multilinear minimax theorem}, a generalization of von…

We study generalized games with full row rank equality constraints and we provide a strikingly simple proof of strong monotonicity of the associated KKT operator. This allows us to show linear convergence to a variational equilibrium of the…

This paper studies Schauder frames in Banach spaces, a concept which is a natural generalization of frames in Hilbert spaces and Schauder bases in Banach spaces. The associated minimal and maximal spaces are introduced, as are shrinking and…

Bilevel optimization problems embed the optimality of a subproblem as a constraint of another optimization problem. We introduce the concept of near-optimality robustness for bilevel optimization, protecting the upper-level solution…

This article gives dual representations for convex integral functionals on the linear space of regular processes. This space turns out to be a Banach space containing many more familiar classes of stochastic processes and its dual can be…

In this paper, using generalized metric projection, we propose a new extragradient method for finding a common element of the solutions set of a generalized equilibrium problem and a variational inequality for an $\alpha$-inverse-strongly…

We prove the almost equivalence of the minimax theorem and the strong duality theorem for a large class of games and conic programs. The previous fundamental results on the equivalence of linear programming and two-player zero-sum games…

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

Wide machine learning tasks can be formulated as non-convex multi-player games, where Nash equilibrium (NE) is an acceptable solution to all players, since no one can benefit from changing its strategy unilaterally. Attributed to the…

We study representations of Banach algebras on reflexive Banach spaces. Algebras which admit such representations which are bounded below seem to be a good generalisation of Arens regular Banach algebras; this class includes dual Banach…

The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear…

Game theory is a very profound study on distributed decision-making behavior and has been extensively developed by many scholars. However, many existing works rely on certain strict assumptions such as knowing the opponent's private…

Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.…