Wednesday, 13 June

Plenary 5

Emperors’ Hall
09:00 – 10:00

Randomness as a Resource in Modern Communication and Information Systems
Holger Boche (Technical University of Munich, Germany)

We consider basic questions in information and communication theory on the value of randomness as a resource. We start with Shannon´s problem of transmission of messages over noisy channels. Shannon’s famous solution of this problem was one of the starting points of our information society. Shannon used deterministic encoding and decoding of messages. It is clear that randomized encoding and decoding cannot increase the Shannon capacity for message transmission over noisy channels. Even if we use common randomness between the transmitter and receiver, it is not possible to increase the Shannon capacity for message transmission. As a next step, we consider the problem of secure message transmission of wiretap channels. In this case we discuss that it is already necessary to use local randomness at the transmitter to achieve the capacity for secure message transmission. We further discuss the problem of message transmission and secure message transmission of noisy channels with jammers. For these type of channels, local randomness at the transmitter is a very important resource that increases the capacity and stabilizes the communication from the transmitter to the receiver. In the second part of the talk we will introduce the communication task of identification. In the identification task, the receiver is interested in testing whether a specific message has been transmitted. The transmitter has no idea which message is interesting to the receiver. The identification task is very important for new applications, e.g. car to car, car to infrastructure, sensor networks, and for the tactile internet. If we only use deterministic encoding and decoding, then the capacity for identification over noisy channels is equal to the Shannon capacity for message transmission. So the number of messages that the receiver can identify grows exponentially with the block length. The situation changes dramatically if we can use local randomness at the transmitter. In this case we will show that the number of messages that the receiver can correctly identify grows doubly exponentially. We will show that the same is true for the secure identification task. We will extend this to the identification of noisy channels with a jammer. Here additional gains can be achieved by using a common randomness transmitter and receiver. We will further discuss storage of data and secure storage of private data on public databases. At the end of the talk we will discuss applications for big data.

This is joint work with Christian Deppe from TU Munich-LNT.

Back to summary

Plenary 6

Emperors’ Hall
10:30 – 11:30

Convex Programming for Non-Convex Problems
Justin Romberg (Georgia Institute of Technology, USA)

We consider the question of estimating a solution to a system of equations that involve convex nonlinearities, a problem that is common in machine learning and signal processing. Because of these nonlinearities, conventional estimators based on empirical risk minimization generally involve solving a non-convex optimization program. We propose a method (called “anchored regression”) that is based on convex programming and amounts to maximizing a linear functional (perhaps augmented by a regularizer) over a convex set. 

The proposed convex program is formulated in the natural space of the problem, and avoids the introduction of auxiliary variables, making it computationally favorable. Working in the native space also provides us with the flexibility to incorporate structural priors (e.g., sparsity) on the solution.

For our analysis, we model the equations as being drawn from a fixed set according to a probability law.  Our main results provide guarantees on the accuracy of the estimator in terms of the number of equations we are solving, the amount of noise present, a measure of statistical complexity of the random equations, and the geometry of the regularizer at the true solution. We also provide recipes for constructing the anchor vector (that determines the linear functional to maximize) directly from the observed data.

We will discuss applications of this technique to nonlinear problems including phase retrieval, blind deconvolution, and inverting the action of a neural network.

This is joint work with Sohail Bahmani.

Back to summary

Poster session WA

Chimney Hall/Rococo Room
11:30 – 13:00

WA1: Communication systems and networks
(Chimney Hall)

WA1-01: Maximizing miss detection for covert communication under practical constraints
Gregory Dvorkind (Rafael, Israel)
Asaf Cohen (Ben-Gurion University of the Negev, Israel)
WA1-02: Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection
Jun Tong (University of Wollongong, Australia)
Qinghua Guo (University of Wollongong, Australia)
Jiangtao Xi (University of Wollongong, Australia)
Yanguang Yu (University of Wollongong, Australia)
Peter J. Schreier (Universitaet Paderborn, Germany)
WA1-03: Improper Signaling for OFDM Underlay Cognitive Radio Systems
Mohammad Soleymani (The University of Tehran, Iran)
Christian Lameiro (University of Paderborn, Germany)
Peter J. Schreier (Universitaet Paderborn, Germany)
Ignacio Santamaria (University of Cantabria, Spain)
WA1-04: Minimum Symbol Error Rate-Based Constant Envelope Precoding for Multiuser Massive MISO Downlink
Mingjie Shao (The Chinese University of Hong Kong, P.R. China)
Qiang Li (University of Electronic Science and Technology of China, P.R. China)
Wing-Kin Ma (The Chinese University of Hong Kong, Hong Kong)
Anthony Man-Cho So (The Chinese University of Hong Kong, Hong Kong)
WA1-05: Adaptive EM-based algorithm for cooperative spectrum sensing in mobile environments
Jesus Perez (University of Cantabria, Spain)
Ignacio Santamaria (University of Cantabria, Spain)
Javier Vía (University of Cantabria, Spain)
WA1-06: Detection of Pilot Spoofing Attack over Frequency Selective Channels
Jitendra Tugnait (Auburn University, USA)
WA1-07: Robust Low Complexity Digital Self Interference Cancellation for Multi Channel Full Duplex Systems
Shachar Shayovitz (University of Tel Aviv, Israel)
Dan Raphaeli (Tel Aviv University, Israel)
WA1-08: Adaptive state estimation over lossy sensor networks fully accounting for end-to-end distortion
Bohan Li (University of California, Santa Barbara, USA)
Tejaswi Nanjundaswamy (University of California, Santa Barbara, USA)
Kenneth Rose (University of California, Santa Barbara, USA)

Back to summary

WA2: Array processing
(Chimney Hall)

WA2-01: Target Resolution Properties of the Multi-Tone Sinusoidal Frequency Modulated Waveform
David Hague (Naval Undersea Warfare Center, USA)
WA2-02: Selective Cramer-Rao Bound for Estimation After Model Selection
Elad Meir (Ben Gurion University of the Negev, Israel)
Tirza Routtenberg (Ben Gurion University of the Negev, Israel)
WA2-03: Statistical Characterization of the Optimal Detector for a Signal with Time-Varying Phase Based on the Edgeworth Series
David Gómez-Casco (Universitat Autònoma de Barcelona, Spain)
José A. López-Salcedo (Universitat Autònoma de Barcelona, Spain)
Gonzalo Seco-Granados (Universitat Autonoma de Barcelona, Spain)
WA2-04: Occupancy grid mapping for personal radar applications
Anna Guerra (University of Bologna, Italy)
Francesco Guidi (CEA LETI, France)
Jacopo Dall’Ara (University of Bologna, Italy)
Davide Dardari (University of Bologna, Italy)
WA2-05: An Efficient Greedy Algorithm for Finding the Nearest Simultaneous Diagonalizable Family
Riku Akema (Tokyo Institute of Technology, Japan)
Masao Yamagishi (Tokyo Institute of Technology, Japan)
Isao Yamada (Tokyo Institute of Technology, Japan)
WA2-06: Constant Modulus Beamforming via Low-Rank Approximation
Amir Adler (MIT, USA)
Mati Wax (Technion, USA)
WA2-07: A Localization Algorithm Based on V2I Communications and AOA Estimation
[Signal Processing Letters Paper Presentation]
Alessio Fascista (Università del Salento, Italy)
Giovanni Ciccarese (Università del Salento, Italy)
Angelo Coluccia (Università del Salento, Italy)
Giuseppe Ricci (Università del Salento, Italy)

Back to summary

WA3: Optimization
(Rococo Room)

WA3-01: Robust Semi-Variance Downside Risk Portfolio Problems: A Convex Optimization Approach
Maobiao Yang (Guangdong University of Technology, P.R. China)
Yongwei Huang (Guangdong University of Technology, P.R. China)
WA3-02: Tight MMSE bounds for the AGN channel under KL divergence constraints on the input distribution
Michael Fauß (Technische Universität Darmstadt, Germany)
Alex Dytso (Princeton University, USA)
Abdelhak M Zoubir (Darmstadt University of Technology, Germany)
H. Vincent Poor (Princeton University, USA)
WA3-03: Global Optimisation for Time of Arrival-Based Localisation
Michael Pauley (The University of Melbourne, Australia)
Jonathan H. Manton (School of Engineering, The University of Melbourne, Australia)
WA3-04: Stochastic FISTA algorithms: so fast?
Gersende Fort (CNRS, France)
Laurent Risser (CNRS, France)
Yves Atchadé (University of Michigan, France)
Eric Moulines (Ecole Polytechnique, France)
WA3-05: Optimal Portfolio Design for Statistical Arbitrage in Finance
Ziping Zhao (The Hong Kong University of Science and Technology, Hong Kong)
Rui Zhou (The Hong Kong University of Science and Technology, Hong Kong)
Zhongju Wang (Hong Kong Applied Science and Technology Research Institute (ASTRI), Hong Kong)
Daniel P Palomar (Hong Kong University of Science and Technology, Hong Kong)
WA3-06: A Riemannian Approach for Graph-Based Clustering by Doubly Stochastic Matrices
Ahmed Douik (California Institute of Technology, USA)
Babak Hassibi (California Institute of Technology, USA)
WA3-07: Sparse reduced rank regression with nonconvex regularization
Ziping Zhao (The Hong Kong University of Science and Technology, Hong Kong)
Daniel P Palomar (Hong Kong University of Science and Technology, Hong Kong)
WA3-08: Sparse Power Factorization with refined peakiness conditions
Dominik Stöger (Technical University of Munich, Germany)
Jakob Geppert (Georg-August-Universität Göttingen, Germany)
Felix Krahmer (Technische Universität München, Germany)
WA3-09: The performance of box-relaxation decoding in massive MIMO with low-resolution ADCs
Christos Thrampoulidis (MIT, USA)
Weiyu Xu (University of Iowa, USA)
WA3-10: Optimal Privacy-enhancing and Cost-efficient Energy Management Strategies for Smart Grid Consumers
Yang You (KTH Royal Institute of Technology, Sweden)
Zuxing Li (CentraleSupelec & L2S, France)
Tobias J. Oechtering (KTH Royal Institute of Technology, Sweden)

Back to summary

WA4 (SS): Online algorithms for static and dynamic robust PCA and compressive sensing
(Rococo Room)

Special Session Organizer:
Namrata Vaswani (Iowa State University, USA)
WA4 (SS)-01: A Two-Stage Approach to Robust Tensor Decomposition
Seyyid Emre Sofuoglu (Michigan State University, USA)
Selin Aviyente (Electrical and Computer Engineering, Michigan State University, MI, USA)
WA4 (SS)-02: Robust PCA and Robust Subspace Tracking: A Comparative Evaluation
Sajid Javed (University of Warwick, United Kingdom (Great Britain))
Praneeth Narayanamurthy (Iowa State University, USA)
Thierry Bouwmans (University of La Rochelle, France)
Namrata Vaswani (Iowa State University, USA)
WA4 (SS)-03: Online Estimation of Coherent Subspaces with Adaptive Sampling
Greg Ongie (University of Michigan, USA)
David Hong (University of Michigan, USA)
Dejiao Zhang (University of Michigan, USA)
Laura Balzano (University of Michigan, USA)
WA4 (SS)-04: Compressive online decomposition of dynamic signals via n-l1 minimization with clustered priors
Huynh Van Luong (University of Erlangen-Nuremberg, Germany)
Nikos Deligiannis (Vrije Universiteit Brussel, Belgium)
Soren Forchhammer (Technical University of Denmark, Denmark)
Andre Kaup (University of Erlangen-Nuremberg, Germany)
WA4 (SS)-05: Online Power Iteration for Subspace Estimation Under Incomplete Observations: Limiting Dynamics and Phase Transitions
Hong Hu (Harvard University, USA)
Yue M. Lu (Harvard University, USA)
WA4 (SS)-06: Data clustering using matrix factorization techniques for wireless propagation map reconstruction
Junting Chen (University of Southern California, USA)
Urbashi Mitra (University of Southern California, USA)

Back to summary