Kernel Regression for Graph Signal Prediction in Presence of Sparse Noise
Related publications (33)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In stochastic optimal control the distribution of the exogenous noise is typically unknown and must be inferred from limited data before dynamic programming (DP)-based solution schemes can be applied. If the conditional expectations in the DP recursions ar ...
Inertial measurement unit (IMU) is a promising tool in the quantification of energy expenditure for human on-land activities, though has never been deployed before to calculate the aquatic activities energy expenditure. Investigating the factors that influ ...
Inertial measurement unit (IMU) is a promising tool in the quantification of energy expenditure for human on-land activities, though has never been deployed before to calculate the aquatic activities energy expenditure. Investigating the factors that influ ...
Traditionally, spatial analysis of point pattern has been mostly focused on Euclidean space. As many human related phenomena take place on a network, the assumption of a continuous isotropic space fails to describe events which actually occur on a one-dime ...
Multiple kernel learning (MKL) aims at simultaneously learning a kernel and the associated predictor in supervised learning settings. For the support vector machine, an efficient and general multiple kernel learning algorithm, based on semi-infinite linear ...
We propose a highly efficient framework for penalized likelihood kernel methods applied to multi-class models with a large, structured set of classes. As opposed to many previous approaches which try to decompose the fitting problem into many smaller ones, ...
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hierarchical structure. The penalizer is a convex functional that performs soft sel ...
We propose a highly efficient framework for kernel multi-class models with a large and structured set of classes. Kernel parameters are learned automatically by maximizing the cross-validation log likelihood, and predictive probabilities are estimated. We ...
This study proposes a new technique for real-time building energy modelling and event detection using kernel regression. We show that this technique can exceed the performance of conventional neural network algorithms, and do so by a large margin when the ...
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hierarchical structure. The penalizer is a convex functional that performs soft sel ...