Sciweavers

3556 search results - page 263 / 712
» Can machine learning be secure
Sort
View
ICML
2010
IEEE
15 years 6 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
ICML
2010
IEEE
15 years 6 months ago
Probabilistic Backward and Forward Reasoning in Stochastic Relational Worlds
Inference in graphical models has emerged as a promising technique for planning. A recent approach to decision-theoretic planning in relational domains uses forward inference in d...
Tobias Lang, Marc Toussaint
ICML
2010
IEEE
15 years 6 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
ICML
2010
IEEE
15 years 6 months ago
The Elastic Embedding Algorithm for Dimensionality Reduction
We propose a new dimensionality reduction method, the elastic embedding (EE), that optimises an intuitive, nonlinear objective function of the low-dimensional coordinates of the d...
Miguel Á. Carreira-Perpiñán
ML
2000
ACM
144views Machine Learning» more  ML 2000»
15 years 5 months ago
MultiBoosting: A Technique for Combining Boosting and Wagging
MultiBoosting is an extension to the highly successful AdaBoost technique for forming decision committees. MultiBoosting can be viewed as combining AdaBoost with wagging. It is abl...
Geoffrey I. Webb