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

80159239318 · Jun 202019922001200920172026
48 results for cost signal manipulation

Study cyber-attacks on RL algorithms, focusing on cost signal manipulation.

problem Adversarial manipulation of cost signals in reinforcement learning.
method Quantitative analysis of TD(λλ) and QQ-learning algorithms under manipulation.
result Bound on approximation error for TD(λλ) and convergence properties for QQ-learning under stealthy attacks.

Many problems in image processing and computer vision (e.g. colorization, style transfer) can be posed as 'manipulating' an input image into a corresponding output image given a user-specified guiding signal. A holy-grail solution towards generic image manipulation should be able to efficiently alter an input image wit…

2017-03-21abs ↗pdf ↗

Study on costs of manipulating AMM-based price oracles.

problem Cost of manipulation in AMM-based on-chain price oracles.
method Analyzes the robustness of AMM-based oracles to strategic manipulation, considering different aggregation methods and market conditions.
result Manipulation costs depend on the total quote depth and can be minimized by optimal liquidity weights.

New framework reduces strategic manipulation cost for minority groups in fair classification.

problem Strategic manipulation disparities in fair classification.
method Constrained optimization framework that constructs classifiers to reduce strategic manipulation cost for minority groups.
result Empirically, the approach reduces strategic manipulation cost for minority groups over multiple real-world datasets.

Randomized classifiers improve strategic classification efficiency.

problem Designing optimal classifiers in strategic classification games.
method Investigation of randomized classifiers and their efficiency in strategic classification.
result Randomized classifiers are necessary for maximizing classification efficiency.

The paper analyzes how leverage affects manipulation in event-linked markets, offering new insights into regulation.

problem Manipulation and insider information in leveraged event-linked markets.
method Develops a two-axis manipulation taxonomy and analyzes leverage's effects on market-price and outcome manipulation.
result Leverage scales market-price manipulation linearly but shifts the cost-benefit threshold for outcome manipulation.

Modified Perceptron handles strategic agents with limited position changes.

problem Learning linear classifiers in the presence of strategic agents that can manipulate their positions.
method Developed a modified Perceptron algorithm with bounded mistakes under various manipulation costs.
result The modified Perceptron achieves bounded mistakes even when manipulation costs are unknown.

Study strategic dynamic pricing for buyers with unknown manipulation costs.

problem Strategic buyers manipulate their features to get lower prices, hindering profit maximization.
method Proposes a strategic dynamic pricing policy that incorporates strategic behavior and binary response data.
result Achieves sublinear regret bound of O(T)O(\sqrt{T}) compared to linear Ω(T)Ω(T) regret of non-strategic policies.

This paper studies poisoning attacks in episodic RL and discovers their effectiveness depends on reward bounds.

problem Understanding security threats to RL algorithms through poisoning attacks.
method Examined two types of poisoning attacks: reward and action manipulation, in bounded and unbounded reward settings.
result The effectiveness of poisoning attacks depends on reward bounds, with different attack costs and success rates.

When consequential decisions are informed by algorithmic input, individuals may feel compelled to alter their behavior in order to gain a system's approval. Models of agent responsiveness, termed "strategic manipulation," analyze the interaction between a learner and agents in a world where all agents are equally able …

2018-08-27abs ↗pdf ↗

Study allocates resources to strategic agents while balancing cost and incentives.

problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) social welfare regret, satisfies all cost constraints, and ensures incentive alignment.

Proposes a method to boost deep reinforcement learning with sparse rewards.

problem Challenges in learning complex behaviors with long horizons and sparse rewards.
method Predictive coding for reward shaping.
result Achieves better learning by providing reward signals that understand environment dynamics and emphasize useful features.

Defines cost of MEV and shows its relevance in various settings.

problem Excess value miners can realize by manipulating transaction order.
method Introduces a simple theoretical definition of cost of MEV, proves properties, and provides examples.
result Reveals the cost of MEV is related to the 'smoothness' of a function over the symmetric group.

Robot learns to manipulate objects using multiple geometric representations.

problem Manipulation tasks are poorly represented by Cartesian coordinates.
method Extends Gaussian distributions on Riemannian manifolds to analyze demonstrations, formulating the problem as an optimal control problem.
result Robot can generalize manipulation tasks using multiple geometric representations.

In the information-based approach to asset pricing the market filtration is modelled explicitly as a superposition of signals concerning relevant market factors and independent noise. The rate at which the signal is revealed to the market then determines the overall magnitude of asset volatility. By letting this inform…

2010-09-20abs ↗pdf ↗

Generative networks have made it possible to generate meaningful signals such as images and texts from simple noise. Recently, generative methods based on GAN and VAE were developed for graphs and graph signals. However, the mathematical properties of these methods are unclear, and training good generative models is di…

2018-09-28abs ↗pdf ↗

This paper tackles fair online decision-making in contextual bandits, achieving optimal performance and fairness.

problem Fairness in online decision-making systems under strategic manipulation.
method Develops algorithms for linear and smooth reward functions, maintaining fairness and optimal regret.
result Achieves nearly minimax-optimal regret with strong fairness guarantees, even in the presence of attacks.

When encountering novel objects, humans are able to infer a wide range of physical properties such as mass, friction and deformability by interacting with them in a goal driven way. This process of active interaction is in the same spirit as a scientist performing experiments to discover hidden facts. Recent advances i…

2016-11-06abs ↗pdf ↗

This paper improves self-play learning in games by manipulating experience distributions.

problem Improving self-play learning in games through better experience sampling.
method Three approaches: weighted sampling, Prioritized Experience Replay, and diversifying trajectories.
result Major improvements in early training performance in some games, minor improvements overall.

Study on optimal information acquisition in Kyle model with entropy cost.

problem Optimal information acquisition in Kyle model with entropy cost.
method Continuous signals are optimal, and any signal with a logit posterior distribution yields the same ex-ante value.
result Posterior expected payoff becomes normally distributed as information acquisition cost increases.

We model the impact costs of a strategy that trades a basket of correlated instruments, by extending to the multivariate case the linear propagator model previously used for single instruments. Our specification allows us to calibrate a cost model that is free of arbitrage and price manipulation. We illustrate our resu…

2017-02-13abs ↗pdf ↗

We compare optimal static and dynamic solutions in trade execution. An optimal trade execution problem is considered where a trader is looking at a short-term price predictive signal while trading. When the trader creates an instantaneous market impact, it is shown that transaction costs of optimal adaptive strategies …

2018-11-27abs ↗pdf ↗

The paper presents a novel approach of spoofing wireless signals by using a general adversarial network (GAN) to generate and transmit synthetic signals that cannot be reliably distinguished from intended signals. It is of paramount importance to authenticate wireless signals at the PHY layer before they proceed throug…

2019-05-03abs ↗pdf ↗

AIMM-X monitors markets for suspicious behavior using transparent scoring.

problem Detecting market manipulation from benign mechanisms.
method Combines microstructure signals and public attention signals for anomaly detection.
result Transparent scoring allows tracing and understanding flagged windows.

Despite recent advances, large scale visual artifacts are still a common occurrence in images generated by GANs. Previous work has focused on improving the generator's capability to accurately imitate the data distribution pdatap_{data}. In this paper, we instead explore methods that enable GANs to actively avoid errors b…

2017-07-03abs ↗pdf ↗

Research examines how strategic latency manipulation impacts Ethereum's network efficiency and decentralization.

problem Impact of artificial latency on Ethereum's network efficiency and decentralization.
method Comprehensive analysis of MEV-Boost auction system and empirical validation with a pilot.
result Increased profitability for node operators and significant systemic challenges like heightened network inefficiencies and centralization risks.

This study proposes a trainable adaptive window switching (AWS) method and apply it to a deep-neural-network (DNN) for speech enhancement in the modified discrete cosine transform domain. Time-frequency (T-F) mask processing in the short-time Fourier transform (STFT)-domain is a typical speech enhancement method. To re…

2018-11-05abs ↗pdf ↗

Goal-oriented reinforcement learning has recently been a practical framework for robotic manipulation tasks, in which an agent is required to reach a certain goal defined by a function on the state space. However, the sparsity of such reward definition makes traditional reinforcement learning algorithms very inefficien…

2019-06-10abs ↗pdf ↗

A Markov-chain model is developed for the purpose estimation of the cure rate of non-performing loans. The technique is performed collectively, on portfolios and it can be applicable in the process of calculation of credit impairment. It is efficient in terms of data manipulation costs which makes it accessible even to…

2018-05-30abs ↗pdf ↗

A framework disentangles controllable objects from visual signals for improved RL.

problem Improving sample efficiency and game performance in vision-based RL.
method Action-conditioned video prediction to disentangle controllable objects.
result Improved sample efficiency and game performance in Atari games.

This work improves RL for complex robotic tasks by guiding exploration with task-specific goal distributions.

problem Solving long-horizon, complex sequential tasks in robotics with sparse rewards.
method Extends hindsight relabelling to task-specific goal distributions using a small set of demonstrations.
result Significantly higher overall performance on complex robotic manipulation tasks.

Optimizes portfolio with two controls to minimize trades and maintain signal integrity.

problem Optimizing a single-asset portfolio with transaction costs and signal autocorrelation.
method Formulated an optimization problem to minimize trades while maintaining signal integrity and achieving maximum return.
result Locally optimal solution minimizes trades and achieves maximum return, with a quantifiable improvement based on threshold and autocorrelation removed.

AI learns market manipulation through simulation, suggesting regulation.

problem Regulating AI to prevent market manipulation.
method Used a genetic algorithm in an artificial market simulation.
result AI discovered market manipulation as an optimal strategy.

Study finds no statistically significant trading edge in MNQ futures signals from OHLCV data.

problem Testing intraday momentum signals from OHLCV data in MNQ futures under realistic execution constraints.
method 947 trading days of five-minute data, 14 signal families evaluated, strict institutional criteria applied.
result No signal satisfies all criteria simultaneously, gross edge insufficient to overcome costs.

This thesis enhances ML reliability by selectively abstaining from predictions when uncertain.

problem Improving reliability in machine learning systems, especially in high-stakes domains.
method Exploiting uncertainty signals from training trajectories to develop lightweight, post-hoc abstention methods compatible with differential privacy.
result A robust trajectory-based approach to selective prediction that maintains high accuracy under privacy noise.

New model improves neural network robustness against input manipulations.

problem Improving neural network robustness against input manipulations.
method Causal view and deep causal manipulation augmented model (deep CAMA) with data augmentation and test-time fine-tuning.
result Deep CAMA shows superior robustness against unseen manipulations compared to traditional models.