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

169338507676 · Jun 202019922001200920172026
48 results for cost prediction

Deep neural network predicts health costs better than traditional models.

problem Accurate prediction of healthcare costs for optimal cost management.
method Developed a deep neural network to predict future health care costs from health insurance claims records.
result Deep neural network outperformed ridge regression and Morbi-RSA models in cost prediction.

We seek decision rules for prediction-time cost reduction, where complete data is available for training, but during prediction-time, each feature can only be acquired for an additional cost. We propose a novel random forest algorithm to minimize prediction error for a user-specified {\it average} feature acquisition b…

2015-02-20abs ↗pdf ↗

Low-cost sensors improve air quality prediction accuracy significantly.

problem Improving air quality monitoring networks with affordable sensors.
method Developed a high-resolution air quality prediction engine using low-cost sensors and official data.
result The use of low-cost sensors improves prediction accuracy by 25% and 15% for PM2.5 and PM10 respectively in densely monitored areas.

Variational Prediction simplifies Bayesian inference without test time costs.

problem Bayesian inference's computational costs and posterior predictive distribution marginalization.
method Variational Prediction learns a variational approximation to the posterior predictive distribution using a variational bound.
result Directly learns a variational approximation to the posterior predictive distribution without test time marginalization costs.

LMM predicts healthcare costs and risks with improved accuracy.

problem Wasteful healthcare spending and inefficiencies in risk prediction.
method Generative pre-trained transformer trained on patient event sequences.
result Improves cost prediction by 14.1% and chronic conditions prediction by 1.9%.

FavMac maximizes value while controlling cost in multi-label prediction.

problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.

In predictive maintenance, model performance is usually assessed by means of precision, recall, and F1-score. However, employing the model with best performance, e.g. highest F1-score, does not necessarily result in minimum maintenance cost, but can instead lead to additional expenses. Thus, we propose to perform model…

2018-09-28abs ↗pdf ↗

Paper tackles regression with cost-based rejection, balancing prediction and rejection costs.

problem Regression with cost-based rejection, balancing prediction and rejection costs in a continuous target space.
method Formulated expected risk, derived Bayes optimal solution, proposed surrogate loss function.
result Bayes optimal solution can be recovered by the proposed surrogate loss function.

We propose a novel adaptive approximation approach for test-time resource-constrained prediction. Given an input instance at test-time, a gating function identifies a prediction model for the input among a collection of models. Our objective is to minimize overall average cost without sacrificing accuracy. We learn gat…

2017-05-26abs ↗pdf ↗

We design an active learning algorithm for cost-sensitive multiclass classification: problems where different errors have different costs. Our algorithm, COAL, makes predictions by regressing to each label's cost and predicting the smallest. On a new example, it uses a set of regressors that perform well on past data t…

2017-03-03abs ↗pdf ↗

Optimizes state monitoring in Markovian systems with cost constraints.

problem Balancing state queries with prediction costs in Markovian systems.
method Greedy policy and SGD-based learning variant for optimal predict-query tradeoff.
result Greedy policy is suboptimal but performs close to optimal under certain conditions.

We present a dynamic model selection approach for resource-constrained prediction. Given an input instance at test-time, a gating function identifies a prediction model for the input among a collection of models. Our objective is to minimize overall average cost without sacrificing accuracy. We learn gating and predict…

2017-04-25abs ↗pdf ↗

The grid integration of intermittent Renewable Energy Sources (RES) causes costs for grid operators due to forecast uncertainty and the resulting production schedule mismatches. These so-called profile service costs are marginal cost components and can be understood as an insurance fee against RES production schedule u…

2014-07-27abs ↗pdf ↗

In many real-world machine learning problems, feature values are not readily available. To make predictions, some of the missing features have to be acquired, which can incur a cost in money, computational time, or human time, depending on the problem domain. This leads us to the problem of choosing which features to u…

2019-12-17abs ↗pdf ↗

We study online optimization in a setting where an online learner seeks to optimize a per-round hitting cost, which may be non-convex, while incurring a movement cost when changing actions between rounds. We ask: \textit{under what general conditions is it possible for an online learner to leverage predictions of futur…

2019-11-10abs ↗pdf ↗

Many applications require the collection of data on different variables or measurements over many system performance metrics. We term those broadly as measures or variables. Often data collection along each measure incurs a cost, thus it is desirable to consider the cost of measures in modeling. This is a fairly new cl…

2019-01-02abs ↗pdf ↗

Paper proposes a cost-sensitive conformal training method with provably controllable learning bounds.

problem Uncertainty quantification and learning bounds in conformal prediction.
method Cost-sensitive conformal training algorithm that minimizes the expected size of prediction sets using rank weighting.
result Theoretical analysis shows tightness between weighted objective and expected size of conformal prediction sets.

A new method for decision-focused learning reduces computational cost.

problem Efficiently solving combinatorial problems with uncertain parameters.
method Reframed as cost-sensitive multi-output regression, with novel loss components.
result Comparable downstream task quality with reduced computational cost.

ICP improves prediction intervals for continuous outcomes at lower computational cost.

problem Systematic bias in point predictions that undermines their use in decision-making.
method Develops Isotonic Conformal Prediction (ICP) framework to decouple calibration from prediction-set construction.
result SICP and TICP procedures match SC-CP coverage at lower computational cost.

We consider the problem of learning decision rules for prediction with feature budget constraint. In particular, we are interested in pruning an ensemble of decision trees to reduce expected feature cost while maintaining high prediction accuracy for any test example. We propose a novel 0-1 integer program formulation …

2016-01-05abs ↗pdf ↗

We consider a framework for structured prediction based on search in the space of complete structured outputs. Given a structured input, an output is produced by running a time-bounded search procedure guided by a learned cost function, and then returning the least cost output uncovered during the search. This framewor…

2012-06-27abs ↗pdf ↗

In the setting of sequential prediction of individual {0,1}\{0, 1\}-sequences with expert advice, we show that by allowing the learner to abstain from the prediction by paying a cost marginally smaller than 12\frac 12 (say, 0.490.49), it is possible to achieve expected regret bounds that are independent of the time horizon …

2020-01-28abs ↗pdf ↗

The paper analyzes the benefit-cost ratio for feature selection in machine learning.

problem Tackling the challenge of distinguishing relevant features from noise in feature selection.
method Simulation study with different cost and data settings to analyze the benefit-cost ratio.
result The benefit-cost ratio can overemphasize cheap noise features in scenarios with large cost differences and small effect sizes.

MPC framework reduces execution costs and schedule deviations in trading.

problem Executing large orders in markets under time and liquidity constraints.
method Model Predictive Control (MPC) framework balancing order completion, market impact, and opportunity cost.
result Significant reductions in slippage and schedule shortfall compared to benchmarks.

Cost-efficient feature selection for multi-label classification in medicine.

problem Feature selection in multi-label classification with cost constraints.
method Sequential feature selection maximizing conditional mutual information, followed by cost-free feature selection using shadow features.
result The method effectively reduces prediction costs in medical applications.

Study learns state representations from observations for control, proving guarantees.

problem Learning state representations from high-dimensional observations for control.
method Cost-driven approach, learning latent state model to predict costs.
result Proves finite-sample guarantees for near-optimal state representation and controller.

We present a novel optimization method, named the Combined Optimization Method (COM), for the joint optimization of two or more cost functions. Unlike the conventional joint optimization schemes, which try to find minima in a weighted sum of cost functions, the COM explores search space for common minima shared by all …

2018-08-21abs ↗pdf ↗

We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in ord…

2016-02-28abs ↗pdf ↗

Sunshine trading theory predicts lower execution costs and liquidity provision through explicit preannouncements, but evidence is scarce in traditional markets.

problem Adverse selection on liquidity provision
method Reconstructing metaorders and comparing them with visible TWAP executions
result Visible TWAPs face lower execution costs and leave a smaller permanent price impact compared to hidden metaorders.

AM-PPI uses multiple predictors to reduce label cost in healthcare AI.

problem Reduces label cost in post-deployment monitoring of healthcare AI.
method Combines model predictions with a small labeled sample, routing each instance to a cost-appropriate subset of predictors.
result Produces narrower confidence intervals than single-predictor methods.

New research challenges the idea that counterfactual explanations should be sparse.

problem Predictive multiplicity leads to multiple models giving almost equal solutions.
method Derive a general upper bound for counterfactual costs under multiplicity and compare sparse vs. data support approaches.
result Data support methods are more robust to multiplicity but have higher counterfactual costs.

New GPnn method achieves scalable regression with low computational cost.

problem Inefficient Gaussian Process (GP) regression for large datasets.
method GP nearest-neighbour (GPnn) prediction with robustness and limiting behaviour exploration.
result GPnn achieves high MSE accuracy with minimal parameter estimation effort, even in gross misspecification.

The paper presents a method to assign accurate and calibrated uncertainties to deterministic model predictions.

problem Assigning uncertainties to deterministic model predictions.
method Transforming deterministic predictions into probabilistic ones using a cost function that balances accuracy and reliability.
result The method improves the reliability of probabilistic predictions without sacrificing accuracy.

ACE improves GBI for simulators by approximating cost functions, making inference more efficient.

problem Inference for misspecified simulators is overly restrictive.
method Amortized cost estimation (ACE) for Generalized Bayesian Inference (GBI).
result ACE provides accurate cost predictions and more efficient inference.