Related papers: Trees in renorming theory

It is shown that a Banach space with locally uniformly convex dual admits an equivalent norm which is itself locally uniformly convex. It follows that on any such space all continuous real-valued functions may be uniformly approximated by…

The notion of almost everywhere convergence has been generalized to vector lattices as unbounded order convergence, which proves a very useful tool in the theory of vector and Banach lattices. In this short note, we establish some new…

Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks as the curse of dimensionality (CoD) cannot be evaded when trying to approximate even a single ReLU neuron…

We provide a few characterizations of a strictly convex Banach space. Using this we improve the main theorem of [Digar, Abhik; Kosuru, G. Sankara Raju; Cyclic uniform Lipschitzian mappings and proximal uniform normal structure. Ann. Funct.…

We study geometric properties of the Banach space $\mathcal{R}$ constructed recently by C.~Read (arXiv 1307.7958) which does not contain proximinal subspaces of finite codimension greater than or equal to two. Concretely, we show that the…

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these…

In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…

We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph $D$ has an upward planar embedding into a point set $S$. We show that any switch tree admits an upward planar…

When optimization theorists consider optimization problems in infinite dimensional spaces, they need to deal with closed convex subsets(usually cones) which mostly have empty interior. These subsets often prevent optimization theorists from…

Let $E$ be a uniformly smooth and uniformly convex real Banach space and $E^*$ be its dual space. Suppose $A : E\rightarrow E^*$ is bounded, strongly monotone and satisfies the range condition such that $A^{-1}(0)\neq \emptyset$. Inspired…

It is well known that every convex body in a finite dimensional normed space can be uniformly approximated by strictly convex and smooth convex bodies. However, in the case of infinite dimensions, little progress has been made since Klee…

We consider the problem of isometric embedding of metric spaces to the Banach spaces; and introduce and study the remarkable class of so-called linearly rigid metric spaces: these are the spaces that admit a unique, up to isometry, linearly…

Several real-world and abstract structures and systems are characterized by marked hierarchy to the point of being expressed as trees. Because the study of these entities often involves sampling (or discovering) the tree nodes in a specific…

We show that the training problem of a deep linear neural network under the squared loss admits an exact convex reformulation in a lifted space over a generalized completely positive cone. The reformulation has the same optimal value as the…

We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches consider local search techniques. In this…

Solving non-convex, NP-hard optimization problems is crucial for training machine learning models, including neural networks. However, non-convexity often leads to black-box machine learning models with unclear inner workings. While convex…

This article delves into the study of the theory of regularized learning in Banach spaces for linear-functional data. It encompasses discussions on representer theorems, pseudo-approximation theorems, and convergence theorems. Regularized…

We prove that, for (adapted) stationary processes, the so-called Maxwell-Wood-roofe condition is sufficient for the law of the iterated logarithm and that it is optimal in some sense. We obtain a similar conclusion concerning the…

We investigate the following property for Banach spaces. A Banach space $X$ satisfies the Uniform Approximation on Large Subspaces (UALS) if there exists $C>0$ with the following property: for any $A\in\mathcal{L}(X)$ and convex compact…