Results 31 to 40 of about 1,354 (166)
Higher Order Fractal Belief Rényi Divergence With Its Applications in Pattern Classification [PDF]
, 2023 Information can be quantified and expressed by uncertainty, and improving the decision level of uncertain information is vital in modeling and processing uncertain information.
Zehong Cao +7 more
core +1 more source
Holographic second laws of black hole thermodynamics
Journal of High Energy Physics, 2018 Recently, it has been shown that for out-of-equilibrium systems, there are additional constraints on thermodynamical evolution besides the ordinary second law.
Alice Bernamonti +3 more
doaj +1 more source
Variational Inference via Rényi Bound Optimization and Multiple-Source Adaptation
Entropy, 2023 Variational inference provides a way to approximate probability densities through optimization. It does so by optimizing an upper or a lower bound of the likelihood of the observed data (the evidence).
Dana Zalman (Oshri), Shai Fine
doaj +1 more source
Conditional Randomization Tests for the Specification of Interference Structure
Journal of Applied Econometrics, EarlyView.ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley +1 more source
Revstat Statistical Journal, 2022 In this paper, we discuss on Rényi entropy of k-records arising from any continuous distribution in detail. The relevance of constructing k-records from random sample in the context of information contained in a random variable has been described in the
Jitto Jose , E. I. Abdul Sathar
doaj +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
On Odd Covers of Cliques and Disjoint Unions
Journal of Graph Theory, EarlyView.ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Arimoto Channel Coding Converse and Rényi Divergence [PDF]
, 2014 —Arimoto [1] proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code on a given discrete memoryless channel.
Sergio Verdú, Yury Polyanskiy
core
Advances in Position‐Momentum Entanglement: A Versatile Tool for Quantum Technologies
Laser &Photonics Reviews, EarlyView.Position–momentum entanglement constitutes a high‐dimensional continuous‐variable resource in quantum optics. Recent advances in its generation, characterization, and control are reviewed, with emphasis on spontaneous parametric down‐conversion and modern measurement techniques.
Satyajeet Patil +6 more
wiley +1 more source
, 2021 University of Technology Sydney. Faculty of Engineering and Information Technology.We investigate quantum Rényi entropic quantities, specifically those derived from ‘sandwiched’ divergence. This divergence is one of several proposed Rényi generalisations
McKinlay, Alexander Clyde
core