{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:49:45Z","timestamp":1725454185043},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341052"},{"type":"electronic","value":"9783642341069"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34106-9_20","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T01:56:27Z","timestamp":1349056587000},"page":"229-244","source":"Crossref","is-referenced-by-count":2,"title":["Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples"],"prefix":"10.1007","author":[{"given":"Alexandra","family":"Carpentier","sequence":"first","affiliation":[]},{"given":"R\u00e9mi","family":"Munos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Carpentier, A., Munos, R.: Finite-time analysis of stratified sampling for monte carlo. In: Neural Information Processing Systems, NIPS (2011a)","key":"20_CR1"},{"unstructured":"Carpentier, A., Munos, R.: Finite-time analysis of stratified sampling for monte carlo. Technical report, INRIA-00636924 (2011b)","key":"20_CR2"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s11009-008-9108-0","volume":"12","author":"P. Etor\u00e9","year":"2010","unstructured":"Etor\u00e9, P., Jourdain, B.: Adaptive optimal allocation in stratified sampling methods. Methodol. Comput. Appl. Probab.\u00a012(3), 335\u2013360 (2010)","journal-title":"Methodol. Comput. Appl. Probab."},{"unstructured":"Etor\u00e9, P., Fort, G., Jourdain, B., Moulines, \u00c9.: On adaptive stratification. Ann. Oper. Res. (2011) (to appear)","key":"20_CR4"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1214\/09-AOS738","volume":"38","author":"E. Gin\u00e9","year":"2010","unstructured":"Gin\u00e9, E., Nickl, R.: Confidence bands in density estimation. The Annals of Statistics\u00a038(2), 1122\u20131170 (2010)","journal-title":"The Annals of Statistics"},{"doi-asserted-by":"crossref","unstructured":"Glasserman, P.: Monte Carlo methods in financial engineering. Springer (2004) ISBN 0387004513","key":"20_CR6","DOI":"10.1007\/978-0-387-21617-1"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1111\/1467-9965.00065","volume":"9","author":"P. Glasserman","year":"1999","unstructured":"Glasserman, P., Heidelberger, P., Shahabuddin, P.: Asymptotically optimal importance sampling and stratification for pricing path-dependent options. Mathematical Finance\u00a09(2), 117\u2013152 (1999)","journal-title":"Mathematical Finance"},{"unstructured":"Grover, V.: Active learning and its application to heteroscedastic problems. Department of Computing Science, Univ. of Alberta, MSc thesis (2009)","key":"20_CR8"},{"doi-asserted-by":"crossref","unstructured":"Hoffmann, M., Lepski, O.: Random rates in anisotropic regression. Annals of Statistics, 325\u2013358 (2002)","key":"20_CR9","DOI":"10.1214\/aos\/1021379858"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1734222.1734225","volume":"20","author":"R. Kawai","year":"2010","unstructured":"Kawai, R.: Asymptotically optimal allocation of stratified sampling with adaptive variance reduction by strata. ACM Transactions on Modeling and Computer Simulation (TOMACS)\u00a020(2), 1\u201317 (2010) ISSN 1049-3301","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"doi-asserted-by":"crossref","unstructured":"Rubinstein, R.Y., Kroese, D.P.: Simulation and the Monte Carlo method. Wiley-interscience (2008) ISBN 0470177942","key":"20_CR11","DOI":"10.1002\/9780470230381"},{"doi-asserted-by":"crossref","unstructured":"Carpentier, A., Munos, R.: Minimax Number of Strata for Online Stratified Sampling given Noisy Samples. Technical report, INRIA-00698517 (2012)","key":"20_CR12","DOI":"10.1007\/978-3-642-34106-9_20"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34106-9_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:44:56Z","timestamp":1620117896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34106-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341052","9783642341069"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34106-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}