Sciweavers

Share
ALT
2007
Springer
7 years 3 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
ALT
2007
Springer
7 years 5 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
ALT
2007
Springer
7 years 5 months ago
Separating Models of Learning with Faulty Teachers
Vitaly Feldman, Shrenik Shah, Neal Wadhwa
ALT
2007
Springer
7 years 5 months ago
Online Regression Competitive with Changing Predictors
This paper deals with the problem of making predictions in the online mode of learning where the dependence of the outcome yt on the signal xt can change with time. The Aggregating...
Steven Busuttil, Yuri Kalnishkan
ALT
2007
Springer
7 years 8 months ago
On Calibration Error of Randomized Forecasting Algorithms
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
Vladimir V. V'yugin
ALT
2007
Springer
7 years 8 months ago
Learning Kernel Perceptrons on Noisy Data Using Random Projections
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
Guillaume Stempfel, Liva Ralaivola
ALT
2007
Springer
7 years 8 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
ALT
2007
Springer
7 years 8 months ago
Learning in Friedberg Numberings
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar e...
Sanjay Jain, Frank Stephan
ALT
2007
Springer
7 years 8 months ago
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form...
Sanjay Jain, Efim B. Kinber
ALT
2007
Springer
7 years 8 months ago
Learning Rational Stochastic Tree Languages
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
François Denis, Amaury Habrard
books