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

Trend · papers per month

3468101135 · Jun 202019922001200920172026
48 results for waste reduction

To train good supervised and semi-supervised object classifiers, it is critical that we not waste the time of the human experts who are providing the training labels. Existing active learning strategies can have uneven performance, being efficient on some datasets but wasteful on others, or inconsistent just between ru…

2015-04-30abs ↗pdf ↗

LeanML reduces machine learning project waste by estimating best performance without training models.

problem Avoidable wastes in machine learning projects.
method Lean design pattern based on mutual information and performance metrics.
result Estimating best performance without training models is faster and cheaper.

New principle reduces load imbalance in LLM serving systems, saving up to 52% energy.

problem Wasted computational power due to load imbalance in LLM serving systems.
method Developed a universal load-balancing principle for barrier-synchronized systems with non-migratable state.
result Proves worst-case theoretical guarantees for imbalance reduction and energy savings.

Contrary to the situation with stochastic gradient descent, we argue that when using stochastic methods with variance reduction, such as SDCA, SAG or SVRG, as well as their variants, it could be beneficial to reuse previously used samples instead of fresh samples, even when fresh samples are available. We demonstrate t…

2016-02-05abs ↗pdf ↗

This study provides an independent, outside-in estimate of the cost and schedule risks of nuclear waste storage projects. Based on a reference class of 216 past, comparable projects, risk of cost overrun was found to be 202% or less, with 80% certainty, i.e., 20% risk of an overrun above 202%. Based on a reference clas…

2019-01-13abs ↗pdf ↗

Uplift models provide a solution to the problem of isolating the marketing effect of a campaign. For customer churn reduction, uplift models are used to identify the customers who are likely to respond positively to a retention activity only if targeted, and to avoid wasting resources on customers that are very likely …

2019-11-28abs ↗pdf ↗

Deep learning model reduces food waste by stabilizing online food delivery supply chains.

problem Wastage and bullwhip effect in online food delivery services.
method Two-phase LSTM network for demand forecasting, newsvendor model for inventory management.
result Significant reduction in bullwhip effect and food waste, improved forecasting accuracy.

This paper proposes a method to reduce complexity in GLMs with categorical predictors.

problem Wasteful, hard-to-interpret, and prone to overfitting of traditional one-hot encoding for high-cardinality categorical predictors.
method Clustering categories of categorical predictors through a numerical method that preserves or improves accuracy while reducing the number of coefficients.
result Clustering categories of categorical predictors reduces complexity substantially without harming accuracy.

We consider the problem of Bayesian parameter estimation for deep neural networks, which is important in problem settings where we may have little data, and/ or where we need accurate posterior predictive densities, e.g., for applications involving bandits or active learning. One simple approach to this is to use onlin…

2015-06-14abs ↗pdf ↗

Group discussions are essential for organizing every aspect of modern life, from faculty meetings to senate debates, from grant review panels to papal conclaves. While costly in terms of time and organization effort, group discussions are commonly seen as a way of reaching better decisions compared to solutions that do…

2016-04-25abs ↗pdf ↗

Persistent sampling improves SMC efficiency by retaining and reusing particles.

problem High computational costs and particle impoverishment in SMC.
method Persistent sampling (PS) retains and reuses particles from all prior iterations, using multiple importance sampling and resampling from a mixture of historical distributions.
result PS achieves more accurate posterior approximations and lower variance in marginal likelihood estimates without additional likelihood evaluations.

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%.

DBS dynamically adjusts batch sizes to improve cluster utilization.

problem Inefficient use of high-performance workers in synchronous distributed training.
method Dynamic Batch Size (DBS) strategy that adjusts batch size and dataset partition based on worker performance.
result Significantly improves cluster utilization and reduces training time.

Many learning algorithms require categorical data to be transformed into real vectors before it can be used as input. Often, categorical variables are encoded as one-hot (or dummy) vectors. However, this mode of representation can be wasteful since it adds many low-signal regressors, especially when the number of uniqu…

2019-08-26abs ↗pdf ↗

New methods prune unpromising rules from KGs, improving scalability and runtime.

problem Scalability issues in walk-based rule learning from KGs.
method Rule Hierarchy Framework (RHF) and Hierarchical Pruning (HPMs).
result Significant reductions in runtime and number of learned rules without compromising predictive performance.

Generating labeled training datasets has become a major bottleneck in Machine Learning (ML) pipelines. Active ML aims to address this issue by designing learning algorithms that automatically and adaptively select the most informative examples for labeling so that human time is not wasted labeling irrelevant, redundant…

2019-05-29abs ↗pdf ↗

We present a method for performing Hamiltonian Monte Carlo that largely eliminates sample rejection for typical hyperparameters. In situations that would normally lead to rejection, instead a longer trajectory is computed until a new state is reached that can be accepted. This is achieved using Markov chain transitions…

2014-09-18abs ↗pdf ↗

We give a complete algorithm and source code for constructing general multifactor risk models (for equities) via any combination of style factors, principal components (betas) and/or industry factors. For short horizons we employ the Russian-doll risk model construction to obtain a nonsingular factor covariance matrix.…

2016-02-16abs ↗pdf ↗

We present and analyze several strategies for improving the performance of stochastic variance-reduced gradient (SVRG) methods. We first show that the convergence rate of these methods can be preserved under a decreasing sequence of errors in the control variate, and use this to derive variants of SVRG that use growing…

2015-11-05abs ↗pdf ↗

Balancing exploration and exploitation is a fundamental part of reinforcement learning, yet most state-of-the-art algorithms use a naive exploration protocol like εε-greedy. This contributes to the problem of high sample complexity, as the algorithm wastes effort by repeatedly visiting parts of the state space that ha…

2019-11-20abs ↗pdf ↗

We study a sequential resource allocation problem between a fixed number of arms. On each iteration the algorithm distributes a resource among the arms in order to maximize the expected success rate. Allocating more of the resource to a given arm increases the probability that it succeeds, yet with a cut-off. We follow…

2018-03-28abs ↗pdf ↗

In both mobile and web applications, speeding up user interface response times can often lead to significant improvements in user engagement. A common technique to improve responsiveness is to precompute data ahead of time for specific activities. However, simply precomputing data for all user and activity combinations…

2019-12-14abs ↗pdf ↗

CPATTA uses conformal prediction for efficient test-time adaptation.

problem Low data selection efficiency in existing ATTA methods.
method Conformal Prediction, online weight-update algorithm, domain-shift detector, staged update scheme.
result CPATTA consistently outperforms state-of-the-art methods by 5% in accuracy.

SESSC clusters fuzzy rules for TSK classifiers, improving performance with label info.

problem Lack of supervised clustering for TSK fuzzy classifiers.
method SESSC integrates within-cluster compactness, between-cluster separation, and label information.
result SESSC initialization outperforms other clustering methods, especially for small rule numbers.

During the Great Recession, Democrats in the United States argued that government spending could be utilized to "grease the wheels" of the economy in order to create wealth and to increase employment; Republicans, on the other hand, contended that government spending is wasteful and discouraged investment, thereby incr…

2014-10-22abs ↗pdf ↗

Learning domain-invariant representations has become a popular approach to unsupervised domain adaptation and is often justified by invoking a particular suite of theoretical results. We argue that there are two significant flaws in such arguments. First, the results in question hold only for a fixed representation and…

2019-03-08abs ↗pdf ↗

Belief propagation and its variants are popular methods for approximate inference, but their running time and even their convergence depend greatly on the schedule used to send the messages. Recently, dynamic update schedules have been shown to converge much faster on hard networks than static schedules, namely the res…

2012-06-20abs ↗pdf ↗

To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in …

2014-02-17abs ↗pdf ↗

We present a novel technique for tailoring Bayesian quadrature (BQ) to model selection. The state-of-the-art for comparing the evidence of multiple models relies on Monte Carlo methods, which converge slowly and are unreliable for computationally expensive models. Previous research has shown that BQ offers sample effic…

2019-02-26abs ↗pdf ↗

After September 2008, the advanced economies severe decline caused demand for emerging economies' exports to drop and the crisis became truly global, much deeper and broader than expected. In these times of global depression, most countries and companies are affected, some more than others. The financial crisis has tur…

2010-10-28abs ↗pdf ↗

The recent framework of compressive statistical learning aims at designing tractable learning algorithms that use only a heavily compressed representation-or sketch-of massive datasets. Compressive K-Means (CKM) is such a method: it estimates the centroids of data clusters from pooled, non-linear, random signatures of …

2018-04-26abs ↗pdf ↗

In recent years, significant progress has been made in solving challenging problems across various domains using deep reinforcement learning (RL). Reproducing existing work and accurately judging the improvements offered by novel methods is vital to sustaining this progress. Unfortunately, reproducing results for state…

2017-09-19abs ↗pdf ↗