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

Trend · papers per month

62123185246 · Jun 202019922001200920172026
48 results for cost heterogeneity

New method optimizes costly functions with unknown costs and budget constraints.

problem Optimizing functions with unknown and heterogeneous evaluation costs under a budget constraint.
method Budgeted multi-step expected improvement acquisition function.
result Our method outperforms existing approaches in various synthetic and real problems.

CyBeR-0 optimizes federated learning with Byzantine resilience and reduced communication costs.

problem Byzantine attacks and communication inefficiency in federated learning.
method Transformed robust aggregation for zero-order optimization under client heterogeneity.
result CyBeR-0 achieves stable performance with minimal communication costs and reduced memory usage.

This paper studies the equilibrium price of an asset that is traded in continuous time between N agents who have heterogeneous beliefs about the state process underlying the asset's payoff. We propose a tractable model where agents maximize expected returns under quadratic costs on inventories and trading rates. The un…

2019-05-14abs ↗pdf ↗

New protocol reduces communication costs for heterogeneous bandits over complex networks.

problem Minimizing group regret in a multi-agent, heterogeneous bandit setting over complex networks.
method Flooding with Absorption (FwA) protocol for heterogeneous bandits over complex networks.
result FwA protocol significantly reduces communication costs compared to flooding while maintaining similar regret performance.

Heterogeneous network embedding (HNE) is a challenging task due to the diverse node types and/or diverse relationships between nodes. Existing HNE methods are typically unsupervised. To maximize the profit of utilizing the rare and valuable supervised information in HNEs, we develop a novel Active Heterogeneous Network…

2019-05-14abs ↗pdf ↗

Study how transaction costs impact stock returns and holdings in equilibrium.

problem Impact of quadratic transaction costs on equilibrium stock returns and holdings.
method Developed a continuous-time risk-sharing model with FBSDEs to characterize equilibrium stock holdings and trading rates.
result Equilibrium stock holdings and trading rates are uniquely determined by FBSDEs, and equilibrium return by a system of coupled FBSDEs.

We propose a continuous-time model of trading with heterogeneous beliefs. Risk-neutral agents face quadratic costs-of-carry on positions and thus their marginal valuations decrease with the size of their position, as it would be the case for risk-averse agents. In the equilibrium models of heterogeneous beliefs that fo…

2017-05-16abs ↗pdf ↗

We study risk-sharing economies where heterogenous agents trade subject to quadratic transaction costs. The corresponding equilibrium asset prices and trading strategies are characterised by a system of nonlinear, fully-coupled forward-backward stochastic differential equations. We show that a unique solution generally…

2019-01-30abs ↗pdf ↗

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.

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 ↗

Bayesian model for cost-effectiveness analysis with subgroup discovery.

problem Statistical challenges in cost-effectiveness analysis, especially with non-random treatment assignment and censored data.
method Developed a nonparametric Bayesian model using Dirichlet and Gamma processes to estimate cost-survival distributions and identify cost-effectiveness subgroups.
result Identified and estimated policy-relevant causal CEA estimands using a Bayesian nonparametric g-computation procedure.

Study on-chain peak shaving to reduce Ethereum transaction costs.

problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.

Paper tackles federated learning with privacy, enhancing target data analysis.

problem Heterogeneity and privacy of distributed data in federated learning.
method Formulates federated differential privacy, studies statistical problems under privacy constraints.
result Federated differential privacy offers a balance between privacy and knowledge transfer.

Investment and consumption strategies with luxury goods for retirement age.

problem Optimal investment and consumption with heterogeneous goods and retirement timing.
method PDE and stochastic control theory, variational inequality, dual transformation.
result Optimal consumption strategies and retirement policies for utility maximizers.

Recent work has developed Bayesian methods for the automatic statistical analysis and description of single time series as well as of homogeneous sets of time series data. We extend prior work to create an interpretable kernel embedding for heterogeneous time series. Our method adds practically no computational cost co…

2019-08-24abs ↗pdf ↗

This research tackles sample complexity in causal graph recovery with temporal heterogeneity.

problem Recovering a unique causal graph from observational data with temporal heterogeneity.
method Integrates time-series dynamics and multi-environment heterogeneity to constrain the problem, enabling a rigorous analysis of statistical limits.
result Unified necessary identifiability conditions and explicit information-theoretic bounds quantify the sample complexity under different noise distributions.

Optimizes user marketing campaigns to balance cost and effectiveness.

problem Lack of methods to optimize marketing campaigns considering cost and effectiveness.
method Proposes a treatment effect optimization algorithm using deep learning to balance cost and effectiveness.
result Demonstrates superior performance in cost-efficiency and real-world business value.

Study on federated learning with private label sets, showing privacy benefits without significant accuracy loss.

problem Effects of label set heterogeneity and privacy constraints in federated learning.
method Apply classical classifier combination methods and adapt FL methods for private label sets, compare public and private settings.
result Reducing labels harms model performance, but centralized tuning can help.

We study how trading costs are reflected in equilibrium returns. To this end, we develop a tractable continuous-time risk-sharing model, where heterogeneous mean-variance investors trade subject to a quadratic transaction cost. The corresponding equilibrium is characterized as the unique solution of a system of coupled…

2017-07-26abs ↗pdf ↗

Multitask Gaussian process regression reduces data generation costs for molecular property prediction.

problem Data bottleneck in training surrogate models for molecular properties.
method Multitask Gaussian process regression over heterogeneous data sources (CC and DFT).
result Predicts at CC-level accuracy with over an order of magnitude reduction in data generation cost.

Proposes a method for private aggregation in heterogeneous federated learning.

problem Ensuring resilience to Byzantine clients and maintaining client data privacy in federated learning with heterogeneous data.
method Careful co-design of verifiable secret sharing, secure aggregation, and private information retrieval scheme.
result Achieves information-theoretic privacy guarantees and Byzantine resilience under data heterogeneity.

Private anchors affect how information is communicated and can improve or distort transmission.

problem How private anchors influence strategic communication and information transmission.
method Analyzed a sender-receiver game with costly reports and privately observed anchors.
result Small positive reporting costs can lead to full revelation, even with zero costs.

DFFL tackles federated learning with heterogeneous objectives and constraints.

problem Federated learning with clients having different objectives and feasible regions.
method Derived heterogeneity bounds for cost-vector distances and support-function/shape-distance terms. Lifted pointwise bounds to local-versus-federated excess-risk comparison.
result Federation is beneficial when the statistical advantage of pooling exceeds a client-specific heterogeneity penalty.

We propose a mean field game model to study the question of how centralization of reward and computational power occur in Bitcoin-like cryptocurrencies. Miners compete against each other for mining rewards by increasing their computational power. This leads to a novel mean field game of jump intensity control, which we…

2019-12-04abs ↗pdf ↗

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.

A new method reduces communication costs in distributed learning.

problem Reduces communication bottlenecks in distributed learning.
method Local SGD with communication-computation overlap and delay-corrected sparse model averaging.
result Theoretical convergence guarantees for smooth non-convex objectives.

We study the system of heterogeneous interbank lending and borrowing based on the relative average of log-capitalization given by the linear combination of the average within groups and the ensemble average and describe the evolution of log-capitalization by a system of coupled diffusions. The model incorporates a game…

2019-07-06abs ↗pdf ↗

Paper extends FFT-based differential privacy method to heterogeneous compositions.

problem Computing accurate differential privacy guarantees for mixed mechanisms.
method Uses Fast Fourier Transform (FFT) for error analysis and parameter selection.
result Provides tighter bounds for heterogeneous compositions compared to homogeneous cases.

End-to-end framework learns LLM routing from observational data.

problem Compounding errors in decoupled approaches and reliance on full-feedback data.
method Causal end-to-end framework minimizing decision-making regret from observational data.
result Method outperforms existing baselines across different embedding models.

Study shows informed traders harm market makers but price discovery benefits outweigh costs.

problem Informed traders' impact on market makers' profitability.
method Agent-based model with heterogeneous learning agents, multi-agent reinforcement learning.
result Informed market order flow is harmful when aggregate informedness is low but beneficial as it increases.

Model liquidity premia using a risk-sharing economy with quadratic costs.

problem Understanding the cross-section of liquidity premia earned by assets with different trading costs.
method Developed a risk-sharing economy model with quadratic transaction costs, leading to matrix-valued Riccati equations for equilibrium.
result Calibrated model to time series data, revealing liquidity premia across assets with varying trading costs.

Study shows pooling scores for conformal prediction distorts group coverage.

problem Pooling scores for conformal prediction distorts group coverage.
method Derived conservation law and lower bound, demonstrated tension between fairness definitions, quantified trade-off between policies.
result Pooling scores for conformal prediction distorts group coverage.

Revisits behavioral finance option pricing model to align with rational asset pricing theory.

problem Inconsistency between behavioral finance and rational asset pricing models in option pricing.
method Introduces arbitrage transaction costs to modify the behavioral finance option pricing formula.
result Modifies behavioral finance option pricing formula to be consistent with rational asset pricing theory.

MetaDVFS uses device and application metadata to improve DVFS efficiency.

problem Improving energy efficiency in mobile platforms with diverse applications and hardware.
method Formulates DVFS as a multi-task reinforcement learning problem and introduces MetaDVFS, leveraging metadata for knowledge transfer.
result MetaDVFS achieves up to 26% improvement in Quality of Experience and up to 17% improvement in Performance-Power Ratio.

New method reduces labeler costs by aggregating predictions from local classifiers.

problem Reduce labeler costs in multiclass classification.
method Model KK-class classification using smaller classifiers trained on subsets of tasks.
result Near-optimal scheme for designing classifier configurations reduces labeler costs.

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.

Unified analysis of federated learning with compression for various data distributions.

problem Communication overhead in federated learning with unreliable or limited communication.
method Periodic compressed communication and local gradient tracking schemes.
result Sharp convergence rates for various objective functions and data distributions.

FedDuA adapts global learning rate for federated learning.

problem Slow convergence in federated learning due to dataset and parameter space heterogeneity.
method FedDuA uses mirror descent to adaptively select global learning rate based on inter-client and coordinate-wise heterogeneity.
result FedDuA achieves minimax optimal convergence for convex objectives and outperforms baselines in various settings.

RelaySum improves decentralized deep learning by uniformly distributing data across workers.

problem Handling data heterogeneity in decentralized deep learning.
method RelaySum uses spanning trees to distribute information exactly uniformly across all workers with finite delays.
result RelaySum is independent of data heterogeneity and scales to many workers, enabling highly accurate decentralized deep learning.