Results 61 to 70 of about 296,906 (157)

Conditional Rényi Divergence Saddlepoint and the Maximization of α-Mutual Information

open access: yesEntropy, 2019
Rényi-type generalizations of entropy, relative entropy and mutual information have found numerous applications throughout information theory and beyond. While there is consensus that the ways A.
Changxiao Cai, Sergio Verdú
doaj   +1 more source

Importance Weighted Directed Graph Variationalauto‐Encoder for Block Modeling of Complex Networks

open access: yesStatistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 5, October 2026.
ABSTRACT This paper addresses the fundamental challenge of jointly performing node clustering and representation learning in directed and valued graphs, which needs both global and local network structures to be captured. While these two tasks are highly interdependent, they are often treated separately in existing works.
S. Niang   +3 more
wiley   +1 more source

FedLucra: Federated Learning With Loss‐Utility Controlled Robust Aggregation

open access: yesExpert Systems, Volume 43, Issue 10, October 2026.
ABSTRACT Federated learning enables collaborative model training without centralizing private data. However, conventional aggregation strategies generally determine client contributions primarily according to local data volume and do not directly consider differences in local model performance. To address this limitation, we propose FedLucra, a modular
Emin Akpinar   +2 more
wiley   +1 more source

Two Measures of Dependence

open access: yesEntropy, 2019
Two families of dependence measures between random variables are introduced. They are based on the Rényi divergence of order α and the relative
Amos Lapidoth, Christoph Pfister
doaj   +1 more source

Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract It is well‐known that polynomial versions of theorems of Rödl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erdős–Hajnal conjecture. In this note, we prove that these three conjectures are in fact equivalent, extending several previous particular results in this direction by Fox, Nguyen ...
Matija Bucić, Jacob Fox, Huy Tuan Pham
wiley   +1 more source

A measure of mutual divergence among a number of probability distributions

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1987
The principle of optimality of dynamic programming is used to prove three major inequalities due to Shannon, Renyi and Holder. The inequalities are then used to obtain some useful results in information theory.
J. N. Kapur, Vinod Kumar, Uma Kumar
doaj   +1 more source

No‐(k+1)$(k+1)$‐in‐line problem for large constant k$k$

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract How many points can be placed in an n×n$n\times n$ grid so that every (affine) line contains at most k$k$ points? We prove that for n⩾k⩾1037$n \geqslant k \geqslant 10^{37}$ the maximum number of points is exactly kn$kn$. Our proof builds on the recent work of Kovács, Nagy and Szabó (who proved an analogous result when k$k$ is at least about ...
Alexandr Grebennikov, Matthew Kwan
wiley   +1 more source

A Robust Solution to Variational Importance Sampling of Minimum Variance

open access: yesEntropy, 2020
Importance sampling is a Monte Carlo method where samples are obtained from an alternative proposal distribution. This can be used to focus the sampling process in the relevant parts of space, thus reducing the variance. Selecting the proposal that leads
Jerónimo Hernández-González   +1 more
doaj   +1 more source

Self‐consistent transfer operators for heterogeneous coupled maps

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 4, October 2026.
Abstract We investigate the dynamics of large heterogeneous network dynamical systems composed of nonlocally coupled chaotic maps. We show that the mean‐field limit of such systems is governed by a suitably defined Self‐consistent Transfer Operator (STO) acting on measures, describing the infinite‐size limits of dense graphs as graphons, thereby ...
Herbert M. C. Maquera   +2 more
wiley   +1 more source

The Rényi power means of matrices

open access: yes, 2020
In this article we introduce a new family of power means for m positive definite matrices, called Rényi power means. These means are defined in terms of the matrix function [Formula presented] related to the Rényi divergence.
Franco, Jose A.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy