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

Trend · papers per month

64128191255 · Jun 202019922001200920172026
48 results for cost-aware benchmark

CLQT benchmarks LLM portfolio managers by evaluating their decision-making process, not just returns.

problem Most benchmarks rank LLMs by returns, ignoring their decision-making process and potential for look-ahead leakage.
method CLQT reframes evaluation as diagnosis, using a closed-loop, cost-aware, strategy-consistent environment with a five-stage cycle.
result CLQT provides a durable map of agent competencies and limitations, separating outcome from process.

Optimizes function networks by selectively evaluating parts of the network, reducing costs.

problem Optimizing expensive function networks where full evaluations are costly.
method Knowledge gradient acquisition function for cost-aware partial evaluations.
result Outperforms existing BOFN methods and benchmarks across various problems.

The notion of expense in Bayesian optimisation generally refers to the uniformly expensive cost of function evaluations over the whole search space. However, in some scenarios, the cost of evaluation for black-box objective functions is non-uniform since different inputs from search space may incur different costs for …

2019-09-09abs ↗pdf ↗

CADRO optimizes DRO by reducing conservatism through cost-aware ambiguity sets.

problem Optimizing solutions under uncertainty with reduced conservatism.
method CADRO uses a cost-aware ambiguity set to reduce DRO's conservatism.
result CADRO provides high-confidence upper bounds and consistent estimators of out-of-sample expected cost.

CAGES optimizes expensive RL problems by efficiently learning gradients from multiple sources.

problem Optimizing expensive-to-evaluate functions in high-dimensional spaces.
method Cost-Aware Gradient Entropy Search (CAGES) for multi-fidelity Bayesian optimization.
result Significant performance improvements on synthetic and RL benchmark problems.

Bayesian optimization with cost-awareness using Gittins index.

problem Optimizing unknown functions with limited data evaluations and costs.
method Developed a connection between cost-aware Bayesian optimization and the Pandora's Box problem, using the Gittins index as an acquisition function.
result The Gittins index-based acquisition function performs well in cost-aware Bayesian optimization, especially in high dimensions.

This work improves cost-aware Bayesian optimization by introducing Pareto-efficient acquisition functions.

problem Cost variability in hyperparameter evaluations affects the efficiency of Bayesian optimization.
method Reformulated cost-aware Bayesian optimization as Pareto efficiency, proposing a novel Pareto-efficient expected improvement.
result Pareto-efficient acquisition functions significantly outperform previous solutions, providing finer control over cost-accuracy trade-offs.

Develops a framework for cost-efficient Bayesian optimization with constraints.

problem Optimizing designs with minimal cost in constrained search spaces.
method Constrained multi-fidelity Bayesian optimization (CMFBO) with automatic stopping criterion.
result Minimizes overall sampling costs while ensuring feasibility.

This work introduces CAET, an algorithm for cost-aware pairwise pure exploration.

problem Identifying optimal arm pairs with varying costs in multi-armed bandits.
method Introduces a framework for pairwise pure exploration with arm-specific costs, derives a lower bound, and proposes CAET algorithm.
result CAET optimizes cumulative cost and approaches the lower bound asymptotically.

In this paper, we propose a cost-aware cascading bandits model, a new variant of multi-armed ban- dits with cascading feedback, by considering the random cost of pulling arms. In each step, the learning agent chooses an ordered list of items and examines them sequentially, until certain stopping condition is satisfied.…

2018-05-22abs ↗pdf ↗

TRASHFIRE improves model robustness by analyzing training rates and costs.

problem Understanding and predicting model robustness under adversarial conditions.
method Survival models, worst-case examples, cost-aware analysis.
result Deeper models offer marginal robustness gains due to inference time, not inherent robustness.

In real-world scenarios, different features have different acquisition costs at test-time which necessitates cost-aware methods to optimize the cost and performance trade-off. This paper introduces a novel and scalable approach for cost-aware feature acquisition at test-time. The method incrementally asks for features …

2018-11-03abs ↗pdf ↗

Adaptive portfolio outperforms static alternatives by 120% over 5 years.

problem Achieving strong and stable long-term performance in diversified portfolios.
method RL-BHRP: A two-level, learning-based approach that adjusts sector and stock exposures dynamically.
result Adaptive portfolio outperforms static alternatives by 120% over 5 years.

LaMBO optimizes modular systems with switching costs, achieving better results than existing methods.

problem Optimizing systems with costly variable updates in a sequence of modules.
method Lazy Modular Bayesian Optimization (LaMBO) that minimizes switching costs.
result LaMBO achieves vanishing regret and improves over existing cost-aware Bayesian optimization algorithms.

CADO optimizes heatmap-based solvers for cost minimization, overcoming performance limitations.

problem Heatmap-based solvers lack objective alignment for cost minimization.
method CADO uses Reinforcement Learning to optimize solution cost directly, introducing Label-Centered Reward and Hybrid Fine-Tuning.
result CADO achieves state-of-the-art performance across diverse benchmarks.

Adaptive Bayesian Optimization for resource-constrained experiments with switching costs.

problem Sequential experimental design with varying costs for changing design variables.
method Adapted batch algorithms to sequential problem, proposing cost-aware and cost-ignorant methods.
result Cost-aware algorithm outperforms tuned process-constrained algorithms in all settings considered.

Not all types of supervision signals are created equal: Different types of feedback have different costs and effects on learning. We show how self-regulation strategies that decide when to ask for which kind of feedback from a teacher (or from oneself) can be cast as a learning-to-learn problem leading to improved cost…

2019-07-11abs ↗pdf ↗

Resource-efficient oblique trees reduce neural signal classification costs.

problem Implementing efficient neural signal classifiers on resource-constrained devices.
method Integrating model compression, probabilistic routing, and cost-aware learning.
result Significant reduction in model size and feature extraction cost compared to state-of-the-art models.

In this paper, we investigate cost-aware joint learning and optimization for multi-channel opportunistic spectrum access in a cognitive radio system. We investigate a discrete time model where the time axis is partitioned into frames. Each frame consists of a sensing phase, followed by a transmission phase. During the …

2018-04-11abs ↗pdf ↗

We consider the minimum cost intervention design problem: Given the essential graph of a causal graph and a cost to intervene on a variable, identify the set of interventions with minimum total cost that can learn any causal graph with the given essential graph. We first show that this problem is NP-hard. We then prove…

2018-10-28abs ↗pdf ↗

SCaLE tackles dynamic regret in noisy bandit feedback with switching costs.

problem Unbounded metric movement costs in bandit online convex optimization.
method SCaLE algorithm for high-dimensional dynamic quadratic hitting costs and 2\ell_2-norm switching costs, with spectral regret analysis.
result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.

Neural Lévy model improves risk and density forecasting for financial returns.

problem Financial returns exhibit heavy tails, volatility clustering, and jumps.
method Proposes a neural Lévy jump-diffusion framework that learns conditional drift, diffusion, jump intensity, and size distribution.
result Demonstrates improved calibration, sharper tail control, and risk reduction.

A RL framework for hedging equity index options with realistic costs.

problem Dynamic hedging of equity index option exposures under transaction costs.
method Reinforcement Learning (RL) with a leak-free environment, cost-aware reward function, and stochastic actor-critic agent.
result The RL policy improves risk-adjusted performance compared to no-hedge, momentum, and volatility-targeting baselines.

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.

The paper optimizes portfolios with transaction costs in a large asset universe.

problem Optimizing portfolios with transaction costs in a large asset universe.
method Mean-variance optimization with nonconvex penalty for proportional and quadratic transaction costs.
result The proposed models show satisfactory performance and highlight the importance of transaction costs.

Unified framework for ranking-and-selection with multiple correct answers and non-answerable estimates

problem Fixed-precision ranking-and-selection in structured settings with non-unique answers and non-answerable estimates
method Unified framework based on answer-wise acceptance sets, restricted generalized likelihood ratio stopping, and answer-pitfall decomposition
result Unified recipe performs well across a broad range of pure-exploration problems

Feature missing is a serious problem in many applications, which may lead to low quality of training data and further significantly degrade the learning performance. While feature acquisition usually involves special devices or complex process, it is expensive to acquire all feature values for the whole dataset. On the…

2018-02-15abs ↗pdf ↗

This paper proposes CSADA to make DNNs cost-sensitive.

problem Over-parameterization challenges cost-sensitive classification in DNNs.
method CSADA framework using adversarial data augmentation.
result CSADA effectively minimizes overall cost and reduces critical errors.

Accelerates Bayesian optimization of function networks with partial evaluations.

problem Optimizing expensive-to-evaluate function networks with varying node costs.
method Proposes an accelerated algorithm that uses global Monte Carlo simulations to select node-specific candidate inputs.
result Achieves up to a 16x speedup over the original p-KGFN algorithm while maintaining competitive query efficiency.

Paper uses SciPhyRL for optimizing large institutional portfolios.

problem Optimizing large institutional portfolios with cumulative costs and practical short horizons.
method Formulates a continuous-time optimization problem, reduces it to solving an HJB equation, and uses PINN for direct solution.
result Learned Gibbs policy yields substantial out-of-sample Sharpe ratio improvements.

Machine learning predicts Bitcoin returns but trading performance drops with costs.

problem Trading Bitcoin predictions with transaction costs.
method XGBoost, LSTM, iTransformer models evaluated in walk-forward protocol; cost-aware execution filter implemented.
result Cost-aware execution filter restores profitability; XGBoost strategy outperforms.

FR-LUX optimizes portfolio management by learning cost-aware policies robust to market conditions.

problem Transaction costs and regime shifts cause failure in live trading portfolios.
method Integrates three ingredients: microstructure-consistent execution model, trade-space trust region, and explicit regime conditioning.
result Achieves top average Sharpe ratio, maintains flat cost-performance slope, and superior risk-return efficiency.

PEMC uses ML to enhance Monte Carlo simulations, reducing variance and runtime.

problem Computational inefficiency in Monte Carlo simulations for complex tasks.
method Prediction-Enhanced Monte Carlo (PEMC) framework that uses ML surrogates as predictors.
result PEMC provides unbiased evaluations with reduced variance and runtime compared to standard Monte Carlo.

An active learner chooses which data points to label to minimize cost and error in streaming data.

problem Efficiently labeling streaming data points with limited labeling costs.
method Formalizes the problem with a loss function, designs an algorithm with a time and cost dependent threshold, and provides upper and lower bounds.
result The algorithm achieves a worst-case upper bound of O~(B13K13T23)\widetilde{O}(B^{\frac{1}{3}} K^{\frac{1}{3}} T^{\frac{2}{3}}) on the loss after TT rounds.

YAHPO Gym introduces a new benchmark for evaluating hyperparameter optimization methods.

problem Evaluating and comparing hyperparameter optimization methods on well-curated benchmark suites.
method Surrogate-based benchmark collection of 14 scenarios, each with multi-fidelity and multi-objective hyperparameter optimization problems.
result Surrogate-based benchmarks produce more faithful results than tabular benchmarks.