Sciweavers

ALT
2009
Springer
14 years 8 months ago
Complexity versus Agreement for Many Views
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
Odalric-Ambrym Maillard, Nicolas Vayatis
ALT
2009
Springer
14 years 8 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...
ALT
2009
Springer
14 years 8 months ago
Error-Correcting Tournaments
We present a family of adaptive pairwise tournaments that are provably robust against large error fractions when used to determine the largest element in a set. The tournaments use...
Alina Beygelzimer, John Langford, Pradeep Ravikuma...
ALT
2009
Springer
14 years 8 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
ALT
2009
Springer
14 years 8 months ago
Pure Exploration in Multi-armed Bandits Problems
Abstract. We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The stra...
Sébastien Bubeck, Rémi Munos, Gilles...
ALT
2009
Springer
14 years 8 months ago
Canonical Horn Representations and Query Learning
Abstract. We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a n...
Marta Arias, José L. Balcázar
ALT
2009
Springer
14 years 8 months ago
Learning from Streams
Abstract. Learning from streams is a process in which a group of learners separately obtain information about the target to be learned, but they can communicate with each other in ...
Sanjay Jain, Frank Stephan, Nan Ye
ALT
2009
Springer
14 years 8 months ago
Learning Finite Automata Using Label Queries
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
Dana Angluin, Leonor Becerra-Bonache, Adrian Horia...
ALT
2009
Springer
14 years 8 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes