Sciweavers

264 search results - page 33 / 53
» Learning Linearly Separable Languages
Sort
View
ECCC
2007
62views more  ECCC 2007»
13 years 8 months ago
Space Hierarchy Results for Randomized and Other Semantic Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...
Jeff Kinne, Dieter van Melkebeek
AISADM
2005
Springer
14 years 2 months ago
Evolving Agents: Communication and Cognition
Computer programming of complex systems is a time consuming effort. Results are often brittle and inflexible. Evolving, self-learning flexible multi-agent systems remain a distant ...
Leonid I. Perlovsky
NN
2008
Springer
143views Neural Networks» more  NN 2008»
13 years 8 months ago
A batch ensemble approach to active learning with model selection
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
ICALP
2011
Springer
13 years 2 days ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
ML
2006
ACM
14 years 2 months ago
Seminal: searching for ML type-error messages
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
Benjamin S. Lerner, Dan Grossman, Craig Chambers