Sciweavers

7853 search results - page 288 / 1571
» Learning from Each Other
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Supervised versus multiple instance learning: an empirical comparison
We empirically study the relationship between supervised and multiple instance (MI) learning. Algorithms to learn various concepts have been adapted to the MI representation. Howe...
Soumya Ray, Mark Craven
IJCAI
1989
15 years 7 months ago
Generation, Local Receptive Fields and Global Convergence Improve Perceptual Learning in Connectionist Networks
This paper presents and compares results for three types of connectionist networks on perceptual learning tasks: [A] Multi-layered converging networks of neuron-like units, with e...
Vasant Honavar, Leonard Uhr
EUROCOLT
1999
Springer
15 years 11 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 6 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
JSAC
2007
189views more  JSAC 2007»
15 years 6 months ago
Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
Chengnian Long, Qian Zhang, Bo Li, Huilong Yang, X...