Adversarial perturbations and RIS interaction vectors improve covert communication.
problem Covert communication in the presence of RISs.
method Designing RIS interaction vectors to balance receiver and eavesdropper detection, adding adversarial perturbations to signals.
result Adversarial perturbations and RIS interaction vectors can be jointly designed to boost covert communications.
Evidence acquisition costs influence disclosure behavior and preference.
problem How evidence acquisition costs affect disclosure behavior and preference.
method Analyzes sender-receiver interactions with covert and overt evidence acquisition, varying certification costs.
result Equilibria converge to the Pareto-worst free-learning equilibrium as costs vanish, and receivers prefer covert to overt acquisition.
RIGA watermarks DNNs covertly and robustly with minimal accuracy loss.
problem Watermarking deep neural networks to enable tracing after release.
method Robust white-box GAN watermarking using adversarial training.
result Significantly improves covertness and robustness over state-of-the-art.
A novel unified Bayesian framework for network detection is developed, under which a detection algorithm is derived based on random walks on graphs. The algorithm detects threat networks using partial observations of their activity, and is proved to be optimum in the Neyman-Pearson sense. The algorithm is defined by a …
Framework detects covert financial market manipulation using LOB representations.
problem Detecting covert financial market manipulation (spoofing) from complex anomaly patterns in multilevel prices.
method Cascaded contrastive representation learning of LOB data.
result Transformer-based architectures achieve state-of-the-art results in detection performance.
Adversarial machine learning hides 5G communications from eavesdroppers.
problem Hiding 5G communications from eavesdroppers using DL classifiers.
method Craft adversarial perturbations to fool DL classifiers.
result Adversarial perturbations can hide 5G communications with high probability.
Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.
problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.
Theory explains power-law distributions without complex models.
problem Understanding power-law distributions in geometrically growing systems.
method Developed a theory of geometrically growing systems and applied it to explain various distributions.
result The geometrically growing system's distribution flattens over time, increasing relative size ratios.
The functional and structural representation of the brain as a complex network is marked by the fact that the comparison of noisy and intrinsically correlated high-dimensional structures between experimental conditions or groups shuns typical mass univariate methods. Furthermore most network estimation methods cannot d…
OCCER uses regression models to classify data points as outliers.
problem One-class classification problem where training data is only from the target class.
method OCCER converts OCC to many regression problems, computes outlier scores from regression errors.
result OCCER outperforms state-of-the-art algorithms on various datasets.
Network detection is an important capability in many areas of applied research in which data can be represented as a graph of entities and relationships. Oftentimes the object of interest is a relatively small subgraph in an enormous, potentially uninteresting background. This aspect characterizes network detection as …
New model detects hidden group structures in criminal networks.
problem Challenges in identifying group structures in criminal networks with noisy data.
method Developed an extended stochastic block model (ESBM) to infer group structures.
result Unveiled complex block structures in an Italian mafia network.