Victoria Kostina

About Me

 
Victoria Kostina

I joined Caltech as an Assistant Professor of Electrical Engineering in the fall of 2014.

Previously, I worked as a postdoctoral researcher with Prof. Sergio Verdú. I completed my PhD at Princeton University in September 2013. I spent the spring of 2015 as a Research Fellow at Simons Institute for the Theory of Computing. I hold a Bachelor's degree from Moscow institute of Physics and Technology, where I was affiliated with the Institute for Information Transmission Problems of the Russian Academy of Sciences, and a Master's degree from University of Ottawa.

My research interests lie in information theory, theory of random processes, coding, wireless communications, and control. I am particularly interested in fundamental limits of delay-sensitive communications.

Curriculum Vitae

Openings

I am looking for strong students and postdocs to join my research group in the fall of 2017.

Prospective students: I apologize I am unable to respond to all inquiries — please do apply online and mention my name as a possible research advisor. I supervise students from both the Electrical Engineering (EE) and the Computing and Mathematical Sciences (CMS) PhD programs.

Prospective postdocs: please apply through the Center for the Mathematics of Information (CMI) postdoctoral fellowship program and mention my name in the application.

Research

Preprints

Journal Articles

Ph.D. Dissertation

Conference Papers

  • A. Marsiglietti and V. Kostina, "A lower bound on the differential entropy for log-concave random variables with applications to rate-distortion theory", in Proceedings 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017, to appear.
  • V. Kostina and E. Tuncel, "The Rate-Distortion Function for Successive Refinement of Abstract Sources", in Proceedings 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017, to appear.
  • M. Ebrahimi, F. Lahouti, V. Kostina, "Coded Random Access Design for Constrained Outage", in Proceedings 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017, to appear.
  • P. Noorzad, M. Effros, M. Langberg, V. Kostina, "The Birthday Problem and Zero-Error Channel Coding", in Proceedings 2017 IEEE International Symposium on Information Theory, Aachen, Germany, June 2017, to appear.
  • A. Khina, G. Pettersson, V. Kostina, and B. Hassibi, "Multi-rate control over AWGN channels: an analog joint source-channel coding perspective”, in Proceedings 2016 IEEE Conference on Decision and Control, Las Vegas, NV, Dec. 2016.
  • V. Kostina and B. Hassibi, “Rate-cost tradeoffs in control”, in Proceedings 54th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct. 2016.
  • V. Kostina, “When is Shannon’s lower bound tight?”, in Proceedings 54th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct. 2016.
  • V. Kostina, Y. Peres, M. Z. Rácz, G. Ranade, “Rate-limited control of systems with uncertain gain”, in Proceedings 54th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct. 2016.
  • V. Kostina, "Data compression with low distortion and finite blocklength", in Proceedings 53rd Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct. 2015.
  • V. Kostina, Y. Polyanskiy and S. Verdú, "Joint source-channel coding with feedback", in Proceedings 2015 IEEE International Symposium on Information Theory, Hong Kong, June 2015.
  • V. Kostina, Y. Polyanskiy and S. Verdú, "Transmitting k samples over the Gaussian channel: energy-distortion tradeoff", in Proceedings 2015 IEEE Information Theory Workshop, Jerusalem, Israel, Apr. 2015.
  • V. Kostina and S. Verdú, "The output distribution of good lossy source codes", in Proceedings 2015 Information Theory and Applications Workshop, La Jolla, CA, Feb. 2015.
  • V. Kostina, Y. Polyanskiy, and S. Verdú, "Variable-length compression allowing errors", in Proceedings 2014 IEEE International Symposium on Information Theory, Honolulu, HI, July 2014.
  • V. Kostina and S. Verdú, "Nonasymptotic noisy lossy source coding", in Proceedings 2013 IEEE Information Theory Workshop, Seville, Spain, Sep. 2013.
  • V. Kostina and S. Verdú, "Channels with cost constraints: strong converse and dispersion", in Proceedings 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 2013.
  • S. Loyka, V. Kostina, and F. Gagnon, "Convexity of error rates in digital communications under non-Gaussian noise", in Proceedings 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 2013.
  • V. Kostina and S. Verdú, "To code or not to code: Revisited", Proceedings 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, Sep. 2012, pp. 5-9.
  • V. Kostina and S. Verdú, "Lossy joint source-channel coding in the finite blocklength regime", in Proceedings 2012 IEEE International Symposium on Information Theory, Cambridge, MA, July 2012, pp. 1553-1557.
  • V. Kostina and S. Verdú, "A new converse in rate-distortion theory", Proceedings 46th Annual Conference on Information Sciences and Systems, Princeton, NJ, Mar. 2012, pp. 1-6.
  • V. Kostina and S. Loyka, "Performance analysis of coded V-BLAST with optimum power and rate allocation", in Proceedings 2011 IEEE International Symposium on Information Theory, Saint Petersburg, Russia, Aug. 2011, pp. 1851-1855.
  • V. Kostina and S. Verdú, "Fixed-length lossy compression in the finite blocklength regime: discrete memoryless sources", in Proceedings 2011 IEEE International Symposium on Information Theory, Saint Petersburg, Russia, Aug. 2011, pp. 41-45.
  • V. Kostina, M. F. Duarte, S. Jafarpour, and R. Calderbank, "The value of redundant measurement in compressed sensing", in Proceedings 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Prague, Czech Republic, May 2011, pp. 3656-3659.
  • V. Kostina and S. Verdú, "Fixed-length lossy compression in the finite blocklength regime: Gaussian source", in Proceedings 2011 IEEE Information Theory Workshop, Paraty, Brazil, Oct. 2011, pp. 457-461.
  • S. Loyka, F. Gagnon, and V. Kostina, "Error rates of capacity-achieving codes are convex", in Proceedings 2010 IEEE International Symposium on Information Theory, Austin, TX, June 2010, pp. 325-329.
  • A. Lorbert, D. Eis, V. Kostina, D. M. Blei, and P. J. Ramadge, "Exploiting covariate similarity in sparse regression via the pairwise elastic net", in Proceedings 13th International Conference on Artificial Intelligence and Statistics, vol. 9, Chia Laguna, Sardinia, Italy, May 2010, pp. 477-484.
  • S. Loyka, V. Kostina, and F. Gagnon, "Bit error rate is convex at high SNR", in Proceedings 2009 IEEE International Zurich Seminar on Communications, ETH Zurich, Switzerland, Mar. 2010, pp. 41-44.
  • V. Kostina and S. Loyka, "Optimum power allocation for coded V-BLAST", in Proceedings 2009 IEEE International Conference on Communications, Dresden, Germany, June 2009.
  • V. Kostina and S. Loyka, "Performance analysis of V-BLAST with optimum power allocation", in Proceedings 2007 IEEE Global Telecommunications Conference, Washington, DC, Nov. 2007, pp. 1508-1513.
  • S. Loyka, V. Kostina, and F. Gagnon, "Symbol error rates of maximum-likelihood detector: Convex/concave behavior and applications", in Proceedings 2007 IEEE International Symposium on Information Theory, Nice, France, June 2007, pp. 2501-2505.
  • V. Kostina and S. Loyka, "Transmit power allocation for the V-BLAST algorithm", in Proceedings 23rd Queen's Biennial Symposium on Communications, Kingston, Canada, May 2006, pp. 165-168.
  • V. Kostina and S. Loyka, "On optimization of the V-BLAST algorithm", in Proceedings 2006 IEEE International Zurich Seminar on Communications, ETH Zurich, Switzerland, Feb. 2006, pp. 110-113.

Matlab Toolbox

Teaching

  • EE 167: Introduction to Data Compression and Storage Spring 2017
    The course will introduce the students to the basic principles and techniques of codes for data compression and storage. The students will master the basic algorithms used for lossless and lossy compression of digital and analog data and the major ideas behind coding for flash memories. Topics include the Huffman code, the arithmetic code, Lempel-Ziv dictionary techniques, scalar and vector quantizers, transform coding; codes for constrained storage systems. Prerequisites: Ma 3 or ACM 116.
  • EE/Ma/CS 127: Error-Correcting Codes Winter 2016, Winter 2017
    Prerequisites: Ma 2. This course develops from first principles the theory and practical implementation of the most important techniques for combating errors in digital transmission or storage systems. Topics include algebraic block codes, e.g., Hamming, BCH, Reed-Solomon (including a self-contained introduction to the theory of finite fields); and the modern theory of sparse graph codes with iterative decoding, e.g., LDPC codes, turbo codes. The students will become acquainted with encoding and decoding algorithms, design principles, and performance evaluation of codes.
  • EE 120: Topics in Information Theory Spring 2016
    This class introduces information measures such as entropy, information divergence, mutual information, information density from a probabilistic point of view, and discusses the relations of those quantities to problems in data compression and transmission, statistical inference, language modeling, game theory, and control. Topics include information projection, data processing inequalities, sucient statistics, hypothesis testing, single-shot approach in information theory, large deviations. Prerequisites: undergraduate calculus and probability; desirable but not required: EE 126.
  • EE 150: Nonasymptotic Information Theory Fall 2014
    Delay-constrained theory of information: single-shot results, information spectrum methods. Information-theoretic limits for sources and channels with memory and/or general alphabets. Advantages of variable-length, feedback, and joint source-channel coding in the nonasymptotic regime. Error exponents, source, and channel dispersion. Prerequisite: EE/Ma 126.

Contact

Email: vkostina AT caltech.edu
Office: Moore 162A
Mailing address: 1200 E California Blvd
MC 136-93
Pasadena CA 91125
Phone number: (626) 395-1320
Admin Assistant: Katie Pichotta
Moore 162B
(626) 395-4715

Last updated Jun 15, 2017.