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

68135203270 · Jun 202019922001200920172026
48 results for total cost

Germany's tax admin costs likely exceed 20% of total revenue, requiring system improvement.

problem High tax administrative costs in Germany and other jurisdictions.
method Statistical data, surveys, and a novel approach to measure total administrative cost as a percentage of total tax revenue.
result Germany's 2021 tax administrative costs likely exceeded 20% of total tax revenue.

New method reduces total cost constraints in CBwK to sqrt(T) with fairness application.

problem Maximize rewards while adhering to total cost constraints in CBwK.
method Dual strategy based on projected-gradient-descent updates.
result Total cost constraints reduced to sqrt(T) with poly-logarithmic terms.

A novel algorithm reduces communication costs in federated best arm identification.

problem Identifying the best arm in a federated multi-armed bandit setup with minimal communication cost.
method Proposes a novel algorithm called FedElim that communicates only in exponential time steps.
result Demonstrates that communication is almost cost-free in FedElim, with a total cost at most 3 times the maximum under its variant.

In this paper, we study a risk process modeled by a Brownian motion with drift (the diffusion approximation model). The insurance entity can purchase reinsurance to lower its risk and receive cash injections at discrete times to avoid ruin. Proportional reinsurance and excess-of-loss reinsurance are considered. The obj…

2011-12-17abs ↗pdf ↗

Improves classifier evaluation by aligning with Total Classification Cost.

problem Lack of consensus on evaluation metrics and class imbalance issues.
method Introduces Weighted Accuracy (WA) and a reweighting framework for cost-sensitive scenarios.
result WA aligns with Total Classification Cost (TCC) minimization under realistic conditions.

Optimizing rewards under budget constraints with correlated costs and rewards.

problem Maximizing total expected reward under a budget constraint on total cost with correlated and potentially heavy-tailed cost-reward pairs.
method Proposes algorithms exploiting correlation between cost and reward via linear minimum mean-square error estimation to achieve tight regret bounds.
result Achieves O(logB)O(\log B) regret for a budget B>0B>0 under certain moment conditions.

Buying or selling assets leads to transaction costs for the investor. On one hand, it is well know to all market practionaires that the transaction costs are positive on average and present therefore systematic loss. On the other hand, for every trade, there is a buy side and a sell side, the total amount of asset and …

2011-03-11abs ↗pdf ↗

Paper proposes a method to estimate project cost contingency reserves considering various types of uncertainty.

problem Inaccurate estimation of project cost contingency reserves due to ignoring different types of uncertainty.
method Quantitative determination of project cost contingency reserves using Monte Carlo Simulation considering aleatoric, stochastic, and epistemic uncertainties.
result The proposed method provides more accurate contingency reserves that align with actual project risks.

A new cost-frugal HPO method controls training cost during optimization.

problem Ignoring training cost variation in HPO leads to inefficient hyperparameter tuning.
method Developed a randomized direct-search method with convergence and approximation guarantees.
result Proved an O(dK)O(\frac{\sqrt{d}}{\sqrt{K}}) convergence rate and O(dε2)O(dε^{-2}) approximation guarantee.

Given a transportation cost c:M×MˉRc: M \times\bar M \to\mathbf{R}, optimal maps minimize the total cost of moving masses from MM to Mˉ\bar M. We find a pseudo-metric and a calibration form on M×MˉM\times\bar M such that the graph of an optimal map is a calibrated maximal submanifold. We define the mass of space-like current…

2009-07-28abs ↗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 ↗

Paper studies fundamental limits of communication in distributed learning.

problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.

Federated Q-Learning achieves linear regret speedup with low communication cost.

problem Achieving linear regret speedup in federated reinforcement learning without high communication costs.
method Proposed two federated Q-Learning algorithms: FedQ-Hoeffding and FedQ-Bernstein, using event-triggered synchronization, novel step size selection, and concentration inequalities.
result Total regrets achieve linear speedup compared to single-agent counterparts with logarithmic communication cost.

Algorithm learns optimal arm selection in unsupervised sequential selection with contextual information.

problem Learning optimal arm selection in unsupervised sequential selection with contextual information.
method Proposes an algorithm for the contextual USS problem under the CWD property, demonstrating sub-linear regret.
result Demonstrates sub-linear regret for the proposed algorithm.

In the total least squares problem, one is given an m×nm \times n matrix AA, and an m×dm \times d matrix BB, and one seeks to "correct" both AA and BB, obtaining matrices A^\hat{A} and B^\hat{B}, so that there exists an XX satisfying the equation A^X=B^\hat{A}X = \hat{B}. Typically the problem is overconstrained, meanin…

2019-09-27abs ↗pdf ↗

Bitcoin mining costs remain stable despite increased activity.

problem Stability of Bitcoin mining costs despite rising energy consumption.
method Estimation of global energy cost over a decade, considering changing oil costs and technological improvements.
result The cost of Bitcoin mining has remained relatively stable since 2010, relative to the volume of transactions.

Optimizes dividend payouts with fixed costs and regime switching.

problem Maximizing dividends with fixed transaction costs and regime switching.
method Identifies optimal dividend strategy as a two-barrier impulsive strategy.
result Explicit determination of optimal strategy for various drift and volatility scenarios.

Study examines the impact of employment benefit costs on firm profitability.

problem Impact of employment benefit costs on firm profitability.
method Panel data regression analysis using E-Views.
result There is a significant positive relationship between employment benefit costs and firm profitability.

Modeling climate change costs with stochastic interest rates shows inequality, but funding abatement can reduce this.

problem Evaluating the costs and benefits of climate change mitigation with uncertain discount rates.
method Amended DICE model with stochastic interest rates and funding abatement costs.
result Introducing funding abatement can reduce intergenerational inequality in climate change costs.

This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g. sparse deconvolution. This paper aims to induce sparsity more strongly than L1 norm regularization, while avoiding non-convex optimization. For this purpose, this paper describes the design and use of…

2013-02-22abs ↗pdf ↗

New algorithm reduces regret and constraint violation in constrained bandit problems.

problem Optimizing under budget and stochastic constraints in resource-constrained settings.
method Lyapunov optimization methodology, tLyOn{ t LyOn} algorithm.
result Achieves O(KBlogB)O(\sqrt{K B\log B}) regret and zero constraint-violation for large BB.

Frequently, acquiring training data has an associated cost. We consider the situation where the learner may purchase data during training, subject TO a budget. IN particular, we examine the CASE WHERE each feature label has an associated cost, AND the total cost OF ALL feature labels acquired during training must NOT e…

2012-10-19abs ↗pdf ↗

We consider the problem of learning a causal graph over a set of variables with interventions. We study the cost-optimal causal graph learning problem: For a given skeleton (undirected version of the causal graph), design the set of interventions with minimum total cost, that can uniquely identify any causal graph with…

2017-03-08abs ↗pdf ↗

New framework for online influencer selection considering cost constraints.

problem Real-world social advertising budget limitations and cost variability of influencers.
method Introduces a budgeted framework for online influence maximization using an algorithm with semi-bandit feedback.
result Improves the state of the art regret bound for cardinality constraint setting.