ITA @ UCSD - ITA Workshop

Year

Monday

8:00	Continental Breakfast

	Secrecy	Cellular Networks	Broadcast Channels	Cryptography and Coding
	Chair: Aylin Yener, Penn State	Chair: Jeffrey Andrews, UT Austin	Chair: Michele Wigger, Telecom ParisTech	Chair: Xinmiao Zhang, Case Western Reserve
8:30	Improvement of information-theoretic secrecy by smart cooperation Ninoslav Marina, Princeton, Toni Stojanovski, European University, Skopje, Macedonia, H. Vincent Poor, Princeton	Coordinate downlink multi-point communications in heterogeneous 4G cellular networks Alan Barbieri, Qualcomm, Peter Gaal, Qualcomm, Stefang Geirhofer, Qualcomm, Tingfang Ji, Qualcomm, Durga Malladi, Qualcomm, Yongbin Wei, Qualcomm, Feng Xue, Qualcomm	Upper concave envelopes and broadcast channels Chandra Nair, CUHK	Lucas polynomials and power sums Ulrich Tamm, University Of Bielefeld
8:50	Recent results on a broadcast approach for fading wiretap channels Yingbin Liang, Syracuse, Lifeng Lai, University Of Arkansas Little Rock, Vincent Poor, Princeton, Shlomo Shamai, Technion	Fair rate optimization in cellular networks Greg Pottie, UC Los Angeles	Is non-unique decoding necessary? Shirin Saeedi, EPFL, Vinod Prabhakaran, TIFR, Suhas Diggavi, UC Los Angeles	New semi-bent functions with multiple trace terms Sihem Mesnager , G�rard Cohen, Telecom Paris Tech
9:10	Secure state estimation Hamza Fawzi, UC Los Angeles, Paulo Tabuada, UC Los Angeles, Suhas Diggavi, UC Los Angeles	Modeling heterogeneous network interference Robert Heath, UT Austin, Marios Kountouris, Supelec		Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel David Declercq, ETIS-ENSEA/UCP/CNRS, France, Bane Vasic, University Of Arizona, Shiva Planjery, University Of Arizona, Erbao Li, ETIS-ENSEA/UCP/CNRS, France
9:30	Break

	Security and Privacy	Finite Blocklengths	Broadcasting	Coding Theory I
	Chair: Anand Sarwate, TTI Chicago	Chair: Vincent Poor, Princeton	Chair: Bobak Nazer, BU	Chair: Tuvi Etzion, Technion
9:45	Privacy in the smart grid: two new challenges Lalitha Sankar, Princeton, S. Raj Rajagopalan, HP Labs, H. Vincent Poor, Princeton	Finite blocklength Slepian-Wolf coding Oliver Kosut, MIT, Vincent Tan, University Of Wisconsin	Lossy broadcasting with complementary side information Roy Timo, University Of South Australia, Alex Grant, University Of South Australia, Gerhard Kramer, TU Munich	On some linear codes that are proper for error detection Torleiv Kl�ve, University Of Bergen
10:05	Information leakage in queuing side channels Negar Kiyavash, UIUC	Non-asymptotic equipartition properties for independent and identically distributed sources En-hui Yang, University Of Waterloo, Jin Meng, University Of Waterloo	The high-SNR sum-capacity of the Gaussian BC with feedback Michael Gastpar, EPFL, Amos Lapidoth, ETH, Yossef Steinberg, Technion, Mich�le Wigger, Telecom ParisTech	Rank modulation codes for translocation errors Farzad Farnoud, UIUC, Vitaly Skachek, UIUC, Olgica Milenkovic , UIUC
10:25	Securing inductively-coupled communication Lav Varshney, IBM T.J Watson, Pulkit Grover, Stanford, Anant Sahai, UC Berkeley	The dispersion of source(-channel) coding Yuval Kochman, MIT, Amir Ingber, Stanford, Da Wang, MIT	The state-dependent semideterministic broadcast channel Amos Lapidoth, ETH, Ligong Wang, MIT	Practical re-write codes Yuval Cassuto, Technion, Eitan Yaakobi, UC San Diego
10:45	Break

	Algorithms in Coding	Wireless Networks	Streaming	Algebraic Coding
	Chair: Andrea Montanari, Stanford	Chair: Robert Heath, UT Austin	Chair: Emina Soljanin, Bell Labs	Chair: Olgica Milenkovic, UIUC
11:00	Efficient projection onto the parity polytope & LP decoding via the alternating direction method of multipliers Siddharth Barman, University Of Wisconsin, Xishuo Liu, University Of Wisconsin, Stark Draper, University Of Wisconsin, Benjamin Recht, University Of Wisconsin	Revisiting basic assumptions in wireless: full-duplex and directional communication Ashutosh Sabharwal, Rice, Achaleshwar Sahai, Rice, Evan Everett, Rice, Lin Zhong, Rice	On Capacity-Quality Tradeoffs in HTTP Adaptive Streaming over LTE Networks Ozgur Oyman, Intel Labs, Sarabjot Singh, UT Austin	On the implementation of modified fuzzy vault for biometric encryption Xinmiao Zhang, Case Western Reserve, Richard Shi, University Of Washington, James Ritcey, University Of Washington
11:20	Quick partial sparse support recovery Vincent Poor, Princeton, Ali Tajer, Princeton	Energy-efficient sensing and communication in multihop channels Elza Erkip, NYU-Poly, Xi Liu, NYU-Poly, Osvaldo Simeone, NJIT	MicroCast: cooperative video streaming on android phones Lorenzo Keller, EPFL, Anh Le, UC Irvine, Blerim Cici, UC Irvine, Hulya Seferoglu, MIT, Christina Fragouli, EPFL, Athina Markopoulou, UC Irvine	Linear-algebraic list decoding and subspace-evasive sets Venkatesan Guruswami, CMU
11:40	New formal verification techniques for algorithms defined over finite fields Luis Lastras, IBM, Alexey Lvov, IBM, Barry Trager, IBM, Shmuel Winograd, IBM, Viresh Paruthi, IBM, Ali El-Zhein, IBM, Robert Shadowen, IBM, Geert Janssen, IBM	Examples of when interaction is useless in multi-user two-way channels Natasha Devroye, University Of Illinois Chicago	Information Theoretic Tradeoffs in Video Streaming Ashish Khisti, University Of Toronto, Farrokh Etezadi, University Of Toronto, Mitchell Trott, HP Labs	Power decoding of Reed-Solomon codes Martin Bossert, Ulm University
12:00	Integer low-density lattices Nicola Di Pietro, Institut de Mathematiques de Bordeaux, Loic Brunel, Mitsubishi Electric Europe, Joseph Jean Boutros, Texas A&M Qatar, Gilles Zemor, Institut de Mathematiques de Bordeaux	Open access neighborhood femtocells Vinay Chande, Qualcomm		Maximal inequality for spherical means in the hypercube Leonard Schulman, Caltech
12:20	Lunch (on your own)

		Bioinformatics I	Combinatorics	Lecture (Kon Tiki Room)
		Chair: Alyson Fletcher, UCSF/UCB	Chair: Ulrich Tamm, University of Bielefeld and Marmara University Istanbul	Chair: Massimo Franceschetti, UCSD
1:45		FaST Linear Mixed Models for genome wide association studies Christoph Lippert, Microsoft, Jennifer Listgarten, Microsoft, David Heckerman, Microsoft	A structure in compositions of subsequences of binary sequence(tentative) Kingo Kobayashi	Wireless industry trends Roberto Padovani, Qualcomm
2:05		Heuristic combinatorial optimization methods in computational molecular biology Richard Karp, UC Berkeley	Asymptotic enumeration of binary matrices with bounded row and column weights Erik Ordentlich, HP Labs, Farzad Parvaresh, HP Labs, Ron Roth, Technion
2:25		The secret affairs of genes: Bridging the gap between genetics and gene multi-function Brendan Frey, University Of Toronto	Unique decodability for string reconciliation Aryeh Kontorovich, Ben Gurion University, Ari Trachtenberg, BU
2:45	Break

	Probability and Information Theory	Message Passing and Inference	Multiterminal Source Coding	Polar Codes
	Chair: Gerhard Kramer, Technische Universit�t M�nchen	Chair: Brendan Frey, University of Toronto	Chair: En-Hui Yang, University of Waterloo	Chair: Alexander Vardy, UCSD
3:00	A class of log-optimal utility functions Paul Cuff, Princeton	Information-theoretically optimal compressed sensing via spatial coupling and approximate message passing David Donoho, Stanford, Adel Javanmard, Stanford, Andrea Montanari, Stanford	A hybrid random-structured coding scheme for the Gaussian two-terminal source coding problem under a covariance matrix distortion constraint Zixiang Xiong, Texas A&M	Chase decoding of Polar codes Gabi Sarkis, McGill, Warren Gross, McGill
3:20	New estimators of directed information Tsachy Weissman, Stanford	Neural connectivity and receptive field estimation via hybrid message passing Alyson Fletcher, UCSF	Combinatorial message sharing and new achievable regions for multiterminal source coding in networks Kumar Viswanatha, UC Santa Barbara, Emrah Akyol, UC Santa Barbara, Kenneth Rose, UC Santa Barbara	On the partial distances of a polarizing matrix obtained from the Kronecker product Kyeongcheol Yang, , Myung-Kyu Lee, POSTECH Korea
3:40	Cause of causality Sae-Young Chung, KAIST	Generalized belief propagation for counting matchings Michael Chertkov, , Adam Yedidia, MIT	Source coding with delayed side information Osvaldo Simeone, NJIT, Haim Permuter, Ben Gurion University	Polar codes for q-ary channels, q=2^r Alexander Barg, University of Maryland, Woomyoung Park, University Of Maryland
4:00	Break

	Shannon Theory	MIMO Systems I	Cooperative Communications	Network Coding I
	Chair: Young-Han Kim, UCSD	Chair: Mahesh Varanasi, University of Colorado, Boulder	Chair: Natasha Devroye, University of Illinois at Chicago	Chair: Aditya Ramamoorthy, Iowa State
4:15	Identity for the Gelfand-Pinsker converse Gerhard Kramer, TU Munich	A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems Tanumay Datta, Indian Institute Of Science, N Ashok Kumar, Indian Institute Of Science, Ananthanarayanan Chockalingam, Indian Institute Of Science, B Sundar Rajan, Indian Institute Of Science	Collaborative spectrum sensing based on event-driven sampling Yasin Yilmaz, Columbia, George Moustakides, Columbia, Xiaodong Wang, Columbia	A graph theoretical approach to network encoding complexity Li Xu, University Of Hong Kong, Weiping Shang, University Of Hong Kong, Guangyue Han, University Of Hong Kong
4:35	MMSE interference in Gaussian channels Shlomo Shamai , Technion, Shlomo Shamai, Technion, Ronit Bustin, Technion	Semi-Blind MU-MIMO based on limited features of user multi-path intensity profiles Haralabos Papadopoulos, DoCoMo, Sayandev Mukherjee, DoCoMo, Sean Ramprashad, DoCoMo	On the limitations of cooperation in wireless networks Jeffrey Andrews, UT Austin, Angel Lozano, Universitat Pompeu Fabra Spain, Robert Heath, UT Austin	The asymptotic behavior of Grassmannian codes Tuvi Etzion, Technion
4:55	The log-volume of optimal codes for memoryless channels, within a few nats Pierre Moulin, UIUC		Beamforming with limited feedback in relay-interference networks Hamid Jafarkhani, UC Irvine	Symmetrical multilevel diversity coding and subset entropy inequalities Jinjing Jiang, Texas A&M, Neeharika Marukala, Texas A&M, Tie Liu, Texas A&M
5:15	Break

	Network Information Theory I	MIMO Systems II	Interference Channels	Source Coding
	Chair: Lalitha Sankar, Princeton	Chair: Alexei Ashikhmin, Bell Labs	Chair: Syed Jafar, UC Irvine	Chair: Jun Chen, McMaster University
5:30	Toward a computational information theory Michelle Effros, Caltech	On the strange error behavior of MMSE precoding and equalization Aria Nosratinia, UT Dallas, Ahmed Mehana, University of Texas at Dallas	A new achievable rate region for the three-user interference channel Arun Padakandla, UM Ann Arbor, Sandeep Pradhan, UM Ann Arbor, Aria Sahebi, UM Ann Arbor	Analysis of a recurrence arising in a graphical compression algorithm Wojtek Szpankowski, Purdue, Charles Knessl, University Of Illinois Chicago, Yongwook Choi
5:50	Network capacity with local network views Salman Avestimehr, Cornell, Alireza Vahid, Cornell, Vaneet Aggarwal, AT&T, Ashu Sabharwal, Rice	Sub-modularity and antenna selection in MIMO systems Rahul Vaze, TIFR, Harish Ganapathy, University Of Texas	On linear deterministic interference channels with partial feedback Sy-Quoc Le, National University Of Singapore, Ravi Tandon, Princeton, Mehul Motani, National University Of Singapore, H. Vincent Poor, Princeton	A sparse regression approach to Gaussian rate-distortion Ramji Venkataramanan, Yale, Antony Joseph, Yale, Sekhar Tatikonda, Yale
6:10	Network compression: memory-assisted source coding of network flows Mohsen Sardari, Georgia Tech, Ahmad Beirami, Georgia Tech, Faramarz Fekri, Georgia Tech	On the performance of large multi-user MIMO systems with antenna correlation Peng Wang, City University of Hong Kong, Jujie Ma, City University of Hong Kong, Hao Wang, City University of Hong Kong, Li Ping, City University of Hong Kong	On the achievable rate sum for symmetric Gaussian interference channels Max Costa, University Of Campinas - Unicamp, Chandra Nair, The Chinese University of Hong Kong	A Compression Algorithm Using Misaligned Side Information Nan Ma, UC Berkeley, Kannan Ramchandran, UC Berkeley, David Tse, UC Berkeley
6:30	Break and soft drinks

6:45	Remembering Jack Wolf - organized by Massimo Franceschetti, Tara Javidi, and Young-Han Kim

7:45	Refreshments

Tuesday

8:00	Continental Breakfast

	Coding Against Shifts and Delays	Computer Vision I	Network Coding II	Degrees of Freedom and Interference Coordination
	Chair: Lara Dolecek, UCLA	Chair: Ce Liu, Microsoft	Chair: Alex Sprintson, Texas A&M	Chair: Viveck Cadambe, MIT
8:30	Error correction on an insertion/deletion channel applying codes from RFID standards Oyvind Ytrehus, Bergen, Guang Yang, Bergen, �ngela Barbero, University Of Valladolid Spain, Eirik Rosnes, Bergen	Information Forests Zhao Yi, UC Los Angeles, Stefano Soatto	Analog network coding: An upper bound and amplify-forward schemes in layered network Ning Cai, Xidian University, Binyue Liu, Xidian University	Understanding spatial signal dimensions: recent results and some conjectures on the DoF of MIMO interference networks Syed Jafar, UC Irvine
8:50	On the capacity of synchronization error channels with noise Tolga M. Duman, Arizona State, Mojtaba Rahmati, Arizona State	Recognition problems in computer vision. Alexander C. Berg, Stony Brook University	Fast restoration in next generation networks Ender Ayanoglu, UC Irvine, Serhat Nazim Avci, UC Irvine	DoF of interference channels with CoMP transmission and reception Venu Veeravalli, UIUC, Sreekanth Annapureddy, UIUC, Aly Elgamal, UIUC
9:10	The cyclic shift channel Tjalling Tjalkens, TU Eindhoven, Danhua Zhu, Philips Research Europe	Similarity-preserving binary codes for scalable image search Svetlana Lazebnik, UIUC	Feed-back and network coding strategies in wireless networks Kwang Taik Kim, Samsung, Chan-Soo Hwang, Assia Inc., Vahid Tarokh, Harvard	Generalized approximate message passing and applications to interference coordination Sundeep Rangan, NYU-Poly
9:30	Break

	LDPC Codes	Topics in Wireless Communication	Network Coding III	Optical Communication
	Chair: Bane Vasic, University of Arizona	Chair: Upamanyu Madhow, UCSB	Chair: Tie Liu, Texas A&M	Chair: George Papen, UCSD
9:45	Dispelling the error floor of LDPC codes Shuai Zhang, University Of Alberta, Christian Schlegel, University Of Alberta	Analytical evaluation of adaptive coding for Nakagami fading channels Jason D. Ellis, Clemson University, Michael A. Juang, Clemson University, Michael B. Pursley, Clemson University	On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks Shurui Huang, Iowa State, Aditya Ramamoorthy, Iowa State	Approaching the ultimate limits of communication efficiency with a photon-counting detector Baris Erkmen, JPL, Bruce Moision, JPL, Samuel J. Dolinar, JPL, Kevin M. Birnbaum, JPL, Dariush Divsalar, JPL
10:05	LDPC decoders on unreliable hardware: fundamental limits and practical implications Sadegh Tabatabaei Yazdi, UC Los Angeles, Lara Dolecek, UC Los Angeles	Communication through Reordering of Resources: Capacity Results and Trellis Code Design Petar Popovski, Aalborg University, Zoran Utkovski, UGD, Stip, Republic of Macedonia, Kasper F. Trillingsgaard, Aalborg University	Achievable rate regions for network coding Randall Dougherty , Chris Freiling, California State University, San Bernardino, Kenneth Zeger, UC San Diego	Fiber-optic communication via the nonlinear Fourier transform Frank Kschischang, University Of Toronto, Mansoor Yousefi, University Of Toronto
10:25	New dual-diagonal structure for low-rate QC LDPC codes with multi edges Hosung Park, Seoul National University, Jong-Seon No, Seoul National University, Dong-Joon Shiin, Hanyang University	Transmission capacity of wireless ad hoc network with non-parametric linear MMSE receiver Byonghyo Shim, Korea University, Byungju Lee, Korea University, Sunho Park, Korea University	Characterizing the region of entropic vectors via information geometry John Walsh	On high-efficiency optical communication and key distribution Yuval Kochman, MIT, Gregory Wornell, MIT
10:45	Break

	Spatial Coupling in LDPC Codes	MIMO Interference Channels	Lossy Source Coding	Multiuser Information Theory
	Chair: Christian Schlegel, University of Alberta	Chair: Nihar Jindal, Broadcom Corporation	Chair: Sandeep Pradhan, University of Michigan	Chair: Elza Erkip, NYU-Poly
11:00	New codes on graphs constructed by connecting spatially coupled chains Dmitry Trukhachev, University Of Alberta, David Mitchell, University Of Notre Dame, Michael Lentmaier, TU Dresden, Daniel Costello, University Of Notre Dame	Interference mitigation in MIMO interference channel via successive single-user soft decoding Jungwon Lee, Samsung, Hyukjoon Kwon, Samsung, Inyup Kang, Samsung	Rate distortion performance bounds for wideband speech Jerry Gibson, UC Santa Barbara	Constant-factor approximation of sum rate in wireless networks: A polymatroidal approach Pramod Viswanath, UIUC
11:20	On the typical minimum distance of protograph-based non-binary LDPC codes Dariush Divsalar, JPL, Lara Dolecek, UC Los Angeles	On MIMO interference and X-channels with feedback and delayed CSI Soheil Mohajer, UC Berkeley, Ravi Tandon, Princeton, Shlomo Shamai, Technion, Vincent Poor, Princeton	Incremental source coding using a Gaussian test channel and MSE distortion Jan Ostergaard, Aalborg University, Ram Zamir, Tel Aviv University	Integer-forcing Bobak Nazer, BU, Jiening Zhan, UC Berkeley, Uri Erez, Tel Aviv University, Michael Gastpar, EPFL / UC Berkeley
11:40	Spatial coupling and information crystallization Phong Nguyen, Texas A&M, Arvind Yedla, Texas A&M, Henry Pfister, Texas A&M, Krishna Narayanan, Texas A&M	On the degrees-of-freedom for the semi-symmetric M X N MIMO interference channels with constant channel coefficients Jungwoo Lee, Seoul National University	High-rate performance of continuous-time lossy source coding David Neuhoff, University Of Michigan, Sandeep Pradhan, University Of Michigan	General broadcast channel: is marton's region tight? Shao-Lun Huang, MIT, Lizhong Zheng, MIT
12:00	Spatially coupled LDPC codes achieve capacity universally (Watch ) Tom Richardson, Qualcomm	Beamforming and aligned interference neutralization achieve the degrees of freedom region of the MIMO 2x2x2 interference network Mahesh Varanasi, University Of Colorado Boulder, Chinmay Vaze, University Of Colorado Boulder	Gaussian robust sequential source coding Jun Chen, McMaster University	Codes based on Eisenstein integers for compute and forward Krishna Narayanan, Texas A&M, Joseph Boutros, Texas A&M Qatar, Engin Tunali, Texas A&M
12:20	Lunch (on your own)

	Quasi-Cyclic LDPC Codes	Complex and Next-Generation Networks	Network Coding IV	Wireless Standards
	Chair: Henry Pfister, Texas A&M	Chair: Sennur Ulukus, University of Maryland	Chair: Joao Barros, University of Porto	Chair: Sundeep Rangan, NYU-Poly
1:45	A transform approach for constructing quasi-cyclic Euclidean geometry LDPC codes Shu Lin, UC Davis, Qiuju Diao, UC Davis, Wei Zhou, UC Davis, Khaled Abdel-Ghaffar, UC Davis	Optimal smart grid tariffs Jean Walrand, UC Berkeley, Longbo Huang, UC Berkeley	On erasure correction coding for streaming Omer F. Tekin , Caltech, Tracey Ho, Caltech, Hongyi Yao, Caltech, Sidharth Jaggi, CUHK	5g WiFi is here: an overview of 802.11ac Nihar Jindal, Broadcom, Ron Porat, Broadcom, Vinko Erceg, PleaseSelect, Matthew Fischer, Broadcom
2:05	[Roxana Smarandache] [Roxana Smarandache]	Complex information systems Robert Bonneau, AFOSR	Network coding and multipath TCP Muriel Medard , MIT, Jason cloud , MIT, Flavio du Pin Calmon, MIT, Weifei Zeng, MIT	Flip-OFDM for unipolar communications Nirmal Fernando, Monash University, Yi Hong, Monash University, Emanuele Viterbo, Monash University
2:25	Quasi-cyclic LDPC codes: construction and rank analysis of their parity-check matrices Keke Liu, UC Davis, Qin Huang , Shu Lin, UC Davis, Khaled Abdel-Ghaffar, UC Davis	The DMT of half-duplex relay networks: fixed or dynamic schedules? Ayfer Ozgur, Stanford, Suhas Diggavi, UC Los Angeles		How do information theory derive the LTE advance technologies? Byung Yi, LG
2:45	Break

	Arrays and Multiantenna Systems	Feedback in Communications	Storage and Search	Wireless Technology
	Chair: Aria Nosratinia, UT Dallas	Chair: Larry Milstein, UCSD	Chair: Alex Dimakis, USC	Chair: Salman Avestimehr, Cornell
3:00	Compressive adaptation of large steerable arrays Dinesh Ramasamy, UC Santa Barbara, Sriram Venkateswaran, UC Santa Barbara, Upamanyu Madhow, UC Santa Barbara	Feedback for latency reduction in the Gaussian Channel Richard Wesel, UC Los Angeles, Tsung-Yi Chen, UC Los Angeles, Adam Williamson, UC Los Angeles, Dariush Divsalar, JPL, Yang Guo, UC Los Angeles	Flexible coding strategies for next-generation storage systems Lara Dolecek, UC Los Angeles, Ryan Gabrys, UC Los Angeles, Eitan Yaakobi, Caltech, Laura Grupp, UC San Diego, Steven Swanson, UC San Diego	Emerging wireless applications in biomedicine Ada Poon, Stanford
3:20	On beam alignment for outdoor millimeter wave beamforming systems David Love, Purdue, Sooyoung Hur, Purdue, James Krogmeier, Purdue, Timothy Thomas, Nokia Siemens Networks, Amitava Ghosh, Nokia Siemens Networks, Taejoon Kim, Nokia	Can a few flops and one bit of CSIT provide near-ergodic behavior to non-ergodic MIMO? Rate-reliability-complexity analysis Petros Elia and Arun Singh , Eurecom	Optimal linear codes with local-error-correcting capability Govinda Kamath, Indian Institute Of Science, N Prakash, Indian Institute Of Science, V Lalitha, Indian Institute Of Science, P Vijay Kumar, Indian Institute Of Science	Full duplex wireless Sachin Katti
3:40	Pilot contamination pre-coding for large-scale antenna systems Alexei Ashikhmin, Bell Labs, Thomas Marzetta, Bell Labs	Two-way interference channels Changho Suh, MIT, David Tse, UC Berkeley	Recognition capacity versus search speed in noisy databases Ertem Tuncel, UC Riverside
4:00	Break

	Information Theory	Communication Networks	Distributed Storage	Energy Harvesting
	Chair: Paolo Minero, Notre Dame	Chair: Roy Yates, Rutgers	Chair: P Vijay Kumar, IISc and USC	Chair: Osvaldo Simeone, NJIT
4:15	Fundamental limits and practical constructions for low transmit, encoding, and decoding power: an overview Pulkit Grover, Stanford, Andrea Goldsmith, Stanford, Anant Sahai, UC Berkeley, Jan Rabaey, UC Berkeley, Karthik Ganesan, UC Berkeley, Yang Wen, UC Berkeley	A few lessons on network connectivity with group mobility Richard La, University Of Maryland College Park	Local distributed storage codes for Hadoop Dimitris Papailiopoulos, USC, Alex Dimakis, USC	Communicating with energy harvesting transmitters and receivers Kaya Tutuncuoglu, Penn State, Aylin Yener, Penn State
4:35	State dependent active communication Urbashi Mitra, USC, Chiranjib Choudhuri, USC	Keynesian economics, the cutoff rate, and graph-based economics Richard Blahut, UIUC	A unification of network coding and routing Raymond Yeung, CUHK	Information-theoretic capacity of energy harvesting systems with very large and very small batteries Omur Ozel, University Of Maryland, Sennur Ulukus, University Of Maryland
4:55	An integral equation formulation of Schrodinger's neuron channel solved via Laplace transforms Toby Berger, University Of Virginia, William Levy, University Of Virginia, Jie Xing, University Of Virginia	On emptying a network of queues Tony Ephremides, University Of Maryland	Repair-by-transfer in distributed storage system Kenneth Shum, CUHK, Yuchong Hu, CUHK	On optimal transmission policies for energy harvesting devices Nicolo' Michelusi, University Of Padova, Kostas Stamatiou, University Of Padova, Michele Zorzi, University Of Padova
5:15	Break

	Channel Coding	Coding Theory II	Network Coding V	Communication Design
	Chair: Erik Agrell, Chalmers University of Technology	Chair: Alexander Barg, University of Maryland	Chair: Sidharth Jaggi, CUHK	Chair: Nihar Jindal, Broadcom Corporation
5:30	Asymptotically optimal trellis coded modulation systems Alexandre Graell i Amat, Chalmers University of Technology, Alex Alvarado, University of Cambridge, Fredrik Brannstrom, Chalmers University of Technology, Erik Agrell, Chalmers University of Technology	Codes on graphs: observability, controllability and local reducibility Dave Forney, MIT, Heide Gluesing-Luerssen	On wireless cooperative data exchange in the presence of an eavesdropper Alex Sprintson, Texas A&M, Muxi Yan, Texas A&M	Minimizing exposure to electromagnetic radiation in portable devices Bertrand Hochwald, University Of Notre Dame, David Love, Purdue
5:50	On the delay and energy performance in coded two-hop line networks with bursty erasures Daniel Lucani, University Of Porto, Joerg Kliewer, New Mexico State	Coding over binary expansions Sriram Vishwanath, UT Austin, Ozan Koyluoglu, University Of Texas, Hongbo Si, University Of Texas, Kumar Appaiah, University Of Texas	Hide and code: session anonymity in wireless line networks with coded packets Hugo Sousa-Pinto, University Of Porto, Daniel E. Lucani, University Of Porto, Jo�o Barros, University Of Porto	Proactive resource allocation and demand shaping Hesham El Gamal, Ohio State
6:10	Towards computation of the capacity of quantized discrete memoryless channels Brian Kurkoski, University Of Electro-Communications Tokyo, Hideki Yagi, University Of Electro-Communications Tokyo	Elastic codes Michael Luby, Qualcomm, Amin Shokrollahi, EPFL	Field size of random network coding in untrustworthy network Sang Wu Kim, Iowa State, Duk Hee Yoon, Iowa State	Reduced-dimension communication system design Andrea Goldsmith, Stanford
7:00	Taco Tuesday - an evening in the life of a UCSD student, organized by the Coviello twins, current and former students welcome

Wednesday

8:00	Continental breakfast

		Lecture	Lecture
		Chair: Martin Vetterli, EPFL	Chair: Wojtek Szpankowski, Purdue
8:30		Optimizing Kinect: audio and acoustics Ivan Tashev, Microsoft	Information theory in an industrial research lab (Watch ) Marcelo Weinberger, HP Labs
9:30	Break

		Lecture	Lecture
		Chair: Yoav Freund, UCSD	Chair: Paul Siegel, UCSD
9:45		Content recommendation on Yahoo! sites Deepak Agarwal, Yahoo	How does applied math become applicable? (Watch ) Emina Soljanin, AT&T Bell Labs
10:45	Break

11:00	Relief - Ubli Mitra and Ruedier Urbanke

12:00	Lunch (on your own)

1:15	Graduation-day poster session

	Poster Session	Poster Session	Poster Session	Poster Session

1:15	Peer-to-peer streaming using multiple random hamilton cycles Joohwan Kim, UIUC	Performance improvement in wireless networks by asynchrony resistant MIMO-PHYs and cross-layer MAC/PHY designs Sanaz Barghi, UC Irvine, Hamid Jafarkhani, UC Irvine, Homayoun Yousefi'zadeh, UC Irvine	MicroCast: cooperative video streaming on smartphones Lorenzo Keller, EPFL, Anh Le, UC Irvine, Hulya Seferoglu, MIT, Christina Fragouli, EPFL, Athina Markopoulou, UC Irvine	Learning graphical models Jose Bento, Stanford
1:15	Scheduling in heterogeneous cellular networks with mobility Pooya Monajemi, UC Los Angeles, Richa Sahasrabudhe, UC Los Angeles, Shaunak Joshi, UC Los Angeles, John Villasenor, UC Los Angeles	Distributed estimation in sensor networks with imperfect model information: an adaptive learning-based approach Qing Zhou, Texas A&M, Soummya Kar, CMU, Lauren Huie, Air Force, Shuguang Cui, Texas A&M	Critically sampled wavelet filterbanks on graphs Sunil K. Narang, USC, Antonio Ortega, USC	Information theory of DNA sequencing Guy Bresler, UC Berkeley, Abolfazl Motahari, UC Berkeley, David Tse, UC Berkeley
1:15	Blind null-space learning for spatial coexistence in MIMO cognitive radios Yair Noam, Stanford, Andrea Goldsmith, Stanford	Distributed compression: multiple descriptions, relays and joint source channel coding Rajiv Soundarajan, UT Austin	Multiaccess communication in the finite blocklength regime Ebrahim MolavianJazi, University Of Notre Dame, J. Nicholas Laneman, University Of Notre Dame	Distributed robust multi-cell coordinated beamforming with imperfect CSI: An ADMM approach Tsung-Hui Chang, UC Davis
1:15	Deterministic sequencing of exploration and exploitation for multi-armed bandit problems Keqin Liu, UC Davis, Qing Zhao, UC Davis	Conditions for linearity of optimal estimation Emrah Akyol, UC Santa Barbara, Kumar Viswanatha, UC Santa Barbara, Kenneth Rose, UC Santa Barbara	Implicit synchronization and collaborative localization with minimalistic models Sriram Venkateswaran, UC Santa Barbara, Upamanyu Madhow, UC Santa Barbara	Nearly-optimal associative memories based on distributed constant weight codes Vincent Gripon, McGill, Claude Berrou, TELECOM Bretagne
1:15	A new degree of freedom in hybrid digital/analog transmission and its applications Yang Gao, UC Riverside	Regenerative hierarchical codebooks for limited channel feedback in MIMO systems Kyeongjun Ko, Seoul National University, Jungwoo Lee, Seoul National University	Sparse recovery over networks Meng Wang, Cornell, Weiyu Xu, University of Iowa, Enrique Mallada, Cornell, Kevin Tang, Cornell	Inference, scheduling and energy management in complex networks Jing Yang, UW Madison
1:15	High rank matrix completion Laura Balzano, University Of Wisconsin, Brian Eriksson, University Of Wisconsin, Robert Nowak, University Of Wisconsin
2:30	Break and light refreshments

2:45	Graduation day talks

	Probability and Statistics	Channel Coding	Networks
	Chair: Alon Orlitsky, UCSD	Chair: Daniel Costello, Notre Dame	Chair: Tony Ephremides, University of Maryland
2:45	Error exponent for goodness of fit test with sparse samples Dayu Huang, University of Illinois Urbana-Champaign, Sean Meyn, University of Illinois Urbana-Champaign	On using the LP decoder for tasks other than decoding Idan Goldenberg, Tel Aviv University, David Burshtein, Tel Aviv University	Achievability over gaussian channels with feedback and applications in control Utsaw Kumar, University Of Notre Dame, J. Nicholas Laneman, University Of Notre Dame, Vijay Gupta, University Of Notre Dame
3:05	Efficient sampling with kernel herding Yutian Chen, UC Irvine, Max Welling, UC Irvine, Alex Smola, Yahoo	Error correcting codes for interactive communication Raviteja Sukhavasi, Caltech	Virtual full-duplex communication in wireless networks Lei Zhang, Northwestern, Dongning Guo, Northwestern
3:25	Quick search for rare events Ali Tajer, Princeton	Synchronization error channels Aravind Iyengar, UC San Diego, Paul Siegel, UC San Diego, Jack Wolf, UC San Diego	An Inter-Disciplinary Approach to Wireless Performance and Security Shyamnath Gollakota, MIT, Dina Katabi, MIT
3:45	Active sequential hypothesis testing Mohammad Naghshvar, UC San Diego, Tara Javidi, UC San Diego	Controlled sensing meets channel coding George Atia, UIUC	Resource allocation with two coupled queues in wireless communication and networks Zhoujia Mao, Ohio State, Can Emre Koksal, Ohio State, Ness Shroff, Ohio State
4:05	Break

	Probability and Learning Theory	Multiuser Information Theory	Networks
	Chair: Tara Javidi, UCSD	Chair: Max Costa, University of Campinas - Unicamp	Chair: Massimo Franceschetti, UCSD
4:20	Long range dependent Markov chains and applications Barlas Oguz, UC Berkeley, Venkat Anantharam, UC Berkeley	Throughput maximization for the Gaussian relay channel with energy harvesting constraints Chuan Huang, Texas A&M	A game theoretic perspective for multiple-access and broadcast channels Srinivas Yerramalli, USC, Rahul Jain, USC, Urbashi Mitra, USC
4:40	Robust and flexible high-dimensional statistical learning Ali Jalali, UT Austin	Multiterminal source coding under logarithmic loss Thomas Courtade, UC Los Angeles, Tsachy Weissman, Stanford	Peer effects and stability in matching markets: The advantage of social network structure Elizabeth Bodine-Baron, Caltech, Christina Lee, Caltech, Anthony Chong, Caltech, Babak Hassibi, Caltech, Adam Wierman, Caltech
5:00	A novel distance measure for rank aggregation Farzad Farnoud, University Of Illinois, Olgica Milenkovic, University Of Illinois	Vector Gaussian models: A common framework for security, reliability, and fidelity Ersen Ekrem, University Of Maryland	Bargaining dynamics in exchange networks Yashodhan Kanoria, Stanford, Mohsen Bayati, Stanford, Christian Borgs, Microsoft Research New England, Jennifer Chayes, Microsoft Research New England, Andrea Montanari, Stanford
5:20	Learning music similarity Brian McFee, UC San Diego	Interference mitigation via feedback Ravi Tandon, Princeton, Soheil Mohajer, UC Berkeley, H. Vincent Poor, Princeton	From secret key agreement to matroidal undirected network Chung Chan, CUHK
5:40	Hot or not: interactive content search using comparisons amin karbasi, EPFL, Stratis Ioannidis, Technicolor, Laurent Massoulie, Technicolor
6:00	R & R

6:45	Reception and Banquet

Thursday

8:00	Continental Breakfast

	Optimization I	Consensus I	Music Information Retrieval I	Clustering
	Chair: Constantine Caramanis, UT Austin	Chair: Aditya Mahajan, McGill	Chair: Gert Lanckriet, UCSD	Chair: Tao Shi, Ohio State
8:30	HOGWILD!: a lock-free approach to parallel stochastic gradient descent Ben Recht, UW Madison	Selective gossip: algorithm and application to distributed particle filtering Michael Rabbat, McGill	Attention vs. saliency for auditory scene analysis Malcolm Slaney, Yahoo
8:50	On $ell_0$ search for low-rank matrix completion Wei Dai, Imperial College London, Ely Kerman, UIUC, Olgica Milenkovic, UIUC	On Hegselmann-Krause opinion dynamics Behrouz Touri, UIUC, Angelia Nedich, UIUC	Mining large-scale music data sets Dan Ellis, Columbia, Thierry Bertin-Mahieux, Columbia	Robust and efficient spectral clustering using selective similarities Aarti Singh, CMU
9:10	Orthogonal matching pursuit with replacement Inderjit Dhillon, University Of Texas, Prateek Jain, Microsoft, Ambuj Tewari, University Of Texas	Estimating distributions from social sampling Anand D. Sarwate, TTI Chicago	Stacking for music tag annotation George Tzanetakis, University Of Victoria	Circles of trust: an axiomatic construction of clustering in asymmetric networks Facundo Memoli, University Of Alberta, Santiago Segarra, University Of Pennsylvania, Alejandro Ribeiro, University Of Pennsylvania, Gunnar Carlsson, Stanford
9:30	Break

	Network Science	Latency	Music Information Retrieval II	Learning Theory
	Chair: Saswati Sarkar, U Penn	Chair: R. Srikant, UIUC	Chair: Gert Lanckriet, UCSD	Chair: Shai Ben-David, University of Waterloo
9:45	Optimal patching in clustered malware epidemics MHR Khouzani, Ohio State, Soheil Eshghi, University Of Pennsylvania, Saswati Sarkar, University Of Pennsylvania, Santosh Venkatesh, University Of Pennsylvania	Peer-to-Peer Streaming Over Dynamic Random Hamilton Cycles Joohwan Kim, UIUC, R. Srikant, UIUC	Music similarity is dead. Long live music recommendation! Oscar Celma, Gracenote	Exchangeable but inconsistent priors for Bayesian inference Max Welling, UC Irvine, Ian Porteous, Google, Kenichi Kurihara, Google
10:05	The vulnerability of the power grid to large scale attacks and failures Andrey Bernstein, Technion, Daniel Bienstock, Columbia, David Hay, Hebrew University, Meric Uzunoglu , Columbia, Gil Zussman, Columbia	Fixed delay transmission of i.i.d. sequences Aditya Mahajan	PodCastle and Songle: crowdsourcing-based web services for spoken document retrieval and active music listening Masataka Goto, AIST, Jun Ogata, AIST, Kazuyoshi Yoshii, AIST, Hiromasa Fujihara, AIST, Matthias Mauch, AIST, Tomoyasu Nakano, AIST	Metric learning of manifolds Marina Meila, University Of Washington, Dominique Perrault-Joncas, Univ. Of Washington
10:25	The Markov graph of network cascades Praneeth Netrapalli, UT Austin, Sujay Sanghavi, UT Austin	[Konstantinos Psounis] [Konstantinos Psounis]	Representational compactness and robustness for large-scale music recommendation Douglas Eck, Google	Bounds on the maximum Bayes error given moments Maya Gupta, University Of Washington, Bela Frigyik, University Of Washington
10:45	Break

	Computer Vision II	Scheduling	Distributed Learning	Graphical Models and Inference
	Chair: Nuno Vasconcelos, UCSD	Chair: Anna Scaglione, UC Davis	Chair: Sanjoy Dasgupta, UCSD	Chair: Alex Ihler, UC Irvine
11:00	Image classification using super-vector coding Kai Yu, NEC, Tong Zhang, Rutgers	Communication scheduling and remote estimation with energy harvesting sensor Ashutosh Nayyar, UIUC, Tamer Basar, UIUC, Demosthenis Teneketzis, UM Ann Arbor, Venugopal Veeravalli, UIUC	Random access sensor networks: field reconstruction from incomplete data Fatemeh Fazel, Northeastern University, Maryam Fazel, University Of Washington, Milica Stojanovic, Northeastern University	Monotonicity and positive correlation in Markov random fields Matt Reyes, MIT Lincoln Labs
11:20	Complementary computing for visual tasks: meshing computer vision with human visual processing Ashish Kapoor, Microsoft	Distributed scheduling for achieving multi-user diversity Asaf Cohen, Ben Gurion University, Dor-Yossef Kampeas, Sefi, Omer Gurewitz, Ben Gurion University	Sampling for conditional inference on network data Yuguo Chen, UIUC	Learning high-dimensional latent graphical models Animashree Anandkumar, UC Irvine
11:40	Sparsity via dense correspondences for videos and large-scale image databases Ce Liu, Microsoft	Effective bandwidth region of multiuser cognitive spectrum access Shiyao Chen, Cornell, Lang Tong, Cornell, Qing Zhao, UC Davis	The sufficiency principle for networked inference problems Biao Chen, Syracuse, Ge Xu, Syracuse	Analysis of graphical models via zeta functions Henry Pfister, Texas A&M, Pascal Vontobel, HP Labs
12:00		Meeting deadlines: server-assisted wireless P2P networks Navid Abedini, Texas A&M, Mayank Manjrekar, Texas A&M, Srinivas Shakkottai, Texas A&M, Libin Jiang, Caltech	Achieving Pareto optimality through distributed learning Jason Marden, University Of Colorado Boulder, H. Peyton Young, University Of Oxford, Lucy Pao, University Of Colorado Boulder	A factor-graph representation of probabilities in quantum mechanics Hans-Andrea Loeliger, ETH, Pascal Vontobel, HP Labs
12:20	Lunch (on your own)

		Information Theory, Probability, and Statistics	Codes over Channels	Lecture (Kon Tiki Room)
		Chair: Anand Sarwate, TTI Chicago	Chair: Dmitry Trukhachev, University of Alberta	Chair: Fan Chung-Graham, UCSD
1:45		Concentration of measure and erasure divergence Maxim Raginsky, UIUC	First-order asymptotics of the BICM mutual information: Uniform vs. nonuniform distributions Erik Agrell, Chalmers University of Technology, Alex Alvarado, University Of Cambridge	A trillion photos (Watch ) Steven Seitz
2:05		Data processing inequalities based on a certain structured class of information measures with application to parameter estimation Neri Merhav, Technion	Orthogonal multiple access and information fusion: How many observations are needed? Gianluigi Ferrari, University Of Parma, Marco Martal�, University Of Parma, Andrea Abrardo, University Of Siena, Riccardo Raheli, University Of Parma
2:25		On concentration for martingales and applications in information theory and communications Igal Sason, Technion	Tree-structure expectation propagation for LDPC decoding in AWGN channels Fernando Perez-Cruz, University Carlos III
2:45	Break

	Interference Management	Sampling and Statistical Signal Processing	Optimization II	Matching and Proximity Search
	Chair: Asaf Cohen, Ben-Gurion University	Chair: Prakash Ishwar, BU	Chair: Mihaela VanderSchaar, UCLA	Chair: Amit Chakrabarti, Dartmouth
3:00	Communication using identical tokens Chris Rose, Rutgers	Sparse sampling: bounds and applications Martin Vetterli, EPFL	On a linear program for minimum weight triangulation Arman Yousefi, UC Riverside, Neal Young, UC Riverside	[Sariel Har-Peled] [Sariel Har-Peled]
3:20	Spectrum white space trade in cognitive radio networks Gaurav Kasbekar, University of Pennsylvania, Saswati Sarkar, University of Pennsylvania	The No-U-Turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo Matt Hoffman, Columbia	On the information architecture and model for scheduling deferrable power loads Anna Scaglione, UC Davis, Mahnoosh Alizadeh, UC Davis, Robert Thomas, Cornell	Fast locality sensitive hashing Anirban Dasgupta, Yahoo
3:40	Interference management in IEEE 802.15.4 based sensor networks Jin-Seok Han, Seoul National University, Hyung-Sin Kim, Seoul National University, Yong-Hwan Lee, Seoul National University	Compressive depth acquisition cameras: Principles and demonstrations Vivek Goyal, MIT	Optimization for all levels of uncertainty Constantine Caramanis, UT Austin	Dual-decomposition and inference in planar graphs Charless Fowlkes, UC Irvine, Julian Yarkony, UC Irvine, Alexander Ihler, UC Irvine
4:00	Break

	Inference	Sparse Signal Recovery	Social Networks and Data Mining	Channel Capacity
	Chair: Anima Anandkumar, UC Irvine	Chair: Vivek Goyal, MIT	Chair: Bhaskar Krishnamachari, USC	Chair: Fernando Perez-Cruz, University Carlos III
4:15	Bilinear generalized approximate message passing (BiG-AMP) for matrix recovery problems Phil Schniter, Ohio State, Volkan Cevher, EPFL	Construction of low-coherence frames using group theory Babak Hassibi, Caltech, Matthew Thill, Caltech	Economic information acquisition for data-driven decision making Maytal Saar-Tsechansky, UT Austin	Achieving Gaussian multiple access channel capacity with spatially coupled sparse graph multi-user modulation Dmitry Trukhachev, University Of Alberta
4:35	Message passing algorithms for mixed inference tasks Alex Ihler, UC Irvine	Sparse recovery with graph constraints Meng Wang, Cornell, Weiyu Xu, Cornell, Enrique Mallada, Cornell, Kevin Tang, Cornell	Estimating and shaping opinions in twitter Onkar Dabeer, TIFR	Capacity of Gaussian MAC with energy harvesting transmit nodes Ramachandran Rajesh, CABS, DRDO, P Deekshith, Indian Institute Of Science, Vinod Sharma, Indian Institute Of Science
4:55	Stochastic belief propagation: low-complexity message-pass with rigorous guarantees Martin Wainwright, UC Berkeley, Nima Noorshams, UC Berkeley	Asymptotic analysis of complex LASSO via complex approximate message passing Arian Maleki, Rice, Laura Anitori, TNO, Netherlands, Zai Yang, Nanyang Technological University, Richard Baraniuk, Rice	Low-distortion inference of latent similarities from a multiplex social network Ittai Abraham, Microsoft Research, Shiri Chechik, Weizmann Inst. of Science, David Kempe, Univ. of Southern California, Aleksandrs Slivkins, Microsoft Research	Let us dance just a little bit more -- On the information capacity of the human motor system Teemu Roos, Helsinki Institute For Information Technology, Antti Oulasvirta, MPI Informatik, Laura Lepp�nen, University Of Helsinki, Arttu Modig, University Of Helsinki
5:15	Break

	Statistics	Statistical Machine Learning and Applications	Games I	Queueing
	Chair: Maxim Raginsky, UIUC	Chair: Aarti Singh, CMU	Chair: Rahul Jain, USC	Chair: Lang Tong, Cornell
5:30	Asymptotic performance for distributed estimation Soummya Kar, CMU, Vincent Poor, Princeton University, Jose Moura, CMU, Shuguang Cui, Texas A&M	Clustering in directed graphs; a statistical model and a spectral algorithm. Karl Rohe, UW Madison, Bin Yu, UC Berkeley	Intruder Classification Games John Musacchio, UC Santa Cruz	Beyond Little's law: batch latency analysis for large multi-hop networks Raj Rao Nadakuditi , Michigan
5:50	Controlled sensing for hypothesis testing Sirin Nitinawarat, UIUC, George Atia, University of Illinois at Urbana-Champaign, Venugopal Veeravalli, University of Illinois at Urbana-Champaign	Reconstructing visual experiences from brain activity evoked by natural movies Shinji Nishmoto, UC Berkeley, An Vu, UC Berkeley, Thomas Naselaris, UC Berkeley, Yuval Benjamini, UC Berkeley, Bin Yu, UC Berkeley, Jack Gallant, UC Berkeley	Large-scale games in network security Joao Hespanha	From local to global stability in stochastic processing networks through quadratic Lyapunov functions Jinwoo Shin, Georgia Tech, Ton Dieker, Georgia Tech
6:10	Optimality of Coincidence-Based Goodness of Fit Test for Sparse Sample Problems Dayu Huang, University Of Illinois, Sean Meyn, University Of Florida	Variable selection in high dimensional clustering using ensemble variable importance measure Tao Shi, Ohio State, Dunke Zhou, Ohio State	Structural properties for dynamic games Achilleas Anastasopoulos, University Of Michigan	On scheduling algorithms robust to heavy-tailed traffic Krishna Jagannathan, IIT, Libin Jiang, Caltech, Eytan Modiano, MIT
6:45	Game night & refreshments - Amit Chakrabarti, Sidharth Jaggi, Bakhtiyar Neymanov, and Prasad Santhanam

Friday

8:00	Continental Breakfast

	Sparsity and Learning	Consensus II	Mathematics in Coding Theory
	Chair: Wei Dai, Imperial College London	Chair: Hamid Sadjadpour, UC Santa Cruz	Chair: Mahdi Cheraghchi, CMU
8:30	On the fundamental limits of adaptive sensing Ery Arias-Castro, UC San Diego, Emmanuel Candes, Stanford, Mark Davenport, Stanford	Contribution of Andrey Kolmogorov to consensus and opinion dynamics Behrouz Touri, UIUC, Angelia Nedich, UIUC	Error-correcting codes vs. superconcentrator graphs Anna Gal, UT Austin, Kristoffer Hansen, Aarhus University, Michal Koucky, Prague, Pavel Pudlak, Prague, Emanuele Viola, Northeastern University
8:50	A unified theory for structured sparse recovery problems Tong Zhang, Rutgers, Cun-hui Zhang, Rutgers	Necessary and sufficient conditions for observational social learning Ali Jadbabaie, University of Pennsylvania	Explicit group testing scheme that identifies almost all defective configurations Arya Mazumdar, MIT
9:10	How to find a needle in a haystack Joel Tropp, Caltech	When is decentralized as good as centralized: a walk through consensus and innovations Jose Moura, CMU	Efficient and explicit coding for interactive communication Amit Sahai, UC Los Angeles
9:30	Break

	Online Algorithms I	Games II	Next Generation Antennas	Communication and Control
	Chair: Roger Levy, UCSD	Chair: Edmund Yeh, Northeastern University	Chair: Jean-Francois Chamberland, Texas A&M	Chair: Ali Jadbabaie, U Penn
9:45	Prediction and compression: comparisons from an information theoretic perspective Narayana Prasad Santhanam, University Of Hawaii Manoa, Venkat Anantharam, UC Berkeley	Content production and link formation games Mihaela VanderSchaar, UC Los Angeles, Yu Zhang, UC Los Angeles, Jaeok Park, UC Los Angeles	High data-rate nanoreceivers with carbon nanotube antennas C. Emre Koksal, Ohio State	A data rate theorem for stabilization over Markov feedback channels Paolo Minero, Notre Dame
10:05	Online learning algorithms for stochastic water-filling Bhaskar Krishnamachari, USC, Yi Gai, USC	The impact of incomplete information on games in parallel relay networks Hongda Xiao, Yale, Edmund Yeh, Northeastern University	Reconfigurable antennas, preemptive switching and virtual channel management Santhosh Kumar, Texas A&M, Jean-Francois Chamberland, PleaseSelect, Gregory Huff, Texas A&M	Network-coding meets decentralized control (and vice versa) Anant Sahai, UC Berkeley, Se Yong Park, UC Berkeley
10:25	Randomized queueing for online matching Thomas Hayes, University Of New Mexico	Spotting trendsetters: inference for network games Vijay Subramanian, Northwestern, Randall Berry, Northwestern	Adaptive antenna grouping to improve wireless network capacity Joseph Soriaga, Qualcomm, Kambiz Azarian, Qualcomm, Radhika Gowaikar, Qualcomm, Donna Ghosh, Qualcomm, Christopher Lott, Qualcomm, Rashid Attar, Qualcomm	On the design of minimal communications network for distributed networked control Mohammad Razeghi-Jahromi, Univ. of Rochester, Alireza Seyedi, Univ. of Rochester
10:45	Break

	Networks and Graphs	Theory	Coding approaches to sparsity	Learning and Control
	Chair: Martin Haenggi, Notre Dame	Chair: Joel Tropp, Caltech	Chair: Venkatesh Saligrama, BU	Chair: Anant Sahai, UC Berkeley
11:00	Delay scaling in dense wireless deployment: From interacting particle systems to wireless networks Vijay Subramanian, , Murat Alanyali, Boston University	Certifiable quantum dice Umesh Vazirani, UC Berkeley, Thomas Vidick, PleaseSelect	Universal MAP signal estimation from random projections Dror Baron, NC State	Disturbance propagation in leader-follower systems Yingbo Zhao, Notre Dame, Vijay Gupta, Notre Dame, Paolo Minero, Notre Dame
11:20	Percolation in directed random geometric graphs Olivier Dousse, Nokia	Faster algorithms for sparse fourier transform Haitham Hassanieh, MIT, Piotr Indyk, MIT, Dina Katabi, MIT, Eric Price, MIT	Compressive sensing meets group testing: LP decoding for non-linear (disjunctive) measurements Chun Lam Chan, CUHK, Sidharth Jaggi, CUHK, Venkatesh Saligrama, BU, Samar Agnihotri, CUHK	Information renormalization the Bellman equation Naftali Tishby
11:40	Optimal power flow on radial networks (Watch ) Steven Low, Caltech, Subhonmesh Bose, Caltech, Mani Chandy, Caltech, Masoud Farivar, Caltech, Dennice Gayme, Caltech	Fast approximation of matrix coherence and statistical leverage Michael Mahoney, Stanford	Recovering simple signals Anna C. Gilbert, University Of Michigan, Brett Hemenway, University Of Michigan, Atri Rudra, SUNY Buffalo, Martin Strauss, University Of Michigan, Mary Wootters, University Of Michigan	Learning non-linear dynamical systems Kevin McGoff, Duke, Sayan Mukherjee, Duke, Natesh Pillai, Harvard
12:00	ALOHA performs optimum power control in Poisson networks Xinchen Zhang, University Of Notre Dame, Martin Haenggi, University Of Notre Dame	Minimum complexity pursuit: noise sensitivity analysis Shirin Jalali, Caltech, Arian Maleki, Rice	Coding-theoretic methods for sparse recovery Mahdi Cheraghchi, CMU	Spectral learning algorithms for dynamical systems Geoffrey Gordon, CMU
12:20	Lunch (on your own)

	Statistical Learning Theory	Online Algorithms II	Applied Machine Learning	Bioinformatics II
	Chair: Kamalika Chaudhuri, UCSD	Chair: Qing Zhao, UC Davis	Chair: Lawrence Saul, UCSD	Chair: Todd Coleman, UCSD
1:35	Learning marginal predictors Clayton Scott, University Of Michigan, Gilles Blanchard, Universitat Potsdam, Urun Dogan, Universitat Potsdam, Gyemin Lee, University Of Michigan, Lloyd Stoolman, University Of Michigan	Decentralized multi-armed bandits Dileep Kalathil, USC, Naumaan Nayyar, USC, Rahul Jain, USC	The Big Data bootstrap Ariel Kleiner, UC Berkeley, Ameet Talwalkar, UC Berkeley, Purna Sarkar, UC Berkeley, Michael Jordan, UC Berkeley	Dynamic coordination in multi-scale brain networks: from single neurons to distributed cell assemblies Ryan Canolty, UC Berkeley, Jose Carmena, UC Berkeley
1:55	Stability and the computational complexity of learning Shai Ben-David, University Of Waterloo	Online learning for stochastic linear optimization problems Keqin Liu, UC Davis, Qing Zhao, UC Davis	Context aware smartphones: an unsupervised approach using the sticky HDP-HMM Leonard Grokop, Qualcomm, Vidya Narayanan, Qualcomm, Sanjiv Nanda, Qualcomm	Statistical characterizations of genome dynamics Francesca Chiaromonte , Penn State, Francesca Chiaromonte, Penn State
2:15	Oracle inequalities and minimax rates for non-local means Rebecca Willett, Duke, Ery Arias-Castro, UC San Diego, Joseph Salmon, Duke	Online dynamic capacity provisioning in data centers Adam Wierman, Caltech	Learning dimensional biases in human categorization: a statistical approach Katherine Heller, MIT	Information theory of DNA sequencing Guy Bresler, UC Berkeley, Abolfazl Motahari, UC Berkeley, David Tse, UC Berkeley
2:35	Learning the Kernel Matrix with Low-rank Multiplicative Shaping Tomer Levinboim, USC, Fei Sha, USC	Lower bounds on trace reconstruction over deletion channels Krishnamurthy Viswanathan, HP Labs, Urs Niesen, Alcatel-Lucent Bell Labs, Ram Swaminathan, HP Labs	Topic modeling and adaptation from noisy automatic speech recognition Damianos Karakos, Johns Hopkins, Mark Dredze, Johns Hopkins, Sanjeev Khudanpur, Johns Hopkins	Predicting gene-disease associations by combining data from multiple species Ambuj Tewari, UT Austin
2:55	Break

	Network Information Theory II	Stream Algorithms	Privacy and Security	Social networks
	Chair: Young-Han Kim, UCSD	Chair: Yoav Freund, UCSD	Chair: Anand Sarwate, TTI Chicago	Chair: Onkar Dabeer, TIFR
3:10	Approximate ergodic capacity of a class of fading 2x2x2 networks Sang-Woon Jeon, EPFL, Chien-Yi Wang, EPFL, Michael Gastpar, EPFL	Algorithms for distributed stream processing Ashish Goel, Stanford	Local anomaly detection Venkatesh Saligrama, BU, Manqi Zhao, Google	Dynamic pricing strategies for social networks in the presence of externalities B. T. Swapna, Ohio State, Atilla Eryilmaz, Ohio State, Ness Shroff, Ohio State
3:30	Interference alignment and the index coding problem. Viveck Cadambe, MIT, Syed Jafar, UC Irvine, Hamed Maleki, UC Irvine	Digital yet deliberately random: computing on stochastic bit streams Marc Riedel, University Of Minnesota	Private linear maps under decaying privacy Nadia Fawaz, Technicolor, S. Muthukrishnan, Rutgers, Aleksandar Nikolov, Rutgers	Status update queueing Roy Yates, Rutgers, Sanjit Kaul, PleaseSelect
3:50	On the noisy MIMO interference channel with analog feedback Francesco Negro, EURECOM, Irfan Ghauri, Intel Labs, Dirk Slock, EURECOM	Everywhere-tight information cost tradeoffs for augmented index Amit Chakrabarti, Dartmouth, Ranganath Kondapally, Dartmouth	Robust detection in the presence of integrity attacks Bruno Sinopoli, CMU	On the interactions between social and communication networks Mohsen Karimzadeh Kiskani, UC Santa Cruz, Bita Azimdoost, UC Santa Cruz, Hamid Sadjadpour, UC Santa Cruz
4:10	Light refreshments and farewell