We estimate treatment cost-savings from early cancer diagnosis. For breast, lung, prostate and colorectal cancers and melanoma, which account for more than 50% of new incidences projected in 2017, we combine published cancer treatment cost estimates by stage with incidence rates by stage at diagnosis. We extrapolate to…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Cost Savings”
New Bitcoin coin selection method improves cost savings.
problem Improving cost savings in Bitcoin coin selection.
method Coin selection with leverage, allowing user-tunable parameters.
result Natural replacement for standard knapsack method.
Cash management is concerned with optimizing the short-term funding requirements of a company. To this end, different optimization strategies have been proposed to minimize costs using daily cash flow forecasts as the main input to the models. However, the effect of the accuracy of such forecasts on cash management pol…
RL agent learns to save costs by managing household energy storage.
problem Maximizing cost savings in smart grids with household energy storage.
method Data-driven RL agent learns from tariff structures and storage capacity.
result RL agent explains its learning process and strategies.
Reinforcement learning (RL) for robotics is challenging due to the difficulty in hand-engineering a dense cost function, which can lead to unintended behavior, and dynamical uncertainty, which makes exploration and constraint satisfaction challenging. We address these issues with a new model-based reinforcement learnin…
This work reduces computation cost for on-device CNN training.
problem High computation cost during on-device CNN training.
method Self-supervised instance filtering and error map pruning.
result Substantial computation saving without significant accuracy loss.
New method reduces computational cost for estimating PAC-Bayes bounds.
problem High computational cost in estimating PAC-Bayes bounds.
method General alternative method that makes computational savings.
result Reduces computational cost on the order of the dataset size.
E2-Train reduces training energy by 80%+ for state-of-the-art CNNs.
problem Efficient training of energy-hungry CNNs on edge devices.
method Selective layer update, stochastic mini-batch dropping, and sign prediction for low-precision backpropagation.
result Achieves >90% energy savings for training ResNet-74 on CIFAR-10.
Optimizes package types for e-commerce to reduce damage and costs.
problem Sub-optimal package types lead to damaged shipments and high costs.
method Multi-stage approach that balances shipment and damage costs using a scalable algorithm.
result Significant cost savings of tens of millions of dollars achieved.
SAVE combines Q-learning and MCTS with amortized value estimates for improved performance.
problem Combining model-free Q-learning and model-based MCTS for efficient learning and planning.
method SAVE uses a learned prior to guide MCTS, which estimates improved state-action values. These estimates are used to update the prior, creating a cooperative relationship between learning and search.
result SAVE achieves higher rewards with fewer training steps and strong performance with small search budgets.
Study on optimal portfolio selection with varying borrowing and saving rates in continuous-time markets.
problem Optimal portfolio selection in markets with different borrowing and saving rates.
method Hamilton-Jacobi-Bellman equation, partial differential equation, verification argument.
result Existence and smoothness of the value function, identification of trading regions and strategies.
Energy savings for DNN inference on resource-constrained devices.
problem Energy efficiency in deep learning inference for constrained devices.
method Efficiently searches through equivalent DNN graphs to find the one with the least execution cost.
result Achieves 24% energy savings with minimal performance impact.
Efficiently identifies promising hyperparameters for online learning models.
problem Expensive hyperparameter search for non-stationary model training.
method Two-stage approach: efficient configuration identification followed by full training.
result Up to 10x reduction in hyperparameter search cost on public benchmark.
SUPAID automates vehicle rollout decisions for fleet managers.
problem Automating supervisor's vehicle rollout decisions to prevent costly mistakes.
method Rule mining approach based on 'one-way efficiency' assumption.
result SUPAID significantly reduces costs in a real transit agency setting.
Cer-Eval saves LLM evaluation costs while maintaining accuracy.
problem Challenges in evaluating large language models due to large dataset requirements.
method Adapts to different evaluation objectives, uses test sample complexity, and develops a partition-based algorithm.
result Cer-Eval can save 20-40% test points with comparable accuracy and 95% confidence guarantee.
CAPO optimizes LLM prompts more efficiently and cost-effectively.
problem Costly and inefficient automatic prompt optimization for LLMs.
method Integrates AutoML techniques for evolutionary optimization of instructions and few-shot examples.
result Significantly improves prompt optimization efficiency and accuracy.
The paper optimizes LLM accuracy by stopping early based on consistent answers.
problem Improving LLM accuracy in math and reasoning problems.
method Bayesian stopping policy to save on sampling costs, tracking only the L-1 most frequent answer counts.
result The L=3 stopping policy is sufficient for asymptotic optimality and significantly reduces inference costs.
New features reduce computational cost of variational inference.
problem Efficiently compute ELBO with reduced computational cost.
method Developed features that reduce to for large .
result Unbiased ELBO estimation with reduced computational complexity.
In this paper we present a slight modification of the Fourier estimation method of the spot volatility (matrix) process of a continuous Itô semimartingale where the estimators are always non-negative definite. Since the estimators are factorized, computational cost will be saved a lot.
Active learning has shown to reduce the number of experiments needed to obtain high-confidence drug-target predictions. However, in order to actually save experiments using active learning, it is crucial to have a method to evaluate the quality of the current prediction and decide when to stop the experimentation proce…
Comparison Lift uses bandit algorithms to optimize online ad testing.
problem Optimizing online ad testing to maximize click-through rates.
method Bandit-based experimentation algorithm that adapts to test results.
result Ad click-through rates increased by 46% on average.
Field canals improvement projects (FCIPs) are one of the ambitious projects constructed to save fresh water. To finance this project, Conceptual cost models are important to accurately predict preliminary costs at the early stages of the project. The first step is to develop a conceptual cost model to identify key cost…
mfEGRA uses active learning to efficiently locate failure boundaries in reliability analysis.
problem Prohibitive cost of reliability analysis using Monte Carlo sampling for high-fidelity models.
method Develops a multifidelity active learning method using data-driven adaptively refined surrogates.
result Significant computational savings (46-48%) compared to single-fidelity EGRA.
Researchers save memory on MCUs by reordering neural network operators.
problem Memory constraints on microcontrollers for neural network inference.
method Operator reordering to save memory, orthogonal to other compression methods.
result Reduced memory footprint of a CNN to deploy on an MCU with 512KB SRAM.
We give an explicit algorithm and source code for extracting expected returns for stocks from expected returns for alphas. Our algorithm altogether bypasses combining alphas with weights into "alpha combos". Simply put, we have developed a new method for trading alphas which does not involve combining them. This yields…
A new method estimates generative model mappings using kernel transfer operators, reducing costs and improving performance.
problem Efficiently estimating mappings between known and unknown distributions in generative models.
method Adapting kernel transfer operators to estimate mappings, reducing computational costs.
result Significant runtime savings and good empirical performance compared to existing methods.
oPoW proposes a new PoW algorithm to reduce mining costs and environmental impact.
problem Scalability issues, environmental concerns, and systemic risks in Bitcoin PoW.
method oPoW is a novel PoW algorithm that shifts mining costs from electricity to hardware (CAPEX).
result oPoW reduces mining costs and improves network scalability, decentralization, and issuance.
Paper proposes a data augmentation method for LLM-generated data in market research.
problem Bias in LLM-generated data in market research.
method Statistical data augmentation approach integrating LLM-generated and real data.
result Statistically robust estimators with reduced bias and cost savings.
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.
The multimodal web elements such as text and images are associated with inherent memory costs to store and transfer over the Internet. With the limited network connectivity in developing countries, webpage rendering gets delayed in the presence of high-memory demanding elements such as images (relative to text). To ove…
Paper improves DNN accelerator robustness against bit errors with energy savings.
problem Bit errors in quantized DNN weights reduce energy efficiency.
method Combines robust fixed-point quantization, weight clipping, and random bit error training.
result Significantly improves robustness against random bit errors with high energy savings.
The paper solves portfolio liquidation under transient price impact for 100 NASDAQ stocks.
problem Determining optimal trading strategies under various market impact models.
method Derives explicit solutions for market impact parameters in a portfolio liquidation model.
result The derived strategy achieves significant cost savings compared to benchmark models.
CTS machines improve screen development in printing industries, reducing costs and increasing profitability.
problem Inefficient screen development process in heat transfer printing and labeling.
method Implementation of CTS (computer-to-screen) technology for screen development.
result Reduction in material and operational costs, leading to profitability.
A new learning framework reduces PV-Battery system costs by 3.6%.
problem Optimizing PV-Battery systems for cost savings with accurate forecasts.
method Decision-focused learning framework integrating optimization and prediction.
result Decision-focused method reduces average electricity costs by 3.6%.
Early-bird tickets can be identified early in training, reducing costs.
problem Costly deep network training.
method Low-cost training schemes (early stopping, low-precision) and mask distance.
result Efficient training methods using EB tickets achieve up to 4.7x energy savings.
Machine learning has automated much of financial fraud detection, notifying firms of, or even blocking, questionable transactions instantly. However, data imbalance starves traditionally trained models of the content necessary to detect fraud. This study examines three separate factors of credit card fraud detection vi…
In this work, we consider to improve the model estimation efficiency by aggregating the neighbors' information as well as identify the subgroup membership for each node in the network. A tree-based penalty is proposed to save the computation and communication cost. We design a decentralized generalized alternatin…
We present here the Temporal Clustering Algorithm (TCA), an incremental learning algorithm applicable to problems of anticipatory computing in the context of the Internet of Things. This algorithm was tested in a specific prediction scenario of consumption of an electric water dispenser typically used in tropical count…
New framework reduces cost of financial option pricing simulations on FPGAs.
problem Efficiently simulate financial option pricing with reduced computational cost.
method Nested MLMC framework with low precision calculations on FPGAs.
result Higher computational savings compared to existing mixed-precision MLMC frameworks.
Argentum is a crypto coin for saving and investment in unstable countries.
problem Stable purchasing power for savings in unstable economies.
method Designing a crypto coin backed by investment instruments.
result Provides a stabilization instrument for savings in unstable economies.
D2P-Fed improves privacy and communication in federated learning.
problem Achieving both differential privacy and communication efficiency in federated learning.
method Applying discrete Gaussian noise to private data transmission.
result D2P-Fed outperforms state-of-the-art by 4.7% to 13.0% in model accuracy with one-third less communication cost.
Method curates cost-effective, high-quality datasets using AI models.
problem Costly manual labeling of datasets.
method Probably Approximately Correct Labels (PACL) method.
result Curates high-quality datasets with low overall labeling error.
Study bank salvage model with stochastic impulse controls to minimize costs.
problem Minimize total cost of saving a bank from default with unpredictable default time.
method Impulse stochastic controls to address the bank's default risk.
result Unique viscosity solution exists for the QVI, with Lipschitz and Holder continuity properties.
Two machine learning models detect anomalies in ER claims, saving up to 40% in improper payments.
problem Improper health insurance payments from fraud and upcoding.
method Two machine learning models: an upcoding model based on severity code distributions and a random forest model for claim sorting.
result Random forest model saved 12% to 40% in improper payments compared to a baseline approach.
We introduce an algorithm to locate contours of functions that are expensive to evaluate. The problem of locating contours arises in many applications, including classification, constrained optimization, and performance analysis of mechanical and dynamical systems (reliability, probability of failure, stability, etc.).…
MoDeGPT compresses large language models without accuracy loss, saving 98% compute costs.
problem Compression of large language models for resource-constrained devices.
method Structured compression framework using modular decomposition and matrix pair reduction.
result MoDeGPT achieves 90-95% zero-shot performance with 25-30% compression rates.
Risk control improves EENNs to make faster predictions without sacrificing accuracy.
problem Determining safe times for EENNs to exit early without degrading performance.
method Adapting risk control frameworks to EENNs to tune their exiting mechanism.
result Risk control enables EENNs to make faster predictions while maintaining user-specified performance goals.
Prize linked savings accounts provide a return in the form of randomly chosen accounts receiving large cash prizes, in lieu of a guaranteed and uniform interest rate. This model became legal for American national banks upon bipartisan passage of the American Savings Promotion Act in December 2014, and many states have …