ITW · 2018
Maximum Likelihood Upper Bounds on the Capacities of Discrete Information Stable Channels
IEEE Information Theory Workshop
How can channel capacity be bounded through maximum likelihood?
The paper derives a maximum likelihood upper bound using optimality conditions for discrete information stable channels. It recovers capacity for selected memoryless channels and develops a counting based bound for the binary deletion channel.
Research themes
Cite this paper
Tongxin Li. Maximum Likelihood Upper Bounds on the Capacities of Discrete Information Stable Channels. IEEE Information Theory Workshop, 2018. https://doi.org/10.1109/ITW.2018.8613485
BibTeX
@inproceedings{tongxin-channel-capacity,
title = {{Maximum Likelihood Upper Bounds on the Capacities of Discrete Information Stable Channels}},
author = {Tongxin Li},
year = {2018},
booktitle = {IEEE Information Theory Workshop},
url = {https://doi.org/10.1109/ITW.2018.8613485},
doi = {10.1109/ITW.2018.8613485}
}
Related papers
Adaptive Riemannian Graph Neural Networks
ARGNN learns a node specific Riemannian metric instead of imposing one fixed curvature on an entire graph. A diagonal metric parameterization and geometric regularization support efficient training, with convergence analysis and experiments on homophilic and heterophilic graphs.
How can a graph model adapt to different local geometries? information theory graph learning sample complexity compressed sensing graph neural networks Riemannian geometryEnergy Injection Identification enabled Disaggregation with Deep Multi-Task Learning
DualNILM jointly recognizes appliance states and identifies energy injected behind the meter. Its transformer architecture combines temporal learning tasks to separate consumption from injections, with evaluation on measured and synthesized datasets.
Can appliances be identified when solar and storage obscure meter readings? AI for energy electric vehicle charging demand response renewable energy load forecasting decarbonization information theory graph learning sample complexity compressed sensing graph neural networks Riemannian geometryQuantum Learning and Estimation for Coordinated Operation between Distribution Networks and Energy Communities
A hybrid quantum learning model estimates energy community responses to prices, while quantum amplitude estimation supports uncertainty calculations. Numerical studies assess accuracy and resource requirements. Reported timing advantages assume ideal quantum devices rather than deployed hardware.
Can quantum methods assist coordination with limited local information? AI for energy electric vehicle charging demand response renewable energy load forecasting decarbonization information theory graph learning sample complexity compressed sensing graph neural networks Riemannian geometry