English
Related papers

Related papers: A New Upper Bound for Distributed Hypothesis Testi…

200 papers

This paper proposes a distributed attack detection and mitigation technique based on distributed estimation over a multi-agent network, where the agents take partial system measurements susceptible to (possible) biasing attacks. In…

Systems and Control · Electrical Eng. & Systems 2021-09-21 Mohammadreza Doostmohammadian , Houman Zarrabi , Hamid R. Rabiee , Usman A. Khan , Themistoklis Charalambous

In this paper, we have developed an approach to generate test data for path coverage based testing. The main challenge of this kind testing lies in its ability to build efficiently such a test suite in order to minimize the number of…

Software Engineering · Computer Science 2017-11-30 Esmaeel Nikravan , Farid Feyzi , Saeed Parsa

We derive new upper and lower bounds for probabilities that $r$ or at least $r$ from $n$ events occur. These bounds can turn to equalities. The method is discussed as well. It works for measurable space and measures with sign, too. We also…

Probability · Mathematics 2020-08-12 Andrei N. Frolov

We consider two alternative tests to the Higher Criticism test of Donoho and Jin [Ann. Statist. 32 (2004) 962-994] for high-dimensional means under the sparsity of the nonzero means for sub-Gaussian distributed data with unknown column-wise…

Statistics Theory · Mathematics 2013-12-19 Ping-Shou Zhong , Song Xi Chen , Minya Xu

Recently, the introduction of the generative adversarial network (GAN) and its variants has enabled the generation of realistic synthetic samples, which has been used for enlarging training sets. Previous work primarily focused on data…

Machine Learning · Computer Science 2018-08-27 Swee Kiat Lim , Yi Loo , Ngoc-Trung Tran , Ngai-Man Cheung , Gemma Roig , Yuval Elovici

This paper first focuses on deriving an alternative approach for proving an extremal entropy inequality (EEI), originally presented in [11]. The proposed approach does not rely on the channel enhancement technique, and has the advantage…

Information Theory · Computer Science 2012-11-21 Sangwoo Park , Erchin Serpedin , Khalid Qaraqe

We prove new probabilistic upper bounds on generalization error of complex classifiers that are combinations of simple classifiers. Such combinations could be implemented by neural networks or by voting methods of combining the classifiers,…

Probability · Mathematics 2007-05-23 Vladimir Koltchinskii , Dmitry Panchenko

We present a detailed study of estimation errors in terms of surrogate loss estimation errors. We refer to such guarantees as $\mathscr{H}$-consistency estimation error bounds, since they account for the hypothesis set $\mathscr{H}$…

Machine Learning · Computer Science 2022-05-18 Pranjal Awasthi , Anqi Mao , Mehryar Mohri , Yutao Zhong

Hypothesis testing results often rely on simple, yet important assumptions about the behaviour of the distribution of p-values under the null and the alternative. We examine tests for one dimensional parameters of interest that converge to…

Statistics Theory · Mathematics 2021-08-06 Yanbo Tang , Radu Craiu , Lei Sun

Model attribution is a critical component of deep neural networks (DNNs) for its interpretability to complex models. Recent studies bring up attention to the security of attribution methods as they are vulnerable to attribution attacks that…

Machine Learning · Computer Science 2023-03-02 Fan Wang , Adams Wai-Kin Kong

We initiate a systematic investigation of distribution testing in the framework of algorithmic replicability. Specifically, given independent samples from a collection of probability distributions, the goal is to characterize the sample…

Machine Learning · Computer Science 2025-07-04 Ilias Diakonikolas , Jingyi Gao , Daniel Kane , Sihan Liu , Christopher Ye

A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by…

Information Theory · Computer Science 2010-10-08 Ali Nazari , S. Sandeep Pradhan , Achilleas Anastasopoulos

We study the amplitude-constrained additive white Gaussian noise channel. It is well known that the capacity-achieving input distribution for this channel is discrete and supported on finitely many points. The best known bounds show that…

Information Theory · Computer Science 2026-03-26 Haiyang Wang , Luca Barletta , Alex Dytso

Bayesian hypothesis testing is re-examined from the perspective of an a priori assessment of the test statistic distribution under the alternative. By assessing the distribution of an observable test statistic, rather than prior parameter…

Statistics Theory · Mathematics 2018-08-28 Hedibert F. Lopes , Nicholas G. Polson

We describe a general framework for weighted parametric multiple test procedures based on the closure principle. We utilize general weighting strategies that can reflect complex study objectives and include many procedures in the literature…

Methodology · Statistics 2019-08-14 Dong Xi , Ekkehard Glimm , Willi Maurer , Frank Bretz

This paper proposes an adaptive penalized weighted mean regression for outlier detection of high-dimensional data. In comparison to existing approaches based on the mean shift model, the proposed estimators demonstrate robustness against…

Statistics Theory · Mathematics 2023-06-27 Jiaqi Li , Linglong Kong , Bei Jiang , Wei Tu

Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that…

Information Theory · Computer Science 2011-05-31 Amin Aminzadeh Gohari , Shenghao Yang , Sidharth Jaggi

The conditional mean is a fundamental and important quantity whose applications include the theories of estimation and rate-distortion. It is also notoriously difficult to work with. This paper establishes novel bounds on the differential…

Information Theory · Computer Science 2022-11-23 Arda Atalik , Alper Köse , Michael Gastpar

This paper introduces a new converse machinery for a challenging class of distributed source-type problems (e.g.\ distributed source coding, common randomness generation, or hypothesis testing with communication constraints), through the…

Information Theory · Computer Science 2018-09-14 Jingbo Liu

Personalized optimal decision making, finding the optimal decision rule (ODR) based on individual characteristics, has attracted increasing attention recently in many fields, such as education, economics, and medicine. Current ODR methods…

Methodology · Statistics 2021-04-22 Hengrui Cai , Rui Song , Wenbin Lu