ACM Home Page
Please provide us with feedback. Feedback
Actively learning level-sets of composite functions
Full text PdfPdf (283 KB)
Source ICML; Vol. 307 archive
Proceedings of the 25th international conference on Machine learning table of contents
Helsinki, Finland
Pages 80-87  
Year of Publication: 2008
ISBN:978-1-60558-205-4
Authors
Brent Bryan  Google Inc., Pittsburgh, PA
Jeff Schneider  Carnegie Mellon University, Pittsburgh, PA
Sponsors
: Yahoo!
: Xerox
IBM : IBM
: NSF
Microsoft Research : Microsoft Research
: Machine Learning Journal/Springer
: Pascal
: University of Helsinki
: Federation of Finnish Learned Societies
: Intel Corporation
: Google
: Helsinki Institute for Information Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 20,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390156.1390167
What is a DOI?

ABSTRACT

Scientists frequently have multiple types of experiments and data sets on which they can test the validity of their parameterized models and locate plausible regions for the model parameters. By examining multiple data sets, scientists can obtain inferences which typically are much more informative than the deductions derived from each of the data sources independently. Several standard data combination techniques result in target functions which are a weighted sum of the observed data sources. Thus, computing constraints on the plausible regions of the model parameter space can be formulated as finding a level set of a target function which is the sum of observable functions. We propose an active learning algorithm for this problem which selects both a sample (from the parameter space) and an observable function upon which to compute the next sample. Empirical tests on synthetic functions and on real data for an eight parameter cosmological model show that our algorithm significantly reduces the number of samples required to identify the desired level-set.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Bennett, C. L., et al. (2003). First-Year Wilkinson Microwave Anisotropy Probe (WMAP) Observations: Foreground Emission. Astrophysical Journal Supplemental, 148, 97--117.
 
3
 
4
Bryan, B., et al. (2005). Active learning for identifying function threshold boundaries. In Advances in neural information processing systems 18. Cambridge, MA: MIT Press.
 
5
Cressie, N. (1991). Statistics for spatial data. New York: Wiley.
 
6
Davis, T. M., et al. (2007). Scrutinizing Exotic Cosmological Models Using ESSENCE Supernova Data Combined with Other Cosmological Probes. Astrophysical Journal, 666, 716.
 
7
Fisher, R. (1932). Statistical methods for research workers. London: Oliver and Boyd. 4 edition.
8
 
9
Hedges, L. V. (1985). Statistical methods for meta-analysis. Academic Press.
10
 
11
 
12
Ramakrishnan, N., et al. (2005). Gaussian processes for active data mining of spatial aggregates. Proceedings of the SIAM International Conference on Data Mining.
 
13
 
14
Santner, T. J., Williams, B. J., & Notz, W. (2003). The design and analyis of computer experiments. Springer. 1 edition.
 
15
Shmueli, G., & Fienberg, S. E. (2006). Statistical methods in counterterrorism, chapter Current and Potential Statistical Methods for Monitoring Multiple Data Streams for Biosurveillance, 109. New York: Springer.
 
16
Spergel, D. et al. (2003). First-Year Wilkinson Microwave Anisotropy Probe Observations: Determination of Cosmological Parameters. Astrophysical Journal Supplemental, 148.
 
17
Tegmark, M., et al. (2006). Cosmological constraints from the SDSS luminous red galaxies. Physical Review D, 74, 123507.

Collaborative Colleagues:
Brent Bryan: colleagues
Jeff Schneider: colleagues