English
Related papers

Related papers: On the Capacity of Constrained Systems

200 papers

We derive bounds on the noncoherent capacity of a very general class of multiple-input multiple-output channels that allow for selectivity in time and frequency as well as for spatial correlation. The bounds apply to peak-constrained…

Information Theory · Computer Science 2008-01-29 Ulrich G. Schuster , Giuseppe Durisi , Helmut Bölcskei , H. Vincent Poor

In this paper, we introduce a novel technique for constrained submodular maximization, inspired by barrier functions in continuous optimization. This connection not only improves the running time for constrained submodular maximization but…

Machine Learning · Computer Science 2020-02-11 Ashwinkumar Badanidiyuru , Amin Karbasi , Ehsan Kazemi , Jan Vondrak

The principle of maximum entropy provides a useful method for inferring statistical mechanics models from observations in correlated systems, and is widely used in a variety of fields where accurate data are available. While the assumptions…

Neurons and Cognition · Quantitative Biology 2017-06-02 Ulisse Ferrari , Tomoyuki Obuchi , Thierry Mora

We study reliable communication in uncoordinated vehicular communication from the perspective of Shannon theory. Our system model for the information transmission is that of an Arbitrarily Varying Channel (AVC): One sender-receiver pair…

Information Theory · Computer Science 2019-06-06 Christian Arendt , Janis Nötzel , Holger Boche

We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the network generate data, e.g., like sensor nodes in a sensor…

Networking and Internet Architecture · Computer Science 2010-10-01 Virag Shah , Bikash Kumar Dey , D. Manjunath

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

Analytic combinatorics in several variables is a branch of mathematics that deals with deriving the asymptotic behavior of combinatorial quantities by analyzing multivariate generating functions. We study information-theoretic questions…

Information Theory · Computer Science 2025-07-16 Andreas Lenz , Stephen Melczer , Cyrus Rashtchian , Paul H. Siegel

The generalization of Shannon's theory to include messages with given autocorrelations is presented. The analytical calculation of the channel capacity is based on the transfer matrix method of the effective 1D Hamiltonian. This bridge…

Statistical Mechanics · Physics 2007-05-23 Ido Kanter , Hanan Rosemarin

Observing how long a dynamical system takes to return to some state is one of the most simple ways to model and quantify its dynamics from data series. This work proposes two formulas to estimate the KS entropy and a lower bound of it, a…

Chaotic Dynamics · Physics 2015-05-14 M. S. Baptista , E. J. Ngamga , Paulo R. F. Pinto , Margarida Brito , J. Kurths

The concept of Shannon entropy of random variables was generalized to measurable functions in general, and to simple functions with finite values in particular. It is shown that the information measure of a function is related to the time…

Information Theory · Computer Science 2017-01-25 Guo Zhao

We present a numerical study of the application of the Shannon entropy technique to the planar restricted three-body problem in the vicinity of first-order interior mean-motion resonances with the perturber. We estimate the diffusion…

Chaotic Dynamics · Physics 2020-01-08 C. Beaugé , P. M. Cincotta

We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability,…

Artificial Intelligence · Computer Science 2011-08-12 Stefan Szeider

The problem of capacity achieving (optimal) input probability measures has been widely investigated for several channel models with constrained inputs. So far, no outstanding generalizations have been derived. This paper does a forward step…

Information Theory · Computer Science 2014-11-11 Vincenzo Zambianchi , Enrico Paolini , Davide Dardari

Recent work emphasizes that the maximum entropy principle provides a bridge between statistical mechanics models for collective behavior in neural networks and experiments on networks of real neurons. Most of this work has focused on…

Neurons and Cognition · Quantitative Biology 2015-06-05 Gasper Tkacik , Olivier Marre , Thierry Mora , Dario Amodei , Michael J. Berry , William Bialek

A left-corner parsing algorithm with top-down filtering has been reported to show very efficient performance for unification-based systems. However, due to the nontermination of parsing with left-recursive grammars, top-down constraints…

cmp-lg · Computer Science 2008-02-03 Noriko Tomuro

The theoretic capacity of a communication system constituted of several transmitting/receiving elements is determined by the singular values of its transfer matrix. Results based on an independent identically distributed channel model,…

Mathematical Physics · Physics 2012-09-27 François Bentosela , Eric Soccorsi

We develop the theory and practice of an approach to modelling and probabilistic inference in causal networks that is suitable when application-specific or analysis-specific constraints should inform such inference or when little or no data…

Artificial Intelligence · Computer Science 2017-05-16 Paul Beaumont , Michael Huth

We derive a bound on generalized currents for Langevin systems in terms of the total entropy production in the system and its environment. For overdamped dynamics, any generalized current is bounded by the total rate of entropy production.…

Statistical Mechanics · Physics 2018-06-06 Andreas Dechant , Shin-ichi Sasa

Maximum entropy models are considered by many to be one of the most promising avenues of language modeling research. Unfortunately, long training times make maximum entropy research difficult. We present a novel speedup technique: we change…

Computation and Language · Computer Science 2007-05-23 Joshua Goodman

The Principle of Maximum Entropy is a rigorous technique for estimating an unknown distribution given partial information while simultaneously minimizing bias. However, an important requirement for applying the principle is that the…

Information Theory · Computer Science 2026-02-03 Kenneth Bogert , Matthew Kothe
‹ Prev 1 8 9 10 Next ›