Narayana P. Santhanam

Orcid: 0000-0001-6515-6311

According to our database1, Narayana P. Santhanam authored at least 61 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkage.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Tail Redundancy and its Characterization of Compression of Memoryless Sources.
IEEE J. Sel. Areas Inf. Theory, December, 2022

Data-Derived Weak Universal Consistency.
J. Mach. Learn. Res., 2022

2021
Estimating Properties of Dynamic Graphical Models.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Non-uniform Consistency of Online Learning with Random Sampling.
Proceedings of the Algorithmic Learning Theory, 2021

Prediction with Finitely many Errors Almost Surely.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Entropy property testing with finitely many errors.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Almost Uniform Sampling From Neural Networks.
Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

2019
Thermodynamic Computing.
CoRR, 2019

Being correct eventually almost surely.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Tail redundancy and its characterizations of universal compression.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Redundancy of Unbounded Memory Markov Classes with Continuity Conditions.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Jackknife estimation for Markov processes with no mixing constraints.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Flash Memories: ISPP Renewal Theory and Flash Design Tradeoffs.
IEEE J. Sel. Areas Commun., 2016

2015
Agnostic insurability of model classes.
J. Mach. Learn. Res., 2015

Community Detection Using Slow Mixing Markov Models.
CoRR, 2015

Write process modeling in MLC flash memories using renewal theory.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Modeling community detection using slow mixing random walks.
Proceedings of the 2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29, 2015

Single letter characterization of average-case strong redundancy of compressing memoryless sequences.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Stationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes.
IEEE Trans. Inf. Theory, 2014

Optimal Detector for Multilevel NAND Flash Memory Channels with Intercell Interference.
IEEE J. Sel. Areas Commun., 2014

Redundancy of Exchangeable Estimators.
Entropy, 2014

Characterizing the Asymptotic Per-Symbol Redundancy of Memoryless Sources over Countable Alphabets in Terms of Single-Letter Marginals.
Entropy, 2014

Data driven consistency (working title).
CoRR, 2014

Universal compression of Gaussian sources with unknown parameters.
CoRR, 2014

On redundancy of memoryless sources over countable alphabets.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Data-driven weak universal redundancy.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

All-bit-line MLC flash memories: Optimal detection strategies.
Proceedings of the IEEE International Conference on Communications, 2014

Spatial correlations for solar PV generation and its tree approximation analysis.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2014

2013
Estimation in slow mixing, long memory channels.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Markov processes: Estimation in the undersampled regime.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions.
IEEE Trans. Inf. Theory, 2012

Optimal Lempel-Ziv based lossy compression for memoryless data: how to make the right mistakes
CoRR, 2012

Alternating Markov chains for distribution estimation in the presence of errors.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Prediction over countable alphabets.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

Universal algorithms: Building a case for pointwise convergence.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Lossy Lempel-Ziv like compression algorithms for memoryless sources.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Patterns and exchangeability.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Classification using pattern probability estimators.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Redundancy of exchangeable estimators.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

What risks lead to ruin.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
On modeling gene regulatory networks using Markov random fields.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Small-sample distribution estimation over sticky channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Information-theoretic limits of graphical model selection in high dimensions.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Further results on relative redundancy.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Sample complexity of determining structures of graphical models.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007
Population estimation with performance guarantees.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Limit Results on Pattern Entropy.
IEEE Trans. Inf. Theory, 2006

Theoretical and Experimental Results on Modeling Low Probabilities.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Relative redundancy for large alphabets.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Making the Correct Mistakes.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005
A lower bound on compression of unknown alphabets.
Theor. Comput. Sci., 2005

Innovation and pattern entropy of stationary processes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Convergence of profile based estimators.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Universal compression of memoryless sources over unknown alphabets.
IEEE Trans. Inf. Theory, 2004

Speaking of infinity [i.i.d. strings].
IEEE Trans. Inf. Theory, 2004

On Modeling Profiles Instead of Values.
Proceedings of the UAI '04, 2004

Relative redundancy: a more stringent performance guarantee for universal compression.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Algorithms for modeling distributions over large alphabets.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Always Good Turing: Asymptotically Optimal Probability Estimation.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Performance of universal codes over infinite alphabets.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003


  Loading...