The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral dimensionality reduction. However, as a first-order regularizer, it can lead to degenerate functions in high-dimensional manifolds. The iterated graph Laplacian enables high-order regularization, but it has a high computational complexity and so cannot be applied to large problems. We introduce a new regularizer which is globally high order and so does not suffer from the degeneracy of the graph Laplacian regularizer, but is also sparse for efficient computation in semi-supervised learning applications. We reduce computational complexity by building a local first-order approximation of the manifold as a surrogate geometry, and construct our h...
Abstract — Semi-supervised learning (SSL), as a powerful tool to learn from a limited number of labe...
Semi-supervised learning gets estimated marginal distribution P-X with a large number of unlabeled e...
By utilizing the label dependencies among both the labeled and unlabeled data, semi-supervised learn...
The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral ...
The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral ...
International audienceSemi-supervised Laplacian regularization, a standard graph-based approach for ...
One fundamental assumption in object recognition as well as in other computer vision and pattern rec...
One fundamental assumption in object recognition as well as in other computer vision and pattern rec...
We observe the distances between estimated function outputs on data points to create an anisotropic ...
One fundamental assumption in object recognition as well as in other computer vision and pattern rec...
As more and more complex data sources become available, the analysis of graph and manifold data has ...
International audienceWe study a semi-supervised learning method based on the similarity graph and R...
In recent years, the need for pattern recognition and data analysis has grown exponentially in vario...
International audienceThe representation and learning benefits of methods based on graph Laplacians,...
We propose a family of learning algorithms based on a new form of regularization that allows us to ...
Abstract — Semi-supervised learning (SSL), as a powerful tool to learn from a limited number of labe...
Semi-supervised learning gets estimated marginal distribution P-X with a large number of unlabeled e...
By utilizing the label dependencies among both the labeled and unlabeled data, semi-supervised learn...
The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral ...
The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral ...
International audienceSemi-supervised Laplacian regularization, a standard graph-based approach for ...
One fundamental assumption in object recognition as well as in other computer vision and pattern rec...
One fundamental assumption in object recognition as well as in other computer vision and pattern rec...
We observe the distances between estimated function outputs on data points to create an anisotropic ...
One fundamental assumption in object recognition as well as in other computer vision and pattern rec...
As more and more complex data sources become available, the analysis of graph and manifold data has ...
International audienceWe study a semi-supervised learning method based on the similarity graph and R...
In recent years, the need for pattern recognition and data analysis has grown exponentially in vario...
International audienceThe representation and learning benefits of methods based on graph Laplacians,...
We propose a family of learning algorithms based on a new form of regularization that allows us to ...
Abstract — Semi-supervised learning (SSL), as a powerful tool to learn from a limited number of labe...
Semi-supervised learning gets estimated marginal distribution P-X with a large number of unlabeled e...
By utilizing the label dependencies among both the labeled and unlabeled data, semi-supervised learn...