Sciweavers

311 search results - page 41 / 63
» Gradient Convergence in Gradient methods with Errors
Sort
View
JMLR
2010
108views more  JMLR 2010»
13 years 2 months ago
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation
The goal of sufficient dimension reduction in supervised learning is to find the lowdimensional subspace of input features that is `sufficient' for predicting output values. ...
Taiji Suzuki, Masashi Sugiyama
ISBI
2004
IEEE
14 years 8 months ago
Penalized Likelihood Transmission Image Reconstruction: Unconstrained Monotonic Algorithms
Statistical reconstruction algorithms in transmission tomography yield improved images relative to the conventional FBP method. The most popular iterative algorithms for this prob...
Somesh Srivastava, Jeffrey A. Fessler
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
NN
2000
Springer
192views Neural Networks» more  NN 2000»
13 years 7 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
SIAMSC
2008
146views more  SIAMSC 2008»
13 years 7 months ago
A Continuous Interior Penalty Method for Viscoelastic Flows
In this paper we consider a finite element discretization of the Oldroyd-B model of viscoelastic flows. The method uses standard continuous polynomial finite element spaces for vel...
Andrea Bonito, Erik Burman