Variance-Reduced Stochastic Learning Under Random Reshuffling
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.
Relightable photographs are alternatives to traditional photographs as they provide a richer viewing experience. However, the complex acquisition systems of existing techniques have restricted its usage to specialized setups. We introduce an easy-to-use an ...
We study the accuracy of the discrete least-squares approximation on a finite dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability measure. Th ...
In Part I of this paper, also in this issue, we introduced a fairly general model for asynchronous events over adaptive networks including random topologies, random link failures, random data arrival times, and agents turning on and off randomly. We perfor ...
Institute of Electrical and Electronics Engineers2015
In this paper we present a software model of the Winner Takes Most (WTM) Kohonen neural network (KNN) with different types of the neighborhood grid. The proposed network model allows for analysis of the convergence properties such as the quantization error ...
Tensor completion aims to reconstruct a high-dimensional data set where the vast majority of entries is missing. The assumption of low-rank structure in the underlying original data allows us to cast the completion problem into an optimization problem rest ...
We study the problem of distributed least-squares estimation over ad hoc adaptive networks, where the nodes have a common objective to estimate and track a parameter vector. We consider the case where there is stationary additive colored noise on both the ...
Given two camera calibrations, this report presents a closed form algorithm that computes a sequence of 3D points such that they all project to a single location on one camera and that their projection forms a uniformly sampled line on the other camera. ...
A distributed least-squares estimation strategy is developed by appealing to collaboration techniques that exploit the space-time structure of the data, achieving an exact recursive solution that is fully distributed. Each node is allowed to communicate wi ...
In developing partial least squares calibration models, selecting the number of latent variables used for their construction to minimize both model bias and model variance remains a challenge. Several metrics exist for incorporating these trade-offs, but t ...
We study the accuracy of the discrete least-squares approximation on a finite-dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability measure. Th ...
