메뉴 건너뛰기




Volumn 54, Issue 4, 2008, Pages 1725-1735

Sequential procedures for aggregating arbitrary estimators of a conditional mean

Author keywords

Aggregation; Bayesian model averaging; Individual sequence; Oracle inequality; Prediction; Regression

Indexed keywords

APPROXIMATION THEORY; BAYESIAN NETWORKS; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES;

EID: 41949142938     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.917657     Document Type: Article
Times cited : (24)

References (37)
  • 1
    • 4944233194 scopus 로고    scopus 로고
    • J.-Y. Audibert, Aggregated estimators and empirical complexity for least square regression, Annal. l'Institut Henri Poincaré (B), Probab. Statist., 40, pp. 685-736, 2003.
    • J.-Y. Audibert, "Aggregated estimators and empirical complexity for least square regression," Annal. l'Institut Henri Poincaré (B), Probab. Statist., vol. 40, pp. 685-736, 2003.
  • 2
    • 0035370926 scopus 로고    scopus 로고
    • Relative loss bounds for on-line density estimation with the exponential family of distributions
    • S. Azoury and M. Warmuth, "Relative loss bounds for on-line density estimation with the exponential family of distributions," Mach. Learn., vol. 43, pp. 211-245, 2001.
    • (2001) Mach. Learn , vol.43 , pp. 211-245
    • Azoury, S.1    Warmuth, M.2
  • 3
    • 0027599793 scopus 로고
    • Universal approximation bounds for superpositions of a sigmoidal function
    • May
    • A. R. Barron, "Universal approximation bounds for superpositions of a sigmoidal function," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 930-945, May 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.3 , pp. 930-945
    • Barron, A.R.1
  • 4
    • 33645301284 scopus 로고    scopus 로고
    • L. Birgé, Model selection via testing: An alternative to (penalized) maximum likelihood estimators, Anna. l'Institut Henri Poincare (B) Prob. Statist., 42, pp. 273-325, 2006.
    • L. Birgé, "Model selection via testing: An alternative to (penalized) maximum likelihood estimators," Anna. l'Institut Henri Poincare (B) Prob. Statist., vol. 42, pp. 273-325, 2006.
  • 5
    • 38049043619 scopus 로고    scopus 로고
    • Aggregation for Gaussian regression
    • F. Bunea, A. B. Tsybakov, and M. H. Wegkamp, "Aggregation for Gaussian regression," Anna. Statist., vol. 35, pp. 1674-1697, 2007.
    • (2007) Anna. Statist , vol.35 , pp. 1674-1697
    • Bunea, F.1    Tsybakov, A.B.2    Wegkamp, M.H.3
  • 6
    • 0030719215 scopus 로고    scopus 로고
    • Analysis of two gradient-based algorithms for on-line regression
    • ACM Press
    • N. Cesa-Bianchi, "Analysis of two gradient-based algorithms for on-line regression," in Proc.12th Annu. Conf. Computational Learning Theory 1999, pp. 163-170, ACM Press.
    • (1999) Proc.12th Annu. Conf. Computational Learning Theory , pp. 163-170
    • Cesa-Bianchi, N.1
  • 9
    • 0033234631 scopus 로고    scopus 로고
    • On the prediction of individual sequences
    • N. Cesa-Bianchi and G. Lugosi, "On the prediction of individual sequences," Ann. Statist., vol. 27, pp. 1865-1895, 2000.
    • (2000) Ann. Statist , vol.27 , pp. 1865-1895
    • Cesa-Bianchi, N.1    Lugosi, G.2
  • 11
    • 33646360369 scopus 로고    scopus 로고
    • Statistical learning theory and stochastic optimization
    • Ecole d'Eté de Probabilités de Saint-Flour, New York: Springer
    • O. Catoni, "Statistical learning theory and stochastic optimization," in Ecole d'Eté de Probabilités de Saint-Flour 2001 (Lecture Notes in Mathematics). New York: Springer, 2001, vol. 1851.
    • (2001) Lecture Notes in Mathematics , vol.1851
    • Catoni, O.1
  • 12
    • 0002476325 scopus 로고    scopus 로고
    • Regret in the on-line decision problem
    • D. P. Foster and R. Vohra, "Regret in the on-line decision problem," Games and Economic Behavior, vol. 29, pp. 1084-1090, 1999.
    • (1999) Games and Economic Behavior , vol.29 , pp. 1084-1090
    • Foster, D.P.1    Vohra, R.2
  • 13
    • 0030387369 scopus 로고    scopus 로고
    • Predicting a binary sequence almost as well as the optimal biased coin
    • New York, ACM Press
    • Y. Freund, "Predicting a binary sequence almost as well as the optimal biased coin," in Proc. 9th Annu. Conf. Computational Learning Theory New York, 1996, pp. 89-98, ACM Press.
    • (1996) Proc. 9th Annu. Conf. Computational Learning Theory , pp. 89-98
    • Freund, Y.1
  • 15
    • 0013175742 scopus 로고    scopus 로고
    • Strategies for sequential prediction of stationary time series
    • M. Dror, P. L. Ecuyer, and F. Szidarovszky, Eds. Boston, MA: Kluwer
    • L. Györfi and G. Lugosi, "Strategies for sequential prediction of stationary time series," in Modeling Uncertainty: An Examination of its Theory, Methods, and Applications, M. Dror, P. L. Ecuyer, and F. Szidarovszky, Eds. Boston, MA: Kluwer, 2001.
    • (2001) Modeling Uncertainty: An Examination of its Theory, Methods, and Applications
    • Györfi, L.1    Lugosi, G.2
  • 16
    • 0033321311 scopus 로고    scopus 로고
    • A simple randomized algorithm for consistent sequential prediction of ergodic time series
    • De
    • L. Györfi, G. Lugosi, and G. Morvai, "A simple randomized algorithm for consistent sequential prediction of ergodic time series," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2642-2650, De. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , Issue.7 , pp. 2642-2650
    • Györfi, L.1    Lugosi, G.2    Morvai, G.3
  • 17
    • 0032164946 scopus 로고    scopus 로고
    • Sequential prediction of individual sequences under general loss functions
    • Sep
    • D. H. Haussler, J. Kivenen, and M. K. Warmuth, "Sequential prediction of individual sequences under general loss functions," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1906-1925, Sep. 1998.
    • (1998) IEEE Trans. Inf. Theory , vol.44 , Issue.5 , pp. 1906-1925
    • Haussler, D.H.1    Kivenen, J.2    Warmuth, M.K.3
  • 19
    • 0034362823 scopus 로고    scopus 로고
    • Functional aggregation for nonparametric regression
    • A. Juditsky and A. Nemirovski, "Functional aggregation for nonparametric regression," Ann. Statist., vol. 28, pp. 681-712, 2000.
    • (2000) Ann. Statist , vol.28 , pp. 681-712
    • Juditsky, A.1    Nemirovski, A.2
  • 20
    • 84947774618 scopus 로고    scopus 로고
    • J. Kivinen and M. K. Warmuth, Averaging expert predictions, in Proc. 4th Europ. Conf. Computational Learning Theory (Euro-COLT99) (Lecture Notes in Computer Science), H. U. Simon and P. Fischer, Eds. Berlin, Germany: Springer-Verlag, 1999, pp. 153-167.
    • J. Kivinen and M. K. Warmuth, "Averaging expert predictions," in Proc. 4th Europ. Conf. Computational Learning Theory (Euro-COLT99) (Lecture Notes in Computer Science), H. U. Simon and P. Fischer, Eds. Berlin, Germany: Springer-Verlag, 1999, pp. 153-167.
  • 21
    • 33847646046 scopus 로고    scopus 로고
    • Local Rademacher Complexities and Oracle Inequalities in Risk Minimization
    • Preprint
    • V. Koltchinskii, Local Rademacher Complexities and Oracle Inequalities in Risk Minimization, Preprint, 2004.
    • (2004)
    • Koltchinskii, V.1
  • 22
    • 33746478298 scopus 로고    scopus 로고
    • Information theory and mixing least-squares regressions
    • Aug
    • G. Leung and A. R. Barron, "Information theory and mixing least-squares regressions," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3396-3410, Aug. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.8 , pp. 3396-3410
    • Leung, G.1    Barron, A.R.2
  • 23
    • 35148838877 scopus 로고
    • The weighted majority algorithm
    • N. Littlestone and M. K. Warmuth, "The weighted majority algorithm," Info. Comput., vol. 108, pp. 212-261, 1994.
    • (1994) Info. Comput , vol.108 , pp. 212-261
    • Littlestone, N.1    Warmuth, M.K.2
  • 24
    • 0032184197 scopus 로고    scopus 로고
    • Universal prediction
    • Oct
    • N. Merhav and M. Feder, "Universal prediction," IEEE Trans. Info. Theory, vol. 44, no. 6, pp. 2124-2147, Oct. 1998.
    • (1998) IEEE Trans. Info. Theory , vol.44 , Issue.6 , pp. 2124-2147
    • Merhav, N.1    Feder, M.2
  • 25
    • 0007259908 scopus 로고    scopus 로고
    • Topics in nonparametric statistics
    • Ecole d'Eté de Probabilités de Saint-Flour, P. Bernard, Ed. New York: Springer, XXVIII
    • A. Nemirovski, "Topics in nonparametric statistics," in Ecole d'Eté de Probabilités de Saint-Flour 1998 (Lecture Notes in Mathematics), P. Bernard, Ed. New York: Springer, 2000, XXVIII.
    • (1998) Lecture Notes in Mathematics
    • Nemirovski, A.1
  • 26
    • 0037268871 scopus 로고    scopus 로고
    • On optimal sequential decision schemes for general processes
    • jan
    • A. B. Nobel, "On optimal sequential decision schemes for general processes," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 83-98, jan. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.1 , pp. 83-98
    • Nobel, A.B.1
  • 27
    • 0033348048 scopus 로고    scopus 로고
    • Universal linear prediction by model order weighting
    • Oct
    • A. Singer and M. Feder, "Universal linear prediction by model order weighting," IEEE Trans. Signal Process., vol. 47, no. 10, pp. 2685-2699, Oct. 1999.
    • (1999) IEEE Trans. Signal Process , vol.47 , Issue.10 , pp. 2685-2699
    • Singer, A.1    Feder, M.2
  • 29
    • 9444226947 scopus 로고    scopus 로고
    • Optimal rates of aggregation
    • Proc. 16th Annu. Conf. Learning Theory (COLT) and 7th Annu. Workshop on Kernel Machines, Heidelberg, Germany: Springer-Verlag
    • A. B. Tsybakov, "Optimal rates of aggregation," in Proc. 16th Annu. Conf. Learning Theory (COLT) and 7th Annu. Workshop on Kernel Machines Lecture Notes in Artificial Intelligence. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2777, pp. 303-313.
    • (2003) Lecture Notes in Artificial Intelligence , vol.2777 , pp. 303-313
    • Tsybakov, A.B.1
  • 31
    • 0035413537 scopus 로고    scopus 로고
    • Competitive on-line statistics
    • V. Vovk, "Competitive on-line statistics," Int. Stat. Rev., vol. 69, pp. 213-248, 2001.
    • (2001) Int. Stat. Rev , vol.69 , pp. 213-248
    • Vovk, V.1
  • 32
    • 21144432799 scopus 로고    scopus 로고
    • Model selection in nonparametric regression
    • M. H. Wegkamp, "Model selection in nonparametric regression," Ann. Statist., vol. 31, pp. 252-273, 2003.
    • (2003) Ann. Statist , vol.31 , pp. 252-273
    • Wegkamp, M.H.1
  • 33
    • 0031630775 scopus 로고    scopus 로고
    • Minimax relative loss analysis for sequential prediction algorithms using parametric hypotheses
    • ACM Press
    • K. Yamanishi, "Minimax relative loss analysis for sequential prediction algorithms using parametric hypotheses," in Proc. COLT 98, 1998, pp. 32-43, ACM Press.
    • (1998) Proc. COLT 98 , pp. 32-43
    • Yamanishi, K.1
  • 34
    • 0347607206 scopus 로고    scopus 로고
    • Adaptive estimation in pattern recognition by combining different procedures
    • Y. Yang, "Adaptive estimation in pattern recognition by combining different procedures," Statistica Sinica, vol. 10, pp. 1069-1089, 2000.
    • (2000) Statistica Sinica , vol.10 , pp. 1069-1089
    • Yang, Y.1
  • 35
    • 1542573460 scopus 로고    scopus 로고
    • Adaptive regression by mixing
    • Y. Yang, "Adaptive regression by mixing," J. Amer. Statist. Assoc. vol. 96, pp. 574-588, 2001.
    • (2001) J. Amer. Statist. Assoc , vol.96 , pp. 574-588
    • Yang, Y.1
  • 36
    • 29144460670 scopus 로고    scopus 로고
    • Aggregating regression procedures for a better performance
    • Y. Yang, "Aggregating regression procedures for a better performance," Bernoulli, vol. 10, pp. 25-47, 2004.
    • (2004) Bernoulli , vol.10 , pp. 25-47
    • Yang, Y.1
  • 37
    • 0742271402 scopus 로고    scopus 로고
    • Combining forecasting procedures: Some theoretical results
    • Y. Yang, "Combining forecasting procedures: Some theoretical results," Econometric Theory, vol. 20, pp. 176-222, 2004.
    • (2004) Econometric Theory , vol.20 , pp. 176-222
    • Yang, Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.