New method steals deep neural network knowledge using unlabeled data.
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.
Trend · papers per month
Establishing unique identities for both humans and end systems has been an active research problem in the security community, giving rise to innovative machine learning-based authentication techniques. Although such techniques offer an automated method to establish identity, they have not been vetted against sophistica…
Study examines adversarial robustness of ANN variants, revealing differences in black-box settings.
Recent advances in machine learning, especially techniques such as deep neural networks, are enabling a range of emerging applications. One such example is autonomous driving, which often relies on deep learning for perception. However, deep learning-based perception has been shown to be vulnerable to a host of subtle …
Adversarial training is one of the strongest defenses against adversarial attacks, but it requires adversarial examples to be generated for every mini-batch during optimization. The expense of producing these examples during training often precludes adversarial training from use on complex image datasets. In this study…
Proposes a framework for automated radiation therapy treatment planning with uncertainty quantification.
We propose two main applications of Gyöngy (1986)'s construction of inhomogeneous Markovian stochastic differential equations that mimick the one-dimensional marginals of continuous Itô processes. Firstly, we prove Dupire (1994) and Derman and Kani (1994)'s result. We then present Bessel-based stochastic volatility mod…
We study a variant of the source identification game with training data in which part of the training data is corrupted by an attacker. In the addressed scenario, the defender aims at deciding whether a test sequence has been drawn according to a discrete memoryless source , whose statistics are known to hi…
We consider a group of mean-variance investors with mimicking desire such that each investor is willing to penalize deviations of his portfolio composition from compositions of other group members. Penalizing norm constraints are already applied for statistical improvement of Markowitz portfolio procedure in order to c…
Solving inverse problems continues to be a central challenge in computer vision. Existing techniques either explicitly construct an inverse mapping using prior knowledge about the corruption, or learn the inverse directly using a large collection of examples. However, in practice, the nature of corruption may be unknow…
The ultimate value of theories of the fundamental mechanisms comprising the asset price in financial systems will be reflected in the capacity of such theories to understand these systems. Although the models that explain the various states of financial markets offer substantial evidences from the fields of finance, ma…
Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces. We show that in many cases, researchers using these tools have derived conclusions that are incorrect, trivial, or limited.
Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces and homotopy invariant fixed point theory. We show that in many cases, researchers using these tools have derived conclusions that are incorrect or tr…
Develops a dynamic latent-factor model for high-dimensional asset characteristics.
Transformers can implement reinforcement learning algorithms from data without updates.
MODULE solves LfO problem with high sample efficiency and stability.
The main result is the construction of ergodic transversal measures of full support on the space of all k-surfaces of a compact hyperbolic 3-manifold. This space is a laminated space, each of its leaf being identified with a "complete" k-surface, i.e. a surface of constant (extrinsic) curvature k, where k belongs to ]0…
"Feint Attack", as a new type of APT attack, has become the focus of attention. It adopts a multi-stage attacks mode which can be concluded as a combination of virtual attacks and real attacks. Under the cover of virtual attacks, real attacks can achieve the real purpose of the attacker, as a result, it often caused hu…
This paper studies adversarial attacks on Gaussian process bandits.
Subpopulation attacks poison data to misclassify naturally distributed points.
Reward-poisoning attacks can force RL agents to learn bad policies, and we categorize and quantify their feasibility.
Spanning attack improves black-box attacks with unlabeled data.
Headless attacks bypass classification heads to fool transfer learning models.
New attack manipulates UCB algorithm, new defense algorithm reduces pseudo-regret.
This paper explores evasion attacks against Bayesian models.
Adversarial attacks pose a threat to deep neural networks, especially in safety-critical applications.
Adversarial attacks hide cyber-physical attacks in ICS.
New approach deflects adversarial attacks by causing them to resemble target classes.
RayS attack improves hard-label adversarial attacks by reducing query complexity and identifying false robust models.
Depending on how much information an adversary can access to, adversarial attacks can be classified as white-box attack and black-box attack. For white-box attack, optimization-based attack algorithms such as projected gradient descent (PGD) can achieve relatively high attack success rates within moderate iterates. How…
New method handles uncertainty in adversarial attacks using ensemble noise simulation.
Control policies, trained using the Deep Reinforcement Learning, have been recently shown to be vulnerable to adversarial attacks introducing even very small perturbations to the policy input. The attacks proposed so far have been designed using heuristics, and build on existing adversarial example crafting techniques …
New attacks reveal membership in label-only ML models.
Adversarial attacks for image classification are small perturbations to images that are designed to cause misclassification by a model. Adversarial attacks formally correspond to an optimization problem: find a minimum norm image perturbation, constrained to cause misclassification. A number of effective attacks have b…
This paper proposes multi-view attack strategies for deep models.
New attacks can infer model training membership using only label predictions, not confidence.
Study of rotating gravastars with de Sitter interiors and Kerr exteriors.
Pixle attacks images by rearranging pixels, bypassing neural networks.
Efficiently attacks large-scale graphs without using the whole graph.
Most state-of-the-art machine learning (ML) classification systems are vulnerable to adversarial perturbations. As a consequence, adversarial robustness poses a significant challenge for the deployment of ML-based systems in safety- and security-critical environments like autonomous driving, disease detection or unmann…
We introduce two tactics to attack agents trained by deep reinforcement learning algorithms using adversarial examples, namely the strategically-timed attack and the enchanting attack. In the strategically-timed attack, the adversary aims at minimizing the agent's reward by only attacking the agent at a small subset of…
A new method uses adversarial attacks to detect other adversarial attacks.
Study on reward poisoning attacks on CMAB, revealing attackability depends on adversary's knowledge.
Many machine learning algorithms are vulnerable to almost imperceptible perturbations of their inputs. So far it was unclear how much risk adversarial perturbations carry for the safety of real-world machine learning applications because most methods used to generate such perturbations rely either on detailed model inf…
New black-box attack method improves GNN defense without needing training data.
Robustness of Deep Reinforcement Learning (DRL) algorithms towards adversarial attacks in real world applications such as those deployed in cyber-physical systems (CPS) are of increasing concern. Numerous studies have investigated the mechanisms of attacks on the RL agent's state space. Nonetheless, attacks on the RL a…
Transferability captures the ability of an attack against a machine-learning model to be effective against a different, potentially unknown, model. Empirical evidence for transferability has been shown in previous work, but the underlying reasons why an attack transfers or not are not yet well understood. In this paper…
Recent studies show that Deep Reinforcement Learning (DRL) models are vulnerable to adversarial attacks, which attack DRL models by adding small perturbations to the observations. However, some attacks assume full availability of the victim model, and some require a huge amount of computation, making them less feasible…