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

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for Heterogeneous Actions

Neural Index Policy for multi-action bandits with heterogeneous budgets.

problem Real-world settings often involve multiple interventions with heterogeneous costs and constraints, breaking classical assumptions.
method Introduces a Neural Index Policy (NIP) that learns to assign budget-aware indices to arm-action pairs using a neural network and differentiable knapsack layer.
result Empirically achieves near-optimal performance while strictly enforcing heterogeneous budgets and scaling to hundreds of arms.

Paper tackles imitation learning with sparse rewards and heterogeneous actions.

problem Challenges of imitation learning with sparse rewards and different actions.
method Proposes a method that balances imitation and reinforcement learning objectives.
result Agent efficiently leverages sparse rewards and learns from different actions.

A novel framework interprets driving patterns using Action phases clustering.

problem Challenges in comprehending driving heterogeneity from underlying behavior mechanisms.
method Resampling and Downsampling Method (RDM) followed by iterative clustering calibration.
result Six driving patterns identified in real-world datasets, revealing dynamic nature of driving.

Federated Q-learning achieves linear speedup with heterogeneity, improving sample complexity.

problem Collaborative learning in distributed RL settings with limited data sharing.
method Analyzes synchronous and asynchronous federated Q-learning, proposes importance averaging.
result Achieves linear speedup with heterogeneity, robust to local trajectory heterogeneity.

New algorithm estimates treatment effects for more efficient contextual bandits.

problem Contextual bandits struggle with action-independent reward redundancies.
method Reduces contextual bandits to heterogeneous treatment effect estimation.
result Heterogeneous treatment effect estimation leads to more efficient model estimation.

We introduce reinforcement learning for heterogeneous teams in which rewards for an agent are additively factored into local costs, stimuli unique to each agent, and global rewards, those shared by all agents in the domain. Motivating domains include coordination of varied robotic platforms, which incur different costs…

2018-05-23abs ↗pdf ↗

Unified survey of treatment effect heterogeneity and uplift modeling methods.

problem Estimating heterogeneous treatment effects and uplift modeling.
method Unified survey of treatment effect heterogeneity and uplift modeling approaches.
result Unified notations for comparing methods and applications in personalized marketing, medicine, and social studies.

Paper introduces TEP to better model treatment effect heterogeneity.

problem Personalised decision making requires evidence of treatment suitability.
method Designs TEP to represent treatment effect heterogeneity, uses local causal structure to show important variables, derives formula for unbiased CATE estimation.
result Proposed method models treatment effect heterogeneity better than existing methods.

This work formalizes and extends parameter sharing in multi-agent reinforcement learning.

problem Parameter sharing limits multi-agent learning to a single policy, preventing different tasks or action spaces.
method Introduces agent indication and extends parameter sharing to heterogeneous observation and action spaces.
result Proves convergence to optimal policies for parameter sharing in heterogeneous environments.

The paper explores how to apply causal knowledge across different datasets to improve learning.

problem How to apply causal knowledge across different datasets to improve learning.
method Investigates the structural causal bandit with transportability, fusing priors from source environments to enhance learning in the deployment setting.
result Achieves a sub-linear regret bound with an explicit dependence on informativeness of prior data, potentially outperforming standard bandit approaches.

Solves action selection for large spaces in RL, achieving near-optimal performance.

problem Selecting a small, representative subset of actions from a large, shared action space.
method Extends meta-bandit approach to MDPs, using a relaxed sub-Gaussian process model.
result Achieves performance comparable to full action space, with theoretical guarantees.

FAIRY explains user actions and social media feeds.

problem Users struggle to understand why certain items appear in their social feeds.
method FAIRY uses an interaction graph to model user behavior and ranks feed items, scoring paths connecting user actions and feed items.
result FAIRY provides clear explanations for user actions and feed items, enhancing transparency and user understanding.

Estimates treatment effects with machine learning using instruments in A/B tests.

problem Estimating heterogeneous treatment effects with unobserved confounders in A/B tests.
method Develops a statistical learning approach using machine learning methods and auxiliary models.
result Shows robustness of estimated effect model to auxiliary model errors and provides asymptotic normality for parameter estimates.

New framework tackles stochastic latent subgroup heterogeneity in online decision-making.

problem Stochastic latent heterogeneity in online decision-making where individual responses vary with unobserved subgroups.
method Latent heterogeneous bandit framework using EM-greedy algorithm to learn subgroup probabilities and reward parameters.
result Achieves optimal estimation and classification guarantees, revealing a fundamental stochastic barrier in online decision-making.

Federated UCBVI reduces communication costs while minimizing regret in multi-agent settings.

problem Minimizing regret in federated learning with heterogeneous agents.
method Federated Upper Confidence Bound Value Iteration (Fed-UCBVI) algorithm.
result Regret bound scales as ildeO(H3SAT/M) ilde{\mathcal{O}}(\sqrt{H^3 |\mathcal{S}| |\mathcal{A}| T / M}) with small additional term due to heterogeneity.

We present an analysis of the price impact associated with trades effected by different financial firms. Using data from the Spanish Stock Market, we find a high degree of heterogeneity across different market members, both in the instantaneous impact functions and in the time-dependent market response to trades by ind…

2011-09-01abs ↗pdf ↗

Financial markets are often driven by latent factors which traders cannot observe. Here, we address an algorithmic trading problem with collections of heterogeneous agents who aim to perform optimal execution or statistical arbitrage, where all agents filter the latent states of the world, and their trading actions hav…

2018-03-12abs ↗pdf ↗

This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.

problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.

PRINCE provides interpretable explanations for recommender systems by removing minimal user actions.

problem Lack of interpretable explanations for recommender systems.
method PRINCE uses a polynomial-time optimal algorithm based on random walks over dynamic graphs to find minimal user actions that change recommendations.
result PRINCE produces more compact explanations than intuitive baselines and is viable for user understanding.

A policy for near-optimal multi-player bandits with non-zero collision rewards.

problem Decentralized multi-player bandits with heterogeneous rewards and collisions.
method A policy achieving near-optimal regret in a non-communicative setting.
result Near order-optimal expected regret of O(log1+δT)O(\log^{1 + δ} T) for 0<δ<10 < δ< 1.

We study a general problem of allocating limited resources to heterogeneous customers over time under model uncertainty. Each type of customer can be serviced using different actions, each of which stochastically consumes some combination of resources, and returns different rewards for the resources consumed. We consid…

2018-10-11abs ↗pdf ↗

Dynamic CBDT improves treatment effect estimation in clinical data.

problem Estimating heterogeneous treatment effects in observational data with high accuracy and interpretability.
method Dynamic Regularized Causal Boosted Decision Trees (CBDT) integrating variance regularization and calibration.
result Significantly improved estimation accuracy and reliable coverage of true treatment effects.

The study uses a multi-armed bandit model to analyze and mitigate hiring discrimination.

problem Hiring discrimination due to insufficient data on worker skill and characteristics.
method Multi-armed bandit model to simulate firms' learning process and policy solutions.
result Temporary affirmative actions effectively alleviate discrimination caused by data insufficiency.

Paper models treatment effects by clustering patients with distinct survival characteristics.

problem Estimating treatment efficacy in clinical settings with censored outcomes.
method Latent variable approach to model heterogeneous treatment effects.
result The latent structure can mediate base survival rates and reveal actionable phenotypes.

We present an empirical study of the intertwined behaviour of members in a financial market. Exploiting a database where the broker that initiates an order book event can be identified, we decompose the correlation and response functions into contributions coming from different market participants and study how their b…

2011-04-04abs ↗pdf ↗

In this paper, we present a simple stock market model (the market game) which incorporates, as ab initio dynamics delayed majority dynamics, according to which agents (with heterogeneous strategies and price expectations) are rewarded if their actions at time t are the actions of the majority of agents at time t+1. We …

2003-11-26abs ↗pdf ↗

Paper tackles robust decision-making from multiple sites with shared structure.

problem Learning robust sequential decisions from heterogeneous multi-site datasets.
method Group-Robust MDPs with d-rectangular uncertainty sets, feature-wise worst-case aggregation, and cluster-level pooling.
result Proves suboptimality bound for robust planning policy under robust partial coverage assumption.

SHIFT framework identifies subgroups with large ML model performance decay.

problem Large model performance decay in subgroups when deployed.
method Subgroup-scanning Hierarchical Inference Framework (SHIFT) for performance drift.
result SHIFT identifies interpretable subgroups with large performance decay and suggests targeted actions to mitigate it.

Framework insures AI actions with reserve capital, preventing loss.

problem Ensuring safety and accountability for AI actions with varying side effects.
method Developed Actuarial Action Interface (AAI) and Authority Frontier to price and gate AI actions.
result Found common refusal and release patterns across domains, with varying required reserve capital.

A multi-player bandit system resists adversarial attacks with near-optimal regret.

problem Adversaries attempt to manipulate rewards in a multi-player multi-armed bandit game.
method Players communicate a single bit to resist attacks, achieving near-optimal regret.
result Achieves near-optimal regret of O(log1+δT+W)O(\log^{1+δ}T + W), where WW is the total time of adversarial attacks.

VSAE learns from missing heterogeneous data by modeling latent dependencies.

problem Learning from partially-observed heterogeneous data with missingness.
method Variational selective autoencoder (VSAE) models joint distribution of observed, unobserved, and missing data.
result VSAE improves over state-of-the-art models in data generation and imputation tasks.

Consider a platform that wants to learn a personalized policy for each user, but the platform faces the risk of a user abandoning the platform if she is dissatisfied with the actions of the platform. For example, a platform is interested in personalizing the number of newsletters it sends, but faces the risk that the u…

2018-02-23abs ↗pdf ↗

Study quantifies impacts of heterogeneity in FL on smartphone data.

problem Heterogeneity in FL devices causes performance degradation.
method Collected 136k smartphone data, built heterogeneity-aware FL platform, conducted extensive experiments.
result Heterogeneity causes up to 9.2% accuracy drop and 2.32x training time increase.

Generative tools mimic stock market traders using synthetic data.

problem Imitating trading behavior of stock market participants.
method Modified state-space model applied to limit order book data, trained on synthetic data generated from a heterogeneous agent-based model.
result Model's predicted distribution matches ground truths from the agent-based model.

New methods handle both data and network heterogeneity in federated learning.

problem Challenges in federated learning due to data and network heterogeneity.
method Two novel client selection schemes that minimize theoretical runtime to convergence.
result Our methods are at least competitive to and up to 20 times better than existing baselines.

New method for learning on heterogeneous graphs without meta-paths.

problem Learning on heterogeneous graphs is sensitive to meta-paths choice, leading to poor performance.
method Decompose heterogeneous graph into homogeneous relation-type graphs, combine higher-order representations, use attention mechanisms.
result Our model outperforms state-of-the-art baselines in vertex classification tasks on heterogeneous graph datasets.

HGT models heterogeneous graphs with dedicated node and edge representations.

problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.

Detects dense subhypergraphs in heterogeneous random hypergraphs.

problem Testing for the existence of a dense subhypergraph in heterogeneous random hypergraphs.
method Established detection boundaries and constructed asymptotically powerful and adaptive tests.
result Developed tests for distinguishing between null and alternative hypotheses.

Paper analyzes D-SGD convergence with heterogeneous data and proposes topology learning.

problem Efficiently dealing with data heterogeneity in decentralized learning.
method Revisits D-SGD analysis, introduces neighborhood heterogeneity, and proposes topology learning.
result Formulates topology learning as a tractable optimization problem and demonstrates its effectiveness.

Method for understanding heterogeneous treatment effects in complex causal graphs.

problem Heterogeneity and comorbidity in healthcare problems.
method Developed a new approach to characterize heterogeneous causal effects (HCEs) in graphical contexts, including heterogeneous causal graphs (HCGs) with confounders and mediators.
result Established theoretical forms and properties of HCEs in linear and nonlinear models, and developed interactive structural learning for estimation.

LATTE tackles heterogeneous network embedding challenges with layer-stacked attention.

problem Aggregating higher-order indirect relations in heterogeneous networks.
method Layer-stacked ATTention Embedding (LATTE) that decomposes meta relations at each layer.
result LATTE achieves state-of-the-art performance on benchmark datasets.