Andrew Cotter

Learn More
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stochastic gradient descent steps and projection steps. We prove that the number of iterations required to obtain a solution of accuracy ε is Õ(1/ε). In contrast, previous(More)
Mini-batch algorithms have been proposed as a way to speed-up stochastic convex optimization problems. We study how such algorithms can be improved using accelerated gradient methods. We provide a novel analysis, which shows how standard gradient methods may sometimes be insufficient to obtain a significant speed-up and propose a novel accelerated gradient(More)
PURPOSE The purpose of this study was to compare the tensile strength of hamstring grafts of varying combined pull-through diameters within the clinically relevant range of 6 to 9 mm. METHODS We tested 44 non-irradiated allograft hamstring grafts (11 per group). Combined looped semitendinosus and gracilis grafts were allocated to the 6-, 7-, 8-, or 9-mm(More)
In a <i>well-spaced point set</i>, when there is a bounding hypercube, the Voronoi cells all have bounded aspect ratio, i.e., the distance from the Voronoi site to the farthest point in the Voronoi cell divided by the distance to the nearest neighbor in the set is bounded by a small constant. Well-spaced point sets satisfy some important geometric(More)
This paper describes the effect of DEM data resolution on predictions from the SWAT model. Measured hydrologic, meteorological, watershed characteristics and water quality data from Moores Creek watershed (near Lincoln, AR, USA) were used in the simulation. The effect of input data resolution was evaluated by running seven scenarios at increasing DEM grid(More)