Sciweavers

247 search results - page 14 / 50
» Superset Learning Based on Generalized Loss Minimization
Sort
View
SIGIR
2002
ACM
14 years 9 months ago
Risk minimization and language modeling in text retrieval dissertation abstract
tion Abstract ChengXiang Zhai (Advisor: John Lafferty) Language Technologies Institute School of Computer Science Carnegie Mellon University With the dramatic increase in online in...
ChengXiang Zhai
NIPS
2008
14 years 11 months ago
Tighter Bounds for Structured Estimation
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
Olivier Chapelle, Chuong B. Do, Quoc V. Le, Alexan...
JCSS
2006
77views more  JCSS 2006»
14 years 10 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
JMLR
2012
13 years 14 days ago
Max-Margin Min-Entropy Models
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on ...
Kevin Miller, M. Pawan Kumar, Benjamin Packer, Dan...
PRICAI
2000
Springer
15 years 1 months ago
Unified Criterion of State Generalization for Reactive Autonomous Agents
Autonomous state generalization problem is a key issue in the research field of behavior learning of reactive agents, and many approaches have been proposed in recent years. Howeve...
Takehisa Yairi, Koichi Hori, Shinichi Nakasuka