Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2020, Volume 56, Issue 2, Pages 64–81
DOI: https://doi.org/10.31857/S0555292320020023 (Mi ppi2316) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Information Theory

New upper bounds in the hypothesis testing problem with information constraints

M. V. Burnashev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (256 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S0555292320020023
Abstract: We consider a hypothesis testing problem where a part of data cannot be observed. Our helper observes the missed data and can send us a limited amount of information about them. What kind of this limited information will allow us to make the best statistical inference? In particular, what is the minimum information sufficient to obtain the same results as if we directly observed all the data? We derive estimates for this minimum information and some other similar results.
Keywords: hypothesis testing, information constraints, error probabilities.
Funding agency Grant number
Russian Foundation for Basic Research 19-01-00364
The research was supported in part by the Russian Foundation for Basic Research, project no. 19-01-00364.
Received: 10.04.2020
Revised: 15.05.2020
Accepted: 19.05.2020
English version:
Problems of Information Transmission, 2020, Volume 56, Issue 2, Pages 157–172
DOI: https://doi.org/10.1134/S0032946020020027
Bibliographic databases:
Document Type: Article
UDC: 621.391.1 : 519.2
Language: Russian
Citation: M. V. Burnashev, “New upper bounds in the hypothesis testing problem with information constraints”, Probl. Peredachi Inf., 56:2 (2020), 64–81; Problems Inform. Transmission, 56:2 (2020), 157–172
Citation in format AMSBIB
\Bibitem{Bur20}
\by M.~V.~Burnashev
\paper New upper bounds in the hypothesis testing problem with information constraints
\jour Probl. Peredachi Inf.
\yr 2020
\vol 56
\issue 2
\pages 64--81
\mathnet{http://mi.mathnet.ru/ppi2316}
\crossref{https://doi.org/10.31857/S0555292320020023}
\elib{https://elibrary.ru/item.asp?id=45428443}
\transl
\jour Problems Inform. Transmission
\yr 2020
\vol 56
\issue 2
\pages 157--172
\crossref{https://doi.org/10.1134/S0032946020020027}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000548217800002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85087914939}
Linking options:
  • https://www.mathnet.ru/eng/ppi2316
  • https://www.mathnet.ru/eng/ppi/v56/i2/p64
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:132
    Full-text PDF :15
    References:18
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024