An Exponential Lower Bound on the Complexity of Regularization Paths

For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadratic programs that are parameterized by a single parameter, as for example the Support Vector Machine (SVM). Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier. It has been assumed that these piecewise linear solution paths have only linear complexity, i.e. linearly many bends. We prove that for the support vector machine this complexity can be exponential in the number of training points in the worst case. More strongly, we construct a single instance of n input points in d dimensions for an SVM such that at least \Theta(2^{n/2}) = \Theta(2^d) many distinct subsets of support vectors occur as the regularization parameter changes.Comment: Journal version, 28 Pages, 5 Figure

Asymmetry in crystal facet dynamics of homoepitaxy by a continuum model

In the absence of external material deposition, crystal surfaces usually relax to become flat by decreasing their free energy. We study an asymmetry in the relaxation of macroscopic plateaus, facets, of a periodic surface corrugation in 1+1 dimensions via a continuum model below the roughening transition temperature. The model invokes a highly degenerate parabolic partial differential equation (PDE) for surface diffusion, which is related to the weighted-$H^{-1}$ (nonlinear) gradient flow of a convex, singular surface free energy in homoepitaxy. The PDE is motivated both by an atomistic broken-bond model and a mesoscale model for steps. By constructing an explicit solution to the PDE, we demonstrate the lack of symmetry in the evolution of top and bottom facets in periodic surface profiles. Our explicit, analytical solution is compared to numerical simulations of the PDE via a regularized surface free energy.Comment: 23 pages, 5 figures, comments welcome! Text slightly modified, references updated in Version 2. Referee comments addresse

Branched Coverings, Triangulations, and 3-Manifolds

A canonical branched covering over each sufficiently good simplicial complex is constructed. Its structure depends on the combinatorial type of the complex. In this way, each closed orientable 3-manifold arises as a branched covering over the 3-sphere from some triangulation of S^3. This result is related to a theorem of Hilden and Montesinos. The branched coverings introduced admit a rich theory in which the group of projectivities plays a central role.Comment: v2: several changes to the text body; minor correction