Pasar al contenido principal

AVANCES EN CODIFICACION Y PROCESADO DE SEÑAL PARA LA SOCIEDAD DIGITAL

PID2019-104958RB-C41

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Passive sampling in reproducing kernel Hilbert spaces using leverage scores

  • Giménez Febrer, Pedro Juan
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Santamaria Caballero, Ignacio
This paper deals with the selection of the training dataset in kernel-based methods for function reconstruction, with a focus on kernel ridge regression. A functional analysis is performed which, in the absence of noise, links the optimal sampling distribution to the one minimizing the difference between the kernel matrix and its low-rank Nyström approximation. From this standpoint, a statistical passive sampling approach is derived which uses the leverage scores of the columns of the kernel matrix to design a sampling distribution that minimizes an upper bound of the risk function. The proposed approach constitutes a passive method, able to select the optimal subset of training samples using only information provided by the input set and the kernel, but without needing to know the values of the function to be approximated. Furthermore, the proposed approach is backed up by numerical tests on real datasets., This work has been funded by the Ministerio de Ciencia e Innovación (MICINN) of the Spanish Government and by the Agencia Estatal de Investigación (AEI/10.13039/501100011033) and ERDF funds (PID 2019-104958RB-C41/C43, RED2018-102668-T); and by the Catalan Government (2017 SGR 578)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Perfect and quasi-perfect codes for the Bosonic classical-quantum channel

  • Blasco Coll, Andreu
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
We explore perfect and quasi-perfect codes for the Bosonic channel, where information is generated by a laser and conveyed in the form of coherent states. In particular, we consider the phase-modulation codebook for coherent states in a Bosonic channel. We show that these phase-modulation codes are quasi-perfect as long as the cardinality of the code is the same as the dimension of the coherent states. These codes feature the smallest error probability among all codes of the same cardinality and the same dimension of the channel Hilbert space. We study the performance of these codes in terms of error probability, incorporating the degradation caused by a depolarizing or an erasure quantum channel., This work was supported in part by the MCIN/AEI/ 10.13039/501100011033 under Grant PID2019-104958RB-C41 and Grant RED2018-102668-T, in part by the Departament de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809 under Grant 2017 SGR 578 and Grant QuantumCAT 001-P-001644, and in part by the European Regional Development Funds (ERDF) ., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Generalized perfect codes for symmetric classical-quantum channels

  • Blasco Coll, Andreu
  • Vázquez Vilar, Gonzalo
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
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., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Quantum multiple hypothesis testing based on a sequential discarding scheme

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
We consider the quantum multiple hypothesis testing problem, focusing on the case of hypothesis represented by pure states. A sequential adaptive algorithm is derived and analyzed first. This strategy exhibits a decay rate in the error probability with respect to the expected value of measurements greater than the optimal decay rate of the fixed-length methods. A more elaborated scheme is developed next, by serially concatenating multiple implementations of the first scheme. In this case each stage considers as a priori hypothesis probability the a posteriori probability of the previous stage. We show that, by means of a fixed number of concatenations, the expected value of measurements to be performed decreases considerably. We also analyze one strategy based on an asymptotically large concatenation of the initial scheme, demonstrating that the expected number of measurements in this case is upper bounded by a constant, even in the case of zero average error probability. A lower bound for the expected number of measurements in the zero error probability setting is also derived., This work was supported in part by the Agencia Estatal de Investigación, Ministerio de Ciencia e Innovación, of the Spanish Government, under Grant RED2018-102668-T and Grant PID2019-104958RB-C41; in part by the Catalan Government under Grant 2017 SGR 578 AGAUR; and in part by the QuantumCAT within the European Regional Development Fund (ERDF) Program of Catalunya under Grant 001-P-001644.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Random-Walk laplacian for frequency analysis in periodic graphs

  • Boukrab, Rachid
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
This paper presents the benefits of using the random-walk normalized Laplacian matrix as a graph-shift operator and defines the frequencies of a graph by the eigenvalues of this matrix. A criterion to order these frequencies is proposed based on the Euclidean distance between a graph signal and its shifted version with the transition matrix as shift operator. Further, the frequencies of a periodic graph built through the repeated concatenation of a basic graph are studied. We show that when a graph is replicated, the graph frequency domain is interpolated by an upsampling factor equal to the number of replicas of the basic graph, similarly to the effect of zero-padding in digital signal processing., This work has been funded by the Agencia Estatal de Investigación, Ministerio de Ciencia, Innovación y Universidades of the Spanish Government and ERDF funds (PID2019-104958RB-C41, RED2018-102668-T); and by the Catalan Government-Secretaria d'Universitats i Recerca, Departament d'Empresa i Coneixement, Generalitat de Catalunya, AGAUR (2020 FI_B 00495, 2017 SGR 578)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Bounds in sequential unambiguous discrimination of multiple pure quantum states

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous discrimination. In this work, we derive performance bounds for such methods when applied to the discrimination of a set of pure states. The performance is evaluated based on the expected number of copies required. We establish a lower bound applicable to any sequential method and an upper bound on the optimal sequential method. The upper bound is derived using a novel and simple non-adaptive method. Importantly, the gap between these bounds is minimal, scaling logarithmically with the number of distinct states., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Order estimation via matrix completion for multi-switch antenna selection

  • Garg, Vaibhav
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Santamaria Caballero, Ignacio
This letter addresses the problem of order estimation for uniform linear arrays (ULAs) with multi-switch antenna selection in the small-sample regime. Multi-switch antenna selection results in a data matrix with missing entries, a scenario for which existing order estimation methods that build on the eigenvalues of the sample covariance matrix do not perform well. A direct application of the Davis-Kahan theorem allows us to show that the signal subspace is quite robust in the presence of missing entries. Based on this finding, this letter proposes a matrix completion (MC) subspace-based order estimation criterion that exploits the shift-invariance property of ULAs. A recently proposed shift-invariant matrix completion (SIMC) method is used for reconstructing the data matrix, and the proposed order estimation criterion is based on the chordal subspace distance between two submatrices extracted from the reconstructed matrix for increasing values of the dimension of the signal subspace. Our simulation results show that the method provides accurate order estimates with percentages of missing entries higher than 50 %., This work was supported by the Ministerio de Ciencia e Innovación (MICINN) of Spain, and AEI/FEDER funds of the E.U., under Grants PID2019-104958RB-C43/C41 (ADELE) and BES-2017-080542., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Higher-order link prediction via learnable maximum mean discrepancy

  • Karanikolas, Georgios V.
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Giannakis, Georgios B.
Higher-order link prediction (HOLP) seeks missing links capturing dependencies among three or more network nodes. Predicting high-order links (HOLs) can for instance reveal hyperlinks in the structure of drug substance and metabolic networks. Existing methods either make restrictive assumptions regarding the emergence of HOLs, or, they rely on reduced dimensionality models of limited expressiveness. To overcome these limitations, the HOLP approach developed here leverages distribution similarities across embeddings as captured by a learnable probability metric. The intuition underpinning the novel approach is that sets of nodes whose embeddings are less similar in distribution, are less likely to be connected by a HOL. Specifically, nonlinear dimensionality reduction is effected through a Gaussian process latent variable model that yields nodal embeddings, and also learns a data-driven similarity function (kernel). This kernel forms the core of a maximum mean discrepancy probability metric. Tests on benchmark datasets illustrate the potential of the proposed approach., This work was supported in part by NSF grants 1901134, 2126052, 2212318, 2220292. A. Pages-Zamora was supported by grants PID 2019-104958RB-C41 and RED2018-102668-T funded by MCIN/AEI/10.13039/501100011033; and by 2021 SGR 01033 funded by Dept. de Recerca i Univ. de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Polar coding for the wiretap broadcast channel with multiple messages

  • Olmo Alòs, Jaume del|||0000-0002-3361-6077
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eaves-dropper. We consider a model in which the transmitter wishes to to reliably send different confidential and private messages to the different legitimate receivers, and the confidential message must also be (strongly) secured from the eavesdropper. There are two different inner-bounds on the achievable region of this model in the literature. Both are characterized by using Marton's coding and the only difference between them is the decoding strategy: one is characterized by using joint decoding, while the other uses successive decoding. In this paper we present a polar coding scheme that achieves the larger inner-bound, and we show that polar-based joint decoding is crucial for this purpose., This work has been funded by the AEI of Ministerio de Ciencia, Innovación y Universidades of Spain, TEC2016-75067-C4-2-R, RED2018-102668-T with ESF and PID2019-104958RB-C41 and Dept. d’Empresa i Coneixement de la Generalitat de Catalunya, 2017 SGR 578 AGAUR and 001-P-001644 QuantumCAT with ERDF., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Unsupervised ensemble learning for genome sequencing

  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Ochoa Álvarez, Idoia
  • Ruiz Cavero, Gonzalo
  • Villalvilla Ornat, Pol
Unsupervised ensemble learning refers to methods devised for a particular task that combine data provided by decision learners taking into account their reliability, which is usually inferred from the data. Here, the variant calling step of the next generation sequencing technologies is formulated as an unsupervised ensemble classification problem. A variant calling algorithm based on the expectation-maximization algorithm is further proposed that estimates the maximum-a-posteriori decision among a number of classes larger than the number of different labels provided by the learners. Experimental results with real human DNA sequencing data show that the proposed algorithm is competitive compared to state-of-the-art variant callers as GATK, HTSLIB, and Platypus., This work has been funded by the Agencia Estatal de Investigación, Ministerio de Ciencia, Innovación y Universidades of the Spanish Government and ERDF funds (PID2019-104958RB-C41, RED2018-102668-T); and by Gipuzkoa Fellows grant and Ramon y Cajal grant., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Extension of Clifford Data Regression methods for quantum error mitigation

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum devices, unlike the more resource-intensive quantum error correction codes. A notable example of such a technique is Clifford Data Regression, which employs a supervised learning approach. This work investigates two variants of this technique, both of which introduce a non-trivial set of gates into the original circuit. The first variant uses multiple copies of the original circuit, while the second adds a layer of single-qubit rotations. Different characteristics of these methods are analyzed theoretically, such as their complexity, or the scaling of the error with various parameters. Additionally, the performance of these methods is evaluated through numerical experiments, demonstrating a reduction in root mean square error., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Relation between quantum advantage in supervised learning and quantum computational advantage

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria|||0000-0002-7087-7014
  • Rodríguez Fonollosa, Javier|||0000-0002-0136-2586
The widespread use of machine learning has raised the question of quantum supremacy for supervised learning as compared to quantum computational advantage. In fact, a recent work shows that computational and learning advantage are, in general, not equivalent, i.e., the additional information provided by a training set can reduce the hardness of some problems. This paper investigates under which conditions they are found to be equivalent or, at least, highly related. This relation is analyzed by considering two definitions of learning speed-up: one tied to the distribution and another that is distribution-independent. In both cases, the existence of efficient algorithms to generate training sets emerges as the cornerstone of such conditions, although, for the distribution-independent definition, additional mild conditions must also be met. Finally, these results are applied to prove that there is a quantum speed-up for some learning tasks based on the prime factorization problem, assuming the classical intractability of this problem., FUNDING: This work was supported in part by the MCIN/AEI/10.13039/501100011033/FEDER, UE, under Grant PID2022-137099NB-C41 and Grant PID2019-104958RB-C41 and in part by the AGAUR, Departament de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809 under Grant 2021 SGR 01033., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.5 - Augmentar la investigació científica i millorar la capacitat tecnològica dels sectors industrials de tots els països, en particular els països en desenvolupament, entre d’altres maneres fomentant la innovació i augmentant substancialment, d’aquí al 2030, el nombre de persones que treballen en el camp de la investigació i el desenvolupa­ment per cada milió d’habitants, així com la despesa en investigació i desenvolupament dels sectors públic i privat, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Higher-order link prediction via learnable maximum mean discrepancy

  • Karanikolas, Georgios V.
  • Pagès Zamora, Alba Maria
  • Giannakis, Georgios B.
Higher-order link prediction (HOLP) seeks missing links capturing dependencies among three or more network nodes. Predicting high-order links (HOLs) can for instance reveal hyperlinks in the structure of drug substance and metabolic networks. Existing methods either make restrictive assumptions regarding the emergence of HOLs, or, they rely on reduced dimensionality models of limited expressiveness. To overcome these limitations, the HOLP approach developed here leverages distribution similarities across embeddings as captured by a learnable probability metric. The intuition underpinning the novel approach is that sets of nodes whose embeddings are less similar in distribution, are less likely to be connected by a HOL. Specifically, nonlinear dimensionality reduction is effected through a Gaussian process latent variable model that yields nodal embeddings, and also learns a data-driven similarity function (kernel). This kernel forms the core of a maximum mean discrepancy probability metric. Tests on benchmark datasets illustrate the potential of the proposed approach., This work was supported in part by NSF grants 1901134, 2126052, 2212318, 2220292. A. Pages-Zamora was supported by grants PID 2019-104958RB-C41 and RED2018-102668-T funded by MCIN/AEI/10.13039/501100011033; and by 2021 SGR 01033 funded by Dept. de Recerca i Univ. de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Order estimation via matrix completion for multi-switch antenna selection

  • Garg, Vaibhav
  • Pagès Zamora, Alba Maria
  • Santamaria Caballero, Ignacio
This letter addresses the problem of order estimation for uniform linear arrays (ULAs) with multi-switch antenna selection in the small-sample regime. Multi-switch antenna selection results in a data matrix with missing entries, a scenario for which existing order estimation methods that build on the eigenvalues of the sample covariance matrix do not perform well. A direct application of the Davis-Kahan theorem allows us to show that the signal subspace is quite robust in the presence of missing entries. Based on this finding, this letter proposes a matrix completion (MC) subspace-based order estimation criterion that exploits the shift-invariance property of ULAs. A recently proposed shift-invariant matrix completion (SIMC) method is used for reconstructing the data matrix, and the proposed order estimation criterion is based on the chordal subspace distance between two submatrices extracted from the reconstructed matrix for increasing values of the dimension of the signal subspace. Our simulation results show that the method provides accurate order estimates with percentages of missing entries higher than 50 %., This work was supported by the Ministerio de Ciencia e Innovación (MICINN) of Spain, and AEI/FEDER funds of the E.U., under Grants PID2019-104958RB-C43/C41 (ADELE) and BES-2017-080542., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Bounds in sequential unambiguous discrimination of multiple pure quantum states

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria
  • Rodríguez Fonollosa, Javier
Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous discrimination. In this work, we derive performance bounds for such methods when applied to the discrimination of a set of pure states. The performance is evaluated based on the expected number of copies required. We establish a lower bound applicable to any sequential method and an upper bound on the optimal sequential method. The upper bound is derived using a novel and simple non-adaptive method. Importantly, the gap between these bounds is minimal, scaling logarithmically with the number of distinct states., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Extension of Clifford Data Regression methods for quantum error mitigation

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria
  • Rodríguez Fonollosa, Javier
To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum devices, unlike the more resource-intensive quantum error correction codes. A notable example of such a technique is Clifford Data Regression, which employs a supervised learning approach. This work investigates two variants of this technique, both of which introduce a non-trivial set of gates into the original circuit. The first variant uses multiple copies of the original circuit, while the second adds a layer of single-qubit rotations. Different characteristics of these methods are analyzed theoretically, such as their complexity, or the scaling of the error with various parameters. Additionally, the performance of these methods is evaluated through numerical experiments, demonstrating a reduction in root mean square error., This work has been funded by grants PID2022-137099NB-C41, PID2019-104958RB-C41 funded by MCIN/AEI/10.13039/501100011033 and FSE+ and by grant 2021 SGR 01033 funded by AGAUR, Dept. de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Generalized perfect codes for symmetric classical-quantum channels

  • Blasco Coll, Andreu
  • Vázquez Vilar, Gonzalo
  • Rodríguez Fonollosa, Javier
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., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Relation between quantum advantage in supervised learning and quantum computational advantage

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria
  • Rodríguez Fonollosa, Javier
The widespread use of machine learning has raised the question of quantum supremacy for supervised learning as compared to quantum computational advantage. In fact, a recent work shows that computational and learning advantage are, in general, not equivalent, i.e., the additional information provided by a training set can reduce the hardness of some problems. This paper investigates under which conditions they are found to be equivalent or, at least, highly related. This relation is analyzed by considering two definitions of learning speed-up: one tied to the distribution and another that is distribution-independent. In both cases, the existence of efficient algorithms to generate training sets emerges as the cornerstone of such conditions, although, for the distribution-independent definition, additional mild conditions must also be met. Finally, these results are applied to prove that there is a quantum speed-up for some learning tasks based on the prime factorization problem, assuming the classical intractability of this problem., FUNDING: This work was supported in part by the MCIN/AEI/10.13039/501100011033/FEDER, UE, under Grant PID2022-137099NB-C41 and Grant PID2019-104958RB-C41 and in part by the AGAUR, Departament de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809 under Grant 2021 SGR 01033., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.5 - Augmentar la investigació científica i millorar la capacitat tecnològica dels sectors industrials de tots els països, en particular els països en desenvolupament, entre d’altres maneres fomentant la innovació i augmentant substancialment, d’aquí al 2030, el nombre de persones que treballen en el camp de la investigació i el desenvolupa­ment per cada milió d’habitants, així com la despesa en investigació i desenvolupament dels sectors públic i privat, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Passive sampling in reproducing kernel Hilbert spaces using leverage scores

  • Giménez Febrer, Pedro Juan
  • Pagès Zamora, Alba Maria
  • Santamaria Caballero, Ignacio
This paper deals with the selection of the training dataset in kernel-based methods for function reconstruction, with a focus on kernel ridge regression. A functional analysis is performed which, in the absence of noise, links the optimal sampling distribution to the one minimizing the difference between the kernel matrix and its low-rank Nyström approximation. From this standpoint, a statistical passive sampling approach is derived which uses the leverage scores of the columns of the kernel matrix to design a sampling distribution that minimizes an upper bound of the risk function. The proposed approach constitutes a passive method, able to select the optimal subset of training samples using only information provided by the input set and the kernel, but without needing to know the values of the function to be approximated. Furthermore, the proposed approach is backed up by numerical tests on real datasets., This work has been funded by the Ministerio de Ciencia e Innovación (MICINN) of the Spanish Government and by the Agencia Estatal de Investigación (AEI/10.13039/501100011033) and ERDF funds (PID 2019-104958RB-C41/C43, RED2018-102668-T); and by the Catalan Government (2017 SGR 578)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Unsupervised ensemble learning for genome sequencing

  • Pagès Zamora, Alba Maria
  • Ochoa Álvarez, Idoia
  • Ruiz Cavero, Gonzalo
  • Villalvilla Ornat, Pol
Unsupervised ensemble learning refers to methods devised for a particular task that combine data provided by decision learners taking into account their reliability, which is usually inferred from the data. Here, the variant calling step of the next generation sequencing technologies is formulated as an unsupervised ensemble classification problem. A variant calling algorithm based on the expectation-maximization algorithm is further proposed that estimates the maximum-a-posteriori decision among a number of classes larger than the number of different labels provided by the learners. Experimental results with real human DNA sequencing data show that the proposed algorithm is competitive compared to state-of-the-art variant callers as GATK, HTSLIB, and Platypus., This work has been funded by the Agencia Estatal de Investigación, Ministerio de Ciencia, Innovación y Universidades of the Spanish Government and ERDF funds (PID2019-104958RB-C41, RED2018-102668-T); and by Gipuzkoa Fellows grant and Ramon y Cajal grant., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Perfect and quasi-perfect codes for the Bosonic classical-quantum channel

  • Blasco Coll, Andreu
  • Rodríguez Fonollosa, Javier
We explore perfect and quasi-perfect codes for the Bosonic channel, where information is generated by a laser and conveyed in the form of coherent states. In particular, we consider the phase-modulation codebook for coherent states in a Bosonic channel. We show that these phase-modulation codes are quasi-perfect as long as the cardinality of the code is the same as the dimension of the coherent states. These codes feature the smallest error probability among all codes of the same cardinality and the same dimension of the channel Hilbert space. We study the performance of these codes in terms of error probability, incorporating the degradation caused by a depolarizing or an erasure quantum channel., This work was supported in part by the MCIN/AEI/ 10.13039/501100011033 under Grant PID2019-104958RB-C41 and Grant RED2018-102668-T, in part by the Departament de Recerca i Universitats de la Generalitat de Catalunya 10.13039/501100002809 under Grant 2017 SGR 578 and Grant QuantumCAT 001-P-001644, and in part by the European Regional Development Funds (ERDF) ., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Random-Walk laplacian for frequency analysis in periodic graphs

  • Boukrab, Rachid
  • Pagès Zamora, Alba Maria
This paper presents the benefits of using the random-walk normalized Laplacian matrix as a graph-shift operator and defines the frequencies of a graph by the eigenvalues of this matrix. A criterion to order these frequencies is proposed based on the Euclidean distance between a graph signal and its shifted version with the transition matrix as shift operator. Further, the frequencies of a periodic graph built through the repeated concatenation of a basic graph are studied. We show that when a graph is replicated, the graph frequency domain is interpolated by an upsampling factor equal to the number of replicas of the basic graph, similarly to the effect of zero-padding in digital signal processing., This work has been funded by the Agencia Estatal de Investigación, Ministerio de Ciencia, Innovación y Universidades of the Spanish Government and ERDF funds (PID2019-104958RB-C41, RED2018-102668-T); and by the Catalan Government-Secretaria d'Universitats i Recerca, Departament d'Empresa i Coneixement, Generalitat de Catalunya, AGAUR (2020 FI_B 00495, 2017 SGR 578)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Polar coding for the wiretap broadcast channel with multiple messages

  • Olmo Alòs, Jaume del
  • Rodríguez Fonollosa, Javier
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eaves-dropper. We consider a model in which the transmitter wishes to to reliably send different confidential and private messages to the different legitimate receivers, and the confidential message must also be (strongly) secured from the eavesdropper. There are two different inner-bounds on the achievable region of this model in the literature. Both are characterized by using Marton's coding and the only difference between them is the decoding strategy: one is characterized by using joint decoding, while the other uses successive decoding. In this paper we present a polar coding scheme that achieves the larger inner-bound, and we show that polar-based joint decoding is crucial for this purpose., This work has been funded by the AEI of Ministerio de Ciencia, Innovación y Universidades of Spain, TEC2016-75067-C4-2-R, RED2018-102668-T with ESF and PID2019-104958RB-C41 and Dept. d’Empresa i Coneixement de la Generalitat de Catalunya, 2017 SGR 578 AGAUR and 001-P-001644 QuantumCAT with ERDF., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Quantum multiple hypothesis testing based on a sequential discarding scheme

  • Pérez Guijarro, Jordi
  • Pagès Zamora, Alba Maria
  • Rodríguez Fonollosa, Javier
We consider the quantum multiple hypothesis testing problem, focusing on the case of hypothesis represented by pure states. A sequential adaptive algorithm is derived and analyzed first. This strategy exhibits a decay rate in the error probability with respect to the expected value of measurements greater than the optimal decay rate of the fixed-length methods. A more elaborated scheme is developed next, by serially concatenating multiple implementations of the first scheme. In this case each stage considers as a priori hypothesis probability the a posteriori probability of the previous stage. We show that, by means of a fixed number of concatenations, the expected value of measurements to be performed decreases considerably. We also analyze one strategy based on an asymptotically large concatenation of the initial scheme, demonstrating that the expected number of measurements in this case is upper bounded by a constant, even in the case of zero average error probability. A lower bound for the expected number of measurements in the zero error probability setting is also derived., This work was supported in part by the Agencia Estatal de Investigación, Ministerio de Ciencia e Innovación, of the Spanish Government, under Grant RED2018-102668-T and Grant PID2019-104958RB-C41; in part by the Catalan Government under Grant 2017 SGR 578 AGAUR; and in part by the QuantumCAT within the European Regional Development Fund (ERDF) Program of Catalunya under Grant 001-P-001644., Postprint (published version)