Related papers: Chaining, Interpolation, and Convexity II: The con…
We show that classical chaining bounds on the suprema of random processes in terms of entropy numbers can be systematically improved when the underlying set is convex: the entropy numbers need not be computed for the entire set, but only…
In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…
We present a very general chaining method which allows one to control the supremum of the empirical process $\sup_{h \in H} |N^{-1}\sum_{i=1}^N h^2(X_i)-\E h^2|$ in rather general situations. We use this method to establish two main…
We give a complete characterization of limiting interpolation spa\-ces for the real method of interpolation using extrapolation theory. For this purpose the usual tools (e.g., Boyd indices or the boundedness of Hardy type operators) are not…
We consider the problem of obtaining interpolation constraints for function classes, i.e., necessary and sufficient constraints that a set of points, function values and (sub)gradients must satisfy to ensure the existence of a global…
We introduce "chain by chain" method for constructing the constraint structure of a system possessing both first and second class constraints. We show that the whole constraints can be classified into completely irreducible first or second…
Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…
In this dissertation, it is first shown that, when the radial basis function is a $p$-norm and $1 < p < 2$, interpolation is always possible when the points are all different and there are at least two of them. We then show that…
There is growing body of learning problems for which it is natural to organize the parameters into matrix, so as to appropriately regularize the parameters under some matrix norm (in order to impose some more sophisticated prior knowledge).…
While exploring dynamical systems, we often come across the principle of contraction mapping, or better known as the Banach fixed point theorem. It is an essential concept based on successive approximation, whose utility comes from two main…
Classically, data interpolation with a parametrized model class is possible as long as the number of parameters is larger than the number of equations to be satisfied. A puzzling phenomenon in deep learning is that models are trained with…
The minimum-norm interpolator (MNI) framework has recently attracted considerable attention as a tool for understanding generalization in overparameterized models, such as neural networks. In this work, we study the MNI under a $2$-uniform…
Building upon Bennett's and Grosse-Erdmann's ideas falling under the conceptual umbrella of factorization of inequalities, we propose a unified approach towards the structure of certain Banach ideal spaces defined in terms of the least…
Generative models based on normalizing flows are very successful in modeling complex data distributions using simpler ones. However, straightforward linear interpolations show unexpected side effects, as interpolation paths lie outside the…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
These draft notes are from a graduate course given by the author in Berkeley during the spring semester of 2005. They cover the basic ideas of a new, geometric approach to geometric measure theory. They begin with a new theory of exterior…
We introduce the technique of generic chaining and majorizing measures for controlling sequential Rademacher complexity. We relate majorizing measures to the notion of fractional covering numbers, which we show to be dominated in terms of…
Natural materials often feature a combination of soft and stiff phases, arranged to achieve excellent mechanical properties, such as high strength and toughness. Many natural materials have even independently evolved to have similar…
There are several extensions of the classical Banach Fixed Point Theorem in technical literature. A branch of generalizations replaces usual contractivity by weaker but still effective assumptions. Our note follows this stream, presenting…
We investigate stochastic interpolation, a recently introduced framework for high dimensional sampling which bears many similarities to diffusion modeling. Stochastic interpolation generates a data sample by first randomly initializing a…