A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
From MaRDI portal
Publication:5814290
DOI10.1214/aoms/1177729330zbMath0048.11804OpenAlexW2042587503WikidataQ56430037 ScholiaQ56430037MaRDI QIDQ5814290
Publication date: 1952
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177729330
Related Items (only showing first 100 items - show all)
On solving LPN using BKW and variants, Implementation and analysis ⋮ Large deviations principle for white noise distributions with growth condition ⋮ Indirect acquisition of information in quantum mechanics ⋮ Strongly continuous and locally equi-continuous semigroups on locally convex spaces ⋮ Multilevel hybrid Chernoff tau-leap ⋮ Search cost for a nearly optimal path in a binary tree ⋮ Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ On clustering histograms with \(k\)-means by using mixed \(\alpha\)-divergences ⋮ Edge-disjoint rainbow spanning trees in complete graphs ⋮ On the runtime and robustness of randomized broadcasting ⋮ Hypothesis testing via affine detectors ⋮ Discriminating quantum states: the multiple Chernoff distance ⋮ Command-based importance sampling for statistical model checking ⋮ The behavior of the generator normalization factor in approximation of random processes ⋮ Note on the structure of Kruskal's algorithm ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Subjective interestingness of subgraph patterns ⋮ The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels ⋮ Agent-based randomized broadcasting in large networks ⋮ Convergence rates of large deviations probabilities for point estimators ⋮ Applications of large deviations to optimal experimental designs ⋮ Approximating majority depth ⋮ Probabilities of large deviations in topological spaces. I ⋮ Large population limits for evolutionary dynamics with random matching ⋮ Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks ⋮ Binary templates for comma-free DNA codes ⋮ On large deviations for Poisson stochastic integrals ⋮ The misclassification error of the maximum likelihood procedure when deciding among a finite choice of distributions ⋮ A subdiffusive behaviour of recurrent random walk in random environment on a regular tree ⋮ Second-order efficient test for inhomogeneous Poisson processes ⋮ A reversion of the Chernoff bound ⋮ Approximation algorithms for multiprocessor scheduling under uncertainty ⋮ Randomised broadcasting: memory vs. randomness ⋮ Reducing reinforcement learning to KWIK online regression ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ On large deviations in testing Ornstein-Uhlenbeck-type models ⋮ Confidence-based reasoning in stochastic constraint programming ⋮ Robust cutpoints in the logical analysis of numerical data ⋮ Minimum \(H\)-decompositions of graphs: edge-critical case ⋮ Law of large numbers in an epidemic model ⋮ Some results on approximate 1-median selection in metric spaces ⋮ An elementary proof of the lower bound of Cramér's theorem in \(\mathbb R^d\) ⋮ Classification when the covariate vectors have unequal dimensions ⋮ Efficient computation of approximate isomorphisms between Boolean functions ⋮ Uniform accuracy of the maximum likelihood estimates for probabilistic models of biological sequences ⋮ Asymptotic properties of posterior distributions in nonparametric regression with non-Gaussian errors ⋮ Limiting behavior of relative Rényi entropy in a non-regular location shift family ⋮ Spreading of messages in random graphs ⋮ Communication and energy efficient routing protocols for single-hop radio networks ⋮ Pricing of American options in discrete time using least squares estimates with complexity penalties ⋮ Spatial birth-death swap chains ⋮ The adaptable choosability number grows with the choosability number ⋮ Total progeny in killed branching random walk ⋮ Nonparametric signal detection with small type I and type II error probabilities ⋮ Randomly colouring graphs (a combinatorial view) ⋮ The saga of minimum spanning trees ⋮ Robust control of uncertain systems: classical results and recent developments ⋮ Efficient distributed sensing using adaptive censoring-based inference ⋮ Colouring graphs when the number of colours is almost the maximum degree ⋮ Noise sensitivity in continuum percolation ⋮ Confidence intervals for the Shapley-Shubik power index in Markovian games ⋮ Chernoff distance for truncated distributions ⋮ System identification in the presence of outliers and random noises: a compressed sensing approach ⋮ Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions ⋮ The horseshoe estimator: posterior concentration around nearly black vectors ⋮ Neighborhood-based uncertainty generation in social networks ⋮ Hypothesis testing by convex optimization ⋮ Discussion of ``Hypothesis testing by convex optimization ⋮ Rejoinder of ``Hypothesis testing by convex optimization ⋮ On the distances between certain distributions in multivariate statistical analysis ⋮ Uniform asymptotic properties of a nonparametric regression estimator of conditional tails ⋮ Randomized multipacket routing and sorting on meshes ⋮ Fast randomized parallel methods for planar convex hull construction ⋮ Improved parallel approximation of a class of integer programming problems ⋮ Bayesian signal detection with compressed measurements ⋮ Randomized approximation of bounded multicovering problems ⋮ Profile forward regression screening for ultra-high dimensional semiparametric varying coefficient partially linear models ⋮ Tight bounds for active self-assembly using an insertion primitive ⋮ The influence of large coalitions ⋮ Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy ⋮ The total path length of split trees ⋮ EL inference for partially identified models: large deviations optimality and bootstrap validity ⋮ User-friendly tail bounds for sums of random matrices ⋮ Solution to a function equation and divergence measures ⋮ Exact computation of minimum sample size for estimation of binomial parameters ⋮ Robustness and ambiguity in continuous time ⋮ Analysis of least squares regression estimates in case of additional errors in the variables ⋮ Thermodynamic uncertainty relations and irreversibility ⋮ Bootstrap-calibrated interval estimates for latent variable scores in item response theory ⋮ Fractional motions ⋮ Examining socioeconomic health disparities using a rank-dependent Rényi index ⋮ A provably efficient algorithm for dynamic storage allocation ⋮ Exponential bounds for the running time of a selection algorithm ⋮ Some inequalities relating to the partial sum of binomial probabilities ⋮ On the maximum cardinality of a consistent set of arcs in a random tournament ⋮ On the minimum order of graphs with given semigroup ⋮ Probabilities of large and moderate deviations for maximum likelihood estimates ⋮ On parallel integer sorting ⋮ An upward measure separation theorem ⋮ Learning and generalization errors for the 2D binary perceptron.
This page was built for publication: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
