CM algorithm matches Shannon's and semantic channels for multi-label classification.
problem Tackles label learning and selection for multi-label classification.
method Adheres to maximum semantic information criterion, uses Bayes' theorem, and trains truth functions.
result Shows improved performance and adaptability to changing source distributions.
New Bayes' theorem optimizes semantic channels for machine learning.
problem Class imbalance and semantic meaning evolution in natural language.
method Convert Shannon's channel to semantic channel using third kind of Bayes' theorem.
result CM algorithm explains natural language evolution and improves predictive models.
Bayesian Monte-Carlo method assesses uncertainty in shear stress entropy models.
problem Uncertainty in evaluating shear stress entropy models remains an open question.
method Bayesian Monte-Carlo (BMC) uncertainty method to evaluate four entropy models.
result FOCB statistic index determines certainty of entropy models in shear stress estimation.
Study predicts shear stress in compound channels using data mining and machine learning.
problem Predicting shear stress distribution in symmetric compound channels.
method Conducted experiments to measure shear stress. Used data mining and machine learning models (RF, M5P, RC, KStar, AR) to predict.
result Random Forest (RF) model showed highest accuracy with R2=0.9.
Relationships that exist between the classical, Shannon-type, and geometric-based approaches to sampling are investigated. Some aspects of coding and communication through a Gaussian channel are considered. In particular, a constructive method to determine the quantizing dimension in Zador's theorem is provided. A geom…
Improved EM algorithm for faster convergence of mixture models.
problem Slow or invalid convergence of EM algorithm for mixture models.
method CM-EM algorithm with a step to optimize mixture ratios and maximize G.
result Global convergence proof for CM-EM algorithm using variational methods.
CM algorithm improves MMI classifications for unseen instances.
problem Improving classification accuracy for unseen instances using MMI criterion.
method Introduces CM algorithm for MMI classifications, combining semantic and Shannon channels for matching.
result Achieves high mutual information (99%) with minimal iterations in low-dimensional feature spaces.
DeepJSCC-f uses feedback to improve image transmission quality.
problem Improve image transmission quality in feedback channels.
method Autoencoder-based joint source-channel coding (DeepJSCC-f) exploiting feedback.
result Improves reconstruction quality for fixed-length or variable-length transmission.
Paper proposes IABF to improve NECST robustness.
problem Limited robustness of NECST learned coding networks.
method Infomax Adversarial-Bit-Flip (IABF) to improve stability and robustness.
result IABF achieves state-of-the-art performances on compression and error correction benchmarks.
Deepcode codes outperform traditional ones by 3 orders of magnitude.
problem Designing reliable codes for feedback channels with Gaussian noise.
method Integrating deep learning with information theory for novel codes.
result Deepcode codes outperform known codes by 3 orders of magnitude in reliability.
A framework for multi-agent communication over noisy channels in reinforcement learning.
problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.
Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is related to Shannon's entropy, and comes up in many settings. It was introduced by Rényi as a measure of information that satisfies almost the same axioms as Kullback-Leibler divergence, and depends on a parameter that is called its or…
New approach uses SPG for semantic communication without a known channel model.
problem Designing efficient semantic communication systems without a known channel model.
method Applying Stochastic Policy Gradient (SPG) for reinforcement learning.
result Achieves comparable performance to model-aware approaches with a decreased convergence rate.
Study on statistical estimation over Gaussian MAC, comparing analog and digital schemes.
problem Distributed minimax statistical estimation over a Gaussian MAC.
method Developed analog joint estimation-communication schemes and derived information-theoretic lower bounds.
result Achieved risk within a logarithmic factor of information-theoretic lower bounds.
This paper explores VAEs in Fisher-Shannon plane, revealing the relationship between Fisher information and Shannon entropy.
problem Understanding the relationship between Fisher information and Shannon entropy in VAEs.
method Investigation of VAEs in Fisher-Shannon plane, focusing on the trade-off between Fisher information and Shannon entropy.
result VAEs' representation learning and log-likelihood estimation are intrinsically related to Fisher information and Shannon entropy.
Study complexity in financial market using Shannon entropy.
problem Measuring complexity in financial market information traffic.
method Reconstructing financial dynamics from share prices, calculating Shannon entropy.
result Shannon entropy quantifies complexity in financial market information.
Revisits SWIFT method for option pricing using Shannon wavelets.
problem Improving option pricing under known characteristic functions.
method SWIFT method based on Shannon wavelets.
result Exposes drawbacks and discusses improvements.
Shannon's theory sets limits on information transmission.
problem Limits of information transmission in systems.
method Mathematical theory of communication.
result Defines fundamental limits on information transmission.
Study on geometric Jensen-Shannon divergence for Gaussian measures in Hilbert space.
problem Computing divergence between Gaussian measures in infinite-dimensional Hilbert space.
method Closed form expression and regularization for divergence calculation.
result Closed form expression and regularization for Geometric Jensen-Shannon divergence.
The note evaluates different methods for option pricing using Shannon Wavelets.
problem Efficient computation of Shannon Wavelet coefficients for option pricing.
method Evaluation of cosine expansion, direct algorithms, and Filon quadrature.
result Filon quadrature is more efficient for computing Shannon Wavelet coefficients.
The Shannon theorem is extended to locally compact groups.
problem Identifying the Poisson boundary of locally compact groups.
method Random walks and Shannon-McMillan-Breiman theorem.
result Generalized criteria for identifying Poisson boundaries.
Proposes a new divergence measure for probability distributions.
problem Challenges in estimating divergences from empirical samples.
method Embeds data into RKHS, computes Jensen-Shannon divergence between covariance operators.
result Establishes RJSD as a lower bound on Jensen-Shannon divergence, enabling variational estimation.
New bound on machine learning model performance using Jensen-Shannon information.
problem Understanding the performance of machine learning models.
method Proposes a new information-theoretic bound on generalization error.
result Shows that the new bound can be tighter than mutual information-based bounds under certain conditions.
New framework using Jensen-Shannon divergence improves domain adaptation theory.
problem Incoherence between empirical domain adversarial training and theoretical H-divergence. method Established new theoretical framework based on Jensen-Shannon divergence, derived bi-directional upper bounds.
result Framework exhibits flexibilities for various transfer learning problems.
A new objective function using Jensen-Shannon divergence improves generative learning from multiple data types.
problem Learning from multiple data types efficiently and accurately.
method Proposes a novel objective function using Jensen-Shannon divergence to approximate multimodal posteriors directly.
result The mmJSD objective optimizes an ELBO and improves generative learning tasks.
Proposes a new loss function for learning with noisy labels.
problem Improving model learnability with noisy labels.
method Uses generalized Jensen-Shannon divergence as a noise-robust loss function.
result Shows state-of-the-art results on noisy data.
The paper proves entropy power properties on Riemannian manifolds and Ricci flows.
problem Entropy power on Riemannian manifolds and Ricci flows.
method Proving concavity and convexity of Shannon entropy power for heat and conjugate heat equations on Riemannian manifolds and Ricci flows.
result Entropy power rigidity models on Einstein or quasi Einstein manifolds and shrinking Ricci solitons.
In this report, we derive a non-negative series expansion for the Jensen-Shannon divergence (JSD) between two probability distributions. This series expansion is shown to be useful for numerical calculations of the JSD, when the probability distributions are nearly equal, and for which, consequently, small numerical er…
Paper tests for time-varying entropy in stock prices, finding periods of inefficiency.
problem Testing for time-varying entropy in stock price dynamics.
method Unbiased approximation of Shannon entropy variance, optimal rolling window selection, hypothesis testing.
result Existence of periods of market inefficiency for meme stocks.
Compressed Counting (CC) [22] was recently proposed for estimating the ath frequency moments of data streams, where 0 < a <= 2. CC can be used for estimating Shannon entropy, which can be approximated by certain functions of the ath frequency moments as a -> 1. Monitoring Shannon entropy for anomaly detection (e.g., DD…
We conduct an axiomatic study of the problem of estimating the strength of a known causal relationship between a pair of variables. We propose that an estimate of causal strength should be based on the conditional distribution of the effect given the cause (and not on the driving distribution of the cause), and study d…
Study compares statistical properties and power of divergence measures for credit risk monitoring.
problem Detecting distributional shifts in credit risk models.
method Derives statistical properties and chi-square benchmark values for Jensen-Shannon Divergence and Kullback-Leibler Divergence, demonstrating their applicability in credit risk monitoring.
result Jensen-Shannon Divergence and Kullback-Leibler Divergence follow chi-square distributions and reveal practical trade-offs in minimizing false positives vs. detecting changes.
Paper compares Rényi min-entropy vs Shannon entropy for feature selection in machine learning.
problem Feature selection in machine learning to improve model performance.
method Proposes an algorithm based on conditional Rényi min-entropy for feature selection, comparing it to Shannon-based mutual information.
result Rényi-based algorithm tends to outperform Shannon-based in real datasets.
This paper tackles mmWave beamforming optimization with active learning.
problem Adaptive and sequential optimization of beamforming vectors during mmWave initial access.
method Hierarchical beamforming codebook, noisy search strategies, and active learning from imperfect labeler.
result Upper bound on search time matches noiseless bisection search, with AoA error probability decaying exponentially.
Researchers calculate Shannon entropy rates of hidden Markov processes efficiently.
problem No finite expression exists for Shannon entropy rates of hidden Markov processes.
method Developed an efficient method to calculate entropy rates and identify minimal predictive features.
result Entropy rates can be accurately calculated for hidden Markov processes.
Improved sampling from high-dimensional Gaussians using smoothed scores.
problem Sampling from high-dimensional Gaussian distributions with gradient information.
method Using smoothed scores, which are gradients of the logarithms of Gaussian-convolved densities, to overcome approximation barriers.
result Improved sampling efficiency with a complexity of \(O\left(\left(\logκ+\log(e\sqrt d/δ_{
m TV})
ight)\log(e\sqrt d/δ_{
m TV})
ight)\) smoothed-score queries.
We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a design matrix. Called a Sparse Superposition or Sparse Regression codebook, this s…
New method improves understanding of machine learning model performance.
problem Understanding how well machine learning models generalize from training data to unseen data.
method Auxiliary Distribution Method to derive new generalization error bounds.
result Upper bounds on generalization errors are tighter and more applicable.
The paper explores how GANs' learned distribution aligns with real data distribution.
problem Aligning GAN's learned distribution with real data distribution.
method Optimizing Jensen-Shannon divergence to force alignment, comparing gradients of different distances.
result Wasserstein W22 may have desirable properties like reduced mode collapse. We develop a complexity measure for large-scale economic systems based on Shannon's concept of entropy. By adopting Leontief's perspective of the production process as a circular flow, we formulate the process as a Markov chain. Then we derive a measure of economic complexity as the average number of bits required to e…
A new metric uses nonparametric comparison for fitting parametric distributions.
problem Measuring goodness-of-fit for nonlinear models using maximum likelihood estimation.
method Survival Jensen-Shannon divergence (SJS) and its empirical counterpart (ESJS) for nonparametric comparison. result The ESJS can be used as a measure of goodness-of-fit in maximum likelihood estimation. The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. ID3, C4.5 and CART are classical decision tree algorithms and the split criteria they…
We derive fundamental sample complexity bounds for recovering sparse and structured signals for linear and nonlinear observation models including sparse regression, group testing, multivariate regression and problems with missing features. In general, sparse signal processing problems can be characterized in terms of t…
A new channel locality block improves CNN performance.
problem Improving the performance of convolutional neural networks.
method Proposed a variant of Squeeze-and-Excitation block using convolutional layers to learn nearby channel correlation.
result Our C-Local block achieved higher accuracy than the standard SE block on the cifar-10 dataset.
Deep learning predicts V2I channel responses for high-mobility wireless communications.
problem Efficient channel estimation for high-mobility V2I communications.
method Developed a deep neural network-based channel prediction method.
result Deep neural networks can learn and predict V2I channel properties in real-time.
Reduced-channel EEG systems struggle with artifact detection, highlighting the importance of referential channels.
problem Artifact detection in EEG signals with fewer channels.
method Investigated a deep learning algorithm, CNN-LSTM, on various channel configurations.
result False alarms increase dramatically when fewer channels are used, emphasizing the importance of referential channels.
Defines discrete channel surfaces in Lie sphere geometry.
problem Defining discrete channel surfaces in Lie sphere geometry.
method Definition and associated data sets for reconstruction.
result Proof of a discrete version of Vessiot's Theorem for isothermic discrete channel surfaces.
New system preserves message meaning in wireless networks, improving data rate.
problem Efficiently transmitting message meaning in wireless networks.
method Modeling semantics as hidden random variables, using Information Bottleneck for compression.
result 20 dB SNR improvement for semantic communication.