Publications

Download full publication list (PDF) ↗   Download BibTeX (.bib) ↗

Preprints and submitted manuscripts (6)

  1. [P1] P. Formont, M. Darrin, I. B. Ayed, and P. Piantanida, “MolRGen: A Training and Evaluation Setting for De Novo Molecular Generation with Reasonning Models,” 2026.arXiv ↗
  2. [P2] M. Dubois, F. Yvon, and P. Piantanida, “How much were you told? measuring external information in peer reviews,” 2026.arXiv ↗
  3. [P3] P. Piantanida and G. Pichler, “A theory for rational speech acts as KL projections with powered semantics,” 2026, (submitted)
  4. [P4] Y. Bahram, Z. Dehghani, M. Desbos, E. Granger, P. Piantanida, and M. Shateri, “Continuous adversarial meanflow transfer,” 2026.arXiv ↗
  5. [P5] C. Chataigner, P. Piantanida, and G. Farnadi, “Position: Auditing Is Not Evaluating; LLM Audit Requires Dynamic, Contextual, Budget-Aware and Reliable Evidence,” Feb. 2026, working paper or preprint.Paper ↗
  6. [P6] L. Estienne, E. Ernst, M. Vera, P. Piantanida, and L. Ferrer, “Ecuasn : A family of metrics for principled evaluation of uncertainty-augmented systems,” 2026.arXiv ↗

Journal articles (60)

  1. [J1] E. Aubinais, E. Gassiat, and P. Piantanida, “Fundamental Limits of Membership Inference Attacks on Machine Learning Models,” Journal of Machine Learning Research, vol. 26, no. 263, pp. 1–54, 2025.Paper ↗arXiv ↗
  2. [J2] Z. Dehghani Tafti, P. Piantanida, and M. Shateri, “A Universal Source-Free Class Unlearning Framework via Synthetic Embeddings,” Transactions on Machine Learning Research, May 2026.Paper ↗
  3. [J3] P. Morales-Álvarez, S. Christodoulidis, M. Vakalopoulou, P. Piantanida, and J. Dolz, “BayesAdapter: Enhanced Uncertainty Estimation in CLIP Few-Shot Adaptation,” International Journal of Computer Vision, vol. 134, no. 2, p. 51, February 2026.Paper ↗arXiv ↗
  4. [J4] L. Estienne, M. Vera, E. Fons, E. Kochkina, P. Piantanida, and L. Ferrer, “Adapting Language Models to Produce Good Class Probabilities for Classification Tasks,” Transactions on Machine Learning Research, February 2026.Paper ↗
  5. [J5] D. Gorla, L. Jalouzot, F. Granese, C. Palamidessi, and P. Piantanida, “On Estimating the Strength of Differentially Private Mechanisms in a Black-Box Setting,” IEEE Transactions on Dependable and Secure Computing, vol. 22, no. 5, pp. 5494–5507, September 2025.Paper ↗
  6. [J6] P. Formont, H. Jeannin, P. Piantanida, and I. Ben Ayed, “A Strong Baseline for Molecular Few-Shot Learning,” Transactions on Machine Learning Research, February 2025.Paper ↗arXiv ↗
  7. [J7] C. Presvôts, M. Kieffer, T. Prevost, P. Panciatici, Z. Li, and P. Piantanida, “Multiple-model coding scheme for electrical signal compression,” Signal Processing, vol. 236, p. 110037, November 2025.Paper ↗
  8. [J8] E. D. C. Gomes, F. Alberge, P. Duhamel, and P. Piantanida, “Combine and Conquer: A Meta-Analysis on Data Shift and Out-of-Distribution Detection,” Transactions on Machine Learning Research, July 2024.Paper ↗arXiv ↗
  9. [J9] M. Shateri, F. Messina, F. Labeau, and P. Piantanida, “Preserving Privacy in GANs Against Membership Inference Attack,” IEEE Transactions on Information Forensics and Security, vol. 19, pp. 1728–1743, 2024.Paper ↗arXiv ↗
  10. [J10] G. Pichler, M. Romanelli, L. Rey Vega, and P. Piantanida, “Perfectly Accurate Membership In- ference by a Dishonest Central Server in Federated Learning,” IEEE Transactions on Dependable and Secure Computing, vol. 21, no. 4, pp. 4290–4296, July 2024.Paper ↗arXiv ↗
  11. [J11] M. Vera, L. Rey Vega, and P. Piantanida, “PACMAN: PAC-style bounds accounting for the Mismatch between Accuracy and Negative log-loss,” Information and Inference: A Journal of the IMA, vol. 13, no. 1, p. iaae002, January 2024.Paper ↗arXiv ↗
  12. [J12] G. Del Grosso, G. Pichler, C. Palamidessi, and P. Piantanida, “Bounding information leakage in machine learning,” Neurocomputing, vol. 534, pp. 1–17, May 2023.Paper ↗arXiv ↗
  13. [J13] C. Pinzón, C. Palamidessi, P. Piantanida, and F. Valencia, “On the incompatibility of accuracy and equal opportunity,” Machine Learning, vol. 113, no. 5, pp. 2405–2434, May 2024.Paper ↗
  14. [J14] M. Vera, L. Rey Vega, and P. Piantanida, “The role of mutual information in variational classifiers,” Machine Learning, vol. 112, no. 9, pp. 3105–3150, September 2023.Paper ↗arXiv ↗
  15. [J15] M. Picot, F. Granese, G. Staerman, M. Romanelli, F. Messina, P. Piantanida, and P. Colombo, “A Halfspace-Mass Depth-Based Method for Adversarial Attack Detection,” Transactions on Machine Learning Research, March 2023.Paper ↗
  16. [J16] M. Vera, L. Rey Vega, and P. Piantanida, “Information flow in Deep Restricted Boltzmann Machines: An analysis of mutual information between inputs and outputs,” Neurocomputing, vol. 507, pp. 235–246, October 2022.Paper ↗
  17. [J17] M. Picot, F. Messina, M. Boudiaf, F. Labeau, I. Ben Ayed, and P. Piantanida, “Adversarial Robustness Via Fisher-Rao Regularization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 3, pp. 2698–2710, March 2023.Paper ↗arXiv ↗
  18. [J18] M. Shateri, F. Messina, P. Piantanida, and F. Labeau, “Privacy-Cost Management in Smart Meters With Mutual-Information-Based Reinforcement Learning,” IEEE Internet of Things Journal, vol. 9, no. 22, pp. 22 389–22 398, November 2022.Paper ↗arXiv ↗
  19. [J19] J. F. Silva and P. Piantanida, “On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets,” IEEE Transactions on Information Theory, vol. 68, no. 4, pp. 2782–2800, April 2022.Paper ↗arXiv ↗
  20. [J20] S. Espinosa, J. F. Silva, and P. Piantanida, “On the Exponential Approximation of Type II Error Probability of Distributed Test of Independence,” IEEE Transactions on Signal and Information Processing over Networks, vol. 7, pp. 777–790, 2021.Paper ↗arXiv ↗
  21. [J21] ——, “Finite-Length Bounds on Hypothesis Testing Subject to Vanishing Type I Error Restric- tions,” IEEE Signal Processing Letters, vol. 28, pp. 229–233, 2021.Paper ↗arXiv ↗
  22. [J22] G. Pichler, P. Piantanida, and G. Matz, “Distributed information-theoretic clustering,” Infor- mation and Inference: A Journal of the IMA, vol. 11, no. 1, pp. 137–166, March 2022.Paper ↗arXiv ↗
  23. [J23] K. Wan, D. Tuninetti, M. Ji, and P. Piantanida, “Combination Networks With End-User-Caches: Novel Achievable and Converse Bounds Under Uncoded Cache Placement,” IEEE Transactions on Information Theory, vol. 68, no. 2, pp. 806–827, February 2022.Paper ↗arXiv ↗
  24. [J24] M. Shateri, F. Messina, P. Piantanida, and F. Labeau, “Real-Time Privacy-Preserving Data Release for Smart Meters,” IEEE Transactions on Smart Grid, vol. 11, no. 6, pp. 5174–5183, November 2020.Paper ↗arXiv ↗
  25. [J25] A. Bunin, Z. Goldfeld, H. H. Permuter, S. Shamai Shitz, P. Cuff, and P. Piantanida, “Key and Message Semantic-Security Over State-Dependent Channels,” IEEE Transactions on Information Forensics and Security, vol. 15, pp. 1541–1556, 2020.Paper ↗arXiv ↗
  26. [J26] K. Wan, D. Tuninetti, M. Ji, G. Caire, and P. Piantanida, “Fundamental Limits of Decentralized Data Shuffling,” IEEE Transactions on Information Theory, vol. 66, no. 6, pp. 3616–3637, June 2020.Paper ↗arXiv ↗
  27. [J27] K. Wan, D. Tuninetti, and P. Piantanida, “An Index Coding Approach to Caching With Uncoded Cache Placement,” IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1318–1332, March 2020.Paper ↗arXiv ↗
  28. [J28] E. de Chérisey, S. Guilley, O. Rioul, and P. Piantanida, “Best Information is Most Success- ful: Mutual Information and Success Rate in Side-Channel Analysis,” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2019, no. 2, pp. 49–79, February 2019.Paper ↗
  29. [J29] J. F. Silva and P. Piantanida, “Universal Weak Variable-Length Source Coding on Countably Infinite Alphabets,” IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 649–668, January 2020.Paper ↗arXiv ↗
  30. [J30] G. Bassi, P. Piantanida, and S. Shamai Shitz, “The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation,” IEEE Transactions on Information Theory, vol. 65, no. 4, pp. 2213–2233, April 2019.Paper ↗arXiv ↗
  31. [J31] A. Altieri and P. Piantanida, “Performance Evaluation of Advanced Relaying Protocols in Large Wireless Networks,” IEEE Access, vol. 7, pp. 22 214–22 226, 2019.Paper ↗arXiv ↗
  32. [J32] M. Benammar, P. Piantanida, and S. Shamai, “On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding,” IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 38–64, January 2020.Paper ↗arXiv ↗
  33. [J33] G. Bassi, P. Piantanida, and S. Shamai (Shitz), “The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources,” Entropy, vol. 21, no. 8, p. 732, July 2019.Paper ↗
  34. [J34] M. Vera, L. Rey Vega, and P. Piantanida, “Collaborative Information Bottleneck,” IEEE Transactions on Information Theory, vol. 65, no. 2, pp. 787–815, February 2019.Paper ↗arXiv ↗
  35. [J35] ——, “Compression-Based Regularization With an Application to Multitask Learning,” IEEE Journal of Selected Topics in Signal Processing, vol. 12, no. 5, pp. 1063–1076, October 2018.Paper ↗arXiv ↗
  36. [J36] G. Pichler, P. Piantanida, and G. Matz, “Dictator functions maximize mutual information,” The Annals of Applied Probability, vol. 28, no. 5, pp. 3094–3101, October 2018.Paper ↗arXiv ↗
  37. [J37] C. He, S. Yang, and P. Piantanida, “A Novel Transmission Scheme for the K-User Broadcast Channel With Delayed CSIT,” IEEE Transactions on Wireless Communications, vol. 17, no. 1, pp. 386–399, January 2018.Paper ↗arXiv ↗
  38. [J38] M. Benammar, P. Piantanida, and S. Shamai Shitz, “Capacity Results for the Multicast Cognitive Interference Channel,” IEEE Transactions on Information Theory, vol. 63, no. 7, pp. 4119–4136, July 2017.Paper ↗arXiv ↗
  39. [J39] G. Katz, P. Piantanida, and M. Debbah, “Distributed Binary Detection With Lossy Data Compression,” IEEE Transactions on Information Theory, vol. 63, no. 8, pp. 5207–5227, August 2017.Paper ↗arXiv ↗
  40. [J40] L. Rey Vega, P. Piantanida, and A. O. Hero, “The Three-Terminal Interactive Lossy Source Coding Problem,” IEEE Transactions on Information Theory, vol. 63, no. 1, pp. 532–562, January 2017.Paper ↗arXiv ↗
  41. [J41] C. He, S. Yang, and P. Piantanida, “On the Gaussian Fading Broadcast Relay Channel With Causal State Feedback,” IEEE Transactions on Communications, vol. 64, no. 7, pp. 2797–2807, July 2016.Paper ↗
  42. [J42] M. Benammar and P. Piantanida, “Secrecy Capacity Region of Some Classes of Wiretap Broadcast Channels,” IEEE Transactions on Information Theory, vol. 61, no. 10, pp. 5564–5582, October 2015.Paper ↗arXiv ↗
  43. [J43] J. Hoydis, R. Couillet, and P. Piantanida, “The Second-Order Coding Rate of the MIMO Quasi-Static Rayleigh Fading Channel,” IEEE Transactions on Information Theory, vol. 61, no. 12, pp. 6591–6622, December 2015.Paper ↗arXiv ↗
  44. [J44] M. Jabi, A. E. Hamss, L. Szczecinski, and P. Piantanida, “Multipacket Hybrid ARQ: Closing Gap to the Ergodic Capacity,” IEEE Transactions on Communications, vol. 63, no. 12, pp. 5191–5205, December 2015.Paper ↗arXiv ↗
  45. [J45] G. Bassi, P. Piantanida, and S. Yang, “Capacity Bounds for a Class of Interference Relay Channels,” IEEE Transactions on Information Theory, vol. 61, no. 7, pp. 3698–3721, July 2015.Paper ↗arXiv ↗
  46. [J46] A. Altieri, P. Piantanida, L. Rey Vega, and C. G. Galarza, “On Fundamental Trade-offs of Device-to-Device Communications in Large Wireless Networks,” IEEE Transactions on Wireless Communications, vol. 14, no. 9, pp. 4958–4971, September 2015.Paper ↗arXiv ↗
  47. [J47] A. Behboodi and P. Piantanida, “Mixed Noisy Network Coding and Cooperative Unicasting in Wireless Networks,” IEEE Transactions on Information Theory, vol. 61, no. 1, pp. 189–222, January 2015.Paper ↗arXiv ↗
  48. [J48] A. Altieri, L. Rey Vega, P. Piantanida, and C. G. Galarza, “On the Outage Probability of the Full-Duplex Interference-Limited Relay Channel,” IEEE Journal on Selected Areas in Communications, vol. 32, no. 9, pp. 1765–1777, September 2014.Paper ↗arXiv ↗
  49. [J49] J. Villard, P. Piantanida, and S. Shamai, “Secure Transmission of Sources Over Noisy Channels With Side Information at the Receivers,” IEEE Transactions on Information Theory, vol. 60, no. 1, pp. 713–739, January 2014.Paper ↗arXiv ↗
  50. [J50] A. Altieri, L. Rey Vega, P. Piantanida, and C. G. Galarza, “Analysis of a Cooperative Strategy for a Large Decentralized Wireless Network,” IEEE/ACM Transactions on Networking, vol. 22, no. 4, pp. 1039–1051, August 2014.Paper ↗arXiv ↗
  51. [J51] J. Villard and P. Piantanida, “Secure Multiterminal Source Coding With Side Information at the Eavesdropper,” IEEE Transactions on Information Theory, vol. 59, no. 6, pp. 3668–3692, June 2013.Paper ↗arXiv ↗
  52. [J52] S. Yang, M. Kobayashi, P. Piantanida, and S. Shamai, “Secrecy Degrees of Freedom of MIMO Broadcast Channels With Delayed CSIT,” IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5244–5256, September 2013.Paper ↗arXiv ↗
  53. [J53] A. Zaidi, P. Piantanida, and S. Shamai Shitz, “Capacity Region of Cooperative Multiple-Access Channel With States,” IEEE Transactions on Information Theory, vol. 59, no. 10, pp. 6153–6174, October 2013.Paper ↗arXiv ↗
  54. [J54] A. Zaidi, S. Shamai, P. Piantanida, and L. Vandendorpe, “Bounds on the Capacity of the Relay Channel With Noncausal State at the Source,” IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2639–2672, May 2013.Paper ↗arXiv ↗
  55. [J55] A. Behboodi and P. Piantanida, “Cooperative Strategies for Simultaneous and Broadcast Relay Channels,” IEEE Transactions on Information Theory, vol. 59, no. 3, pp. 1417–1443, March 2013.Paper ↗arXiv ↗
  56. [J56] M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai, “On the Secrecy Degrees of Freedom of the Multiantenna Block Fading Wiretap Channels,” IEEE Transactions on Information Forensics and Security, vol. 6, no. 3, pp. 703–711, September 2011.Paper ↗
  57. [J57] P. Piantanida, G. Matz, and P. Duhamel, “Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors,” IEEE Transactions on Information Theory, vol. 55, no. 9, pp. 4221–4239, September 2009.Paper ↗arXiv ↗
  58. [J58] P. Piantanida, S. M.-S. Sadough, and P. Duhamel, “On the Outage Capacity of a Practical De- coder Accounting for Channel Estimation Inaccuracies,” IEEE Transactions on Communications, vol. 57, no. 5, pp. 1341–1350, May 2009.Paper ↗arXiv ↗
  59. [J59] A. Zaidi, P. Piantanida, and P. Duhamel, “Broadcast- and MAC-Aware Coding Strategies for Multiple User Information Embedding,” IEEE Transactions on Signal Processing, vol. 55, no. 6, pp. 2974–2992, June 2007.Paper ↗
  60. [J60] J. P. Piantanida and C. F. Estienne, “A New Estimator Based on Maximum Entropy,” Latin American Applied Research, vol. 35, no. 2, pp. 143–147, April–June 2005.Paper ↗

International conference proceedings (203)

  1. [C1] C. Roverato, J. Cotnareanu, P. Piantanida, B. N. Oreshkin, and M. Coates, “DynaPFN: Zero-shot dynamical system forecasting with tabular prior-fitted networks,” in Advances in Neural Information Processing Systems, 2026
  2. [C2] C. Chataigner, P. Piantanida, and G. Farnadi, “Auditing is not evaluating: LLM audit requires dynamic, contextual, budget-aware and reliable evidence,” in AI4GOOD Workshop at the 40th Conference on Neural Information Processing Systems (NeurIPS 2026), 2026.Paper ↗
  3. [C3] ——, “Auditing is not evaluating: LLM audit requires dynamic, contextual, budget-aware and reliable evidence,” in Advances in Neural Information Processing Systems, 2026, neurIPS 2026 Position Paper Track.Paper ↗
  4. [C4] K. Chehbouni, C. Chataigner, P. Ganesh, P. Piantanida, J. C. K. Cheung, and G. Farnadi, “From infrastructure to interface, the AI value chain drives LLM homogenization,” in Advances in Neural Information Processing Systems, 2026, neurIPS 2026 Position Paper Track
  5. [C5] A. Satouf, G. D’Erasmo, Y. Zong, H. Amadou-Boubacar, P. Piantanida, and B. Piwowarski, “STORM: Stepwise token optimization with reward-guided beam search,” in Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing, 2026.arXiv ↗
  6. [C6] L. Fosse, P. Formont, E. Aubinais, and P. Piantanida, “Data-driven estimation of statistical deficiency,” in 2026 IEEE Information Theory Workshop (ITW), 2026
  7. [C7] E. Aubinais, P. Formont, P. Piantanida, and E. Gassiat, “Membership Inference Risks in Quantized Models: A Theoretical and Empirical Study,” in The 29th International Conference on Artificial Intelligence and Statistics (AISTATS), 2026.arXiv ↗
  8. [C8] G. Pichler, M. Romanelli, and P. Piantanida, “Happiness as a Measure of Fairness,” in The 29th International Conference on Artificial Intelligence and Statistics (AISTATS), 2026.Paper ↗arXiv ↗
  9. [C9] A. Satouf, Y. Zong, H. A. Boubacar, P. Piantanida, and B. Piwowarski, “QueStER: Query Specification for Generative Keyword-Based Retrieval,” in Findings of the Association for Computational Linguistics: EACL 2026, ser. Findings of ACL, V. Demberg, K. Inui, and L. Marquez, Eds. Association for Computational Linguistics, March 2026, pp. 5957–5968.Paper ↗arXiv ↗
  10. [C10] A. Satouf, G. B. Zenou, B. Piwowarski, H. A. Boubacar, and P. Piantanida, “Rational Retrieval Acts: Leveraging Pragmatic Reasoning to Improve Sparse Retrieval,” in Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval, N. Ferro, M. Maistro, G. Pasi, O. Alonso, A. Trotman, and S. Verberne, Eds. ACM, 2025, pp. 2674–2678.Paper ↗arXiv ↗
  11. [C11] P. Marza, L. Fillioux, S. Boutaj, K. Mahatha, C. Desrosiers, P. Piantanida, J. Dolz, S. Christodoulidis, and M. Vakalopoulou, “THUNDER: Tile-level Histopathology image UNDERstanding benchmark,” in Advances in Neural Information Processing Systems 38. Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2025, pp. 171 942–172 034, (spotlight).Paper ↗arXiv ↗
  12. [C12] P. Formont, M. DARRIN, B. Karimian, E. Granger, J. C. Cheung, I. B. Ayed, M. Shateri, and P. Piantanida, “Learning Task-Agnostic Representations through Multi-Teacher Distillation,” in Advances in Neural Information Processing Systems 38. Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2025, pp. 121 561–121 607.Paper ↗arXiv ↗
  13. [C13] C. Spinoso-Di Piano, D. E. Austin, P. Piantanida, and J. C. Cheung, “(RSA)2: A Rhetorical- Strategy-Aware Rational Speech Act Framework for Figurative Language Understanding,” in Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Vol- ume 1: Long Papers), W. Che, J. Nabende, E. Shutova, and M. T. Pilehvar, Eds. Association for Computational Linguistics, July 2025, pp. 20 898–20 938.Paper ↗arXiv ↗
  14. [C14] L. Estienne, G. B. Zenou, N. Naderi, J. C. Cheung, and P. Piantanida, “Collaborative Rational Speech Act: Pragmatic Reasoning for Multi-Turn Dialog,” in Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, November 2025, pp. 22 509–22 523, (oral).Paper ↗arXiv ↗
  15. [C15] L. Fosse, F. Bechet, B. Favre, G. Damnati, G. Lecorvé, M. Darrin, P. Formont, and P. Piantanida, “Statistical Deficiency for Task Inclusion Estimation,” in Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), W. Che, J. Nabende, E. Shutova, and M. T. Pilehvar, Eds. Association for Computational Linguistics, July 2025, pp. 382–415.Paper ↗arXiv ↗
  16. [C16] M. Dubois, F. Yvon, and P. Piantanida, “MOSAIC: Multiple Observers Spotting AI Content,” in Findings of the Association for Computational Linguistics: ACL 2025, W. Che, J. Nabende, E. Shutova, and M. T. Pilehvar, Eds. Association for Computational Linguistics, July 2025, pp. 24 230–24 247.Paper ↗arXiv ↗
  17. [C17] ——, “MOSAIC at GENAI Detection Task 3 : Zero-Shot Detection Using an Ensemble of Models,” in Proceedings of the 1stWorkshop on GenAI Content Detection (GenAIDetect). International Conference on Computational Linguistics, January 2025, pp. 371–376.Paper ↗
  18. [C18] O. Beaumont, R. Bourgouin, M. Darrin, L. Marchal, and P. Piantanida, “Leveraging Expert Usage to Speed up LLM Inference with Expert Parallelism,” in Euro-Par 2025: Parallel Processing - 31st European Conference on Parallel and Distributed Processing, Dresden, Germany, August 25-29, 2025, Proceedings, Part I, ser. Lecture Notes in Computer Science, W. E. Nagel, D. Goehringer, and P. C. Diniz, Eds., vol. 15900. Springer, 2025, pp. 145–158.Paper ↗
  19. [C19] M. Dubois, F. Yvon, and P. Piantanida, “How Sampling Affects the Detectability of Machine- written texts: A Comprehensive Study,” in Findings of the Association for Computational Linguistics: EMNLP 2025, C. Christodoulopoulos, T. Chakraborty, C. Rose, and V. Peng, Eds. Suzhou, China: Association for Computational Linguistics, November 2025, pp. 11 369–11 387.Paper ↗arXiv ↗
  20. [C20] C. Presvôts, M. Kieffer, T. Prevost, P. Panciatici, Z. Li, and P. Piantanida, “Two-stage Multiple- Model Compression Approach for Sampled Electrical Signals,” in 2024 Data Compression Conference (DCC), A. Bilgin, J. E. Fowler, J. Serra-Sagristà, Y. Ye, and J. A. Storer, Eds. IEEE, 2024, pp. 522–531.Paper ↗
  21. [C21] M. Darrin, P. Formont, I. B. Ayed, J. C. Cheung, and P. Piantanida, “When is an Embedding Model More Promising than Another?” in Advances in Neural Information Processing Systems 37. Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2024, pp. 68 330– 68 379.Paper ↗arXiv ↗
  22. [C22] A. Altieri, M. Romanelli, G. Pichler, F. Alberge, and P. Piantanida, “Beyond the Norms: Detecting Prediction Errors in Regression Models,” in Proceedings of the 41st International Conference on Machine Learning, ser. Proceedings of Machine Learning Research, vol. 235. PMLR, 21–27 Jul 2024, pp. 1186–1221, (spotlight).Paper ↗arXiv ↗
  23. [C23] E. D. C. Gomes, M. Romanelli, G. Pichler, and P. Piantanida, “A Data-Driven Measure of Relative Uncertainty for Misclassification Detection,” in The Twelfth International Conference on Learning Representations, 2024.Paper ↗arXiv ↗
  24. [C24] M. Darrin, P. Formont, J. Cheung, and P. Piantanida, “COSMIC: Mutual Information for Task-Agnostic Summarization Evaluation,” in Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, August 2024, pp. 12 696–12 717, (oral).Paper ↗arXiv ↗
  25. [C25] M. Darrin, I. Arous, P. Piantanida, and J. Cheung, “GLIMPSE: Pragmatically Informative Multi- Document Summarization for Scholarly Reviews,” in Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, August 2024, pp. 12 737–12 752.Paper ↗arXiv ↗
  26. [C26] F. Granese, M. Romanelli, and P. Piantanida, “Optimal Zero-Shot Detector for Multi-Armed Attacks,” in Proceedings of The 27th International Conference on Artificial Intelligence and Statistics, ser. Proceedings of Machine Learning Research, S. Dasgupta, S. Mandt, and Y. Li, Eds., vol. 238. PMLR, 02–04 May 2024, pp. 2467–2475.Paper ↗arXiv ↗
  27. [C27] D. Gorla, L. Jalouzot, F. Granese, C. Palamidessi, and P. Piantanida, “On the (Im)Possibility of Estimating Various Notions of Differential Privacy (short paper),” in Proceedings of the 24th Italian Conference on Theoretical Computer Science, Palermo, Italy, September 13-15, 2023, ser. CEUR Workshop Proceedings, G. Castiglione and M. Sciortino, Eds., vol. 3587. CEUR-WS.org, 2023, pp. 219–224.Paper ↗arXiv ↗
  28. [C28] P. Colombo, M. Picot, N. Noiry, G. Staerman, and P. Piantanida, “Toward Stronger Textual Attack Detectors,” in Findings of the Association for Computational Linguistics: EMNLP 2023, H. Bouamor, J. Pino, and K. Bali, Eds. Association for Computational Linguistics, 2023, pp. 484–505.Paper ↗arXiv ↗
  29. [C29] M. Darrin, G. Staerman, E. D. C. Gomes, J. C. Cheung, P. Piantanida, and P. Colombo, “Unsupervised Layer-wise Score Aggregation for Textual OOD Detection,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38. Association for the Advancement of Artificial Intelligence (AAAI), February 2024, pp. 17 880–17 888.Paper ↗arXiv ↗
  30. [C30] P. Colombo, M. Peyrard, N. Noiry, R. West, and P. Piantanida, “The Glass Ceiling of Automatic Evaluation in Natural Language Generation,” in Findings of the Association for Computational Linguistics: IJCNLP-AACL 2023 (Findings), J. C. Park, Y. Arase, B. Hu, W. Lu, D. Wijaya, A. Purwarianti, and A. A. Krisnadhi, Eds. Nusa Dua, Bali: Association for Computational Linguistics, November 2023, pp. 178–183.Paper ↗arXiv ↗
  31. [C31] M. Darrin, P. Piantanida, and P. Colombo, “RainProof: An Umbrella to Shield Text Generator from Out-Of-Distribution Data,” in Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, H. Bouamor, J. Pino, and K. Bali, Eds. Singapore: Association for Computational Linguistics, December 2023, pp. 5831–5857.Paper ↗arXiv ↗
  32. [C32] P. Colombo, N. Noiry, G. Staerman, and P. Piantanida, “A Novel Information Theoretic Objective to Disentangle Representations for Fair Classification,” in Findings of the Association for Computational Linguistics: IJCNLP-AACL 2023 (Findings), J. C. Park, Y. Arase, B. Hu, W. Lu, D. Wijaya, A. Purwarianti, and A. A. Krisnadhi, Eds. Nusa Dua, Bali: Association for Computational Linguistics, November 2023, pp. 184–198.Paper ↗arXiv ↗
  33. [C33] P. Colombo, V. Pellegrain, M. Boudiaf, M. Tami, V. Storchan, I. Ayed, and P. Piantanida, “Transductive Learning for Textual Few-Shot Classification in API-based Embedding Models,” in Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, H. Bouamor, J. Pino, and K. Bali, Eds. Singapore: Association for Computational Linguistics, December 2023, pp. 4214–4231.Paper ↗arXiv ↗
  34. [C34] M. Boudiaf, E. Bennequin, M. Tami, C. Hudelot, A. Toubhans, P. Piantanida, and I. B. Ayed, “Open-Set Likelihood Maximization for Few-Shot Learning,” in 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2023, pp. 24 007–24 016.Paper ↗arXiv ↗
  35. [C35] P. Colombo, E. Dadalto, G. Staerman, N. Noiry, and P. Piantanida, “Beyond Mahalanobis Distance for Textual OOD Detection,” in Advances in Neural Information Processing Systems 35, S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, Eds., vol. 35. Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2022, pp. 17 744–17 759.Paper ↗arXiv ↗
  36. [C36] N. M. Guerreiro, P. Colombo, P. Piantanida, and A. Martins, “Optimal Transport for Unsu- pervised Hallucination Detection in Neural Machine Translation,” in Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Toronto, Canada: Association for Computational Linguistics, July 2023, pp. 13 766–13 784.Paper ↗arXiv ↗
  37. [C37] F. Granese, M. Picot, M. Romanelli, F. Messina, and P. Piantanida, “MEAD: A Multi- Armed Approach for Evaluation of Adversarial Examples Detectors,” in Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2022, Grenoble, France, September 19-23, 2022, Proceedings, Part III, ser. Lecture Notes in Computer Science, M. Amini, S. Canu, A. Fischer, T. Guns, P. K. Novak, and G. Tsoumakas, Eds., vol. 13715. Springer Nature Switzerland, 2022, pp. 286–303.Paper ↗arXiv ↗
  38. [C38] G. Pichler, P. J. A. Colombo, M. Boudiaf, G. Koliander, and P. Piantanida, “A Differential Entropy Estimator for Training Neural Networks,” in Proceedings of the 39th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 17–23 Jul 2022, pp. 17 691–17 715.Paper ↗arXiv ↗
  39. [C39] P. Colombo, G. Staerman, N. Noiry, and P. Piantanida, “Learning Disentangled Textual Representations via Statistical Measures of Similarity,” in Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Dublin, Ireland: Association for Computational Linguistics, May 2022, pp. 2614–2630, (spotlight).Paper ↗arXiv ↗
  40. [C40] G. Del Grosso, H. Jalalzai, G. Pichler, C. Palamidessi, and P. Piantanida, “Leveraging Adversarial Examples to Quantify Membership Information Leakage,” in 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, Jun 19, 2022 - Jun 24, 2022, New Orleans, Louisiana, Nov 16 2022, pp. 10 389–10 399.Paper ↗arXiv ↗
  41. [C41] S. Espinosa, J. F. Silva, and P. Piantanida, “A Data-Driven Quantization Design for Distributed Testing Against Independence with Communication Constraints,” in ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 22-27 May 2022 in Singapore. 2022, pp. 5238–5242.Paper ↗
  42. [C42] E. Dadalto Carama Gome, F. Alberge, P. Duhamel, and P. Piantanida, “Igeood: An Information Geometry Approach to Out-of-Distribution Detection ,” in The Tenth International Conference on Learning Representations, (Virtual) Mon Apr 25th through Fri the 29th 2022.Paper ↗arXiv ↗
  43. [C43] P. Colombo, C. Clavel, and P. Piantanida, “InfoLM: A New Metric to Evaluate Summarization & Data2Text Generation,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36. Association for the Advancement of Artificial Intelligence (AAAI), Feb. 22 - March 1 2022, pp. 10 554–10 562, doi:https://doi.org/10.1609/aaai.v36i10.21299 (Best Paper Award).Paper ↗arXiv ↗
  44. [C44] C. Pinzon, C. Palamidessi, P. Piantanida, and F. Valencia, “On the Impossibility of non-Trivial Accuracy in Presence of Fairness Constraints,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36. Association for the Advancement of Artificial Intelligence (AAAI), Feb. 22 - March 1 2022, pp. 7993–8000.Paper ↗arXiv ↗
  45. [C45] M. Picot, F. Messina, F. Labeau, and P. Piantanida, “Robust Autoencoder-based State Estimation in Power Systems,” in IEEE ISGT NA 2022: “Technology Solutions for an Evolving Grid”, February 21 - 24, Washington, DC, USA 2022
  46. [C46] G. Del Grosso, G. Pichler, C. Palamidessi, and P. Piantanida, “Formalizing Attribute and Membership Inference Attacks on Machine Learning Models,” in Privacy Preserving Machine Learning, Nov. 19th, Virtual ACM CCS 2021 Workshop 2021.Paper ↗
  47. [C47] E. Dadalto Carama Gome, F. Alberge, P. Duhamel, and P. Piantanida, “Igeood: An Informa- tion Geometry Approach to Out-of-Distribution Detection ,” in NeurIPS 2021 Workshop on Distribution Shifts, Dec 13th, 2021, Virtual 2021
  48. [C48] P. Colombo, G. Staerman, C. Clavel, and P. Piantanida, “Automatic Text Evaluation through the Lens of Wasserstein Barycenters,” in Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, November 2021, pp. 10 450–10 466.Paper ↗arXiv ↗
  49. [C49] F. Granese, M. Romanelli, D. Gorla, C. Palamidessi, and P. Piantanida, “DOCTOR: A Simple Method for Detecting Misclassification Errors,” in Advances in Neural Information Processing Systems, Dec 6th - 14th, 2021, Virtual 2021, (spotlight).Paper ↗arXiv ↗
  50. [C50] O. Veilleux, M. Boudiaf, P. Piantanida, and I. Ben Ayed, “Realistic evaluation of transductive few-shot learning,” in Advances in Neural Information Processing Systems, Dec 6th - 14th, 2021, Virtual 2021.Paper ↗arXiv ↗
  51. [C51] M. Benammar, E. Dadalto Carama Gome, and P. Piantanida, “CSI-aided Robust Neural-based Decoders,” in The 11th International Symposium on Topics in Coding, Virtual August 30th to September 3rd 2021
  52. [C52] P. Colombo, P. Piantanida, and C. Clavel, “A Novel Estimator of Mutual Information for Learning to Disentangle Textual Representations,” in Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). Association for Computational Linguistics, August 2021, pp. 6539–6550, (spotlight).Paper ↗arXiv ↗
  53. [C53] M. Boudiaf, H. Kervadec, I. M. Ziko, P. Piantanida, I. Ben Ayed, and J. Dolz, “Few-Shot Segmentation Without Meta-Learning: A Good Transductive Inference Is All You Need?” in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, Virtual Sat, Jun 19, 2021 – Fri, Jun 25, 2021 2021, pp. 13 974–13 983.Paper ↗arXiv ↗
  54. [C54] M. Vera, L. Rey Vega, and P. Piantanida, “Information and Regularization in Restricted Boltzmann Machines,” in ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, Sun, Jun 6, 2021 – Fri, Jun 11 2021, pp. 3155–3159.Paper ↗
  55. [C55] M. Shateri, F. Messina, P. Piantanida, and F. Labeau, “Learning Sparse Privacy-Preserving Representations for Smart Meters Data,” in EEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (IEEE SmartGridComm 2021), Oct. 25 - Oct. 28 2021.arXiv ↗
  56. [C56] M. Boudiaf, J. Rony, I. M. Ziko, E. Granger, M. Pedersoli, P. Piantanida, and I. Ben Ayed, “A Unifying Mutual Information View of Metric Learning: Cross-Entropy vs. Pairwise Losses,” in European Conference on Computer Vision (ECCV), 2020, pp. 548–564, (spotlight).Paper ↗arXiv ↗
  57. [C57] M. Boudiaf, I. Ziko, J. Rony, J. Dolz, I. Ben Ayed, and P. Piantanida, “Information Maximization for Few-Shot Learning,” in Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, Eds., vol. 33. Curran Associates, Inc., Dec 5th - 12th, 2020, Vancouver 2020, pp. 2445–2457.Paper ↗arXiv ↗
  58. [C58] M. Romanelli, K. Chatzikokolakis, C. Palamidessi, and P. Piantanida, “Estimating G-Leakage via Machine Learning,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, ser. CCS 2020. New York, NY, USA: ACM, 2020, pp. 697–716.Paper ↗arXiv ↗
  59. [C59] G. Del Grosso, G. Pichler, and P. Piantanida, “Privacy-Preserving Synthetic Smart Meters Data,” in 2021 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT). IEEE, February 15-18, Washington, DC, USA 2021, pp. 1–5.Paper ↗arXiv ↗
  60. [C60] M. Shateri, F. Messina, P. Piantanida, and F. Labeau, “On the Impact of Side Information on Smart Meter Privacy-Preserving Methods,” in 2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm). IEEE, October 2020, pp. 1–6.Paper ↗arXiv ↗
  61. [C61] G. Pichler, J. Dolz, I. Ben Ayed, and P. Piantanida, “On Direct Distribution Matching for Adapting Segmentation Networks,” in Proceedings of the Third Conference on Medical Imaging with Deep Learning, ser. Proceedings of Machine Learning Research, vol. 121. PMLR, 06–08 Jul 2020, pp. 624–637.Paper ↗arXiv ↗
  62. [C62] M. Shateri, F. Messina, P. Piantanida, and F. Labeau, “Privacy-Cost Management in Smart Meters Using Deep Reinforcement Learning,” in 2020 IEEE PES Innovative Smart Grid Technologies Europe (ISGT-Europe). IEEE, 2020, pp. 929–933.Paper ↗arXiv ↗
  63. [C63] C. Feutry, P. Piantanida, and P. Duhamel, “Learning Semi-supervised Anonymized Represen- tations by Mutual Information,” in ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, May 4 and May 8, Barcelona, Spain 2020, pp. 3467–3471.Paper ↗
  64. [C64] M. Shateri, F. Messina, P. Piantanida, and F. Labeau, “Recurrent Adversarial Training for Smart Meter Privacy,” in Montreal AI Symposium, August 2019
  65. [C65] ——, “Deep Directed Information-Based Learning for Privacy-Preserving Smart Meter Data Release,” in 2019 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm). IEEE, October 2019, pp. 1–7.Paper ↗arXiv ↗
  66. [C66] G. Pichler, J. Dolz, I. Ben Ayed, and P. Piantanida, “On Direct Distribution Matching for Adapting Segmentation Networks,” in Montreal AI Symposium, August 2019
  67. [C67] S. Espinosa, J. F. Silva, and P. Piantanida, “New Results on Testing Against Independence with Rate-Limited Constraints,” in 2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2019, pp. 1–5.Paper ↗
  68. [C68] E. de Chérisey, S. Guilley, O. Rioul, and P. Piantanida, “An Information-Theoretic Model for Side-Channel Attacks in Embedded Hardware,” in 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, July 7-12 2019, pp. 310–315.Paper ↗
  69. [C69] J. Silva and P. Piantanida, “Universal D-Semifaithfull Coding for Countably Infinite Alphabets,” in 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, July 7-12 2019, pp. 567–571.Paper ↗
  70. [C70] K. Wan, D. Tuninetti, M. Ji, and P. Piantanida, “A Novel Asymmetric Coded Placement in Combination Networks with End-User Caches,” in 2018 Information Theory and Applications Workshop (ITA). IEEE, Feb 2018, pp. 1–5.Paper ↗arXiv ↗
  71. [C71] ——, “Fundamental Limits of Distributed Data Shuffling,” in 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, Oct 2018, pp. 662–669.Paper ↗
  72. [C72] F. Alberge, C. Feutry, P. Duhamel, and P. Piantanida, “Detecting Covariate Shift with Black Box Predictors,” in 2019 26th International Conference on Telecommunications (ICT). IEEE, April 2019, pp. 324–329.Paper ↗
  73. [C73] L. Dogariu, S. Ciochina, C. Paleologu, J. Benesty, and P. Piantanida, “An Optimized LMS Algorithm for Bilinear Forms,” in 2018 International Symposium on Electronics and Telecom- munications (ISETC). IEEE, Nov 2018, pp. 1–4.Paper ↗
  74. [C74] C. Feutry, P. Piantanida, Y. Bengio, and P. Duhamel, “Learning Anonymized Representations with Adversarial Neural Networks,” in 2018 International Conference on Machine Learning, Stockholm, Sweden, Jul 10, 2018 – Jul 15 2018.arXiv ↗
  75. [C75] M. Vera, P. Piantanida, and L. R. Vega, “The Role of the Information Bottleneck in Represen- tation Learning,” in 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2018, pp. 1580–1584.Paper ↗
  76. [C76] K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches,” in 2018 IEEE International Symposium on Information Theory (ISIT), June 2018, pp. 1550–1554.Paper ↗
  77. [C77] ——, “Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology,” in 2018 IEEE International Conference on Communications (ICC). IEEE, May 2018, pp. 1–6.Paper ↗arXiv ↗
  78. [C78] G. Bassi, M. Skoglund, and P. Piantanida, “Lossy Communication Subject to Statistical Parameter Privacy,” in 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2018, pp. 1031–1035.Paper ↗
  79. [C79] A. Bunin, Z. Goldfeld, H. H. Permuter, S. Shamai, P. Cuff, and P. Piantanida, “Key-Message Security over State-Dependent Wiretap Channels,” in 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2018, pp. 136–140.Paper ↗
  80. [C80] L. M. Dogariu, S. Ciochin, C. Paleologu, J. Benesty, and P. Piantanida, “Identification of Bilinear Forms with the Kalman Filter,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, April 2018, pp. 4134–4138.Paper ↗
  81. [C81] M. Vera, P. Piantanida, and L. Rey Vega, “A learning algorithm with compression-based regularization,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, April 2018, pp. 2836–2840.Paper ↗
  82. [C82] K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology,” in IEEE ICC 2018 Communication Theory Symposium, 20 – 24 May, Kansas City, MO, USA, 2018.arXiv ↗
  83. [C83] ——, “Novel Outer Bounds for Combination Networks with End-User-Caches,” in 2017 IEEE Information Theory Workshop (ITW). IEEE, 2017, pp. 444–448.Paper ↗
  84. [C84] Q. Yang, P. Piantanida, and D. Gunduz, “ The Multi-Layer Information Bottleneck Problem,” in Information Theory Workshop (ITW), 2017 IEEE, Nov. 6th – 10th, 2017.arXiv ↗
  85. [C85] L. M. Dogariu, S. Ciochin, C. Paleologu, J. Benesty, and P. Piantanida, “An adaptive solution for nonlinear system identification,” in 2017 International Symposium on Signals, Circuits and Systems (ISSCS). IEEE, July 2017, pp. 1–4.Paper ↗
  86. [C86] C. He, S. Yang, and P. Piantanida, “A non-linear transmission scheme for the K-user broadcast channel with state feedback,” in 2016 International Symposium on Information Theory and Its Applications (ISITA), Oct 2016, pp. 101–105
  87. [C87] J. F. Silva and P. Piantanida, “The redundancy gains of almost lossless universal source coding over envelope families,” in 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2017, pp. 2003–2007.Paper ↗
  88. [C88] M. Vera, L. R. Vega, and P. Piantanida, “Distributed cooperative information bottleneck,” in 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2017, pp. 709–713.Paper ↗
  89. [C89] G. Pichler, P. Piantanida, and G. Matz, “A multiple description CEO problem with log-loss distortion,” in 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2017, pp. 111–115.Paper ↗
  90. [C90] M. Mhanna, P. Piantanida, and P. Duhamel, “Privacy-preserving quantization learning with applications to smart meters,” in 2017 IEEE International Conference on Communications (ICC). IEEE, May 2017, pp. 1–6.Paper ↗
  91. [C91] ——, “Privacy-preserving quantization learning for distributed binary decision with applications to smart meters,” in 2017 IEEE International Conference on Communications Workshops (ICC Workshops). IEEE, May 2017, pp. 1128–1133.Paper ↗
  92. [C92] K. Wan, D. Tuninetti, and P. Piantanida, “Novel delivery schemes for decentralized coded caching in the finite file size regime,” in 2017 IEEE International Conference on Communications Workshops (ICC Workshops). IEEE, May 2017, pp. 1183–1188.Paper ↗arXiv ↗
  93. [C93] K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “Novel inner bounds with uncoded cache placement for combination networks with end-user-caches,” in 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, Oct 2017, pp. 361–368.Paper ↗
  94. [C94] G. Katz, P. Piantanida, and M. Debbah, “A New Approach to Distributed Hypothesis Testing,” in 2016 50th Asilomar Conference on Signals, Systems and Computers. IEEE, Nov. 2016, pp. 1365–1369.Paper ↗
  95. [C95] A. Bunin, P. Piantanida, and S. S. Shitz, “The Gaussian wiretap channel with correlated sources at the terminals: Secret communication and key generation,” in 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE). IEEE, Nov 2016, pp. 1–5.Paper ↗
  96. [C96] J. F. Silva and P. Piantanida, “Almost lossless variable-length source coding on countably infinite alphabets,” in 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, July 2016, pp. 1–5.Paper ↗
  97. [C97] G. Pichler, P. Piantanida, and G. Matz, “Distributed information-theoretic biclustering,” in 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, July 2016, pp. 1083–1087.Paper ↗arXiv ↗
  98. [C98] G. Bassi, P. Piantanida, and S. Shamai, “Secret key generation over noisy channels with common randomness,” in 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, July 2016, pp. 510–514.Paper ↗
  99. [C99] G. Katz, P. Piantanida, and M. Debbah, “Collaborative distributed hypothesis testing with general hypotheses,” in 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, July 2016, pp. 1705–1709.Paper ↗
  100. [C100] K. Wan, D. Tuninetti, and P. Piantanida, “On caching with more users than files,” in 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, July 2016, pp. 135–139.Paper ↗arXiv ↗
  101. [C101] G. Pichler, P. Piantanida, and G. Matz, “Tight Upper Bound on the Mutual Information of Two Boolean Functions,” in 2016 IEEE Information Theory Workshop (ITW). IEEE, 2016, pp. 16–20.Paper ↗
  102. [C102] K.Wan, D. Tuninetti, and P. Piantanida, “On the Optimality of Uncoded Cache Placement,” in 2016 IEEE Information Theory Workshop (ITW). IEEE, 2016, pp. 161–165.Paper ↗arXiv ↗
  103. [C103] M. Mhanna, P. Duhamel, and P. Piantanida, “Quantization for distributed binary detection under secrecy constraints,” in 2016 IEEE International Conference on Communications (ICC). IEEE, May 2016, pp. 1–6.Paper ↗
  104. [C104] G. Pichler, P. Piantanida, and G. Matz, “Distributed information-theoretic biclustering of two memoryless sources,” in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, Sept 2015, pp. 426–433.Paper ↗
  105. [C105] G. Bassi, P. Piantanida, and S. Shamai, “The Wiretap Channel with Generalized Feedback: Secure Communication and Key Generation,” in 2015 IEEE Information Theory Workshop - Fall (ITW). IEEE, October 2015, pp. 282–286.Paper ↗arXiv ↗
  106. [C106] M. Vera, L. Rey Vega, and P. Piantanida, “The two-way cooperative Information Bottleneck,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2015, pp. 2131–2135.Paper ↗
  107. [C107] L. Rey Vega, P. Piantanida, and A. O. Hero, “On the rate-distortion regions for interactive source coding,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2015, pp. 1771–1775.Paper ↗
  108. [C108] G. Bassi, P. Piantanida, and S. Shamai, “On the capacity of the wiretap channel with generalized feedback,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2015, pp. 1154–1158.Paper ↗
  109. [C109] M. Benammar, P. Piantanida, and S. Shamai, “On Multiple Description coding for the Multicast Cognitive Interference Channel,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2015, pp. 2126–2130.Paper ↗
  110. [C110] M. Mhanna and P. Piantanida, “On secure distributed hypothesis testing,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2015, pp. 1605–1609.Paper ↗
  111. [C111] G. Katz, P. Piantanida, R. Couillet, and M. Debbah, “On the necessity of binning for the distributed hypothesis testing problem,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, June 2015, pp. 2797–2801.Paper ↗
  112. [C112] M. Benammar, P. Piantanida, and S. Shamai, “Capacity results for the Multicast Cognitive Interference Channel,” in 2015 IEEE Information Theory Workshop (ITW). IEEE, April 2015, pp. 1–5.Paper ↗arXiv ↗
  113. [C113] C. He, S. Yang, and P. Piantanida, “An achievable rate region of broadcast relay channel with state feedback,” in 2015 IEEE International Conference on Communications (ICC). IEEE, June 2015, pp. 4193–4198.Paper ↗
  114. [C114] A. El Hamss, L. Szczecinski, and P. Piantanida, “Increasing the throughput of HARQ via multi-packet transmission,” in 2014 IEEE Global Communications Conference. IEEE, Dec 2014, pp. 1485–1491.Paper ↗
  115. [C115] G. Katz, P. Piantanida, R. Couillet, and M. Debbah, “Joint estimation and detection against independence,” in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, Sept 2014, pp. 1220–1227.Paper ↗
  116. [C116] M. Benammar, P. Piantanida, and S. Shamai (Shitz), “Multiple Description Coding for the Compound Broadcast Channel,” in 2014 IEEE Information Theory Workshop (ITW 2014). IEEE, November 2014, pp. 566–570.Paper ↗
  117. [C117] M. Benammar and P. Piantanida, “On the secrecy capacity region of a class of parallel Wiretap Broadcast Channel,” in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, Sept 2014, pp. 1072–1077.Paper ↗
  118. [C118] ——, “On the secrecy capacity region of the Wiretap Broadcast Channel,” in 2014 IEEE Information Theory Workshop (ITW 2014). IEEE, Nov 2014, pp. 421–425.Paper ↗
  119. [C119] G. Bassi, P. Piantanida, and S. Yang, “Constant-gap results and cooperative strategies for a class of Interference Relay Channels,” in 2014 IEEE International Symposium on Information Theory. IEEE, June 2014, pp. 1421–1425.Paper ↗
  120. [C120] P. Piantanida, L. Vega, and A. Hero, “A proof of the Generalized Markov Lemma with countable infinite sources,” in 2014 IEEE International Symposium on Information Theory. IEEE, June 2014, pp. 591–595.Paper ↗
  121. [C121] R. Tandon, P. Piantanida, and S. Shamai, “On multi-user MISO wiretap channels with delayed CSIT,” in 2014 IEEE International Symposium on Information Theory. IEEE, June 2014, pp. 211–215.Paper ↗
  122. [C122] L. Rey Vega, P. Piantanida, and A. Hero, “On the three-terminal interactive lossy source coding problem,” in 2014 IEEE International Symposium on Information Theory. IEEE, June 2014, pp. 771–775.Paper ↗arXiv ↗
  123. [C123] G. Bassi, P. Piantanida, and S. Yang, “Capacity to within a Constant Gap for a Class of Interference Relay Channels,” in 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2013, pp. 1300–1306.Paper ↗
  124. [C124] P. Piantanida, M. Kobayashi, and G. Caire, “Analog Index Coding over Block-Fading MISO Broadcast Channels with Feedback,” in 2013 IEEE Information Theory Workshop (ITW). IEEE, 2013, pp. 1–5.Paper ↗
  125. [C125] M. Benammar and P. Piantanida, “On the Role of Interference Decoding in Compound Broadcast Channels,” in 2013 IEEE Information Theory Workshop (ITW). IEEE, 2013, pp. 1–5.Paper ↗
  126. [C126] J. Hoydis, R. Couillet, and P. Piantanida, “Bounds on the Second-Order Coding Rate of the MIMO Rayleigh Block-Fading Channel,” in 2013 IEEE International Symposium on Information Theory. IEEE, 2013, pp. 1526–1530.Paper ↗arXiv ↗
  127. [C127] A. Altieri, L. Vega, C. Galarza, and P. Piantanida, “Cooperative Unicasting in Large Wireless Networks ,” in 2013 IEEE International Symposium on Information Theory. IEEE, 2013, pp. 429–433.Paper ↗
  128. [C128] A. Behboodi and P. Piantanida, “Mixed Noisy Network Coding ,” in 2013 IEEE International Symposium on Information Theory. IEEE, 2013, pp. 2324–2328.Paper ↗
  129. [C129] J. Hoydis, R. Couillet, P. Piantanida, and M. Debbah, “A random matrix approach to the finite blocklength regime of MIMO fading channels,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, july 2012, pp. 2181–2185.Paper ↗
  130. [C130] A. Altieri, L. Vega, C. Galarza, and P. Piantanida, “Cooperation versus interference in large wireless relay networks,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, july 2012, pp. 611–615.Paper ↗
  131. [C131] M. Ivashkina, I. Andriyanova, P. Piantanida, and C. Poulliat, “Erasure-correcting vs. erasure- detecting codes for the full-duplex binary erasure relay channel,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, july 2012, pp. 945–949.Paper ↗
  132. [C132] A. Behboodi and P. Piantanida, “Selective coding strategy for unicast composite networks,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, july 2012, pp. 1321–1325.Paper ↗arXiv ↗
  133. [C133] J. Villard, P. Piantanida, and S. Shamai, “Secure transmission of a Gaussian source over Gaussian channels with side information,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, july 2012, pp. 1177–1181.Paper ↗
  134. [C134] A. Zaidi, P. Piantanida, and S. Shamai, “Wyner-Ziv type versus noisy network coding for a state-dependent MAC,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, july 2012, pp. 1682–1686.Paper ↗arXiv ↗
  135. [C135] C. G. Galarza, P. Piantanida, and M. Kountouris, “On the Block Error Probability of Finite- Length Codes in Decentralized Wireless Networks,” in 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 28 – 30 September 2011, pp. 1195–1201.Paper ↗
  136. [C136] A. Behboodi and P. Piantanida, “On the Asymptotic Error Probability of Composite Relay Channels,” in 2011 IEEE International Symposium on Information Theory Proceedings. IEEE, 2011, pp. 1524–1528.Paper ↗
  137. [C137] M. Ivashkina, I. Andriyanova, P. Piantanida, and C. Poulliat, “Block-Markov LDPC Scheme for Half- and Full-Duplex Erasure Relay Channel,” in 2011 IEEE International Symposium on Information Theory Proceedings. IEEE, 2011, pp. 1469–1473.Paper ↗
  138. [C138] J. Villard, P. Piantanida, and S. Shamai (Shitz), “Secure Lossy Source-Channel Wiretapping with Side Information at the Receiving Terminals,” in 2011 IEEE International Symposium on Information Theory Proceedings. IEEE, 2011, pp. 1141–1145.Paper ↗arXiv ↗
  139. [C139] A. Zaidi, P. Piantanida, and S. Shamai (Shitz), “Multiple Access Channel with States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder,” in 2011 IEEE International Symposium on Information Theory Proceedings. IEEE, 2011, pp. 2801–2805.Paper ↗arXiv ↗
  140. [C140] A. Altieri, L. Rey Vega, C. G. Galarza, and P. Piantanida, “Cooperative Strategies for Interference-Limited Wireless Networks,” in 2011 IEEE International Symposium on Information Theory Proceedings. IEEE, 2011, pp. 1623–1627.Paper ↗arXiv ↗
  141. [C141] S. Yang, P. Piantanida, M. Kobayashi, and S. Shamai (Shitz), “On the Secrecy Degrees of Freedom of Multi-Antenna Wiretap Channels with Delayed CSIT,” in 2011 IEEE International Symposium on Information Theory Proceedings. IEEE, 2011, pp. 2866–2870.Paper ↗arXiv ↗
  142. [C142] M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the Multi-Antenna Wiretap Channel with Delayed CSI at the Transmitter,” in VALUETOOLS – Workshop on Secure Wireless Networks (SECURENETS), May 20 2011
  143. [C143] A. Zaidi, P. Piantanida, and S. Shamai (Shitz), “Capacity of Multiple Access Channel with Noncausal and Strictly Causal States at the Encoders,” in NEWCOM++ / COST 2100 Joint Workshop on Wireless Communications (JNCW 2011), 2011
  144. [C144] M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the Secrecy Degrees of Freedom of MISO Wiretap Channels with Delayed CSIT,” in NEWCOM++ / COST 2100 Joint Workshop on Wireless Communications (JNCW 2011), 2011
  145. [C145] A. Behboodi and P. Piantanida, “Broadcasting over the relay channel with oblivious cooperative strategy,” in 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 29 2010-oct. 1 2010, pp. 1098–1103.Paper ↗arXiv ↗
  146. [C146] J. Villard and P. Piantanida, “Secure lossy source coding with side information at the decoders,” in 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 29 2010-oct. 1 2010, pp. 733–739.Paper ↗arXiv ↗
  147. [C147] A. Behboodi and P. Piantanida, “On the simultaneous relay channel with collocated relay and destination nodes,” in Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010 Proceedings of the 8th International Symposium on, 31 2010-june 4 2010, pp. 437–442
  148. [C148] P. Piantanida and S. Shamai (Shitz), “On the capacity of compound state-dependent channels with states known at the transmitter,” in 2010 IEEE International Symposium on Information Theory. IEEE, june 2010, pp. 624–628.Paper ↗arXiv ↗
  149. [C149] M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the secrecy degress of freedom of the multi-antenna block fading wiretap channels,” in 2010 IEEE International Symposium on Information Theory. IEEE, june 2010, pp. 2563–2567.Paper ↗arXiv ↗
  150. [C150] A. Behboodi and P. Piantanida, “Capacity of a class of broadcast relay channels,” in 2010 IEEE International Symposium on Information Theory. IEEE, june 2010, pp. 590–594.Paper ↗arXiv ↗
  151. [C151] A. Zaidi, S. Shamai (Shitz), P. Piantanida, and L. Vandendorpe, “Bounds on the capacity of the relay channel with noncausal state information at source,” in 2010 IEEE International Symposium on Information Theory. IEEE, june 2010, pp. 639–643.Paper ↗arXiv ↗
  152. [C152] M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the Secrecy Degrees of Freedom of the Multi-Antenna Block Fading Wiretap Channels,” in Future Network and MobileSummit 2010 Conference and Exhibition, 16-18 June 2010, Florence, Italy 2010
  153. [C153] A. Zaidi, S. Shamai (Shitz), P. Piantanida, and P. Vandendorpe, “Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source,” in Future Network and MobileSummit 2010 Conference and Exhibition, 16-18 June 2010, Florence, Italy 2010
  154. [C154] J. Villard, P. Bianchi, E. Moulines, and P. Piantanida, “High-rate quantization for the Neyman- Pearson detection of Hidden Markov Processes,” in IEEE Information Theory Workshop 2010 (ITW 2010). IEEE, jan. 2010, pp. 1–5.Paper ↗arXiv ↗
  155. [C155] P. Piantanida and S. Shamai (Shitz), “Capacity of compound state-dependent channels with states known at the transmitter,” in 2009 IEEE International Symposium on Information Theory. IEEE, 28 2009-july 3 2009, pp. 1968–1972.Paper ↗
  156. [C156] A. Behboodi and P. Piantanida, “On the simultaneous relay channel with informed receivers,” in 2009 IEEE International Symposium on Information Theory. IEEE, 28 2009-july 3 2009, pp. 1179–1183.Paper ↗
  157. [C157] P. Piantanida and S. Shamai (Shitz), “Capacity of compound state-dependant channels with state information at the transmitter,” in Proc. of NEWCOM - ACoRN Joint Workshop, March 30-April 1,Barcelona, Spain 2009
  158. [C158] P. Layec, P. Piantanida, R. Visoz, and A. Berthet, “Transceiver design for sum-MSE optimization in MIMO-MAC with imperfect channel estimation,” in Signals, Systems and Computers, 2008 42nd Asilomar Conference on, oct. 2008, pp. 321–325.Paper ↗
  159. [C159] A. Venkiah, P. Piantanida, C. Poullia, P. Duhamel, and D. Declercq, “Rateless coding for quasi-static fading channels using channel estimation accuracy,” in 2008 IEEE International Symposium on Information Theory. IEEE, july 2008, pp. 2257–2261.Paper ↗
  160. [C160] P. Layec, P. Piantanida, R. Visoz, and A. Berthet, “Capacity of channels with multistage successive refinement of quantized feedback information via noisy links,” in 2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications. IEEE, july 2008, pp. 176–180.Paper ↗
  161. [C161] ——, “Capacity bounds for MIMO multiple access channel with imperfect channel state information,” in 2008 IEEE Information Theory Workshop. IEEE, May 2008, pp. 21–25.Paper ↗
  162. [C162] P. Piantanida, S. Sadough, and P. Duhamel, “On the Outage Capacity of a Practical Decoder Using Channel Estimation Accuracy,” in 2007 IEEE International Symposium on Information Theory. IEEE, june 2007, pp. 2281–2285.Paper ↗arXiv ↗
  163. [C163] S. Sadough, P. Piantanida, and P. Duhamel, “MIMO-OFDM optimal decoding and achievable information rates under imperfect channel estimation,” in 2007 IEEE 8th Workshop on Signal Processing Advances in Wireless Communications. IEEE, june 2007, pp. 1–5.Paper ↗arXiv ↗
  164. [C164] P. Piantanida and P. Duhamel, “Dirty-Paper Coding without Channel Information at the Transmitter and Imperfect Estimation at the Receiver,” in 2007 IEEE International Conference on Communications. IEEE, june 2007, pp. 5406–5411.Paper ↗arXiv ↗
  165. [C165] ——, “On the Capacity of the Fading MIMO Broadcast Channel Without Channel Information at the Transmitter and Imperfect Estimation at the Receivers,” in 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP ’07, vol. 3. IEEE, april 2007, pp. III–409–III–412.Paper ↗
  166. [C166] ——, “Achievable Rates for the Fading MIMO Broadcast Channel with Imperfect Channel Estimation,” in Communication, Control, and Computing (Allerton), 2010 44th Annual Allerton Conference on, Sep. 27-29 2006
  167. [C167] S. Sadough, P. Piantanida, and P. Duhamel, “Achievable Outage Rates with Improved Decoding of BICM Multiband OFDM under Channel Estimation Errors,” in 2006 Fortieth Asilomar Conference on Signals, Systems and Computers. IEEE, 29 2006-nov. 1 2006, pp. 1806–1810.Paper ↗arXiv ↗
  168. [C168] P. Piantanida, G. Matz, and P. Duhamel, “Outage Behavior of Discrete Memoryless Chan- nels Under Channel Estimation Errors,” in Proceedings of the International Symposium on Information Theory and its Applications (ISITA), 2006, pp. 417–422.arXiv ↗
  169. [C169] ——, “Estimation-Induced Outage Capacity of Ricean Channels,” in 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications. IEEE, july 2006, pp. 1–5.Paper ↗
  170. [C170] A. Zaidi and P. Piantanida, “MAC Aware Coding Strategy for Multiple User Information Embedding,” in 2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings, vol. 5. IEEE, may 2006, pp. V–393–V–396.Paper ↗
  171. [C171] A. Zaidi, P. Piantanida, and P. Duhamel, “Scalar scheme for Multiple User Information Embedding,” in Proceedings. (ICASSP ’05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., vol. 2. IEEE, 18-23, 2005, pp. 5–8.Paper ↗
  172. [C172] P. Piantanida, S. Lasaulce, and P. Duhamel, “Broadcast Channels with Noncausal Side Information: Coding Theorem and Application Example,” in Proc. Winterschool on Coding and Information Theory, Feb. 20-25, , Bratislava, Slovakia 2005
  173. [C173] P. Piantanida and C. Estienne, “Maximum Entropy Good-Turing Estimator for Language Modeling,” in 8th European Conference on Speech Communication and Technology (Eurospeech 2003). ISCA, September 1-4, Geneva, Switzerland 2003, pp. 2277–2280. Invited Papers in proceedings of international conferencesPaper ↗arXiv ↗
  174. [InvC1] M. Benammar and P. Piantanida, “On Robust Deep Neural Decoders,” in 2019 53rd Asilomar Conference on Signals, Systems, and Computers. IEEE, Oct 2019, pp. 527–531.
  175. [InvC2] K. Wan, D. Tuninetti, P. Piantanida, and M. Ji, “On Combination Networks with Cache- aided Relays and Users,” in WSA 2018; 22nd International ITG Workshop on Smart Antennas, March 2018, pp. 1–7.
  176. [InvC3] M. Benammar and P. Piantanida, “Optimal Training Channel Statistics for Neural-based Decoders,” in 2018 52nd Asilomar Conference on Signals, Systems, and Computers. IEEE, Oct 2018, pp. 2157–2161.
  177. [InvC4] K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “Recent Advances on Combination Networks with End-User Caches,” in Information Theory and Applications Workshop (ITA), Catamaran Resort, Pacific Beach, San Diego., Feubrary 11th – 16th 2018
  178. [InvC5] K. Wan, D. Tuninetti, M. Ji, and P. Piantanida, “State-of-the-art in cache-aided combination networks,” in 2017 51st Asilomar Conference on Signals, Systems, and Computers. IEEE, Oct 2017, pp. 641–645.
  179. [InvC6] K. Wan, D. Tuninetti, P. Piantanida, and M. Ji, “On Cache-aided Relay Networks,” in The 22nd International ITG Workshop on Smart Antennas (WSA 2018), Bochum, Germany, March 14 - 16 2018
  180. [InvC7] K. Wan, D. Tuninetti, and P. Piantanida, “A novel index coding scheme and its application to coded caching,” in 2017 Information Theory and Applications Workshop (ITA). IEEE, Feb 2017, pp. 1–6.
  181. [InvC8] K. Wan, D. Tuninetti, M. Ji, and P. Piantanida, “State-of-the-art in cache-aided combination networks,” in 2017 51st Asilomar Conference on Signals, Systems, and Computers. IEEE, Oct 2017, pp. 641–645.
  182. [InvC9] A. Bunin, Z. Goldfeld, H. H. Permuter, S. Shamai (Shitz), P. Cuff, and P. Piantanida, “Semantically-Secured Message-Key Trade-Off over Wiretap Channels with Random Param- eters,” in Proceedings of the 2nd Workshop on Communication Security, M. Baldi, E. A. Quaglia, and S. Tomasin, Eds. Cham: Springer International Publishing, 2018, pp. 33–48.
  183. [InvC10] G. Bassi, P. Piantanida, and S. Shamai (Shitz), “The Role of Noisy Feedback in Secure Communications,” in EuCNC’2015 - European Conference on Networks and Communications, 2015
  184. [InvC11] A. Altieri, P. Piantanida, L. Vega, and C. Galarza, “A stochastic geometry approach to distributed caching in large wireless networks,” in 2014 11th International Symposium on Wireless Communications Systems (ISWCS). IEEE, Aug 2014, pp. 863–867.
  185. [InvC12] C. He, S. Yang, and P. Piantanida, “On the capacity of the fading broadcast channel with state feedback,” in 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP). IEEE, May 2014, pp. 182–185.
  186. [InvC13] M. Benammar, P. Piantanida, and S. Shamai (Shitz), “Dirty-paper Coding Techniques for Compound MISO Broadcast Channels: A DoF Analysis,” in Proceedings of the 9th International Conference on Cognitive Radio Oriented Wireless Networks. ICST, June 2014.
  187. [InvC14] A. Adhikary, P. Piantanida, M. Kobayashi, H. Papadopoulos, and G. Caire, “CSI Dissemi- nation for MU-MIMO Schemes Based on Outdated CSI,” in 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2012, pp. 1672–1679.
  188. [InvC15] A. Behboodi and P. Piantanida, “Selective Coding Strategy for composite relay channels,” in 2012 5th International Symposium on Communications, Control and Signal Processing. IEEE, may 2012, pp. 1–6.
  189. [InvC16] ——, “On the asymptotic spectrum of the error probability of composite networks,” in 2012 IEEE Information Theory Workshop. IEEE, sept. 2012, pp. 148–152.
  190. [InvC17] A. Altieri, L. Rey Vega, C. Galarza, and P. Piantanida, “On the balance between cooperation and interference in dense wireless networks,” in Wireless Communication Systems (ISWCS), 2012 International Symposium on, aug. 2012, pp. 1009–1013.
  191. [InvC18] J. Villard, P. Piantanida, and S. Shamai (Shitz), “Hybrid Digital/Analog Schemes for Secure Transmission with Side Information,” in 2011 IEEE Information Theory Workshop. IEEE, 16 – 20 October 2011, pp. 678–682.
  192. [InvC19] J. Villard and P. Piantanida, “Secure Distributed Lossless Compression with Side Informa- tion at the Eavesdropper,” in VALUETOOLS – Workshop on Secure Wireless Networks (SECURENETS), May 20 2011.
  193. [InvC20] A. Zaidi, S. Shamai (Shitz), P. Piantanida, and L. Vandendorpe, “On the capacity of a class of relay channels with orthogonal components and noncausal state information at source,” in IEEE 5th International Symposium on Wireless Pervasive Computing 2010. IEEE, May 2010, pp. 528–533. Proceedings of national conferences
  194. [NatC1] R. Mouravieff, T. Herserant, A. Satouf, H. A. Boubacar, P. Piantanida, V. Guigue, S. Lam- prier, and B. Piwowarski, “DQE : Génération de données diversifiées par agents pour le question-réponse sur tables,” in Actes de la 21e Conférence en Recherche d’Information et Applications. Volume 1 : articles scientifiques originaux, N. HERNANDEZ and S. QUINIOU, Eds. Nantes, France: ATALA, Jun. 2026, pp. 94–106.
  195. [NatC2] F. Alberge, C. Feutry, P. Piantanida, and P. Duhamel, “A Simple Statistical Method to Detect Covariate Shift,” in Colloque GRETSI - Traitement du Signal et des Images (GRETSI 2019), August 2019
  196. [NatC3] M. Picot, F. Messina, P. Piantanida, and F. Labeau, “Modelling the Uncertainty of a Deep Neural Network Enhances its Adversarial Robustness,” in Colloque GRETSI - Traitement du Signal et des Images (GRETSI 2019), August 2019
  197. [NatC4] V. Matias, L. Rey Vega, and P. Piantanida, “Algoritmo Iterativo Multitarea con un Enfoque de Teoría de Información,” in Proc. of XVII Workshop in Information Processing and Control (RPIC 2017), 20 – 22 September 2017
  198. [NatC5] A. Altieri, L. Rey Vega, P. Piantanida, and C. G. Galarza, “Performance of Cooperative Strategies on Dense Wireless Networks,” in Proc. of XIV Workshop in Information Processing and Control (RPIC 2011), 16 – 18 November 2011
  199. [NatC6] J. Villard and P. Piantanida, “Codage de source sous contrainte de sécurité avec information adjacente aux récepteurs,” in XXIIIe Colloque GRETSI - Traitement du Signal et des Images (GRETSI 2011), 5-8 September 2011
  200. [NatC7] A. Behboodi and P. Piantanida, “Cooperative Strategies for Simultaneous Relay Channels,” in XXIIIe Colloque GRETSI - Traitement du Signal et des Images (GRETSI 2011), 5-8 September 2011
  201. [NatC8] P. Piantanida and C. Estienne, “Improving Backing-off by Considering Extended Contexts,” in Proc. of Workshop in Information Processing and Control (RPIC), October 10-14, San Nicolas, Argentina 2003
  202. [NatC9] P. Piantanida, N. Barraza, and C. Estienne, “Una nueva familia de estimadores de Prob- abilidades de n-gramas en Modelos Coersitivos,” in Proc. of Workshop in Information Processing and Control (RPIC), October 10-14, San Nicolas, Argentina 2003
  203. [NatC10] C. Estienne, P. Pelle, and P. Piantanida, “A Front-end for Speech Recognition Systems Using Phase-Locked Loops,” in Proc. of Workshop in Information Processing and Control (RPIC), October 10-14, San Nicolas, Argentina 2001, pp. 88–91

Book chapters and technical reports (3)

  1. [B1] P. Piantanida and L. R. Vega, Information Bottleneck and Representation Learning. Cambridge University Press, 2021, pp. 330–358, doi:10.1017/9781108616799.012.
  2. [B2] F. Regol, J. Chataoui, B. Charpentier, M. Coates, P. Piantanida, and S. Gunnemann, “Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE,” 2024.
  3. [B3] G. Pichler, P. Piantanida, and G. Koliander, “On the estimation of information measures of continuous distributions,” CoRR, vol. abs/2002.02851, 2020.

Theses (3)

  1. [R1] P. Piantanida, “Information-theoretic methods: From communication to decision, privacy and learning, at the heart of data sciences,” HDR (Habilitation à diriger des recherches), Université Paris-Saclay, Gif-sur-Yvette, France, Tech. Rep., May 2019.HAL ↗
  2. [R2] ——, “Multi-user information theory: State information and imperfect channel knowledge,” Ph.D. dissertation, Université Paris-Sud, Gif-sur-Yvette, France, May 2007.
  3. [R3] ——, “Statistical language modeling using maximal entropy methods,” Master’s thesis, Buenos Aires University (UBA), Buenos Aires, Argentina, September 2003