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.11804WikidataQ56430037 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
Thermodynamic uncertainty relations and irreversibility, Convergence rates of large deviations probabilities for point estimators, Probabilities of large deviations in topological spaces. I, 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, Randomized approximation of bounded multicovering problems, The influence of large coalitions, Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy, 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., The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels, Agent-based randomized broadcasting in large networks, Applications of large deviations to optimal experimental designs, Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks, Binary templates for comma-free DNA codes, 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, A relation between the Chernoff index and the Pitman efficacy, A guided tour of Chernoff bounds, 0-1 laws and decision problems for fragments of second-order logic, Processor sharing: a survey of the mathematical theory, Large deviations in testing fractional Ornstein-Uhlenbeck models, Asymptotic error rates in quantum hypothesis testing, Goodness-of-fit tests for a heavy tailed distribution, Game chromatic index of graphs with given restrictions on degrees, Evaluation and selection of models for out-of-sample prediction when the sample size is small relative to the complexity of the data-generating process, Cuckoo hashing: Further analysis, On an upper bound of Sanov's inequality for the probability of a large deviation, Large deviations of order n for sums of random variables related to a Markov chain, Stopping times of one-sample rank order sequential probability ratio tests, Semiparametric analysis of discrete response. Asymptotic properties of the maximum score estimator, On the \(L_ p\) norm for some approximation operators, On progressively truncated maximum likelihood estimators, A conditional limit construction of the normal probability density, Large triangle-free subgraphs in graphs without \(K_ 4\), Random homeomorphisms, On convergence of conditional probability measures, Large deviations and asymptotic efficiency of a statistic of integral type. II, Multidimensional large deviation local limit theorems, Large deviations of uniformly recurrent Markov additive processes, The distribution of the finitely many times in the strong law of large numbers, Probabilistic methods, On the shape of the convex hull of random points, Local Bahadur efficiency of score tests, Communication-efficient parallel algorithms for distributed random-access machines, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Packing items from a triangular distribution, Does co-NP have short interactive proofs ?, A parallel bucket sort, Edge-colouring random graphs, Applications of the theory of records in the study of random trees, Broadcasting with random faults, Probabilities of large deviations for random fields, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Measures of distance between probability distributions, Knowing what doesn't matter: exploiting the omission of irrelevant data, Some first passage problems related to cusum procedures, Some new properties of the Bechhofer-Kiefer-Sobel stopping rule, Allocating observations between two normal populations to maximize the half slope of the F-test, Bahadur efficiency of the F-test, A note on the asymptotic efficiency of the Sobel-Wald test, Roth's estimate of the discrepancy of integer sequences is nearly sharp, Irregularities of two-colourings of the NxN square lattice, A lower bound for radio broadcast, Programmed interactions in higher-order neural networks: Maximal capacity, Local Chernoff and Hodges-Lehmann efficiencies of linear rank tests for symmetry, An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties, Confidence intervals for the mean in the bounded case, Some observations on skip-lists, The maximum number of winning 2-sets, On the complexity of approximating the independent set problem, Expected parallel time and sequential space complexity of graph and digraph problems, Optimal randomized parallel algorithms for computational geometry, Hodges-Lehmann and Chernoff efficiencies of linear rank statistics, Dynamic point location in arrangements of hyperplanes, On packing bipartite graphs, Circuit size relative to pseudorandom oracles, Randomized range-maxima in nearly-constant parallel time, Cooperation versus competition, Optimally ranking unrankable tournaments, Bayesian discriminant approach to input signal selection in parameter estimation problems, On sequential distinguishability for the exponential family, Exponential bound for distribution of locally infinitely divisible processes, The analysis of double hashing, Exponential convergence properties of linear estimators under exponential and uniform distribution, The weak convergence of likelihood ratio random fields and its applications, On hiding information from an oracle, Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps, Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis, An introduction to some statistical aspects of PAC learning theory, Effective bandwidths and performance bounds in high-speed communication systems, Random sampling and greedy sparsification for matroid optimization problems, Large deviation theorems for extended random variables and some applications, A new integral nonparametric test for the affine symmetry hypothesis, Elements of a theory of computer simulation. I, Chernoff-type bound for finite Markov chains, Signed domination in regular graphs and set-systems, Chernoff efficiency of the sign and Wilcoxon tests for testing the symmetry hypothesis, Singular stationary measures are not always fractal, An estimate of the probabilities of deviation of the sample mean, A self-normalized Erdős-Rényi type strong law of large numbers, Designing algorithms by expectations, Speed of convergence of the least-squares estimator in autoregressive models, Nonclairvoyant scheduling, Extended large deviations, On large deviation expansion of distribution of maximum likelihood estimator and its application in large sample estimation, A problem of Füredi and Seymour on covering intersecting families by pairs, Generalized divergence measures and the probability of error, Perturbation analysis of the \(GI/GI/1\) queue, Large deviations for fields with stationary independent increments, Expected complexity of graph partitioning problems, A design of a parallel dictionary using skip lists, Randomized routing on generalized hypercubes, Undecidable statements and random graphs, Self-normalized large deviations, Optimal convergence rates and asymptotic efficiency of point estimators under truncated distribution families, Functional Erdős-Rényi laws for processes indexed by sets, Efficient massively parallel implementation of some combinatorial algorithms, Random induced subgraphs of generalized \(n\)-cubes, On some conjectures of Graffiti, A lower bound for irredundant Ramsey numbers, Size-estimation framework with applications to transitive closure and reachability, Optimal bounds for the approximation of Boolean functions and some applications, Probabilistic robustness analysis: Explicit bounds for the minimum number of samples, Analysis and application of adaptive sampling, Faster deterministic sorting through better sampling., When does a random Robin Hood win?, How to use several noisy channels with unknown error probabilities, Gustav Elfving's impact on experimental design., Convexity and logical analysis of data, A large deviation theorem for \(U\)-processes, A near-optimal polynomial time algorithm for learning in certain classes of stochastic games, Large-deviation theorems in hypothesis-testing problems, Large-deviation probability and the local dimension of sets, Random subgraphs of Cayley graphs over \(p\)-groups, The passport control problem or how to keep a dynamic service system load balanced?, The complexity of theory revision, A probabilistic framework for problems with real structured uncertainty in systems and control, Local information and the design of sequential hypothesis tests, Integer sets with prescribed pairwise differences being distinct, A probabilistic analysis of the maximal covering location problem, A general lower bound on the number of examples needed for learning, A simple linear expected time algorithm for finding a Hamilton path, Probabilistic analysis of a heuristic for the dual bin packing problem, Average-case analysis of the modified harmonic algorithm, Large deviations for functionals of stationary processes, Asymptotic approximations for error probabilities of sequential or fixed sample size tests in exponential families., On generalized Ramsey theory: The bipartite case, The extremal function for complete minors, Randomized path coloring on binary trees., On the decisional complexity of problems over the reals, Statistical learning control of uncertain systems: theory and algorithms., Information and entropy econometrics -- editor's view., Disjointly representing set systems, Convergence rates for posterior distributions and adaptive estimation, Fast approximate probabilistically checkable proofs, Blinking model and synchronization in small-world networks with a time-varying coupling, The mean residual life function at great age: Applications to tail estimation, Adaptive decision making for stochastic processes, A large deviation principle for \(m\)-variate von Mises-statistics and \(U\)- statistics, Learning fallible deterministic finite automata, Independence number and the complexity of families of sets, Some properties of the Hellinger transform and its application in classification problems, Simultaneous approximation of the Feller operator, Large deviations for combinatorial distributions. I: Central limit theorems, Fluctuations of shapes of large areas under paths of random walks, Arthur-Merlin games in Boolean decision trees, Efficient algorithmic learning of the structure of permutation groups by examples, \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration, Expected time analysis of a simple recursive Poisson random variate generator, Central limit theorems of partial sums for large segmental values, Directed drift: A new linear threshold algorithm for learning binary weights on-line, Asymptotic efficiency of majority rule relative to rank-sum method for selecting the best population, A survey of randomized algorithms for control synthesis and performance verification, Minimum \(H\)-decompositions of graphs, On the Chernoff bound for efficiency of quantum hypothesis testing, Recursive robust estimation and control without commitment, Probabilistic distance measures of the Dirichlet and beta distributions, Goodness-of-fit tests via phi-divergences, A large deviation inequality for vector functions on finite reversible Markov chains, Convergence of \(k\) nearest neighbor kernel estimator in nonparametric functional regression, Toward a tight upper bound for the error probability of the binary Gaussian classification problem, Characterization of product anti-magic graphs of large order, Approximating the online set multicover problems via randomized winnowing, Meet and merge: approximation algorithms for confluent flows, Radio communication in random graphs, Nonparametric regression with additional measurement errors in the dependent variable, Large deviations for M-estimators, On exponential bounds for binomial probabilities, Iteration of positive approximation operators, A class of measures of informativity of observation channels, Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses, Probabilistic solutions to some NP-hard matrix problems, Log-efficient search for significant inputs of linear model, Convergence rates of change-point estimators and tail probabilities of the first-passage-time process, On random cartesian trees, On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm, Robust algorithms for packet routing in a mesh, Infinitary logics and very sparse random graphs, Skip trees, an alternative data structure to skip lists in a concurrent approach, Strong extension axioms and Shelah's zero-one law for choiceless polynomial time, Some results on increments of the partially observed empirical process, Unnamed Item, A glimpse of the impact of pál erdős on probability and statistics, An Improvement of Hind's Upper Bound on the Total Chromatic Number, Functional laws of the iterated logarithm for small increments of empirical processes, On the asymptotic efficiency of aligned‐rank tests in randomized block designs, A normal approximation for beta and gamma tail probabilities, Repeated likelihood ratio tests for curved exponential families, Estimation of Entropy and Mutual Information, Trading quantum for classical resources in quantum data compression, An overview of the theory of large deviations and applications to statistical mechanics, Analysis of quickselect : an algorithm for order statistics, PP multivariate random weighting method, Some Large Deviations Limit Theorems in Conditional Nonparametric Statistics, Tools to Estimate the First Passage Time to a Convex Barrier, Unnamed Item, Unnamed Item, Integration of Stochastic Models by Minimizing α-Divergence, Unnamed Item, [https://portal.mardi4nfdi.de/wiki/Software:5515921 Verschl�sselungstheorie f�r symmetrische Kan�le], On the Strong Law of Large Numbers, A relation between moment generating functions and convergence rates in the law of large numbers, Relative efficiency of the Wald ${\rm SPRT}$ and the Chernoff information number, Comparison of experiments when the parameter space is finite, Some Results Giving Rates of Convergence in the Law of Large Numbers for Weighted Sums of Independent Random Variables, On the Recurrence of a Certain Chain, A large deviation theorem for weighted sums, Large deviations for renewal processes, On the strong law of large numbers for a class of stochastic processes, Convergence properties of two-stage stochastic programming, On evaluating a class of frame-based nonstationary pattern recognition methods using Bhattacharyya distance, Nonstandard strong laws for local quantile processes, Large deviations for \(U\)-statistics, On the multifractal analysis of measures, Efficient randomized routing algorithms on the two-dimensional mesh of buses, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, A sequential approach to classification: Cost of not knowing the covariance matrix, Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph, Large deviations for a class of scale-parameter-free statistics under the gamma distribution, Moderate deviations for the kernel mode estimator and some applications, Sequential sampling techniques for algorithmic learning theory, Degenerate and Poisson convergence criteria for success runs, Settling time bounds for M/G/1 queues, Pseudorandom sources for BPP, The scaling window of the 2-SAT transition, On probabilistic elimination of generalized quantifiers, A large deviation principle for bootstrapped sample means, VALUE-AT-RISK ESTIMATION FOR DYNAMIC HEDGING, Optimal sampling of independent increment processes, Unnamed Item, Preparation information and optimal decompositions for mixed quantum states, Unnamed Item, Statistical Evidence for Small Generating Sets, Large deviations for Poisson systems of independent random walks, Problemas de optimo que relacionan la informacion de Kullback y el conjunto de riesgos de Neyman-Pearson, Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal, Reachability is harder for directed than for undirected finite graphs, Entropy, character theory and centrality of finite quasigroups, Spreading Messages, An Analysis of the Height of Tries with Random Weights on the Edges, A Proposal for a New Bound for Discrete Distributions, On Radio Broadcasting in Random Geometric Graphs, Sampling independent sets in the discrete torus, The asymptotic probabilistic behaviour of quadratic sum assignment problems, Unnamed Item, Hellinger integrals of diffusion processes, Unnamed Item, Unnamed Item, Unnamed Item, Almost sure convergence of the Hill estimator, Unnamed Item, Unnamed Item, Deterministic approximations of probability inequalities, Forbidden Intersections, Statistische Analyse des homogenen und des inhomogenen Poissonprozesses, Zero-One Laws for Sparse Random Graphs, A chaos hypothesis for some large systems of random equations, On the asymptotic distribution of a class of aligned rank order test statistics in randomized block designs, Einige statistische Verfahren im Zusammenhang mit Poissonprozessen und deren Anwendung, Approximations for interactive Markov chains in discrete and continuous time, Upper and lower class sequences for minimal uniform spacings, [https://portal.mardi4nfdi.de/wiki/Software:3946964 Vitesses maximales de d�croissance des erreurs et tests optimaux associ�s], Sparse pseudorandom distributions, A note on the probabilistic analysis of patricia trees, Bahadur efficiency and probabilities of large deviations, [https://portal.mardi4nfdi.de/wiki/Software:4150440 M�langes d'�quations diff�rentielles et grands �carts � la loi des grands nombres], Goodness-of-fit test statistics that dominate the Kolmogorov statistics, Some probabilistic methods in the theory of approximation operators, The chernoff efficiency of the wilcoxon rank test, Chernoff bounds for discriminating between two markov processes, Universal Limit Laws for Depths in Random Trees, The Sum of a Digitaddition Series, Fixed-width confidence sequences for the normal mean and the binomial probability
