Ali Al-Bashabsheh

Orcid: 0000-0003-0462-7727

According to our database1, Ali Al-Bashabsheh authored at least 33 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Information Bottleneck and Aggregated Learning.
IEEE Trans. Pattern Anal. Mach. Intell., December, 2023

Smoothed noise contrastive mutual information neural estimation.
J. Frankl. Inst., November, 2023

2022
Smoothed InfoNCE: Breaking the log N Curse without Overshooting.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Agglomerative Info-Clustering: Maximizing Normalized Total Correlation.
IEEE Trans. Inf. Theory, 2021

Adaptive Label Smoothing for Classifier-based Mutual Information Neural Estimation.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
On Functions of Markov Random Fields.
Proceedings of the IEEE Information Theory Workshop, 2020

Aggregated Learning: A Vector-Quantization Approach to Learning Neural Network Classifiers.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
On Information-Theoretic Characterizations of Markov Random Fields and Subfields.
IEEE Trans. Inf. Theory, 2019

Neural Entropic Estimation: A faster path to mutual information estimation.
CoRR, 2019

Finding Better Web Communities in Digraphs via Max-Flow Min-Cut.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Change of Multivariate Mutual Information: From Local to Global.
IEEE Trans. Inf. Theory, 2018

A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers-Wannier Duality.
IEEE Trans. Inf. Theory, 2018

Agglomerative Info-Clustering.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Info-clustering: An efficient algorithm by network information flow.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

2016
Info-Clustering: A Mathematical Theory for Data Clustering.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Successive Omniscience.
IEEE Trans. Inf. Theory, 2016

On Characterizations of Markov Random Fields and Subfields.
CoRR, 2016

Kramers-Wannier Duality and Factor Graphs.
CoRR, 2016

Incremental and decremental secret key agreement.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Duality between feature selection and data clustering.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Multivariate Mutual Information Inspired by Secret-Key Agreement.
Proc. IEEE, 2015

Successive omniscience.
Proceedings of the 2015 International Symposium on Network Coding, 2015

The ising model: Kramers-Wannier duality and normal factor graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
On stochastic estimation of the partition function.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Translation schemes and LP bounds.
Proceedings of the 13th Canadian Workshop on Information Theory, 2013

2012
Normal Factor Graphs as Probabilistic Models
CoRR, 2012

2011
Normal Factor Graphs and Holographic Transformations.
IEEE Trans. Inf. Theory, 2011

Normal factor graphs: A diagrammatic approach to linear algebra.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
On Holant Theorem and Its Proof
CoRR, 2010

Valiant transform of forney graphs.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2008
Average Throughput with Linear Network Coding over Finite Fields: The Combination Network Case.
EURASIP J. Wirel. Commun. Netw., 2008

On the k-pairs problem.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
On the Capacity Bounds of Undirected Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2007


  Loading...