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,742 papers · 148 categories

Trend · papers per month

57114170227 · Jun 202019922001200920172026
48 results for free rider attacks

New study tackles free-rider attacks in federated learning models.

problem Free-rider attacks compromise federated learning models by non-contributing to data updates.
method Theoretical and experimental analysis of iterative federated learning schemes, including FedAvg and FedProx.
result Formal guarantees for free-rider attacks to converge to aggregated models of fair participants.

A new federated learning framework ensures fairness and robustness.

problem Collaborative fairness and adversarial robustness in federated learning.
method RFFL framework with a reputation mechanism to identify and remove non-contributing or malicious participants.
result RFFL achieves high fairness and robustness to different types of adversaries.

Paper proposes an ensemble of attacks to evaluate adversarial robustness more reliably.

problem Insufficient evaluation of adversarial defenses leads to incorrect robustness assessments.
method Developed two extensions of PGD-attack and combined them with two complementary attacks.
result Identified several broken defenses with lower robust test accuracy than reported.

We study the role of active and passive investors in an investment market with uncertainties. Active investors concentrate on a single or a few stocks with a given probability of determining the quality of them. Passive investors spread their investment uniformly, resembling buying the market index. In this toy market …

2001-04-18abs ↗pdf ↗

Paper proposes a method to generate adversarial perturbations for black-box attacks without accessing inner states.

problem Generating adversarial perturbations for black-box attacks without accessing inner states of a DNN.
method Matrix-free generation method that requires fewer query trials.
result The proposed method successfully deceives a DNN for semantic segmentation more effectively than random noise.

Adversarial training, in which a network is trained on adversarial examples, is one of the few defenses against adversarial attacks that withstands strong attacks. Unfortunately, the high cost of generating strong adversarial examples makes standard adversarial training impractical on large-scale problems like ImageNet…

2019-04-29abs ↗pdf ↗

Paper proposes B3D method for black-box backdoor detection.

problem Detecting backdoor attacks in black-box models without access to training data.
method Gradient-free optimization to reverse-engineer triggers, simple strategy for reliable predictions.
result Effectiveness of B3D method corroborated on hundreds of DNN models.

We consider a stochastic game of contribution to the common good in which the players have continuous control over the degree of contribution, and we examine the gradualism arising from the free rider effect. This game belongs to the class of variable concession games which generalize wars of attrition. Previously know…

2019-03-31abs ↗pdf ↗

Paper proposes a deep RL method for hedging variable annuities, outperforming misspecified models.

problem Model miscalibration in variable annuity contracts with GMMB and GMDB riders.
method Two-phase deep reinforcement learning approach: training phase in a controlled environment, online learning phase in real market.
result Trained reinforcement learning agent hedges equally well as correct Delta in training phase and outperforms misspecified Deltas.

Recent studies have highlighted that deep neural networks (DNNs) are vulnerable to adversarial attacks, even in a black-box scenario. However, most of the existing black-box attack algorithms need to make a huge amount of queries to perform attacks, which is not practical in the real world. We note one of the main reas…

2018-09-09abs ↗pdf ↗

Paper addresses Byzantine attacks in decentralized optimization over networks.

problem Byzantine attacks in decentralized stochastic optimization over static and time-varying networks.
method Formulate a TV norm-penalized approximation of the problem, solve using stochastic subgradient method.
result Proposed method reaches a neighborhood of the Byzantine-free optimal solution.

Study robustness of split conformal prediction under adversarial attacks.

problem Ensuring distribution-free coverage guarantees in CP under adversarial conditions.
method Theoretical analysis and extensive experiments on split conformal prediction robustness.
result Prediction coverage varies with calibration-time attack strength, enabling control over coverage under adversarial tests.

Smart reply systems have been developed for various messaging platforms. In this paper, we introduce Uber's smart reply system: one-click-chat (OCC), which is a key enhanced feature on top of the Uber in-app chat system. It enables driver-partners to quickly respond to rider messages using smart replies. The smart repl…

2019-07-18abs ↗pdf ↗

MACER trains robust models without adversarial training, faster and more effective.

problem Learning robust models without relying on attack-dependent adversarial training.
method MACER trains provably robust smoothed classifiers by maximizing certified radius.
result MACER achieves larger average certified radius and faster training time compared to state-of-the-art methods.

It has recently been shown that neural networks but also other classifiers are vulnerable to so called adversarial attacks e.g. in object recognition an almost non-perceivable change of the image changes the decision of the classifier. Relatively fast heuristics have been proposed to produce these adversarial inputs bu…

2018-11-28abs ↗pdf ↗

During the last years, a remarkable breakthrough has been made in AI domain thanks to artificial deep neural networks that achieved a great success in many machine learning tasks in computer vision, natural language processing, speech recognition, malware detection and so on. However, they are highly vulnerable to easi…

2018-03-26abs ↗pdf ↗

New attacks exploit transfer learning to misclassify text models.

problem Misclassification attacks against transfer learned text classifiers.
method Novel attack algorithms using unintended features from teacher models.
result Transfer learning increases vulnerability to misclassification attacks.

We study the natural map eta between a group of binary planar trees whose leaves are labeled by elements of a free abelian group H and a certain group D(H) derived from the free Lie algebra over H. Both of these groups arise in several different topological contexts. The map eta is known to be an isomorphism over Q, bu…

2005-04-13abs ↗pdf ↗

DAD++ improves test-time adversarial defense without access to training data.

problem Improving adversarial robustness of pre-trained models without access to training data.
method Test-time Data-free Adversarial Defense (DAD++) with detection and correction schemes.
result DAD++ significantly improves adversarial robustness with minimal clean accuracy drop.

This paper investigates recently proposed approaches for defending against adversarial examples and evaluating adversarial robustness. We motivate 'adversarial risk' as an objective for achieving models robust to worst-case inputs. We then frame commonly used attacks and evaluation metrics as defining a tractable surro…

2018-02-15abs ↗pdf ↗

We consider the black-box adversarial setting, where the adversary has to generate adversarial perturbations without access to the target models to compute gradients. Previous methods tried to approximate the gradient either by using a transfer gradient of a surrogate white-box model, or based on the query feedback. Ho…

2019-06-17abs ↗pdf ↗

While great progress has been made at making neural networks effective across a wide range of visual tasks, most models are surprisingly vulnerable. This frailness takes the form of small, carefully chosen perturbations of their input, known as adversarial examples, which represent a security threat for learned vision …

2019-06-10abs ↗pdf ↗

Semantic paraphrases can fool financial sentiment classifiers due to geometric shifts in model representations.

problem Semantic paraphrase attacks on financial sentiment classifiers
method Developing a continuous local model of semantic paraphrase perturbations
result The worst-case local displacement of the target representation is governed by the largest generalised eigenvalue of a matrix pencil constructed from the Jacobians of the two embedding maps.

Numerous methods for crafting adversarial examples were proposed recently with high success rate. Since most existing machine learning based classifiers normalize images into some continuous, real vector, domain firstly, attacks often craft adversarial examples in such domain. However, "adversarial" examples may become…

2019-05-19abs ↗pdf ↗

Proposes a method to improve Byzantine-robustness in compressed federated learning.

problem Byzantine-robustness in compressed federated learning.
method Gradient difference compression and stochastic average gradient algorithm (SAGA).
result The proposed method reaches a neighborhood of the optimal solution at a linear convergence rate.

Enhances neural network robustness with polyhedral envelope regularization.

problem Improving neural network robustness against adversarial attacks.
method Introduces polyhedral envelope regularization to bound the robustness region.
result Demonstrates improved robustness guarantees with minimal computational overhead.