Learning Pattern Transformation Manifolds for Classification
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We consider a distributed social learning problem where a network of agents is interested in selecting one among a finite number of hypotheses. The data collected by the agents might be heterogeneous, meaning that different sub-networks might observe data ...
We prove equidistribution at shrinking scales for the monochromatic ensemble on a compact Riemannian manifold of any dimension. This ensemble on an arbitrary manifold takes a slowly growing spectral window in order to synthesize a random function. With hig ...
The nonlocal nature of the fractional integral makes the numerical treatment of fractional dierential equations expensive in terms of computational eort and memory requirements. In this paper we propose a method to reduce these costs while controlling the ...
Society for Industrial and Applied Mathematics2017
In many signal processing, machine learning and computer vision applications, one often has to deal with high dimensional and big datasets such as images, videos, web content, etc. The data can come in various forms, such as univariate or multivariate time ...
Extending a result of Caffarelli, we provide global Lipschitz changes of variables between compactly supported perturbations of log-concave measures. The result is based on a combination of ideas from optimal transportation theory and a new Pogorelov-type ...
Linear subspace models are pervasive in computational sciences and particularly used for large datasets which are often incomplete due to privacy issues or sampling constraints. Therefore, a critical problem is developing an efficient algorithm for detecti ...
We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...
We show that the configuration spaces of a product of parallelizable manifolds may be recovered from those of the factors as the Boardman-Vogt tensor product of right modules over the operads of little cubes of the appropriate dimension. We also discuss an ...
A new method to automatically classify solid hydrometeors based on Multi-Angle Snowflake Camera (MASC) images is presented. For each individual image, the method relies on the calculation of a set of geometric and texture-based descriptors to simultaneousl ...
In this paper, we consider the problem of jointly localizing a microphone array and identifying the direction of arrival of acoustic events. Under the assumption that the sources are in the far field, this problem can be formulated as a constrained low-ran ...
