Sciweavers

658 search results - page 41 / 132
» Open problems in the security of learning
Sort
View
NIPS
1998
13 years 10 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
BWCCA
2010
13 years 4 months ago
Lifetime Security Improvement in Wireless Sensor Network Using Queue-Based Techniques
A wireless sensor network (WSN) is envisioned as a cluster of tiny power-constrained devices with functions of sensing and communications. Sensors closer to a sink node have a larg...
Fuu-Cheng Jiang, Hsiang-Wei Wu, Der-Chen Huang, Ch...
ALT
2010
Springer
13 years 10 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett
ALT
2005
Springer
14 years 5 months ago
Learnability of Probabilistic Automata via Oracles
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
Omri Guttman, S. V. N. Vishwanathan, Robert C. Wil...
ICASSP
2009
IEEE
14 years 3 months ago
Map approach to learning sparse Gaussian Markov networks
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
Narges Bani Asadi, Irina Rish, Katya Scheinberg, D...