Related papers: Strong Duality for Generalized Trust Region Subpro…
In this paper we take some classical ideas from commutative algebra, mostly ideas involving duality, and apply them in algebraic topology. To accomplish this we interpret properties of ordinary commutative rings in such a way that they can…
Trust-region subproblem (TRS) is an important problem arising in many applications such as numerical optimization, Tikhonov regularization of ill-posed problems, and constrained eigenvalue problems. In recent decades, extensive works focus…
We obtain the exact solution of the bond-percolation thresholds with inhomogenous probabilities on the square lattice. Our method is based on the duality analysis with real-space renormalization, which is a profound technique invented in…
We obtain a strong renewal theorem with infinite mean beyond regular variation, when the underlying distribution belongs to the domain of geometric partial attraction a semistable law with index $\alpha\in (1/2,1]$. In the process we obtain…
This talk presents work concepts and results for the determination of the fine structure constant $\alpha$ at the $Z_0$ mass resonance. The problem consisting of the break-down of global duality for singular integral weights is circumvented…
We prove a conjecture of Arunachalam & Dutt ([AD24]) on the existence of a tolerant stabilizer testing algorithm, and achieve an exponential improvement in the parameters of the tester. Key to our argument is a generalized uncertainty…
We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor for the permanent. We also give a combinatorial application of the lower…
The (q_1,q_2) SL(2,Z) string bound states of type IIB superstring theory admit two inequivalent (T-dual) representations in eleven dimensions in terms of a fundamental 2-brane. In both cases, the spectrum of membrane oscillations can be…
In this paper we associate with an infinite family of real extended functions defined on a locally convex space, a sum, called robust sum, which is always well-defined. We also associate with that family of functions a dual pair of problems…
Plonka sums consist of an algebraic construction similar, in some sense to direct limits, which allows to represent classes of algebras defined by means of regular identities (namely those equations where the same set of variables appears…
A ring with an Auslander dualizing complex is a generalization of an Auslander-Gorenstein ring. We show that many results which hold for Auslander-Gorenstein rings also hold in the more general setting. On the other hand we give criteria…
Soft-thresholding has been widely used in neural networks. Its basic network structure is a two-layer convolution neural network with soft-thresholding. Due to the network's nature of nonlinearity and nonconvexity, the training process…
In this paper we study the a posteriori bounds for a conforming piecewise linear finite element approximation of the Signorini problem. We prove new rigorous a posteriori estimates of residual type in $L^{p}$, for $p \in (4,\infty)$ in two…
We develop a general framework for using duality to "transfer" stability results for a functional inequality to its dual inequality. As an application, we prove a stability bound for the Hardy-Littlewood-Sobolev inequality, which is related…
The paper establishes generalization bounds for multitask deep neural networks using operator-theoretic techniques. The authors propose a tighter bound than those derived from conventional norm based methods by leveraging small condition…
We present new information-theoretic generalization guarantees through the a novel construction of the "neighboring-hypothesis" matrix and a new family of stability notions termed sample-conditioned hypothesis (SCH) stability. Our approach…
In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…
Strong (Lagrangian) duality of general conic optimization problems (COPs) has long been studied and its profound and complicated results appear in different forms in a wide range of literatures. As a result, characterizing the known and…
The main goal of this paper is to investigate strong duality of non-convex semidefinite programming problems (SDPs). In the optimization community, it is well-known that a convex optimization problem satisfies strong duality if the Slater's…
We establish strong duality relations for functional two-step compositional risk-constrained learning problems with multiple nonconvex loss functions and/or learning constraints, regardless of nonconvexity and under a minimal set of…