Narayana P. Santhanam

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkage.

Narayana Prasad Santhanam, Mayank Bakshi

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Tail Redundancy and its Characterization of Compression of Memoryless Sources.

Maryam Hosseini, Narayana Santhanam

IEEE J. Sel. Areas Inf. Theory, December, 2022

Data-Derived Weak Universal Consistency.

Narayana Santhanam, Venkatachalam Anantharam, Wojciech Szpankowski

J. Mach. Learn. Res., 2022

2021

Estimating Properties of Dynamic Graphical Models.

Changlong Wu, Narayana Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2021

Non-uniform Consistency of Online Learning with Random Sampling.

Changlong Wu, Narayana Santhanam

Proceedings of the Algorithmic Learning Theory, 2021

Prediction with Finitely many Errors Almost Surely.

Changlong Wu, Narayana Santhanam

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Entropy property testing with finitely many errors.

Changlong Wu, Narayana Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2020

Almost Uniform Sampling From Neural Networks.

Changlong Wu, Narayana Prasad Santhanam

Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

2019

Thermodynamic Computing.

Tom Conte, Erik DeBenedictis, Natesh Ganesh, Todd Hylton, John Paul Strachan, R. Stanley Williams, Alexander A. Alemi, Lee Altenberg, Gavin E. Crooks, James P. Crutchfield, Lídia del Rio, Josh Deutsch, Michael Robert DeWeese, Khari Douglas, Massimiliano Esposito, Michael P. Frank, Robert Fry, Peter Harsha, Mark D. Hill, Christopher T. Kello, Jeff Krichmar, Suhas Kumar, Shih-Chii Liu, Seth Lloyd, Matteo Marsili, Ilya Nemenman, Alex Nugent, Norman H. Packard, Dana Randall, Peter Sadowski, Narayana Santhanam, Robert Shaw, Adam Z. Stieg, Elan Stopnitzky, Christof Teuscher, Chris Watkins, David H. Wolpert, J. Joshua Yang, Yan Yufik

CoRR, 2019

Being correct eventually almost surely.

Changlong Wu, Narayana Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2019

Tail redundancy and its characterizations of universal compression.

Maryam Hosseini, Narayana Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Redundancy of Unbounded Memory Markov Classes with Continuity Conditions.

Changlong Wu, Maryam Hosseini, Narayana Santhanam

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Jackknife estimation for Markov processes with no mixing constraints.

Kevin Oshiro, Changlong Wu, Narayana P. Santhanam

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Flash Memories: ISPP Renewal Theory and Flash Design Tradeoffs.

Meysam Asadi, Erich F. Haratsch, Aleksandar Kavcic, Narayana Prasad Santhanam

IEEE J. Sel. Areas Commun., 2016

2015

Agnostic insurability of model classes.

Narayana P. Santhanam, Venkat Anantharam

J. Mach. Learn. Res., 2015

Community Detection Using Slow Mixing Markov Models.

Ramezan Paravi Torghabeh, Narayana Prasad Santhanam

CoRR, 2015

Write process modeling in MLC flash memories using renewal theory.

Meysam Asadi, Erich F. Haratsch, Aleksandar Kavcic, Narayana P. Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2015

Modeling community detection using slow mixing random walks.

Ramezan Paravi Torghabeh, Narayana Prasad Santhanam

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.

Maryam Hosseini, Narayana Santhanam

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Stationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes.

Meysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam

IEEE Trans. Inf. Theory, 2014

Optimal Detector for Multilevel NAND Flash Memory Channels with Intercell Interference.

Meysam Asadi, Xiujie Huang, Aleksandar Kavcic, Narayana Prasad Santhanam

IEEE J. Sel. Areas Commun., 2014

Redundancy of Exchangeable Estimators.

Narayana P. Santhanam, Anand D. Sarwate, Jae Oh Woo

Entropy, 2014

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

Maryam Hosseini, Narayana Santhanam

Entropy, 2014

Data driven consistency (working title).

Narayana P. Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski

CoRR, 2014

Universal compression of Gaussian sources with unknown parameters.

Alon Orlitsky, Narayana P. Santhanam

CoRR, 2014

On redundancy of memoryless sources over countable alphabets.

Maryam Hosseini, Narayana Santhanam

Proceedings of the International Symposium on Information Theory and its Applications, 2014

Data-driven weak universal redundancy.

Narayana Prasad Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski

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.

Xiujie Huang, Meysam Asadi, Aleksandar Kavcic, Narayana Prasad Santhanam

Proceedings of the IEEE International Conference on Communications, 2014

Spatial correlations for solar PV generation and its tree approximation analysis.

Navid Tafaghodi Khajavi, Anthony Kuh, Narayana P. Santhanam

Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2014

2013

Estimation in slow mixing, long memory channels.

Meysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Markov processes: Estimation in the undersampled regime.

Meysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions.

Narayana P. Santhanam, Martin J. Wainwright

IEEE Trans. Inf. Theory, 2012

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

Narayana P. Santhanam, Dharmendra S. Modha

CoRR, 2012

Alternating Markov chains for distribution estimation in the presence of errors.

Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Prediction over countable alphabets.

Narayana P. Santhanam, Venkat Anantharam

Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

Universal algorithms: Building a case for pointwise convergence.

Narayana P. Santhanam, Venkat Anantharam

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Lossy Lempel-Ziv like compression algorithms for memoryless sources.

Narayana Prasad Santhanam, Dharmendra S. Modha

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Patterns and exchangeability.

Narayana P. Santhanam, Mokshay M. Madiman

Proceedings of the IEEE International Symposium on Information Theory, 2010

Classification using pattern probability estimators.

Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2010

Redundancy of exchangeable estimators.

Narayana P. Santhanam, Mokshay M. Madiman, Anand D. Sarwate

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

What risks lead to ruin.

Narayana Santhanam, Venkat Anantharam

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

On modeling gene regulatory networks using Markov random fields.

Narayana Santhanam, Janis Dingel, Olgica Milenkovic

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Small-sample distribution estimation over sticky channels.

Farzad Farnoud, Olgica Milenkovic, Narayana P. Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Information-theoretic limits of graphical model selection in high dimensions.

Narayana P. Santhanam, Martin J. Wainwright

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Further results on relative redundancy.

Hirakendu Das, Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Sample complexity of determining structures of graphical models.

Narayana Santhanam, Martin J. Wainwright

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

Population estimation with performance guarantees.

Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Limit Results on Pattern Entropy.

Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

IEEE Trans. Inf. Theory, 2006

Theoretical and Experimental Results on Modeling Low Probabilities.

Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Relative redundancy for large alphabets.

Alon Orlitsky, Narayana Santhanam, Junan Zhang

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Making the Correct Mistakes.

Dharmendra S. Modha, Narayana P. Santhanam

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005

A lower bound on compression of unknown alphabets.

Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam

Theor. Comput. Sci., 2005

Innovation and pattern entropy of stationary processes.

Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Narayana Zhang

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Convergence of profile based estimators.

Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Junan Zhang

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Universal compression of memoryless sources over unknown alphabets.

Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

IEEE Trans. Inf. Theory, 2004

Speaking of infinity [i.i.d. strings].

Alon Orlitsky, Narayana P. Santhanam

IEEE Trans. Inf. Theory, 2004

On Modeling Profiles Instead of Values.

Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

Proceedings of the UAI '04, 2004

Relative redundancy: a more stringent performance guarantee for universal compression.

Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Algorithms for modeling distributions over large alphabets.

Alon Orlitsky, Sajama, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Always Good Turing: Asymptotically Optimal Probability Estimation.

Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Performance of universal codes over infinite alphabets.

Alon Orlitsky, Narayana P. Santhanam

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003