REVIEW 3 cited by
Concentration inequality using unconfirmed knowledge
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Concentration inequality using unconfirmed knowledge
read the original abstract
We give a concentration inequality based on the premise that random variables take values within a particular region. The concentration inequality guarantees that, for any sequence of correlated random variables, the difference between the sum of conditional expectations and that of the observed values takes a small value with high probability when the expected values are evaluated under the condition that the past values are known. Our inequality outperforms other well-known inequalities, e.g. the Azuma-Hoeffding inequality, especially in terms of the convergence speed when the random variables are highly biased. This high performance of our inequality is provided by the key idea in which we predict some parameters and adopt the predicted values in the inequality.
Forward citations
Cited by 3 Pith papers
-
Security of passive entanglement-based key distribution protocols
Passive BBM92 and QCKA with biased basis choice are proven secure in the asymptotic limit, with key rates nearly identical to active protocols.
-
Numerical security analysis for practical quantum key distribution
A numerical framework proves finite-key security for practical decoy-state QKD systems with transmitter and receiver imperfections including non-IID signals.
-
Experimentally validated quantum-secure federated learning over a multi-user quantum network
QuNetQFL is a quantum federated learning protocol using distributed quantum keys for secure aggregation, experimentally validated on a four-client quantum network with scalability simulations to 200 clients and applic...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.