Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,376,795 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
C++
Co-training
Document classification
Duality (optimization)
Expand
Broader (1)
Machine learning
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Two-Tier Precoding for FDD Multi-Cell Massive MIMO Time-Varying Interference Networks
Junting Chen
,
V. Lau
IEEE Journal on Selected Areas in Communications
2014
Corpus ID: 16101035
Massive MIMO is a promising technology in future wireless communication networks. However, it raises a lot of implementation…
Expand
Highly Cited
2013
Highly Cited
2013
Speaker adaptation of context dependent deep neural networks
H. Liao
IEEE International Conference on Acoustics…
2013
Corpus ID: 14657792
There has been little work on examining how deep neural networks may be adapted to speakers for improved speech recognition…
Expand
Highly Cited
2012
Highly Cited
2012
Model sparsity and brain pattern interpretation of classification models in neuroimaging
P. M. Rasmussen
,
L. K. Hansen
,
Kristoffer Hougaard Madsen
,
N. Churchill
,
S. Strother
Pattern Recognition
2012
Corpus ID: 19232153
Highly Cited
2012
Highly Cited
2012
Manifold Identification in Dual Averaging for Regularized Stochastic Online Learning
Sangkyun Lee
,
Stephen J. Wright
Journal of machine learning research
2012
Corpus ID: 1533088
Iterative methods that calculate their steps from approximate subgradient directions have proved to be useful for stochastic…
Expand
Highly Cited
2011
Highly Cited
2011
Fast global convergence of gradient methods for high-dimensional statistical recovery
Alekh Agarwal
,
S. Negahban
,
M. Wainwright
arXiv.org
2011
Corpus ID: 5742502
Many statistical $M$-estimators are based on convex optimization problems formed by the combination of a data-dependent loss…
Expand
Highly Cited
2011
Highly Cited
2011
Interactively building a discriminative vocabulary of nameable attributes
Devi Parikh
,
K. Grauman
Computer Vision and Pattern Recognition
2011
Corpus ID: 17052215
Human-name able visual attributes offer many advantages when used as mid-level features for object recognition, but existing…
Expand
Highly Cited
2009
Highly Cited
2009
Hybrid Terminal Sliding-Mode Observer Design Method for a Permanent-Magnet Synchronous Motor Control System
Yong Feng
,
Jianfei Zheng
,
Xinghuo Yu
,
N. Truong
IEEE transactions on industrial electronics…
2009
Corpus ID: 30373687
This paper proposes a hybrid terminal sliding-mode observer based on the nonsingular terminal sliding-mode (NTSM) and the high…
Expand
Highly Cited
2006
Highly Cited
2006
Manifold Denoising
Matthias Hein
,
Markus Maier
Neural Information Processing Systems
2006
Corpus ID: 11920160
We consider the problem of denoising a noisily sampled submanifold M in ℝd, where the submanifold M is a priori unknown and we…
Expand
Highly Cited
2005
Highly Cited
2005
Limited feedback unitary precoding for orthogonal space-time block codes
D. Love
,
R. Heath
IEEE Transactions on Signal Processing
2005
Corpus ID: 16736861
Orthogonal space-time block codes (OSTBCs) are a class of easily decoded space-time codes that achieve full diversity order in…
Expand
Highly Cited
2000
Highly Cited
2000
Relations Between Regularization and Diffusion Filtering
O. Scherzer
,
J. Weickert
Journal of Mathematical Imaging and Vision
2000
Corpus ID: 7510274
Regularization may be regarded as diffusion filtering with an implicit time discretization where one single step is used. Thus…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE