Electronic Journal of Statistics

Hypothesis testing via affine detectors

Anatoli Juditsky and Arkadi Nemirovski

Full-text: Open access


In this paper, we further develop the approach, originating in [13], to “computation-friendly” hypothesis testing via Convex Programming. Most of the existing results on hypothesis testing aim to quantify in a closed analytic form separation between sets of distributions allowing for reliable decision in precisely stated observation models. In contrast to this descriptive (and highly instructive) traditional framework, the approach we promote here can be qualified as operational – the testing routines and their risks are yielded by an efficient computation. All we know in advance is that, under favorable circumstances, specified in [13], the risk of such test, whether high or low, is provably near-optimal under the circumstances. As a compensation for the lack of “explanatory power,” this approach is applicable to a much wider family of observation schemes and hypotheses to be tested than those where “closed form descriptive analysis” is possible.

In the present paper our primary emphasis is on computation: we make a step further in extending the principal tool developed in [13] – testing routines based on affine detectors – to a large variety of testing problems. The price of this development is the loss of blanket near-optimality of the proposed procedures (though it is still preserved in the observation schemes studied in [13], which now become particular cases of the general setting considered here).

Article information

Electron. J. Statist., Volume 10, Number 2 (2016), 2204-2242.

Received: July 2016
First available in Project Euclid: 19 July 2016

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 62G10: Hypothesis testing 62C20: Minimax procedures
Secondary: 62M02: Markov processes: hypothesis testing 62M10: Time series, auto-correlation, regression, etc. [See also 91B84] 90C25: Convex programming 65K10: Optimization and variational techniques [See also 49Mxx, 93B40]

Hypothesis testing nonparametric testing composite hypothesis testing statistical applications of convex optimization


Juditsky, Anatoli; Nemirovski, Arkadi. Hypothesis testing via affine detectors. Electron. J. Statist. 10 (2016), no. 2, 2204--2242. doi:10.1214/16-EJS1170. https://projecteuclid.org/euclid.ejs/1468954728

Export citation


  • [1] L. Birgé., Approximation dans les spaces métriques et théorie de l’estimation: inégalités de Cràmer-Chernoff et théorie asymptotique des tests. PhD thesis, Université Paris VII, 1980.
  • [2] L. Birgé. Vitesses maximales de décroissance des erreurs et tests optimaux associés., Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 55(3):261–273, 1981.
  • [3] L. Birgé. Sur un théorème de minimax et son application aux tests., Probab. Math. Stat., 3:259–282, 1982.
  • [4] L. Birgé. Approximation dans les espaces métriques et théorie de l’estimation., Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 65(2):181–237, 1983.
  • [5] L. Birgé. Model selection via testing: an alternative to (penalized) maximum likelihood estimators., Annales de l’Institut Henri Poincare (B) Probability and Statistics, 42(3):273–325, 2006.
  • [6] L. Birgé. Robust tests for model selection. In M. Banerjee, F. Bunea, J. Huang, V. Koltchinskii, and M. Maathuis, editors, From Probability to Statistics and Back: High-Dimensional Models and Processes – A Festschrift in Honor of Jon A. Wellner, pages 47–64. Institute of Mathematical Statistics, 2013.
  • [7] M. Burnashev. On the minimax detection of an imperfectly known signal in a white noise background., Theory Probab. Appl., 24:107–119, 1979.
  • [8] M. Burnashev. Discrimination of hypotheses for gaussian measures and a geometric characterization of the gaussian distribution., Math. Notes, 32:757–761, 1982.
  • [9] H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations., The Annals of Mathematical Statistics, pages 493–507, 1952.
  • [10] D. Donoho and R. Liu. Geometrizing rate of convergence I. Technical report, Tech. Report 137a, Dept. of Statist., University of California, Berkeley, 1987.
  • [11] D. L. Donoho and R. C. Liu. Geometrizing rates of convergence, II., The Annals of Statistics, pages 633–667, 1991.
  • [12] A. Goldenshluger. A universal procedure for aggregating estimators., The Annals of Statistics, pages 542–568, 2009.
  • [13] A. Goldenshluger, A. Juditsky, and A. Nemirovski. Hypothesis testing by convex optimization., Electronic Journal of Statistics, 9(2) :1645–1712, 2015.
  • [14] J.-B. Hiriart-Urruty and C. Lemarechal., Convex Analysis and Minimization Algorithms I: Fundamentals (Grundlehren Der Mathematischen Wissenschaften). Springer, 1993.
  • [15] Y. Ingster and I. A. Suslina., Nonparametric goodness-of-fit testing under Gaussian models, volume 169 of Lecture Notes in Statistics. Springer, 2002.
  • [16] C. Kraft. Some conditions for consistency and uniform consistency of statistical procedures., Univ. of California Publ. Statist., 2:493–507, 1955.
  • [17] L. Le Cam. Convergence of estimates under dimensionality restrictions., The Annals of Statistics, pages 38–53, 1973.