BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Andrea M. Tonello

Andrea M. Tonello contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Information TheoryMachine Learningmath.ITeess.SPArtificial IntelligenceCryptography and Security

Trust snapshot

Quick read

Trust 19 - UnverifiedVerification L1Unclaimed author
5works
0followers
6topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Empty SPACE: Cross-Attention Sparsity for Concept Erasure in Diffusion Models

Erasing specific concepts from text-to-image diffusion models is essential for avoiding the generation of copyrighted and explicit content. Closed-form concept erasure methods offer a fast alternative to backpropagation-based techniques, but they become less effective when scaling from smaller models such as Stable Diffusion 1.5 to larger models like Stable Diffusion XL. To maintain erasure effectiveness in these larger-scale architectures, we propose SParse cross-Attention-based Concept Erasure (SPACE). SPACE iteratively modifies the cross-attention parameters of a model with a closed-form update that jointly induces sparsity and erases target concepts. By concentrating the concept mapping to a lower-dimensional subspace, SPACE achieves superior erasure efficacy compared to dense baselines. Extensive experimental results show improvements in erasure effectiveness and robustness against adversarial prompts. Furthermore, SPACE achieves 80\%-90\% cross-attention sparsity, reducing the storage requirements for saving the modified parameters by 70\%, demonstrating its memory efficiency.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

A Close Examination of the Multipath Propagation Stochastic Model for Communications over Power Lines

This paper focuses on the parameterization of the multipath propagation model (MPM) for indoor broadband power line communications (PLC), which up to now has been established in an heuristic way. The MPM model was initially proposed in the PLC context for outdoor channels in the band up to 20 MHz, but its number of parameters becomes extremely large when used to model indoor channel frequency responses (CFR), which are much more frequency-selective than outdoor ones, and the band is extended to 80 MHz. This work proposes a fitting procedure that addresses this problem. It allows determining the model parameters that yield the best fit to each channel of a large database of single-input single-output (SISO) experimental measurements acquired in typical home premises of different European countries. Then, the statistics of the MPM parameters are analyzed. The study unveils the relation between the model parameters and the main characteristics of the actual CFR like the frequency selectivity and the average attenuation. It also estimates the probability density function (PDF) of each parameter and proposes a fitting distribution for each of them. Moreover, the relationship among the main parameters of the model, as well as their impact on the performance of PLC communication systems are also explored. Provided results can be helpful for the development of MPM-based models for indoor broadband PLC.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

MIND: Maximum Mutual Information Based Neural Decoder

We are assisting at a growing interest in the development of learning architectures with application to digital communication systems. Herein, we consider the detection/decoding problem. We aim at developing an optimal neural architecture for such a task. The definition of the optimal criterion is a fundamental step. We propose to use the mutual information (MI) of the channel input-output signal pair, which yields to the minimization of the a-posteriori information of the transmitted codeword given the communication channel output observation. The computation of the a-posteriori information is a formidable task, and for the majority of channels it is unknown. Therefore, it has to be learned. For such an objective, we propose a novel neural estimator based on a discriminative formulation. This leads to the derivation of the mutual information neural decoder (MIND). The developed neural architecture is capable not only to solve the decoding problem in unknown channels, but also to return an estimate of the average MI achieved with the coding scheme, as well as the decoding error probability. Several numerical results are reported and compared with maximum a-posteriori and maximum likelihood decoding strategies.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Capacity-Approaching Autoencoders for Communications

The autoencoder concept has fostered the reinterpretation and the design of modern communication systems. It consists of an encoder, a channel, and a decoder block which modify their internal neural structure in an end-to-end learning fashion. However, the current approach to train an autoencoder relies on the use of the cross-entropy loss function. This approach can be prone to overfitting issues and often fails to learn an optimal system and signal representation (code). In addition, less is known about the autoencoder ability to design channel capacity-approaching codes, i.e., codes that maximize the input-output information under a certain power constraint. The task being even more formidable for an unknown channel for which the capacity is unknown and therefore it has to be learnt. In this paper, we address the challenge of designing capacity-approaching codes by incorporating the presence of the communication channel into a novel loss function for the autoencoder training. In particular, we exploit the mutual information between the transmitted and received signals as a regularization term in the cross-entropy loss function, with the aim of controlling the amount of information stored. By jointly maximizing the mutual information and minimizing the cross-entropy, we propose a methodology that a) computes an estimate of the channel capacity and b) constructs an optimal coded signal approaching it. Several simulation results offer evidence of the potentiality of the proposed method.

0 citations0 reviewsNo code linkedOpen access
preprint2018arXiv

Physical Layer Key Generation for Secure Power Line Communications

Leakage of information in power line communication networks is a threat to privacy and security both in smart grids and in-home applications. A way to enhance security is to encode the transmitted information with a secret key. Relying on the channel properties, it is possible to generate a common key at the two communication ends without transmitting it through the broadcast channel. Since the key is generated locally, it is intrinsically secure from a possible eavesdropper. Most of the existing physical layer key generation techniques have been developed for symmetric channels. However, the power line channel is in general not symmetric, but just reciprocal. Therefore, in this paper, we propose two novel methods that exploit the reciprocity of the power line channel to generate common information at the two intended users. This information is processed through different quantization techniques to generate secret keys. To assess the security of the generated keys, we analyze the spatial correlation of the power line channels and verify the low correlation of the possible eavesdropping channels. The two proposed methods are tested on a measurement dataset. The results show that the information leaked to possible eavesdroppers has very low correlation to any secret key.

0 citations0 reviewsNo code linkedOpen access