相关论文: Analyticity Domain for Off-shell Five-point Supers…

Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…

We describe all complex geodesics in convex tube domains. In the case when the base of a convex tube domain does not contain any real line, the obtained description involves the notion of boundary measure of a holomorphic map and it is…

We build in a given pseudoconvex (Runge) domain $D$ of $\mathbb{C}^N$ a $\mathcal O(D)$ convex set $\Gamma$, every connected component of which is a holomorphically contractible (convex) compact set, enjoying the property that any…

In this paper, we develop new affine-invariant algorithms for solving composite convex minimization problems with bounded domain. We present a general framework of Contracting-Point methods, which solve at each iteration an auxiliary…

Understanding the relationship between the depth of a neural network and its representational capacity is a central problem in deep learning theory. In this work, we develop a geometric framework to analyze the expressivity of ReLU networks…

Current work on human-machine alignment aims at understanding machine-learned latent spaces and their correspondence to human representations. G{\"a}rdenfors' conceptual spaces is a prominent framework for understanding human…

The continuity properties of the convex closure of the output entropy of infinite dimensional channels and their applications to the additivity problem are considered. The main result of this paper is the statement that the superadditivity…

In this paper we first address four point functions of string amplitudes in both type IIA and IIB string theories. Making use of non-BPS scattering amplitudes, we explore not only several Bianchi identities that hold in both transverse and…

Knowledge graph embedding research has mainly focused on the two smallest normed division algebras, $\mathbb{R}$ and $\mathbb{C}$. Recent results suggest that trilinear products of quaternion-valued embeddings can be a more effective means…

We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM…

We present a simple method which simplifies the evaluation of the on-shell multiple box diagrams reducing them to triangle type ones. For the $L$-loop diagram one gets the expression in terms of Feynman parameters with $2L$-fold…

Convex clustering is a well-regarded clustering method, resembling the similar centroid-based approach of Lloyd's $k$-means, without requiring a predefined cluster count. It starts with each data point as its centroid and iteratively merges…

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…

This paper proposes a random subspace trust-region algorithm for general convex-constrained derivative-free optimization (DFO) problems. Similar to previous random subspace DFO methods, the convergence of our algorithm requires a certain…

Leveraging synthetically rendered data offers great potential to improve monocular depth estimation and other geometric estimation tasks, but closing the synthetic-real domain gap is a non-trivial and important task. While much recent work…

We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum $\sum_{i=1}^{m}f_i(z)$ of functions over in a network. We provide complexity bounds for four different…

This paper provides some preliminary results on the dynamics of certain complex continued fractions. After establishing some general number theoretic results, we explore the dynamics of the natural extension map associated to a specific…

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…

We show how studying leading singularities of Feynman diagrams, when all momenta are complex, gives a simple way of writing multi-loop and multi-particle scattering amplitudes in N=4 super Yang-Mills. The simplicity of the method is…