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

0.6%1.3%1.9%2.6% · Jun 202519922001200920172026
48 results for strategic replication

New algorithm prevents strategic replication in multi-armed bandit problems.

problem Strategic replication by agents can exploit bandit algorithms' balance.
method Designs Hierarchical UCB (H-UCB) and Robust Hierarchical UCB (RH-UCB) algorithms.
result Achieves O(lnT)O(\ln T)-regret and sublinear regret in realistic scenarios.

Study liquidity provision in decentralized exchanges considering risk aversion and replication costs.

problem Economic viability of liquidity provision in decentralized exchanges (DEXs).
method Formulated strategic interactions as a sequential game with risk-averse LP, traders, and arbitrageurs.
result DEX liquidity depth is crucial for risk management, influenced by risk aversion and replication costs.

Paper examines financial engineering problems and introduces AlphaZero for better replication strategies.

problem Replication portfolio construction in incomplete markets with non-convex constraints.
method Introduces AlphaZero-based system to compare with deep hedging method.
result AlphaZero outperforms deep hedging in non-convex environments, finding near-optimal strategies.

LLMs mimic human traders in finance, but not as much as expected.

problem Evaluating how LLMs behave in financial markets.
method Adapted experimental design with LLMs and human traders, analyzed in single and mixed model settings.
result LLMs tend to price assets near their fundamental value, but not as much as humans, and show less trading strategy variance.

Study explores algorithmic collusion in repeated games using various learning dynamics.

problem Understanding algorithmic collusion in repeated games with different learning dynamics.
method Examines QQ-learning, gradient learning, and other dynamics in a general repeated game setting.
result Characterizes the set of payoff vectors achievable by these dynamics, revealing possibilities for collusion.

Paper generalizes strategic classification framework and introduces SVC for PAC-learning.

problem Strategic manipulation of testing data to fool classifiers.
method Unified framework for strategic classification, strategic VC-dimension (SVC).
result Characterizes the learnability and computational tractability of linear classifiers.

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.

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.

Study compares employers with and without anticipating strategic labor force responses.

problem Understanding and optimizing strategic interactions in labor markets.
method Formulation of causal strategic classification, theory, and experiments.
result Performatively optimal hiring policies improve employer and labor outcomes, but can also harm labor force utility.

New study on replicability and stability in machine learning algorithms.

problem Ensuring consistent results in machine learning models without fixing randomness.
method Introduced global stability and list replicability concepts, proving their equivalence and boosting list replicability.
result Global stability can only be achieved weakly, while list replicability can be boosted to achieve high probability of consistent results.

Study on computational aspects of replicable learning, bridging statistical and algorithmic perspectives.

problem Understanding the computational connections between replicability and various learning paradigms.
method Design of replicable learners, lifting framework, and transformation techniques.
result Efficient replicable learners for specific learning problems under various distributions.

New algorithm learns optimal policies in strategic MDPs with private types.

problem Optimal policy learning in strategic MDPs with private types and information asymmetry.
method PLAN algorithm using instrumental variable regression and pessimism principle.
result PLAN achieves near-optimal policy with 1/K1 / \sqrt{K} optimality.

Deep neural network (DNN) has demonstrated its success in multiple domains. However, DNN models are inherently vulnerable to adversarial examples, which are generated by adding adversarial perturbations to benign inputs to fool the DNN model to misclassify. In this paper, we present a cross-layer strategic ensemble fra…

2019-10-01abs ↗pdf ↗

New findings show strategic interactions can undermine model expressiveness in machine learning.

problem How strategic interactions affect model performance in machine learning.
method Analyzing model expressiveness and strategic interactions in various machine learning settings.
result Optimizing over less expressive model classes can lead to better equilibrium outcomes in strategic environments.

Extends super-replication theorem with dynamic strategies and transaction costs.

problem Dynamic super-replication under proportional transaction costs.
method Generalizes admissible strategies and defines a well-defined super-replication price process.
result Well-defined super-replication price process in dynamic setting.

Consequential decision-making typically incentivizes individuals to behave strategically, tailoring their behavior to the specifics of the decision rule. A long line of work has therefore sought to counteract strategic behavior by designing more conservative decision boundaries in an effort to increase robustness to th…

2018-08-25abs ↗pdf ↗

Study replicability in high-dimensional statistics, resolving open problems.

problem Ensuring consistent results in high-dimensional statistical tasks.
method Introduced replicable learning algorithms and established computational and statistical equivalence with high-dimensional isoperimetric tilings.
result Matching sample complexity upper and lower bounds for replicable mean estimation and coin problem.

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.

In this work we introduce the notion of fully incomplete markets. We prove that for these markets the super-replication price coincide with the model free super-replication price. Namely, the knowledge of the model does not reduce the super-replication price. We provide two families of fully incomplete models: stochast…

2015-08-21abs ↗pdf ↗

The paper analyzes trading strategies in a competitive market with incomplete information.

problem Strategic trading under uncertainty when firms lack full knowledge of competitors' strategies.
method Bayesian games framework to incorporate uncertainty and derive optimal trading strategies.
result Uncertainty significantly impacts trading strategies compared to complete information scenarios.

Algorithm learns optimal coordination for strategic agents in uncertain settings.

problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of O~(T)\tilde{O}(\sqrt{T}) for learning optimal policy.

Randomised classifiers outperform deterministic ones in strategic classification.

problem Strategic modification of features by agents in classification tasks.
method Theoretical analysis of randomised classifiers in strategic classification.
result Randomised classifiers can achieve better accuracy than deterministic ones under certain conditions.

We study super--replication of contingent claims in markets with fixed transaction costs. This can be viewed as a stochastic impulse control problem with a terminal state constraint. The first result in this paper reveals that in reasonable continuous time financial market models the super--replication price is prohibi…

2016-10-28abs ↗pdf ↗

Study one-shot strategic classification under unknown costs, improving worst-case accuracy.

problem Learning robust decision rules in strategic settings with unknown user costs.
method Formal study of one-shot strategic classification, framing as a minimax problem, designing efficient algorithms for full-batch and stochastic settings.
result Proves efficient algorithms converge to minimax solution, revealing dual norm regularization's value.

Consequential decision-making incentivizes individuals to strategically adapt their behavior to the specifics of the decision rule. While a long line of work has viewed strategic adaptation as gaming and attempted to mitigate its effects, recent work has instead sought to design classifiers that incentivize individuals…

2019-10-23abs ↗pdf ↗

Optimizing expensive black-box systems with limited data is an extremely challenging problem. As a resolution, we present a new surrogate optimization approach by addressing two gaps in prior research -- unimportant input variables and inefficient treatment of uncertainty associated with the black-box output. We first …

2019-11-06abs ↗pdf ↗

We consider a symmetric multi-players zero-sum game with two strategic variables. There are nn players, n3n\geq 3. Each player is denoted by ii. Two strategic variables are tit_i and sis_i, i{1,,n}i\in \{1, \dots, n\}. They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nas…

2018-06-17abs ↗pdf ↗

Adaptive replication improves stochastic function optimization.

problem Challenges in accurately estimating functions with high variance.
method Trust-region-based Bayesian optimization with adaptive replication.
result Adaptive replication substantially improves solution accuracy and efficiency.

Replicable clustering algorithms for k-medians, k-means, and k-centers are proposed.

problem Designing clustering algorithms that produce the same partition on repeated runs under the same distribution.
method Utilizing approximation routines for combinatorial clustering problems in a black-box manner.
result Replicable algorithms for statistical kk-medians, kk-means, and kk-centers with specified approximation and sample complexities.

We study a strategic version of the multi-armed bandit problem, where each arm is an individual strategic agent and we, the principal, pull one arm each round. When pulled, the arm receives some private reward vav_a and can choose an amount xax_a to pass on to the principal (keeping vaxav_a-x_a for itself). All non-pulle…

2017-06-27abs ↗pdf ↗

COBRA addresses strategic behavior in online platforms by ensuring truthful reporting without monetary incentives.

problem Ensuring truthful reporting from strategic agents in online platforms.
method Proposes COBRA, an algorithm for contextual bandits involving strategic agents that disincentivizes strategic behavior.
result COBRA achieves sub-linear regret guarantee and incentive compatibility without monetary incentives.

Strategic feature manipulation helps learners identify meaningful variables in online regression settings.

problem Strategic feature manipulation poses a challenge for learners in online regression settings.
method Investigates how strategic feature manipulation by individuals can help learners recover meaningful features.
result Simple learner behavior can help accurately recover meaningful features and incentivize feature improvement.

The results of a learning process depend on the input data. There are cases in which an adversary can strategically tamper with the input data to affect the outcome of the learning process. While some datasets are difficult to attack, many others are susceptible to manipulation. A resourceful attacker can tamper with l…

2019-01-16abs ↗pdf ↗