Sciweavers

1106 search results - page 192 / 222
» On regularization algorithms in learning theory
Sort
View
AI
1999
Springer
15 years 3 months ago
Topological Inference of Teleology: Deriving Function from Structure via Evidential Reasoning
Reasoning about the physical world is a central human cognitive activity. One aspect of such reasoning is the inference of function from the structure of the artifacts one encount...
John O. Everett
ATAL
2011
Springer
14 years 4 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 11 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
NDSS
2008
IEEE
15 years 10 months ago
Limits of Learning-based Signature Generation with Adversaries
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
Shobha Venkataraman, Avrim Blum, Dawn Song
TREC
2004
15 years 5 months ago
Can We Get A Better Retrieval Function From Machine?
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
Weiguo Fan, Wensi Xi, Edward A. Fox, Li Wang