Skip to search formSkip to main contentSkip to account menu

Manifold regularization

In machine learning, Manifold regularization is a technique for using the shape of a dataset to constrain the functions that should be learned on… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Massive MIMO is a promising technology in future wireless communication networks. However, it raises a lot of implementation… 
Highly Cited
2013
Highly Cited
2013
There has been little work on examining how deep neural networks may be adapted to speakers for improved speech recognition… 
Highly Cited
2012
Highly Cited
2012
Iterative methods that calculate their steps from approximate subgradient directions have proved to be useful for stochastic… 
Highly Cited
2011
Highly Cited
2011
Many statistical $M$-estimators are based on convex optimization problems formed by the combination of a data-dependent loss… 
Highly Cited
2011
Highly Cited
2011
Human-name able visual attributes offer many advantages when used as mid-level features for object recognition, but existing… 
Highly Cited
2009
Highly Cited
2009
This paper proposes a hybrid terminal sliding-mode observer based on the nonsingular terminal sliding-mode (NTSM) and the high… 
Highly Cited
2006
Highly Cited
2006
We consider the problem of denoising a noisily sampled submanifold M in ℝd, where the submanifold M is a priori unknown and we… 
Highly Cited
2005
Highly Cited
2005
Orthogonal space-time block codes (OSTBCs) are a class of easily decoded space-time codes that achieve full diversity order in… 
Highly Cited
2000
Highly Cited
2000
Regularization may be regarded as diffusion filtering with an implicit time discretization where one single step is used. Thus…