Expanding the Family of Grassmannian Kernels: An Embedding Perspective

Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition tasks. However, it also incurs challenges arising from the fact that linear subspaces do not obey Euclidean geometry, but lie on a special type of Riemannian manifolds known as Grassmannian. To leverage the techniques developed for Euclidean spaces (e.g, support vector machines) with subspaces, several recent studies have proposed to embed the Grassmannian into a Hilbert space by making use of a positive definite kernel. Unfortunately, only two Grassmannian kernels are known, none of which -as we will show- is universal, which limits their ability to approximate a target function arbitrarily well. Here, we introduce several positive definite Grassmannian kernels, including universal ones, and demonstrate their superiority over previously-known kernels in various tasks, such as classification, clustering, sparse coding and hashing

Adult Pancreatic Hemangioma: Case Report and Literature Review

We report an adult pancreatic hemangioma diagnosed on pathological specimen review following pylorus preserving pancreaticoduodenectomy for a symptomatic cystic mass in the head of the pancreas. Eight cases of adult pancreatic hemangioma have been reported in literature since 1939. Presenting symptoms, radiographic diagnosis, pathologic characteristics, and treatment of adult pancreatic hemagiomas are discussed following review of all published cases

Database Learning: Toward a Database that Becomes Smarter Every Time

In today's databases, previous query answers rarely benefit answering future queries. For the first time, to the best of our knowledge, we change this paradigm in an approximate query processing (AQP) context. We make the following observation: the answer to each query reveals some degree of knowledge about the answer to another query because their answers stem from the same underlying distribution that has produced the entire dataset. Exploiting and refining this knowledge should allow us to answer queries more analytically, rather than by reading enormous amounts of raw data. Also, processing more queries should continuously enhance our knowledge of the underlying distribution, and hence lead to increasingly faster response times for future queries. We call this novel idea---learning from past query answers---Database Learning. We exploit the principle of maximum entropy to produce answers, which are in expectation guaranteed to be more accurate than existing sample-based approximations. Empowered by this idea, we build a query engine on top of Spark SQL, called Verdict. We conduct extensive experiments on real-world query traces from a large customer of a major database vendor. Our results demonstrate that Verdict supports 73.7% of these queries, speeding them up by up to 23.0x for the same accuracy level compared to existing AQP systems.Comment: This manuscript is an extended report of the work published in ACM SIGMOD conference 201

On the Convergence of Kergin and Hakopian Interpolants at Leja Sequences for the Disk

We prove that Kergin interpolation polynomials and Hakopian interpolation polynomials at the points of a Leja sequence for the unit disk $D$ of a sufficiently smooth function $f$ in a neighbourhood of $D$ converge uniformly to $f$ on $D$. Moreover, when $f$ is $C^\infty$ on $D$, all the derivatives of the interpolation polynomials converge uniformly to the corresponding derivatives of $f$

Control of intestinal stem cell function and proliferation by mitochondrial pyruvate metabolism.

Most differentiated cells convert glucose to pyruvate in the cytosol through glycolysis, followed by pyruvate oxidation in the mitochondria. These processes are linked by the mitochondrial pyruvate carrier (MPC), which is required for efficient mitochondrial pyruvate uptake. In contrast, proliferative cells, including many cancer and stem cells, perform glycolysis robustly but limit fractional mitochondrial pyruvate oxidation. We sought to understand the role this transition from glycolysis to pyruvate oxidation plays in stem cell maintenance and differentiation. Loss of the MPC in Lgr5-EGFP-positive stem cells, or treatment of intestinal organoids with an MPC inhibitor, increases proliferation and expands the stem cell compartment. Similarly, genetic deletion of the MPC in Drosophila intestinal stem cells also increases proliferation, whereas MPC overexpression suppresses stem cell proliferation. These data demonstrate that limiting mitochondrial pyruvate metabolism is necessary and sufficient to maintain the proliferation of intestinal stem cells

Comparison of some Reduced Representation Approximations

In the field of numerical approximation, specialists considering highly complex problems have recently proposed various ways to simplify their underlying problems. In this field, depending on the problem they were tackling and the community that are at work, different approaches have been developed with some success and have even gained some maturity, the applications can now be applied to information analysis or for numerical simulation of PDE's. At this point, a crossed analysis and effort for understanding the similarities and the differences between these approaches that found their starting points in different backgrounds is of interest. It is the purpose of this paper to contribute to this effort by comparing some constructive reduced representations of complex functions. We present here in full details the Adaptive Cross Approximation (ACA) and the Empirical Interpolation Method (EIM) together with other approaches that enter in the same category

On the Schoenberg Transformations in Data Analysis: Theory and Illustrations

The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on the arc lengths, angles and curvature of the transformations are proposed, and visualized on artificial data sets by classical multidimensional scaling. A simple distance-based discriminant algorithm illustrates the theory, intimately connected to the Gaussian kernels of Machine Learning

Building nonparametric nn-body force fields using Gaussian process regression

Constructing a classical potential suited to simulate a given atomic system is a remarkably difficult task. This chapter presents a framework under which this problem can be tackled, based on the Bayesian construction of nonparametric force fields of a given order using Gaussian process (GP) priors. The formalism of GP regression is first reviewed, particularly in relation to its application in learning local atomic energies and forces. For accurate regression it is fundamental to incorporate prior knowledge into the GP kernel function. To this end, this chapter details how properties of smoothness, invariance and interaction order of a force field can be encoded into corresponding kernel properties. A range of kernels is then proposed, possessing all the required properties and an adjustable parameter $n$ governing the interaction order modelled. The order $n$ best suited to describe a given system can be found automatically within the Bayesian framework by maximisation of the marginal likelihood. The procedure is first tested on a toy model of known interaction and later applied to two real materials described at the DFT level of accuracy. The models automatically selected for the two materials were found to be in agreement with physical intuition. More in general, it was found that lower order (simpler) models should be chosen when the data are not sufficient to resolve more complex interactions. Low $n$ GPs can be further sped up by orders of magnitude by constructing the corresponding tabulated force field, here named "MFF".Comment: 31 pages, 11 figures, book chapte