Sciweavers

1435 search results - page 58 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
94
Voted
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 10 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
164
Voted
AII
1992
15 years 4 months ago
Learning from Multiple Sources of Inaccurate Data
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
Ganesh Baliga, Sanjay Jain, Arun Sharma
117
Voted
SAC
2008
ACM
15 years 6 hour ago
Error estimation in wireless sensor networks
We present an analogy between the operation of a Wireless Sensor Network and the sampling and reconstruction of a signal. We measure the impact of three factors on the quality of ...
Alejandro César Frery, Heitor Ramos, Jos&ea...
109
Voted
COLT
2000
Springer
15 years 4 months ago
Leveraging for Regression
In this paper we examine master regression algorithms that leverage base regressors by iteratively calling them on modified samples. The most successful leveraging algorithm for c...
Nigel Duffy, David P. Helmbold
109
Voted
MOC
2010
14 years 7 months ago
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
Ren-Cang Li