Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 47
Encontrada(s) 1 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

On LDPC Code Ensembles with Generalized Constraints

  • Liu, Yanfang
  • Martínez Olmos, Pablo
  • Koch, Tobias Mirco
Proceeding of: 2017 IEEE International Symposium on Information Theory, Aachen, Germany, 25-30 June, 2017, In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a class of generalized low-density parity-check (GLDPC) codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. The rate of the GLDPC ensemble is bounded using classical results on linear block codes, namely Hamming bound and Varshamov bound. We also study the impact of the decoding method used at GC nodes. To incorporate both bounded-distance (BD) and Maximum Likelihood (ML) decoding at GC nodes into our analysis without having to resort on multi-edge type of degree distributions (DDs), we propose the probabilistic peeling decoder (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a success probability that depends on the GC block code and its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as density evolution (DE) or the differential equation method. Furthermore, for a class of GLDPC ensembles, we demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code. We illustrate our analysis for GLDPC code ensembles using (2, 6) and (2,15) base DDs. In all cases, we show that a large fraction of GC nodes is required to reduce the original gap to capacity., This work has been funded in part by the Spanish Ministerio de Economía y Competitividad and the Agencia Española de Investigación under Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU) and by the Comunidad de Madrid in Spain under Grant S2103/ICE-2845. T. Koch has further received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, and from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013-41718-R and RYC-2014-16332. Pablo M. Olmos has further received funding from the Spanish Ministerio de Economía y Competitividad under Grant IJCI-2014-19150.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Medical data wrangling with sequential variational autoencoders

  • Barrejón Moreno, Daniel
  • Martínez Olmos, Pablo
  • Artés Rodríguez, Antonio
Medical data sets are usually corrupted by noise and missing data. These missing patterns are commonly assumed to be completely random, but in medical scenarios, the reality is that these patterns occur in bursts due to sensors that are off for some time or data collected in a misaligned uneven fashion, among other causes. This paper proposes to model medical data records with heterogeneous data types and bursty missing data using sequential variational autoencoders (VAEs). In particular, we propose a new methodology, the Shi-VAE, which extends the capabilities of VAEs to sequential streams of data with missing observations. We compare our model against state-of-theart solutions in an intensive care unit database (ICU) and a dataset of passive human monitoring. Furthermore, we find that standard error metrics such as RMSE are not conclusive enough to assess temporal models and include in our analysis the cross-correlation between the ground truth nd the imputed signal. We show that Shi-VAE achieves the best performance in terms of using both metrics, with lower computational complexity than the GP-VAE model, which is the state-of-the-art method for medical records., This work was supported in part by Spanish Government MCI under Grants TEC2017-92552-EXP and RTI2018-099655-B-100, in part by Comunidad de Madrid under Grants IND2017/TIC-7618, IND2018/TIC-9649, IND2020/TIC-17372, and Y2018/TCS-4705, in part by BBVA Foundation under the Deep-DARWiN Project, and in part by the European Union (FEDER) and the European Research Council (ERC) through the European Union's Horizon 2020 research and innovation program under Grant 714161.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Bursty Wireless Networks of Bounded Capacity

  • Villacrés Estrada, Grace Silvana
  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
Proceeding of: 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020, The channel capacity of wireless networks Is often studied under the assumption that the communicating nodes have perfect channel-state information and that interference is always present. In this paper, we study the channel capacity of a wireless network without these assumptions, i.e., a bursty noncoherent wireless network where the users are grouped in cells and the base-station features several receive antennas. We demonstrate that the channel capacity is bounded in the signal-to-noise ratio (SNR) when the number of receive antennas is finite and the probability of presence of interference is strictly positive., This work has been supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant No. 714161), and by the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

The Error Probability of Generalized Perfect Codes via the Meta-Converse

  • Vázquez Vilar, Gonzalo
  • Guillén I Fàbregas, Albert
  • Verdú, Sergio
We introduce a definition of perfect and quasi-perfect codes for discrete symmetric channels based on the packing and covering properties of generalized spheres whose shape is tilted using an auxiliary probability measure. This notion generalizes previous definitions of perfect and quasi-perfect codes and encompasses maximum distance separable codes. The error probability of these codes, whenever they exist, is shown to coincide with the estimate provided by the meta-converse lower bound. We illustrate how the proposed definition naturally extends to cover almost-lossless source-channel coding and lossy compression., This work was supported in part by the European Research Council (ERC) under Grant 714161 and Grant 725411, in part by the Spanish Ministry of Economy and Corupetitiveness under Grant TEC2016-78434-C3 and Grant DCI-2015-27020, in part by the National Science Foundation under Grant CCF-1513915, in part by the Center for Science of Information, and in part by tbe NSF Science and Technology Center under Grant CCF-0939370.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Scaling laws for many-access channels and unsourced random access

  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceeding of: 55th Asilomar Conference on Signals, Systems, and Computers, October 31 - November 3, 2021 Pacific Grove, California, USA., In the emerging Internet of Things, a massive number of devices may connect to one common receiver. Consequently, models that study this setting are variants of the classical multiple-access channel where the number of users grows with the blocklength. Roughly, these models can be classified into three groups based on two criteria: the notion of probability of error and whether users use the same codebook. The first group follows the classical notion of probability of error and assumes that users use different codebooks. In the second group, users use different codebooks, but a new notion of probability of error called per-user probability of error is considered. The third group considers the per-user probability of error and that users are restricted to use the same codebook. This group is also known as unsourced random access. For the first and second groups of models, scaling laws that describe the capacity per unit-energy as a function of the order of growth of users were characterized by Ravi and Koch (arxiv.org/abs/2012.10350). In this paper, we first review these results. We then present scaling laws for the third group of models, i.e., unsourced random access., J. Ravi and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Ciencia e Innovación under Grant PID2020-116683GB-C21 / AEI / 10.13039/501100011033.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Multi-source change-point detection over local observation models

  • Romero Medrano, Lorena
  • Artés Rodríguez, Antonio
In this work, we address the problem of change-point detection (CPD) on high-dimensional, multi-source, and heterogeneous sequential data with missing values. We present a new CPD methodology based on local latent variable models and adaptive factorizations that enhances the fusion of multi-source observations with different statistical data-type and face the problem of high dimensionality. Our motivation comes from behavioral change detection in healthcare measured by smartphone monitored data and Electronic Health Records. Due to the high dimension of the observations and the differences in the relevance of each source information, other works fail in obtaining reliable estimates of the change-points location. This leads to methods that are not sensitive enough when dealing with interspersed changes of different intensity within the same sequence or partial missing components. Through the definition of local observation models (LOMs), we transfer the local CP information to homogeneous latent spaces and propose several factorizations that weight the contribution of each source to the global CPD. With the presented methods we demonstrate a reduction in both the detection delay and the number of not-detected CPs, together with robustness against the presence of missing values on a synthetic dataset. We illustrate its application on real-world data from a smartphone-based monitored study and add explainability on the degree of each source contributing to the detection., This work has been partly supported by Spanish government (AEI/MCI) under grants RTI2018-099655-B-100, PID2021-123182OB-I00, PID2021-125159NB-I00, and TED2021-131823B-I00, by Comunidad de Madrid under grant IND2018/TIC-9649, IND2022/TIC- 23550, by the European Union (FEDER) and the European Research Council (ERC) through the European Union's Horizon 2020 research and innovation program under Grant 714161, and by Comunidad de Madrid and FEDER through IntCARE-CM.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Handling incomplete heterogeneous data using VAEs

  • Nazabal Renteria, Alfredo
  • Martínez Olmos, Pablo
  • Ghahramani, Zoubin
  • Valera Martínez, María Isabel
Variational autoencoders (VAEs), as well as other generative models, have been shown to be efficient and accurate for capturing the latent structure of vast amounts of complex high-dimensional data. However, existing VAEs can still not directly handle data that are heterogenous (mixed continuous and discrete) or incomplete (with missing data at random), which is indeed common in real-world applications. In this paper, we propose a general framework to design VAEs suitable for fitting incomplete heterogenous data. The proposed HI-VAE includes likelihood models for real-valued, positive real valued, interval, categorical, ordinal and count data, and allows accurate estimation (and potentially imputation) of missing data. Furthermore, HI-VAE presents competitive predictive performance in supervised tasks, outperforming supervised models when trained on incomplete data., Alfredo Nazabal would like to acknowledge the funding provided by the UK Government’s Defence & Security Programme in support of the Alan Turing Institute, EPSRC Grant EP/N510129/1. The work of Pablo M. Olmos is sup-ported by Spanish government MCI under grant RTI2018-099655-B-100, by Comunidad de Madrid under grants IND2017/TIC-7618, IND2018/TIC-9649, and Y2018/TCS-4705, by BBVA Foundation under the Deep-DARWiNproject, and by the European Union (FEDER and the European Research Council (ERC) through the European Unions Horizon 2020 research and innovation program under Grant 714161). Zoubin Ghahramani acknowledges support from the Alan Turing Institute (EPSRC Grant EP/N510129/1) and EPSRC Grant EP/N014162/1, and donations from Google and Microsoft Research. We also gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan X Pascal GPU used for this research.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

A High-SNR Normal Approximation for MIMO Rayleigh Block-Fading Channels

  • Qi, Chao
  • Koch, Tobias Mirco
Proceeding of: 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020, This paper concerns the maximum coding rate at which a code of given blocklength can be transmitted with a given block-error probability over a non-coherent Rayleigh block-fading channel with multiple transmit and receive antennas (MIMO). In particular, a high-SNR normal approximation of the maximum coding rate is presented, which is proved to become accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals L tend to infinity., C. Qi and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU)
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

On Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength

  • Lancho Serrano, Alejandro
  • Koch, Tobias Mirco
  • Durisi, Giuseppe
This article concerns the maximum coding rate at which data can be transmitted over a noncoherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. A high-SNR normal approximation of the maximum coding rate is presented that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals $L$ over which we code tend to infinity. Numerical analyses suggest that the approximation is accurate at SNR values above 15dB and when the number of coherence intervals is 10 or more., The work of A. Lancho and T. Koch was supported in part by the Spanish Ministerio de Economia y Competitividad under Grant TEC2013-41718-R and Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU), in part by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under Grant 714161, and in part by the Comunidad de Madrid under Grant S2103/ICE-2845. The work of A. Lancho further was supported by an FPU fellowship from the Spanish Ministerio de Educación, Cultura y Deporte under Grant FPU14/01274. The work of T. Koch further was supported in part by the Spanish Ministerio de Economía y Competitividad under Grant RYC-2014-16332 and in part by the 7th European Union Framework Programme under Grant 333680. The work of G. Durisi was supported by the Swedish Research Council under Grant 2012-4571 and Grant 2016-03293.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Second-order asymptotics of Hoeffding-like hypothesis tests

  • Kallumadatil Velluva, Harsha
  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceedings of: 2022 IEEE Information Theory Workshop (ITW), 01-09 November 2022, Mumbai, India., We consider a binary statistical hypothesis testing problem, where n independent and identically distributed random variables Z^n are either distributed according to the none hypothesis P or the alternate hypothesis Q, and only P is known. For this problem, a well-known test is the Hoeffding test, which accepts P if the Kullback-Leibler (KL) divergence between the empirical distribution of Z^n and P is below some threshold. In this paper, we consider Hoeffding-like tests, where the KL divergence is replaced by other divergences, and characterize, for a large class of divergences, the first and second-order terms of the type-II error for a fixed type-I error. Since the considered class includes the KL divergence, we obtain the second-order term of the Hoeffding test as a special case., K. V. Harsha, J. Ravi, and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Ciencia e Innovación under Grant PID2020-116683GB- C21 / AEI / 10.13039/501100011033.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Error probability bounds for Gaussian channels under maximal and average power constraints

  • Vázquez Vilar, Gonzalo
This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. New lower bounds are presented for the minimum error probability of codes satisfying maximal and average power constraints. These bounds are tighter than previous results in the finite blocklength regime, and yield a better understanding on the structure of good codes under an average power limitation. Evaluation of these bounds for short and moderate blocklengths is also discussed., This work was supported in part by the European Research Council (ERC) under Grant 714161, and in part by the Spanish Ministry of Economy and Competitiveness under Grant TEC2016-78434-C3 (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

The Role of Interaction and Common Randomness in Two-User Secure Computation

  • Kurri, Gowtham R.
  • Ravikumaran Nair, Jithin
  • Prabhakaran, Vinod M.
This paper has been presented at : 2018 IEEE International Symposium On Information Theory (ISIT), We consider interactive computation of randomized functions between two users with the following privacy requirement: the interactive communication should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings., Gowtham R. Kurri was supported by a travel fellowship from the Sarojini Damodaran Foundation. This work was done while Jithin Ravi was at Tata Institute of Fundamental Research. He has received funding from ERC grant 714161.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

On the error probability of optimal codes in Gaussian channels under maximal power constraint

  • Vázquez Vilar, Gonzalo
Proceedings of: 2019 IEEE International Symposium on Information Theory (ISIT), For an additive white Gaussian noise channel, we prove that Th. 41 in [Polyanskiy, Poor, Verdά2010] is a lower bound to the error probability of any channel code satisfying the maximal power constraint. In contrast, the (tighter) lower bound to the error probability in Eq. (20) in [Shannon 1959] only holds under equal power constraint., This work has been funded in part by the European Research Council (ERC) under grant 714161, and by the Spanish Ministry of Economy and Competitiveness under grants IJCI-2015-27020 and TEC2016-78434-C3 (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC

  • Liu, Yanfang
  • Martínez Olmos, Pablo
  • Koch, Tobias Mirco
In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a class of generalized low-density parity-check (GLDPC) codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. The rate of the GLDPC ensemble is bounded using classical results on linear block codes, namely, Hamming bound and Varshamov bound. We also study the impact of the decoding method used at GC nodes. To incorporate both bounded-distance (BD) and maximum likelihood (ML) decoding at GC nodes into our analysis without resorting on multi-edge type of degree distributions (DDs), we propose the probabilistic peeling decoding (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a successful decoding probability that depends on both the GC block code and its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as density evolution (DE) or the differential equation method. Furthermore, for a class of GLDPC ensembles, we demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code under ML decoding at GC nodes. We illustrate our analysis for GLDPC code ensembles with regular and irregular DDs. In all cases, we show that a large fraction of GC nodes is required to reduce the original gap to capacity, but the optimal fraction is strictly smaller than one. We then consider techniques to further reduce the gap to capacity by means of random puncturing, and the inclusion of a certain fraction of generalized variable nodes in the graph., This work was supported in part by the Spanish Ministerio de Economía y Competitividad and the Agencia Española de Investigación under Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU) and in part by the Comunidad de Madrid in Spain under Grant S2103/ICE-2845, Grant IND2017/TIC-7618, Grant IND2018/TIC-9649, and Grant Y2018/TCS-4705. P. M. Olmos was further supported by the Spanish Ministerio de Economía y Competitividad under Grant IJCI-2014-19150. T. Koch was further supported by the European Research Council (ERC) through the European Union’s Horizon 2020 research and innovation programme under Grant 714161, by the 7th European Union Framework Programme under Grant 333680, and by the Spanish Ministerio de Economía y Competitividad under Grant TEC2013- 41718-R and Grant RYC-2014-16332.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Robust signaling for bursty interference

  • Villacrés Estrada, Grace Silvana
  • Koch, Tobias Mirco
  • Sezgin, Aydin
  • Vázquez Vilar, Gonzalo
This paper studies a bursty interference channel, where the presence/absence of interference is modeled by a block-i.i.d. Bernoulli process that stays constant for a duration of T symbols (referred to as coherence block) and then changes independently to a new state. We consider both a quasi-static setup, where the interference state remains constant during the whole transmission of the codeword, and an ergodic setup, where a codeword spans several coherence blocks. For the quasi-static setup, we study the largest rate of a coding strategy that provides reliable communication at a basic rate and allows an increased (opportunistic) rate when there is no interference. For the ergodic setup, we study the largest achievable rate. We study how non-causal knowledge of the interference state, referred to as channel-state information (CSI), affects the achievable rates. We derive converse and achievability bounds for (i) local CSI at the receiver side only; (ii) local CSI at the transmitter and receiver side; and (iii) global CSI at all nodes. Our bounds allow us to identify when interference burstiness is beneficial and in which scenarios global CSI outperforms local CSI. The joint treatment of the quasi-static and ergodic setup further allows for a thorough comparison of these two setups., This work has been funded in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013-41718-R, RYC-2014-16332, IJCI-2015-27020, TEC2016-78434-C3-3-R (AEI/FEDER, EU), from the Comunidad de Madrid under Grant S2103/ICE-2845, and from ‘Ayudas para la Movilidad del Programa Propio de Investigación UC3M 2016
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Capacity per Unit-Energy of Gaussian Random Many-Access Channels

  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceeding of: 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020, We consider a Gaussian multiple-access channel with random user activity where the total number of userslₙ and the average number of active users kₙ may be unbounded. For this channel, we characterize the maximum number of bits that can be transmitted reliably per unit-energy in terms of lₙ and kₙ . We show that if kₙ log lₙ is sublinear in n, then each user can achieve the single-user capacity per unit-energy. Conversely, if kₙ log lₙ is superlinear in n, then the capacity per unit-energy is zero. We further demonstrate that orthogonal-access schemes, which are optimal when all users are active with probability one, can be strictly suboptimal., J. Ravi and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Finite-Blocklength Approximations for Noncoherent Rayleigh Block-Fading Channels

  • Lancho Serrano, Alejandro
  • Östman, Johan
  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
Proceeding of: 53rd Asilomar Conference on Signals, Systems, and Computers (ACSSC 2019), 3-6 Nov. 2019, Pacific Grove, CA, USA, Several emerging wireless communication services and applications have stringent latency requirements, necessitating the transmission of short packets. To obtain performance benchmarks for short-packet wireless communications, it is crucial to study the maximum coding rate as a function of the blocklength, commonly called finite-blocklength analysis. A finiteblocklength analysis can be performed via nonasymptotic bounds or via refined asymptotic approximations. This paper reviews finite-blocklength approximations for the noncoherent Rayleigh block-fading channel. These approximations have negligible computational cost compared to the nonasymptotic bounds and are shown to be accurate for error probabilities as small as 10-8 [super index] and SNRs down to 0 dB., A. Lancho has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161) and from the Swedish Research Council under grant 2016-03293. J. O¨ stman has been supported by the Swedish Research Council under grants 2014-6066 and 2016-03293. T. Koch has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161) and from the Spanish Ministerio de Economía y Competitividad under grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU). G. Vazquez-Vilar has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161) and from the Spanish Ministerio de Economía y Competitividad under grant TEC2016- 78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Automatic antibiotic resistance prediction in Klebsiella pneumoniae based on MALDI-TOF mass spectra

  • Guerrero López, Alejandro Jorge
  • Sevilla Salcedo, Carlos
  • Candela, Ana
  • Hernández García, Marta
  • Cercenado, Emilia
  • Martínez Olmos, Pablo
  • Cantón, Rafael
  • Muñoz, Patricia
  • Gómez Verdejo, Vanessa
  • Campo, Rosa del
  • Rodríguez Sánchez, Belén
Matrix-Assisted Laser Desorption Ionization Time-Of-Flight (MALDI-TOF) Mass Spectrometry (MS) is a ref-erence method for microbial identification and it can be used to predict Antibiotic Resistance (AR) when combined with artificial intelligence methods. However, current solutions need time-costly preprocessing steps, are difficult to reproduce due to hyperparameter tuning, are hardly interpretable, and do not pay attention to epidemiological differences inherent to data coming from different centres, which can be critical. We propose using a multi-view heterogeneous Bayesian model (KSSHIBA) for the prediction of AR using MALDI-TOF MS data together with their epidemiological differences. KSSHIBA is the first model that removes the ad-hoc preprocessing steps that work with raw MALDI-TOF data. In addition, due to its Bayesian probabilistic nature, it does not require hyperparameter tuning, provides interpretable results, and allows exploiting local epidemiological differences between data sources. To test the proposal, we used data from 402 Klebsiella pneumoniae isolates coming from two different domains and 20 different hospitals located in Spain and Portugal. KSSHIBA outperforms current state-of-the-art approaches in antibiotic susceptibility prediction, obtaining a 0.78 AUC score in Wild Type classification and a 0.90 AUC score in Extended-Spectrum Beta-Lactamases (ESBL)+Carbapenemases (CP)-producers. The proposal consistently removes the need for ad-hoc preprocessing by working with raw MALDI-TOF data, which, in turn, reduces the time needed to obtain the results of the resistance mechanism in microbiological laboratories. The proposed model implementation as well as both data domains are publicly available., This work was supported by Spanish MINECO (Agencia Estatal de Investigacion) [RTI2018-099655-B-10, PID2021-123182OB-I00 to P.O.]; this paper is also funded by MCIN/AEI/10.13039/5011000110, Spain [PID2020-115363RB-I00 to A.G., C.S., and V.G]; and Comunidad de Madrid, Spain [IND2022/TIC-23550, IntCARE-CM to P. O.]; and the European Union (European Regional Development Fund and the European Research Council) through the European Union's Horizon 2020 Research and Innovation Program [714161 to P. O.]; and Intramural Program of the Gregorio Maranon Health Research Institute to A. G.; and Health Research Fund (Instituto de Salud Carlos III. Plan Nacional de I+D+I 2013-2016) of the Carlos III Health Institute (ISCIII, Madrid, Spain) [PI15/01073, PI18/00997 to A. C. and B. R.] partially financed by the European Regional Development Fund (FEDER) 'A way of making Europe'; and Health Research Fund Miguel Servet contract [CPII19/00002 to B. R.]
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

On the Information Dimension of Stochastic Processes

  • Geiger, Bernhard C.
  • Koch, Tobias Mirco
In 1959, Rényi proposed the information dimension and the d-dimensional entropy to measure the information content of general random variables. This paper proposes a generalization of information dimension to stochastic processes by defining the information dimension rate as the entropy rate of the uniformly quantized stochastic process divided by minus the logarithm of the quantizer step size 1/m in the limit as m to infty. It is demonstrated that the information dimension rate coincides with the rate-distortion dimension, defined as twice the rate-distortion function R(D) of the stochastic process divided by -log (D) in the limit as D downarrow 0 . It is further shown that among all multivariate stationary processes with a given (matrix-valued) spectral distribution function (SDF), the Gaussian process has the largest information dimension rate and the information dimension rate of multivariate stationary Gaussian processes is given by the average rank of the derivative of the SDF. The presented results reveal that the fundamental limits of almost zero-distortion recovery via compressible signal pursuit and almost lossless analog compression are different in general., The work of Bernhard C. Geiger has partly been funded by the Erwin Schrödinger Fellowship J 3765 of the Austrian Science Fund and by the German Ministry of Education and Research in the framework of an Alexander von Humboldt Professorship. The Know-Center is funded within the Austrian COMET Program - Competence Centers for Excellent Technologies - under the auspices of the Austrian Federal Ministry of Transport, Innovation and Technology, the Austrian Federal Ministry of Digital and Economic Affairs, and by the State of Styria. COMET is managed by the Austrian Research Promotion Agency FFG. The work of Tobias Koch has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Ministerio de EconomÍa y Competitividad of Spain under Grants TEC2013-41718-R, RYC-2014-16332, and TEC2016-78434-C3-3-R (AEI/FEDER, EU), and from the Comunidad de Madrid under Grant S2103/ICE-2845.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Private Index Coding

  • Narayanan, Varun
  • Ravikumaran Nair, Jithin
  • Mishra, Vivek K.
  • Dey, Bikash K.
  • Karamchandani, Nikhil
  • Prabhkaran, Vinod M.
This paper has been presented at: 2018 IEEE International Symposium On Information Theory (ISIT), We study the problem of index coding under the privacy requirement that receivers do not learn anything more than the messages they already have as side information and the message they want from the server. To achieve this private index coding, we consider the use of secret keys that are shared among various subsets of users and the server. We characterize key access structures that allow private index coding. For up to three receivers, we characterize the rate region of transmission and key rates and show that scalar coding is optimal; we also show that scalar linear codes are sub-optimal for four receivers. Furthermore, when no keys are available, we consider a weaker notion of privacy analogous to weak security. Finally, for a different setting in which the server is allowed to send messages exclusively to a subset of users, we study the number of transmissions required to achieve error-free decoding and privacy., Prabhakaran and N. Karamchandani acknowledge initial discussions with Parathasarathi Panda and Vaishakh Ravi. V. Narayanan was supported by a travel fellowship from the Sarojini Damodaran Foundation. This work was done while Jithin Ravi was at Tata Institute of Fundamental Research and IIT Bombay. He has received funding from ERC grant 714161.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Sparse semi-supervised heterogeneous interbattery bayesian analysis

  • Sevilla Salcedo, Carlos
  • Gómez Verdejo, Vanessa
  • Martínez Olmos, Pablo
The Bayesian approach to feature extraction, known as factor analysis (FA), has been widely studied in machine learning to obtain a latent representation of the data. An adequate selection of the probabilities and priors of these bayesian models allows the model to better adapt to the data nature (i.e. heterogeneity, sparsity), obtaining a more representative latent space. The objective of this article is to propose a general FA framework capable of modelling any problem. To do so, we start from the Bayesian Inter-Battery Factor Analysis (BIBFA) model, enhancing it with new functionalities to be able to work with heterogeneous data, to include feature selection, and to handle missing values as well as semi-supervised problems. The performance of the proposed model, Sparse Semi-supervised Heterogeneous Interbattery Bayesian Analysis (SSHIBA), has been tested on different scenarios to evaluate each one of its novelties, showing not only a great versatility and an interpretability gain, but also outperforming most of the state-of-the-art algorithms., The work of Pablo M. Olmos was partly supported by the Spanish government (Ministerio de Ciencia e Innovación) under grants TEC2017-92552-EXP and RTI2018-099655-B-100; the Comunidad de Madrid under grants IND2017/TIC-7618, IND2018/TIC-9649, IND2020/TIC-17372, and Y2018/TCS-4705; the BBVA Foundation under the Domain Alignment and Data Wrangling with Deep Generative Models (Deep-DARWiN) project; and the European Union (European Regional Development Fund and the European Research Council) through the European Union's Horizon 2020 Research and Innovation Program under grant 714161. C. Sevilla-Salcedo and V. Gómez-Verdejo's work has been partly funded by the Spanish MINECO grants TEC2017-83838-R and PID2020-115363RB-I00.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Design of Discrete Constellations for Peak-Power-Limited complex Gaussian Channels

  • Huleihel, Wasim
  • Goldfeld, Ziv
  • Koch, Tobias Mirco
  • Madiman, Mokshay
  • Médard, Muriel
  • Huleihel, Wasim
Proceeding of: IEEE International Symposium on Information Theory (ISIT 2018), The capacity-achieving input distribution of the complex Gaussian channel with both average- and peak-power constraint is known to have a discrete amplitude and a continuous, uniformly-distributed, phase. Practical considerations, however, render the continuous phase inapplicable. This work studies the backoff from capacity induced by discretizing the phase of the input signal. A sufficient condition on the total number of quantization points that guarantees an arbitrarily small backoff is derived, and constellations that attain this guaranteed performance are proposed., The work of W. Huleihel was supported by the MIT - Technion Postdoctoral Fellowship. The work of Z. Goldfeld was supported by the Rothchild postdoctoral fellowship. The work of T. Koch has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the Spanish Ministerio de Economíıa y Competitividad under Grants TEC2013-41718-R, RYC-2014-16332, and TEC2016-78434-C3-3-R (AEI/FEDER, EU), and from the Comunidad de Madrid under Grant S2103/ICE-2845. The work of M. Mokshay was supported by NSF grant #1409504.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Predicting emotional states using behavioral markers derived from passively sensed data: Data-driven machine learning approach

  • Sükei, Emese
  • Norbury, Agnes
  • Perez-Rodriguez, M. Mercedes
  • Martínez Olmos, Pablo
  • Artés Rodríguez, Antonio
Background: Mental health disorders affect multiple aspects of patients’ lives, including mood, cognition, and behavior. eHealth and mobile health (mHealth) technologies enable rich sets of information to be collected noninvasively, representing a promising opportunity to construct behavioral markers of mental health. Combining such data with self-reported information about psychological symptoms may provide a more comprehensive and contextualized view of a patient’s mental state than questionnaire data alone. However, mobile sensed data are usually noisy and incomplete, with significant amounts of missing observations. Therefore, recognizing the clinical potential of mHealth tools depends critically on developing methods to cope with such data issues. Objective: This study aims to present a machine learning–based approach for emotional state prediction that uses passively collected data from mobile phones and wearable devices and self-reported emotions. The proposed methods must cope with high-dimensional and heterogeneous time-series data with a large percentage of missing observations. Methods: Passively sensed behavior and self-reported emotional state data from a cohort of 943 individuals (outpatients recruited from community clinics) were available for analysis. All patients had at least 30 days’ worth of naturally occurring behavior observations, including information about physical activity, geolocation, sleep, and smartphone app use. These regularly sampled but frequently missing and heterogeneous time series were analyzed with the following probabilistic latent variable models for data averaging and feature extraction: mixture model (MM) and hidden Markov model (HMM). The extracted features were then combined with a classifier to predict emotional state. A variety of classical machine learning methods and recurrent neural networks were compared. Finally, a personalized Bayesian model was proposed to improve performance by considering the individual differences in the data and applying a different classifier bias term for each patient. Results: Probabilistic generative models proved to be good preprocessing and feature extractor tools for data with large percentages of missing observations. Models that took into account the posterior probabilities of the MM and HMM latent states outperformed those that did not by more than 20%, suggesting that the underlying behavioral patterns identified were meaningful for individuals’ overall emotional state. The best performing generalized models achieved a 0.81 area under the curve of the receiver operating characteristic and 0.71 area under the precision-recall curve when predicting self-reported emotional valence from behavior in held-out test data. Moreover, the proposed personalized models demonstrated that accounting for individual differences through a simple hierarchical model can substantially improve emotional state prediction performance without relying on previous days’ data. Conclusions: These findings demonstrate the feasibility of designing machine learning models for predicting emotional states from mobile sensing data capable of dealing with heterogeneous data with large numbers of missing observations. Such models may represent valuable tools for clinicians to monitor patients’ mood states., This project has received funding from the European Union's Horizon 2020 Research and Innovation Program under the Marie Sklodowska-Curie grant agreement number 813533. This work was partly supported by the Spanish government (Ministerio de Ciencia e Innovación) under grants TEC2017-92552-EXP and RTI2018-099655-B-100; the Comunidad de Madrid under grants IND2017/TIC-7618, IND2018/TIC-9649, IND2020/TIC-17372, and Y2018/TCS-4705; the BBVA Foundation under the Domain Alignment and Data Wrangling with Deep Generative Models (Deep-DARWiN) project; and the European Union (European Regional Development Fund and the European Research Council) through the European Union's Horizon 2020 Research and Innovation Program under grant 714161. The authors thank Enrique Baca-Garcia for providing demographic and clinical data and assisting in interpreting and summarizing the data.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

On noncoherent multiple-antenna Rayleigh block-fading channels at finite blocklength

  • Qi, Chao
  • Koch, Tobias Mirco
This paper investigates the maximum coding rate at which data can be transmitted over a noncoherent, multiple-input, multiple-output (MIMO) Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. A high-SNR normal approximation is derived that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals over which we code tend to infinity. The obtained normal approximation complements the nonasymptotic bounds that have appeared in the literature, but whose evaluation is computationally demanding. It further lays the theoretical foundation for an analytical analysis of the fundamental tradeoff between diversity, multiplexing, and channel-estimation cost at finite blocklength and finite SNR., The work of Tobias Koch was supported in part by European Research Council (ERC) through European Union’s Horizon 2020 Research and Innovation Programme under Grant 714161; in part by Ministerio de Ciencia, Innovacion y Universidades, Spain, under Grant PID2024- ´ 159557OB-C21 (MICIU/AEI/10.13039/501100011033 and ERDF/UE), Grant PID2020-116683GB-C21 (AEI/10.13039/501100011033), Grant TEC2016- 78434-C3-3-R (AEI/FEDER, EU), and Grant RYC-2014-16332; and in part by the Comunidad de Madrid under Grant IDEA-CM (TEC-2024/COM-89).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Scaling Laws for Gaussian Random Many-Access Channels

  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
An earlier version of this paper was presented in part at the 2019 IEEE International Symposium on Information Theory [DOI: 10.1109/ISIT.2019.8849751], in part at the 2020 International Zurich Seminar on Information and Communication [DOI: 10.3929/ethz-b-000403243], and in part at the 2020 IEEE International Symposium on Information Theory [DOI: 10.1109/ISIT44484.2020.9174091]., This paper considers a Gaussian multiple-access channel with random user activity where the total number of users ℓn and the average number of active users kn may grow with the blocklength n . For this channel, it studies the maximum number of bits that can be transmitted reliably per unit-energy as a function of ℓn and kn . When all users are active with probability one, i.e., ℓn=kn , it is demonstrated that, if kn is of an order strictly below n/logn , then each user can achieve the single-user capacity per unit-energy (loge)/N0 (where N0/2 is the noise power) by using an orthogonal-access scheme. In contrast, if kn is of an order strictly above n/logn , then the users cannot achieve any positive rate per unit-energy. Consequently, there is a sharp transition between orders of growth where interference-free communication is feasible and orders of growth where reliable communication at a positive rate per unit-energy is infeasible. It is further demonstrated that orthogonal-access schemes in combination with orthogonal codebooks, which achieve the capacity per unit-energy when the number of users is bounded, can be strictly suboptimal. When the user activity is random, i.e., when ℓn and kn are different, it is demonstrated that, if knlogℓn is sublinear in n , then each user can achieve the single-user capacity per unit-energy (loge)/N0 . Conversely, if knlogℓn is superlinear in n , then the users cannot achieve any positive rate per unit-energy. Consequently, there is again a sharp transition between orders of growth where interference-free communication is feasible and orders of growth where reliable communication at a positive rate is infeasible that depends on the asymptotic behaviors of both ℓn and kn . It is further demonstrated that orthogonal-ac..., The work of Jithin Ravi was supported by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Program under Grant 714161. The work of Tobias Koch was supported in part by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Program under Grant 714161; and in part by the Spanish Ministerio de Ciencia e Innovación under Grant RYC-2014-16332, Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU), and Grant PID2020-116683GB-C21 / AEI / 10.13039/501100011033.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Saddlepoint Approximations for Short-Packet Wireless Communications

  • Lancho Serrano, Alejandro
  • Östman, Johan
  • Durisi, Giuseppe
  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
This article was presented in part at the 2019 IEEE International Symposium on Information Theory, Paris, France, July 2019, and in part at the 2019 53rd Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, November 2019., In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained attention in the information theory literature. While these bounds are accurate for many scenarios of interest, they need to be evaluated numerically for most wireless channels of practical interest, and their evaluation is computationally demanding. This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels. These approximations can be calculated efficiently and are shown to be accurate for SNR values as small as 0 dB and blocklengths of 168 channel uses or more., The work of Alejandro Lancho was supported in part by European Research Council (ERC) through the European Union’s Horizon 2020 Research and Innovation Programme under Grant 714161, and in part by the Wallenberg AI, Autonomous Systems, and Software Program. The work of Johan Östman and Giuseppe Durisi was supported by the Swedish Research Council under Grant 2014-6066 and Grant 2016-03293. The work of Tobias Koch was supported in part by the European Research Council (ERC) through the European Union’s Horizon 2020 Research and Innovation Programme under Grant 714161 and in part by the Spanish Ministerio de Economía y Competitividad (AEI/FEDER, EU) under Grant RYC-2014-16332 and Grant TEC2016-78434-C3-3-R. The work of Gonzalo Vazquez-Vilar was supported in part by the European Research Council (ERC) through the European Union’s Horizon 2020 Research and Innovation Programme Under Grant 71416 and in part by the Spanish Ministerio de Economía y Competitividad (AEI/FEDER, EU) under Grant TEC2016-78434-C3-3-R.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Spatially coupled generalized LDPC codes: asymptotic analysis and finite length scaling

  • Mitchell, David G.M.
  • Martínez Olmos, Pablo
  • Lentmaier, Michael
  • Costello, Daniel J.
Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result in improved error floor performance, due to better minimum distance and trapping set properties, at a cost of some increased decoding complexity. In this paper, we study spatially coupled generalized low-density parity-check (SC-GLDPC) codes and present a comprehensive analysis of these codes, including: (1) an iterative decoding threshold analysis of SC-GLDPC code ensembles demonstrating capacity approaching thresholds via the threshold saturation effect; (2) an asymptotic analysis of the minimum distance and free distance properties of SC-GLDPC code ensembles, demonstrating that the ensembles are asymptotically good; and (3) an analysis of the finite-length scaling behavior of both GLDPC block codes and SC-GLDPC codes based on a peeling decoder (PD) operating on a binary erasure channel (BEC). Results are compared to GLDPC block codes, and the advantages and disadvantages of SC-GLDPC codes are discussed., This work was supported in part by the National Science Foundation under Grant ECCS-1710920, Grant OIA-1757207, and Grant HRD-1914635; in part by the European Research Council (ERC) through the European Union's Horizon 2020 research and innovation program under Grant 714161; and in part by the Spanish Ministry of Science, Innovation and University under Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Interactive secure function computation

  • Data, Deepesh
  • Kurri, Gowtham R.
  • Ravikumaran Nair, Jithin
  • Prabhakaran, Vinod M.
We consider interactive computation of randomized functions between two users with the following privacy requirement: the interaction should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings. We also study perfectly secure non-interactive computation when only one of the users computes a randomized function based on a single transmission from the other user. We characterize randomized functions which can be perfectly securely computed in this model and obtain tight bounds on the optimal message lengths in all the privacy settings., This work was supported by the Department of Atomic Energy, Government of India, under Project 12-R&D-TFR-5.01-0500. The work of Deepesh Data was supported by a Microsoft Research India Ph.D. Fellowship. The work of Gowtham R. Kurri was supported in part by a Travel Fellowship from the Sarojini Damodaran Foundation and in part by the Department of Science and Technology, Government of India, under an Indo-Israel Grant DST/INT/ISR/P-16/2017. The work of Jithin Ravi was supported by the European Research Council (ERC) through the European Union's Horizon 2020 Research and Innovation Programme under Grant 714161. The work of Vinod M. Prabhakaran was supported in part by a Ramanujan Fellowship from the Department of Science and Technology, Government of India, in part by the Information Technology Research Academy (ITRA), Government of India, under ITRA Mobile Grant ITRA/15(64)/Mobile/USEAADWN/01, and in part by the Department of Science and Technology, Government of India, under an Indo-Israel Grant DST/INT/ISR/P-16/2017.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Saddlepoint Approximation of the Error Probability of Binary Hypothesis Testing

  • Vázquez Vilar, Gonzalo
  • Guillén i Fàbregas, Albert
  • Koch, Tobias Mirco
  • Lancho Serrano, Alejandro
We propose a saddlepoint approximation of the error probability of a binary hypothesis test between two i.i.d. distributions. The approximation is accurate, simple to compute, and yields a unified analysis in different asymptotic regimes. The proposed formulation is used to efficiently compute the meta-converse lower bound for moderate block-lengths in several cases of interest., This work has been funded in part by the European Research Council (ERC) under grants 714161 and 725411, by the Spanish Ministry of Economy and Competitiveness under grants TEC2013-41718-R, RYC-201416332, IJCI-2015-27020 and TEC2016-78434-C3 (AEI/FEDER, EU), by the Madrid Autonomous Community under grant S2103/ICE-2845 and by the Spanish Ministry of Education, Culture and Sport under grant FPU14/01274.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

A high-SNR normal approximation for single-antenna Rayleigh block-fading channels

  • Lancho Serrano, Alejandro
  • Koch, Tobias Mirco
  • Durisi, Giuseppe
Proceeding of: 2017 IEEE International Symposium on Information Theory, Aachen, Germany, 25-30 June, 2017, This paper concerns the maximal achievable rate at which data can be transmitted over a non-coherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. In particular, a high-SNR normal approximation of the maximal achievable rate is presented that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals L over which we code tend to infinity. Numerical analyses suggest that the approximation is accurate already at SNR values of 15 dB., A. Lancho and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013-41718-R, RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU), from an FPU fellowship from the Spanish Ministerio de Educación, Cultura y Deporte under Grant FPU14/01274 and from the Comunidad de Madrid under Grant S2103/ICE-2845. G. Durisi has been supported by the Swedish Research Council under Grants 2012-4571 and 2016-03293.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Normal approximations for fading channels

  • Lancho Serrano, Alejandro
  • Koch, Tobias Mirco
  • Durisi, Giuseppe
Proceeding of: 52nd Annual Conference on Information Sciences and Systems (CISS 2018), Capacity and outage capacity characterize the maximum coding rate at which reliable communication is feasible when there are no constraints on the packet length. Evaluated for fading channels, they are important performance benchmarks for wireless communication systems. However, the latency of a communication system is proportional to the length of the packets it exchanges, so assuming that there are no constraints on the packet length may be overly optimistic for communication systems with stringent latency constraints. Recently, there has been great interest within the information theory community in characterizing the maximum coding rate for short packet lengths. Research on this topic is often concerned with asymptotic expansions of the coding rate with respect to the packet length, which then give rise to normal approximations. In this paper, we review existing normal approximations for single-antenna Rayleigh block-fading channels and compare them with the high-SNR normal approximation we presented at the 2017 IEEE International Symposium on Information Theory (Lancho, Koch, and Durisi, 2017). We further discuss how these normal approx- imations may help to assess the performance of communication protocols., A. Lancho and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013-41718-R, RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU), from an FPU fellowship from the Spanish Ministerio de Educación, Cultura y Deporte under Grant FPU14/01274, and from the Comunidad de Madrid under Grant S2103/ICE-2845. G. Durisi has been supported by the Swedish Research Council under Grant and 2016-03293.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Bayesian sparse factor analysis with kernelized observations

  • Sevilla Salcedo, Carlos
  • Guerrero López, Alejandro Jorge
  • Martínez Olmos, Pablo
  • Gómez Verdejo, Vanessa
Multi-view problems can benefit from latent representations since they find low-dimensional projections that fairly capture the correlations among the multiple views that characterise the data. On the other hand, high-dimensionality and non-linear issues are traditionally handled by kernel methods, inducing a (non)-linear function between the latent projection and the data itself. However, they usually come with exposition to overfitting. Here, we combine Bayesian factor analysis with what we refer to as kernelized observations, in which the proposed model focuses on reconstructing not the data itself, but its relationship with other data points measured by a kernel function. In turn, we extend previous Bayesian FA formulations to be able to model non-linear data relationships by means of kernelized data representations and, at the same time, include additional facilities to obtain compact kernel representations by means of an automatic selection of Bayesian Relevance Vectors (RVs), feature relevance analysis and, even, obtain an automatic multiple kernel learning approach. Besides, this is flexibly included into a modular framework where we can easily adapt the model capabilities to the data needs and, even, combine them with previous FA functionalities such as heterogeneous data representations or semi-supervised learning. Using several public databases, we demonstrate the potential of the approach (and its extensions) w.r.t. common multi-view learning models such as kernel canonical correlation analysis, heterogeneous incomplete - variational autoenconder or manifold relevance determination, where the proposed model shows its ability to outperform the baselines while indistinctly combining model extensions., This paper is part of the project PID2020-115363RB-I00 funded by MCIN/AEI/10.13039/501100011033. The work of Pablo M. Olmos is supported by the Spanish AEI (Ministerio de Ciencia e Innovación) under grants RTI2018-099655-B-10, PID2021-123182OB-I00, and TED2021-13182313-10, by Comunidad de Madrid under grants IND2018/TIC-9649 and Y2018/TCS-4705, and by the European Union (FEDER and the European Research Council (ERC) through the European Unions Horizon 2020 research and innovation program under Grant 714161). Sevilla-Salcedo and V. Gómez-Verdejo,-Verdejo's work was supported by Spanish MINECO (Agencia Estatal de Investigación) grant TEC2017-83838-R. The work of Alejandro Guerrero is supported by MINECO and EU FEDER.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Probabilistic Time of Arrival Localization

  • Pérez Cruz, Fernando
  • Martínez Olmos, Pablo
  • Minyi Zhang, Michael
  • Huang, Howard
In this letter, we take a new approach for time of arrival geo-localization. We show that the main sources of error in metropolitan areas are due to environmental imperfections that bias our solutions, and that we can rely on a probabilistic model to learn and compensate for them. The resulting localization error is validated using measurements from a live LTE cellular network to be less than 10 meters, representing an order-of-magnitude improvement., This work was supported in part by the Spanish Government under Grant TEC2016-78434-C3-3-R, in part by Comunidad de Madrid under Grants IND2017/TIC-7618, IND2018/TIC-9649, and Y2018/TCS-4705, and in part by the European Research Council (ERC) through the European Unions Horizon 2020 research and innovation programme under Grant 714161
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Second-order asymptotics of divergence tests

  • Kallumadatil Velluva, Harsha
  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceedings of: International Zurich Seminar on Information and Communication (IZS 2024), Zurich, Switzerland, March 6–8, 2024, Consider a binary statistical hypothesis testing problem, where n independent and identically distributed random variables Zn are either distributed according to the null hypothesis P or the alternate hypothesis Q, and only P is known. A well-known test that is suitable for this case is the so-called Hoeffding test, which accepts P if the Kullback-Leibler (KL) divergence between the empirical distribution of Zn and P is below some threshold. In this work, we characterize the first and second-order terms of the type-II error probability for a fixed type-I error probability for the Hoeffding test as well as for divergence tests, where the KL divergence is replaced by a general divergence. We demonstrate that, irrespective of the divergence, divergence tests achieve the first-order term of the Neyman-Pearson test, which is the optimal test when both P and Q are known. In contrast, the second-order term of divergence tests is strictly worse than that of the Neyman-Pearson test. We further demonstrate that divergence tests with an invariantdivergence achieve the same second-order term as the Hoeffding test, but divergence tests with a non-invariant divergence may outperform the Hoeffding test for some alternate hypotheses Q., Part of this work was done while K. V. Harsha and J. Ravi were with the Signal Theory and Communications Department, Universidad Carlos III de Madrid, Leganés, Spain. K. V. Harsha, J. Ravi, and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant No. 714161). J. Ravi has further received funding from the Science and Engineering Research Board (SERB) under Start-up Research Grant (SRG) and also from IIT Kharagpur under Faculty Start-up Research Grant (FSRG). T. Koch has further received funding from the Spanish Ministerio de Ciencia e Innovación under Grant PID2020-116683GBC21 / AEI / 10.13039/501100011033.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Detecting train driveshaft damages using accelerometer signals and Differential Convolutional Neural Networks

  • López Galdo, Antia
  • Guerrero López, Alejandro Jorge
  • Martínez Olmos, Pablo
  • Gómez García, María Jesús
Maintaining railway axles is crucial to prevent catastrophic failures and enormous human and economic costs. In recent years, there has been a growing interest in the railway industry to adopt condition monitoring techniques to enhance the safety and efficiency of the rail transport system, which maintenance is currently based on periodic inspections. In this context, this work presents a technique for real-time crack diagnosis on railway axles, based on advanced 2D-Convolutional Neural Network (CNN) architectures applied to time¿frequency representations of vibration signals. One of the critical novelties is introducing a differential CNN structure that captures the system's statistical properties, enabling generalisation between different mechanical sets and conditions. The proposed system has been trained with data corresponding to a unique wheelset assembly, showing that the model is able to diagnose cracks on the three different wheelset tested in operation under 32 different combinations of conditions, such as load, speed, sense of rotation and vibration direction. Four different crack levels have been introduced, representing the maximum one a 0.08% of the axle diameter, and the method proposed achieved Area Under the Curve (AUC) score of 0.85, significantly outperforming results obtained with other architectures proposed in the state-of-the-art, the score of the next below is 0.76. The results demonstrate the effectiveness and practicality of this approach to accurately classify the four crack levels tested within a condition monitoring system for non-stationary conditions, that would enable reliable real-time diagnosis, thus paving the way towards a more robust and efficient railway axle maintenance system., This work has been developed within the project Sistema de monitorizacion de estado para deteccion de fisuras en ejes ferroviarios (SMEPDFEF-CM-UC3M) , 2021 Call for grants to carry out interdisciplinary R & D projects for young doctors of the Carlos III University from Madrid. The work was also supported by MCIN AEI [grant numbers RTI2018-099655-B-100, PID2021-123182OB-I00 and TED2021-131372A-I00] ; by the Comunidad de Madrid [grant numbers IND2022/TIC-23550] ; by the European Union (FEDER and the European Research Council (ERC) ) through the European Unions Horizon 2020 research innovation program [grant number 714161] ; and by the IISGM [grant INTRAMURAL].
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

On the information dimension rate of stochastic processes

  • Geiger, Bernhard C.
  • Koch, Tobias Mirco
Proceeding of: 2017 IEEE International Symposium on Information Theory, Aachen, Germany, 25-30 June 2017, Jalali and Poor ("Universal compressed sensing," arXiv:1406.7807v3, Jan. 2016) have recently proposed a generalization of Rényi's information dimension to stationary stochastic processes by defining the information dimension of the stochastic process as the information dimension of k samples divided by k in the limit as k →∞ to. This paper proposes an alternative definition of information dimension as the entropy rate of the uniformly-quantized stochastic process divided by minus the logarithm of the quantizer step size 1/m in the limit as m →∞ ; to. It is demonstrated that both definitions are equivalent for stochastic processes that are ψ*-mixing, but that they may differ in general. In particular, it is shown that for Gaussian processes with essentially-bounded power spectral density (PSD), the proposed information dimension equals the Lebesgue measure of the PSD's support. This is in stark contrast to the information dimension proposed by Jalali and Poor, which is 1 if the process's PSD is positive on a set of positive Lebesgue measure, irrespective of its support size., The work of Bernhard C. Geiger has been funded by the Erwin Schrödinger Fellowship J 3765 of the Austrian Science Fund and by the German Ministry of Education and Research in the framework of an Alexander von Humboldt Professorship. The work of Tobias Koch has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013- 41718-R, RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU), and from the Comunidad de Madrid under Grant S2103/ICE-2845.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

The Error Probability of Generalized Perfect Codes

  • Vázquez Vilar, Gonzalo
  • Guillén I Fàbregas, Albert
  • Verdú, Sergio
This paper has been presented at : IEEE International Symposium on Information Theory 2018, We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This new definition generalizes previous definitions and encompasses maximum distance separable codes. The error probability of these codes, whenever they exist, is shown to attain the meta-converse lower bound., This work has been funded in part by the European Research Council (ERC) under grants 714161 and 725411, by the Spanish Ministry of Economy and Competitiveness under Grants TEC2016-78434-C3 and IJCI-2015-27020, by the National Science Foundation under Grant CCF-1513915 and by the Center for Science of Information, an NSF Science and Technology Center under Grant CCF-0939370.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Demand-Private Coded Caching and the Exact Trade-off for N=K=2

  • Kamath, Sneha
  • Ravikumaran Nair, Jithin
  • Dey, Bikash Kumar
Proceedings of: National Conference on Communications (NCC), 21-23 Feb. 2020, Kharagpur, India., The distributed coded caching problem has been studied extensively in the recent past. While the known coded caching schemes achieve an improved transmission rate, they violate the privacy of the users since in these schemes the demand of one user is revealed to others in the delivery phase. In this paper, we consider the coded caching problem under the constraint that the demands of the other users remain information theoretically secret from each user. We first show that the memory-rate pair (M, min{ N, K}(1- M / N)) is achievable under information theoretic demand privacy, while using broadcast transmissions. Using this, we show that perfectly demand-private coded caching rate is order optimal for all parameter regimes. We then show that a demand-private scheme for N files and K users can be obtained from a non-private scheme that satisfies only a restricted subset of demands of N K users for N files. We then focus on the demand-private coded caching problem for K = 2 users, N = 2 files. We characterize the exact memory-rate trade-off for this case. To show the achievability, we use our first result to construct a demand-private scheme from a non-private scheme satisfying a restricted demand subset that is known from an earlier work by Tian. Further, by giving a converse based on the extra requirement of privacy, we show that the obtained achievable region is the exact memory-rate trade-off., J. Ravi received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). The work of B. K. Dey was supported in part by the Bharti Centre for Communication, lIT Bombay.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Unsupervised learning of global factors in deep generative models

  • Peis Aznarte, Ignacio
  • Martínez Olmos, Pablo
  • Artés Rodríguez, Antonio
We present a novel deep generative model based on non i.i.d. variational autoencoders that captures global dependencies among observations in a fully unsupervised fashion. In contrast to the recent semi-supervised alternatives for global modeling in deep generative models, our approach combines a mixture model in the local or data-dependent space and a global Gaussian latent variable, which lead us to obtain three particular insights. First, the induced latent global space captures interpretable disentangled representations with no user-defined regularization in the evidence lower bound (as in beta-VAE and its generalizations). Second, we show that the model performs domain alignment to find correlations and interpolate between different databases. Finally, we study the ability of the global space to discriminate between groups of observations with non-trivial underlying structures, such as face images with shared attributes or defined sequences of digits images., This work has been partly supported by Spanish government (AEI/MCI) under grants PID2021-123182OB-I00, PID2021-125159NB-I00 and RTI2018-099655-B-100, by Comunidad de Madrid under grant IND2022/TIC-23550, by the European Union (FEDER) and the European Research Council (ERC) through the European Union's Horizon 2020 research and innovation program under Grant 714161, and by Comunidad de Madrid and FEDER through IntCARE-CM. The work of Ignacio Peis has been also supported by by Spanish government (MIU) under grant FPU18/00516.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels

  • Taufiq Asyhari, A.
  • Koch, Tobias Mirco
  • Guillén i Fàbregas, Albert
The material in this paper was presented in part at the 2011 IEEE International Symposium on Information Theory (ISIT), Saint Petersburg, Russia, 31 July-5 August 2011 and the 49th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, USA, 28-30 September 2011., We study the information rates of noncoherent, stationary, Gaussian, and multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we investigate the behavior of these achievable rates in the limit as the signal-to-noise ratio (SNR) tends to infinity by analyzing the capacity pre-log, which is defined as the limiting ratio of the capacity to the logarithm of the SNR as the SNR tends to infinity. We demonstrate that a scheme estimating the channel using pilot symbols and detecting the message using nearest neighbor decoding (while assuming that the channel estimation is perfect) essentially achieves the capacity pre-log of noncoherent multiple-input single-output flat-fading channels, and it essentially achieves the best so far known lower bound on the capacity pre-log of noncoherent MIMO flat-fading channels. Extending the analysis to fading multiple-access channels reveals interesting relationships between the number of antennas and Doppler bandwidth in the comparative performance of joint transmission and time division multiple-access., The work of A.T.A was supported in part by the Yousef Jameel Scholarship at the University of Cambridge. T. K. received funding from the European's Seventh Framework Programme (FP7/2007-2013) under grant agreement No. 252663, from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement number 714161), and from the Spanish Ministerio de Economía y Competitividad under grant RYC-2014-16332. The work of A.G.i.F. has been funded by the European Research Council under ERC grant agreements 259663 and 725411.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

On the Second-Order Asymptotics of the Hoeffding Test and Other Divergence Tests

  • Kallumadatil Velluva, Harsha
  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Consider a composite hypothesis testing problem where the test has access to the null hypothesis P but not to the alternative hypothesis Q. The generalized likelihood-ratio test (GLRT) for this problem is the Hoeffding test, which accepts P if the Kullback-Leibler (KL) divergence between the empirical distribution of Zn and P is below some threshold. This paper proposes a generalization of the Hoeffding test, termed divergence test, for which the KL divergence is replaced by an arbitrary divergence. For this test, the first and second-order terms of the type-II error probability for a fixed type-I error probability are characterized and compared with the error terms of the Neyman-Pearson test, which is the optimal test when both P and Q are known. It is demonstrated that, irrespective of the divergence, divergence tests achieve the first-order term of the Neyman-Pearson test. In contrast, the second-order term of divergence tests is strictly worse than that of the Neyman-Pearson test. It is further demonstrated that divergence tests with an invariant divergence achieve the same second-order term as the Hoeffding test, but divergence tests with a non-invariant divergence may outperform the Hoeffding test for some alternative hypotheses Q. This implies that the GLRT may have a second-order asymptotic performance that is strictly suboptimal., This work was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Program under Grant 714161. The work of Jithin Ravi was supported in part by the Science and Engineering Research Board (SERB) under the Start-Up Research Grant SRG/2022/001393 and in part by Indian Institute of Technology (IIT) Kharagpur under the Faculty Start-Up Research Grant (FSRG). The work of Tobias Koch was supported in part by the Spanish Ministerio de Ciencia e Innovación under Grant PID2020-116683GB-C21/AEI/10.13039/501100011033 and in part by the Comunidad de Madrid under Grant TEC-2024/COM-89
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Automatic patient functionality assessment from multimodal data using deep learning techniques - Development and feasibility evaluation

  • Sükei, Emese
  • León-Martínez, Santiago de
  • Martínez Olmos, Pablo
  • Artés Rodríguez, Antonio
Wearable devices and mobile sensors enable the real-time collection of an abundant source of physiological and behavioural data unobtrusively. Unlike traditional in-person evaluation or ecological momentary assessment (EMA) questionnaire-based approaches, these data sources open many possibilities in remote patient monitoring. However, defining robust models is challenging due to the data's noisy and frequently missing observations. This work proposes an attention-based Long Short-Term Memory (LSTM) neural network-based pipeline for predicting mobility impairment based on WHODAS 2.0 evaluation from such digital biomarkers. Furthermore, we addressed the missing observation problem by utilising hidden Markov models and the possibility of including information from unlabelled samples via transfer learning. We validated our approach using two wearable/mobile sensor data sets collected in the wild and socio-demographic information about the patients. Our results showed that in the WHODAS 2.0 mobility impairment prediction task, the proposed pipeline outperformed a prior baseline while additionally providing interpretability with attention heatmaps. Moreover, using a much smaller cohort via task transfer learning, the same model could learn to predict generalised anxiety severity accurately based on GAD-7 scores., ES received funding from the European Union Horizon 2020 research and innovation program (Marie Sklodowska-Curie grant 813533) . AA and PO are supported by the Spanish government MCI under grants PID2021-123182OB-I00 and PID2021-125159NB-I00, by Comunidad de Madrid under grant IND2022/TIC-23550, by the European Research Council (ERC) through the European Union's Horizon 2020 research and innovation program under Grant 714161, and by Comunidad de Madrid and FEDER through IntCARE-CM.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Capacity per Unit-Energy of Gaussian Many-Access Channels

  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceeding of: 2019 IEEE International Symposium on Information Theory (ISIT), 7-12 July 2019, Paris, France, We consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength n. For this setup, the maximum number of bits that can be transmitted reliably per unit-energy is analyzed. We show that if the number of users is of an order strictly above n/log n, then the users cannot achieve any positive rate per unit-energy. In contrast, if the number of users is of order strictly below n/log n, then each user can achieve the single-user capacity per unit-energy (log e)/N 0 (where N 0 /2 is the noise power) by using an orthogonal access scheme such as time division multiple access. We further demonstrate that orthogonal codebooks, which achieve the capacity per unit-energy when the number of users is bounded, can be strictly suboptimal., J. Ravi and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Generalized Perfect Codes for Symmetric Classical-Quantum Channels

  • Blasco Coll, Andreu
  • Vázquez Vilar, Gonzalo
  • Fonollosa, Javier Rodríguez
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite dimensional complex Hilbert output space. The resulting optimality conditions depend on the channel considered and on an auxiliary state defined on the output space of the channel. For certain $N$ -qubit classical-quantum channels, we show that codes based on a generalization of Bell states are quasi-perfect and, therefore, they feature the smallest error probability among all codes of the same blocklength and cardinality., This work was supported in part by the European Research Council (ERC) under Grant 714161; in part by the Agencia Estatal de Investigación, Ministerio de Ciencia e Innovación, the Spanish Government, under Grant RED2018-102668-T, Grant PID2019-104958RB-C41, and Grant PID2020-116683GB-C21; and in part by the Catalan Government, within the ERDF Program of Catalunya, under Grant 2017 SGR 578 AGAUR and Grant 001-P001644 QuantumCAT.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

A Rigorous Approach to High-Resolution Entropy-Constrained Vector Quantization

  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
The nonnegativity of relative entropy implies that the differential entropy of a random vector X with probability density function (pdf) f is upper-bounded by -E[log g(X)]for any arbitrary pdf g. Using this inequality with a cleverly chosen g, we derive a lower bound on the asymptotic excess rate of entropy-constrained vector quantization for d-dimensional sources and rth-power distortion, where the asymptotic excess rate is defined as the difference between the smallest output entropy of a vector quantizer satisfying the distortion constraint and the rate-distortion function in the limit as the distortion tends to zero. Specialized to the one-dimensional case, this lower bound coincides with the asymptotic excess rate achieved by a uniform quantizer, thereby recovering the result by Gish and Pierce that uniform quantizers are asymptotically optimal as the allowed distortion tends to zero. Furthermore, in the one-dimensional case, the derivation of the lower bound reveals a necessary condition for a sequence of quantizers to be asymptotically optimal. This condition implies that any sequence of asymptotically optimal almost-regular quantizers must converge to a uniform quantizer as the distortion tends to zero. While the obtained lower bound itself is not novel, to the best of our knowledge, we present the first rigorous derivation that follows the direct approach by Gish and Pierce without resorting to heuristic high-resolution approximations commonly found in the quantization literature. Furthermore, our derivation holds for all d-dimensional sources having finite differential entropy and whose integer part has finite entropy. In contrast to Gish and Pierce, we do not require additional constraints on the continuity or decay of the source pdf., This work has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Ministerio de Economía y Competitividad of Spain under Grants TEC2013-41718-R, RYC-2014-16332, IJCI-2015-27020, TEC2015-69648-REDC, and TEC2016-78434-C3-3-R (AEI/FEDER, EU), and from the Comunidad de Madrid under Grant S2103/ICE-2845. The material in this paper was presented in part at the 2016 IEEE International Symposium on Information Theory, Barcelona, Spain, July 2016.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Improved memory-rate trade-off for caching with demand privacy

  • Gurjarpadhye, Chinmay
  • Ravikumaran Nair, Jithin
  • Dey, Bikash Kumar
  • Karamchandani, Nikhil
We consider the demand-private coded caching problem in a noiseless broadcast network. It is known from past works that a demand-private scheme for N files and K users can be obtained from a non-private scheme for N files and NK users. We first propose a scheme that improves on this idea by removing some redundant transmissions. The memory- rate trade-off achieved using this scheme is shown to be within a multiplicative factor of 3 from the optimal for all the memory regimes when K K = 2., J. Ravi has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). The work of B. K. Dey was supported in part by the Bharti Centre for Communication in IIT Bombay. The work of N. Karamchandani is supported in part by a Science and Engineering Research Board (SERB) grant on "Content Caching and Delivery over Wireless Networks".
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels

  • Lancho Serrano, Alejandro
  • Östman, Johan
  • Durisi, Giuseppe
  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
Proceeding of: 2019 IEEE International Symposium on Information Theory (ISIT), 7-12 July 2019, Paris, France, This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels. These approximations can be calculated efficiently and are shown to be accurate for SNR values as small as 0 dB, blocklengths of 168 channel uses or more, and when the channel's coherence interval is not smaller than two. It is demonstrated that the derived approximations recover both the normal approximation and the reliability function of the channel., A. Lancho, G. Vázquez-Vilar and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (714161), the Spanish Ministerio de Economía y Competitividad (RYC-2014-16332, TEC2016-78434-C3-3-R (AEI/FEDER, EU) and IJCI2015-27020), the Spanish Ministerio de Educación, Cultura y Deporte (FPU014/01274), and the Comunidad de Madrid (S2103/ICE-2845). G. Durisi and J. Östman have been supported by the Swedish Research Council under Grants 2016-03293 and 2014-6066.