Zobrazeno 81 - 90
of 317
pro vyhledávání: ''
Autor:
Tongxin Li
Publikováno v:
ITW
Motivated by a greedy approach for generating {\it{information stable}} processes, we prove a universal maximum likelihood (ML) upper bound on the capacities of discrete information stable channels, including the binary erasure channel (BEC), the bin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d840549236db5617f9f9caeb830466bc
https://resolver.caltech.edu/CaltechAUTHORS:20190205-072554267
https://resolver.caltech.edu/CaltechAUTHORS:20190205-072554267
Autor:
Pakshal Bohra, Ajit Rajwade
Publikováno v:
GlobalSIP
We present an estimator, based on the Anscombe transform, for the problem of low-rank matrix recovery under Poisson noise. We derive an upper bound on the matrix reconstruction error for this estimator, considering a linear sensing operator which obe
Autor:
Sergei Parsegov, Pavel Shcherbakov
Publikováno v:
2018 22nd International Conference on System Theory, Control and Computing (ICSTCC).
Transient performance problems in stable linear systems were always in focus of the control community. Nevertheless, deviations of trajectories in input-free discrete time systems have been paid much less attention. In this paper, we are interested i
Autor:
Puning Zhao, Lifeng Lai
Publikováno v:
Allerton
KSG mutual information estimator, which is based on the distances of each sample to its $k$ -th nearest neighbor, is widely used to estimate mutual information between two continuous random variables. Existing work has analyzed the convergence rate o
Publikováno v:
Allerton
Henze-Penrose (HP) divergence has been used in many information theory, statistics and machine learning contexts, including the estimation of two-class Bayes classification error. Previous work has shown HP divergence can be directly estimated using
Publikováno v:
Allerton
We consider the problem of detecting the source of an epidemic that spreads in a network. The only information about the epidemic comes from a subset of nodes, which we call sensors, and which can reveal if and when they become infected. How many sen
Publikováno v:
FOCS
We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the combinatoria
Publikováno v:
Allerton
Consider the Fisher information for estimating a vector $\theta \in \mathbb {R}^{d}$ from the quantized version of a statistical sample $X \sim f(x|\theta)$. Let M be a k-bit quantization of $X.$ We provide a geometric characterization of the trace o
Autor:
Guosong Yang, Joao P. Hespanha
Publikováno v:
Allerton
We study a notion of topological entropy for switched systems, formulated in terms of the minimal number of initial states needed to approximate all initial states within a finite precision. This paper focuses on the topological entropy of switched l
Autor:
Yuta Sakai
Publikováno v:
ISITA
This study investigates generalized Fano-type inequalities in the following senses: (i) the alphabet ${\mathcal{X}}$ of a random variable X is countably infinite; (ii) instead of a fixed finite cardinality of ${\mathcal{X}}$, a fixed X-marginal distr