Sciweavers

4930 search results - page 40 / 986
» Learning minimal abstractions
Sort
View
139
Voted
EC
2011
216views ECommerce» more  EC 2011»
14 years 4 months ago
Abandoning Objectives: Evolution Through the Search for Novelty Alone
man and Kenneth O. Stanley (2010). Revising the Evolutionary Computation Abstraction: Minimal Criteria Novelty Search. In: Proceedings of the Genetic and Evolutionary Computation C...
Joel Lehman, Kenneth O. Stanley
97
Voted
NAACL
2010
14 years 10 months ago
Minimally-Supervised Extraction of Entities from Text Advertisements
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
Sameer Singh, Dustin Hillard, Chris Leggetter
ML
2010
ACM
138views Machine Learning» more  ML 2010»
14 years 7 months ago
Mining adversarial patterns via regularized loss minimization
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
Wei Liu, Sanjay Chawla
ICASSP
2011
IEEE
14 years 4 months ago
Application specific loss minimization using gradient boosting
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
Bin Zhang, Abhinav Sethy, Tara N. Sainath, Bhuvana...
CAV
2007
Springer
121views Hardware» more  CAV 2007»
15 years 6 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh