Sciweavers

83 search results - page 6 / 17
» Neural Network Learning: Testing Bounds on Sample Complexity
Sort
View
ICML
2008
IEEE
14 years 8 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
ICANN
2011
Springer
12 years 11 months ago
Bias of Importance Measures for Multi-valued Attributes and Solutions
Attribute importance measures for supervised learning are important for improving both learning accuracy and interpretability. However, it is well-known there could be bias when th...
Houtao Deng, George C. Runger, Eugene Tuv
EWRL
2008
13 years 9 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin
BMCBI
2007
207views more  BMCBI 2007»
13 years 7 months ago
Discovering biomarkers from gene expression data for predicting cancer subgroups using neural networks and relational fuzzy clus
Background: The four heterogeneous childhood cancers, neuroblastoma, non-Hodgkin lymphoma, rhabdomyosarcoma, and Ewing sarcoma present a similar histology of small round blue cell...
Nikhil R. Pal, Kripamoy Aguan, Animesh Sharma, Shu...
ICML
2007
IEEE
14 years 8 months ago
Asymptotic Bayesian generalization error when training and test distributions are different
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
Keisuke Yamazaki, Klaus-Robert Müller, Masash...