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

Trend · papers per month

55109164218 · Jun 202019922001200920172026
48 results for Cost savings

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…

2017-08-30abs ↗pdf ↗

Convolutional neural networks (CNNs) have been increasingly deployed to edge devices. Hence, many efforts have been made towards efficient CNN inference in resource-constrained platforms. This paper attempts to explore an orthogonal direction: how to conduct more energy-efficient training of CNNs, so as to enable on-de…

2019-10-29abs ↗pdf ↗

We introduce "Search with Amortized Value Estimates" (SAVE), an approach for combining model-free Q-learning with model-based Monte-Carlo Tree Search (MCTS). In SAVE, a learned prior over state-action values is used to guide MCTS, which estimates an improved set of state-action values. The new Q-estimates are then used…

2019-12-05abs ↗pdf ↗

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.

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.

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.

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…

2017-08-09abs ↗pdf ↗

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.

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…

2017-11-06abs ↗pdf ↗

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.

We present a new Bitcoin coin selection algorithm, "coin selection with leverage", which aims to improve upon cost savings than that of standard knapsack like approaches. Parameters to the new algorithm are available to be tuned at the users discretion to address other goals of coin selection. Our approach naturally fi…

2019-11-04abs ↗pdf ↗

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.

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.

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.

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 …

2017-01-18abs ↗pdf ↗

Study on pooled annuity funds and how initial savings affect income stability.

problem Analyzing the stability of income payments in pooled annuity funds.
method Examining the influence of initial savings on income fluctuations and developing a criterion for pooling funds.
result Identification of a term, the 'implied number of homogeneous members', linking initial savings to income fluctuations.

Machine learning predicts flight connections for airline crew scheduling.

problem Predicting the next connecting flight for airline crews.
method Adapted neural network for multiclass classification from historical data.
result High accuracy (99.7%) in flight connection prediction.

We show how Adjoint Algorithmic Differentiation (AAD) allows an extremely efficient calculation of correlation Risk of option prices computed with Monte Carlo simulations. A key point in the construction is the use of binning to simultaneously achieve computational efficiency and accurate confidence intervals. We illus…

2010-04-11abs ↗pdf ↗

New method reduces variance in random coordinate descent for Langevin Monte Carlo.

problem Efficient sampling from log-concave distributions in high dimensions.
method Introduces RCAD, a variance reduction technique for RCD-LMC.
result RCAD-O-LMC and RCAD-U-LMC converge within the same number of iterations as classical LMC methods, saving computational cost.

The effects of saving and spending patterns on holding time distribution of money are investigated based on the ideal gas-like models. We show the steady-state distribution obeys an exponential law when the saving factor is set uniformly, and a power law when the saving factor is set diversely. The power distribution c…

2005-07-20abs ↗pdf ↗