Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

69138207276 · Jun 202019922001200920172026
48 results for input obfuscation

We inject undetectable backdoors into obfuscated neural networks and language models.

problem Safeguarding models from sophisticated adversarial attacks.
method Developed a strategy to plant undetectable backdoors in obfuscated neural networks and language models.
result Undetectable backdoors can be planted in obfuscated models, even if weights and architecture are accessible.

This paper detects function-level obfuscation in binary code using graph-based methods.

problem Detecting and characterizing function-level obfuscation in binary code.
method Graph-based approaches, including GNNs, are compared on various datasets.
result GNNs outperform baselines in function-level obfuscation detection, especially in a 11-class classification task.

In this work we revisit gradient regularization for adversarial robustness with some new ingredients. First, we derive new per-image theoretical robustness bounds based on local gradient information. These bounds strongly motivate input gradient regularization. Second, we implement a scaleable version of input gradient…

2019-05-27abs ↗pdf ↗

Adversarial training is an effective methodology for training deep neural networks that are robust against adversarial, norm-bounded perturbations. However, the computational cost of adversarial training grows prohibitively as the size of the model and number of input dimensions increase. Further, training against less…

2019-07-04abs ↗pdf ↗

The goal of homomorphic encryption is to encrypt data such that another party can operate on it without being explicitly exposed to the content of the original data. We introduce an idea for a privacy-preserving transformation on natural language data, inspired by homomorphic encryption. Our primary tool is {\em obfusc…

2019-04-21abs ↗pdf ↗

Identifying features that leak information about sensitive attributes is a key challenge in the design of information obfuscation mechanisms. In this paper, we propose a framework to identify information-leaking features via information density estimation. Here, features whose information densities exceed a pre-defined…

2019-10-17abs ↗pdf ↗

We consider the problem of obfuscating sensitive information while preserving utility, and we propose a machine learning approach inspired by the generative adversarial networks paradigm. The idea is to set up two nets: the generator, that tries to produce an optimal obfuscation mechanism to protect the data, and the c…

2019-04-01abs ↗pdf ↗

This work enhances collaborative inference privacy by minimizing conditional entropy and boosting robustness against model inversion attacks.

problem Privacy leakage in collaborative inference systems via model inversion attacks.
method Theoretical proof and derivation of a differentiable measure for bounding conditional entropy, followed by a CEM algorithm to maximize it.
result Theoretical proof and experimental validation show that CEM consistently boosts inversion robustness without compromising feature utility or efficiency.

Improves code2vec for Java classes by obfuscating variable names.

problem Code2vec's reliance on variable names makes it vulnerable to typos and attacks.
method Obfuscate variable names during code2vec training and aggregate method embeddings for class-level predictions.
result Obfuscated variable names improve model's robustness and accuracy.

Deep neural networks require large amounts of resources which makes them hard to use on resource constrained devices such as Internet-of-things devices. Offloading the computations to the cloud can circumvent these constraints but introduces a privacy risk since the operator of the cloud is not necessarily trustworthy.…

2018-05-30abs ↗pdf ↗

Clustering algorithms have been increasingly adopted in security applications to spot dangerous or illicit activities. However, they have not been originally devised to deal with deliberate attack attempts that may aim to subvert the clustering process itself. Whether clustering can be safely adopted in such settings r…

2018-11-25abs ↗pdf ↗

Recurrent neural networks (RNNs) are powerful constructs capable of modeling complex systems, up to and including Turing Machines. However, learning such complex models from finite training sets can be difficult. In this paper we empirically show that RNNs can learn models of computer peripheral devices through input a…

2018-05-21abs ↗pdf ↗

The Internet of Things (IoT) will be a main data generation infrastructure for achieving better system intelligence. However, the extensive data collection and processing in IoT also engender various privacy concerns. This paper provides a taxonomy of the existing privacy-preserving machine learning approaches develope…

2019-09-21abs ↗pdf ↗

LLMs detect market patterns through causal reasoning, not just temporal association.

problem Detecting structural market patterns in financial data.
method Obfuscation testing using the WHO-WHOM-WHAT framework.
result LLMs achieve 71.5% detection rate of market patterns without temporal context.

NKI integrates obfuscated datasets using nonlinear kernels for improved data collaboration.

problem Privacy-preserving data collaboration with reduced reconstruction risk.
method Formulates linear kernel integration, kernelizes it, and introduces graph regularization and centering constraints.
result NKI improves classification accuracy over existing linear integration methods under nonlinear dimensionality reduction.

SONet stabilizes ODE networks for robustness without adversarial training.

problem Improving adversarial robustness of neural networks without sacrificing natural accuracy.
method SONet uses skew-symmetric ODE blocks and DOPRI5 solver for robustness.
result SONet achieves comparable robustness to adversarial defense methods without trade-off.

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

Adversarial examples are perturbed inputs designed to fool machine learning models. Adversarial training injects such examples into training data to increase robustness. To scale this technique to large datasets, perturbations are crafted using fast single-step methods that maximize a linear approximation of the model'…

2017-05-19abs ↗pdf ↗

New defense method inspired by encryption improves visual classification accuracy.

problem Conventional defenses reduce accuracy and are defeated by obfuscated gradients.
method Block-wise pixel shuffling with secret key for training and test images.
result Achieves high accuracy (91.55%) on clean images and (89.66%) on adversarial examples.

We consider the problem of detecting malware with deep learning models, where the malware may be combined with significant amounts of benign code. Examples of this include piggybacking and trojan horse attacks on a system, where malicious behavior is hidden within a useful application. Such added flexibility in augment…

2020-02-10abs ↗pdf ↗

Paper defends sensitive attributes in GNNs from inference attacks.

problem Protecting sensitive attributes in GNNs from inference attacks.
method Proposes adversarial training with TV and Wasserstein distance to locally filter sensitive attributes.
result Framework creates strong defense against inference attacks with minimal performance loss.

Adversarial training is the most successful empirical method for increasing the robustness of neural networks against adversarial attacks. However, the most effective approaches, like training with Projected Gradient Descent (PGD) are accompanied by high computational complexity. In this paper, we present two ideas tha…

2020-02-24abs ↗pdf ↗

Paper proposes a method to encrypt faces while maintaining visual similarity.

problem Protecting personal data from unauthorized face recognition.
method Targeted identity-protection iterative method (TIP-IM) to generate adversarial identity masks.
result TIP-IM provides 95%+ protection success rate against face recognition models.

A new method improves adversarial robustness and interpretability with reduced training time.

problem Adversarial attacks on deep neural networks.
method A novel regularizer incorporating first and second order information via a quadratic approximation to the adversarial loss.
result Single iteration of the proposed regularizer achieves stronger robustness than prior methods.

This work proposes a novel privacy-preserving method for synthetic replacement of sensitive data.

problem Privacy-preserving transformations of sensitive data.
method Adversarial representation learning for synthetic replacement of private attributes.
result Our method provides stronger privacy and better utility than previous methods.

Interpretability and fairness are critical in computer vision and machine learning applications, in particular when dealing with human outcomes, e.g. inviting or not inviting for a job interview based on application materials that may include photographs. One promising direction to achieve fairness is by learning data …

2018-10-15abs ↗pdf ↗

The authors seek financial datasets to benchmark feature engineering methods on US market data.

problem Improving predictive models for financial data science competitions.
method Feature engineering methods applied to multivariate time-series data from the US market.
result Predictive power of models tested against Numerai-Signals targets.

Bayesian deep learning for graphs improves graph classification and prediction tasks.

problem Graph classification reproducibility issues and lack of uncertainty quantification.
method Developed a Bayesian Deep Learning framework for graph learning, considering discrete and continuous edge features.
result Produces unsupervised embeddings for graph classification tasks reaching state-of-the-art performance.

With the celebrated success of deep learning, some attempts to develop effective methods for detecting malicious PowerShell programs employ neural nets in a traditional natural language processing setup while others employ convolutional neural nets to detect obfuscated malicious commands at a character level. While the…

2018-10-03abs ↗pdf ↗

Information systems have widely been the target of malware attacks. Traditional signature-based malicious program detection algorithms can only detect known malware and are prone to evasion techniques such as binary obfuscation, while behavior-based approaches highly rely on the malware training samples and incur prohi…

2019-10-17abs ↗pdf ↗

New mechanisms from primate vision improve neural network robustness.

problem Demonstrating robust neural networks to small adversarial perturbations.
method Investigated two biologically plausible mechanisms: non-uniform retina sampling and receptive field diversity.
result Non-uniform retina sampling and receptive field diversity improve adversarial robustness.

Identifying meaningful signal buried in noise is a problem of interest arising in diverse scenarios of data-driven modeling. We present here a theoretical framework for exploiting intrinsic geometry in data that resists noise corruption, and might be identifiable under severe obfuscation. Our approach is based on uncov…

2018-01-25abs ↗pdf ↗

This paper improves privacy and fairness in federated learning by protecting sensitive data and ensuring group fairness.

problem Privacy and fairness issues in federated learning.
method Introduces group privacy through dd-privacy, a localized form of differential privacy.
result The method provides better group fairness than a global model in federated learning.

New methods interpret clustering outcomes without altering data structure.

problem Post-processing methods destroy data integrity and obscure interpretations.
method Algorithm-agnostic interpretation methods using permutation feature importance, individual conditional expectation, and partial dependence.
result Preserves original feature structure and explains clustering outcomes.