We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
We study the convergence and the rate of convergence of a local manifold learning algorithm: LTSA [13]. The main technical tool is the perturbation analysis on the linear invarian...
Complex simulations can generate very large amounts of data stored disjointly across many local disks. Learning from this data can be problematic due to the difficulty of obtainin...
John Nicholas Korecki, Kevin W. Bowyer, Larry O. H...
— We have found a more general formulation of the REINFORCE learning principle which had been proposed by R. J. Williams for the case of artificial neural networks with stochast...
In this paper we present lessons learned in the Evaluating Predictive Uncertainty Challenge. We describe the methods we used in regression challenges, including our winning method ...