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

0.8%1.6%2.4%3.2% · Jun 200019922001200920172026
48 results for database workload

Paper proposes a method to predict optimal data partitioning based on query execution costs.

problem Finding optimal data partitioning for improved system performance and scalability.
method Formal model abstraction of workload queries, genetic algorithm for optimization, evaluation using PostgreSQL's query optimizer.
result The approach effectively reduces workload execution cost and improves system performance.

Recent hardware developments have dramatically increased the scale of data parallelism available for neural network training. Among the simplest ways to harness next-generation hardware is to increase the batch size in standard mini-batch neural network training algorithms. In this work, we aim to experimentally charac…

2018-11-08abs ↗pdf ↗

Developing reliable workload predictive models can affect many aspects of clinical decision making procedure. The primary challenge in healthcare systems is handling the demand uncertainty over the time. This issue becomes more critical for the healthcare facilities that provide service for chronic disease treatment be…

2018-12-27abs ↗pdf ↗

Proposes a framework for energy-efficient AIGC workload scheduling in cloud data centers.

problem Challenges of scheduling AIGC workloads for energy efficiency and quality control.
method Joint energy management and coordinated AIGC workload scheduling framework with diffusion model-aided reward shaping.
result Effective learning of scheduling policies under sparse environmental feedback.

Configuration spaces for computer systems can be challenging for traditional and automatic tuning strategies. Injecting task-specific knowledge into the tuner for a task may allow for more efficient exploration of candidate configurations. We apply this idea to the task of index set selection to accelerate database wor…

2019-09-16abs ↗pdf ↗

Proposes FIPO-BC for efficient online calibration of complex models.

problem Efficiently calibrating computationally expensive models with large datasets.
method Fixed inducing points online Bayesian calibration (FIPO-BC) algorithm.
result FIPO-BC is at least ten times faster than standard methods and enables online updates.

Paper proposes a human-algorithm approach to reduce medical device recall risk and workload.

problem High recall rate and regulatory workload in FDA's 510(k) pathway.
method Developed machine learning models to estimate recall risk and proposed a data-driven clearance policy.
result Conservative evaluation of policy shows a 32.9% improvement in recall rate and 40.5% reduction in workload.

Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems, however, use simple generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each workload is infeasible. In this paper, we show that modern ma…

2018-10-03abs ↗pdf ↗

Paper develops a BERT-based classifier to reduce pathology report annotation workload.

problem Manual annotation of pathology reports is labor-intensive and time-consuming.
method Developed an automatic text classifier using BERT and introduced a human-centric metric to identify low-confidence cases.
result The model reduces manual annotation workload by 80% to 98%.

Preserving the privacy of individuals by protecting their sensitive attributes is an important consideration during microdata release. However, it is equally important to preserve the quality or utility of the data for at least some targeted workloads. We propose a novel framework for privacy preservation based on the …

2017-11-05abs ↗pdf ↗

Simple policy outperforms complex ones in cloud auto-scaling.

problem Predicting resource scaling for large-scale cloud applications with limited deployment throughput.
method Probabilistic workload forecast for auto-scaling decisions based on risk aversion.
result The proposed policy outperforms sophisticated and simple benchmark policies in real-world and synthetic data.

SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.

problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.

This paper optimizes how deep learning models are distributed across different devices.

problem Optimizing how large, complex neural networks are split across multiple devices.
method Identified and solved an optimization problem for device placement of DNN operators.
result Automated algorithms that solve the device placement problem for modern pipelined settings.

Classifying human cognitive states from behavioral and physiological signals is a challenging problem with important applications in robotics. The problem is challenging due to the data variability among individual users, and sensor artefacts. In this work, we propose an end-to-end framework for real-time cognitive wor…

2018-10-07abs ↗pdf ↗

Gradient boosting decision tree (GBDT) is a widely-used machine learning algorithm in both data analytic competitions and real-world industrial applications. Further, driven by the rapid increase in data volume, efforts have been made to train GBDT in a distributed setting to support large-scale workloads. However, we …

2019-07-03abs ↗pdf ↗

AlgoPerf competition evaluates neural network training speed-ups.

problem Improving neural network training speed using better algorithms.
method Compared 18 diverse submissions from 10 teams on multiple workloads.
result Schedule Free AdamW algorithm achieved best results in self-tuning ruleset.

Optimizes resource allocation for virtualized network functions based on performance profiles.

problem Mapping SLA performance requirements to dynamic virtualized infrastructure resources.
method Profile-based resource allocation using VNF performance datasets and machine learning models.
result A method to predict and recommend optimal resource allocation for network services.

Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.

problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.

AutoPQ automates quantile forecasting for smart grids, reducing workload and environmental impact.

problem Accurate and unbiased uncertainty quantification in probabilistic forecasting for smart grid operations.
method AutoPQ uses a conditional Invertible Neural Network (cINN) to generate quantile forecasts from point forecasts, automating model selection and hyperparameter optimization.
result AutoPQ outperforms state-of-the-art methods while reducing computational effort and environmental impact.

FLAME auto-labels mobile data efficiently on diverse processors.

problem Accurately and efficiently labeling mobile data with unknown labels on heterogeneous processors.
method Self-adaptive auto-labeling system Flame that schedules and executes workloads on mobile processors.
result Flame achieves high labeling accuracy and performance on heterogeneous mobile processors.

We introduce a learning-based framework to optimize tensor programs for deep learning workloads. Efficient implementations of tensor operators, such as matrix multiplication and high dimensional convolution, are key enablers of effective deep learning systems. However, existing systems rely on manually optimized librar…

2018-05-21abs ↗pdf ↗

Service-induced congestion in memory-constrained LLM serving

problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.

Study connects database alignment and planted matching using Gaussian features.

problem Identify matching between correlated user features in anonymized databases.
method Derived results for database alignment and planted matching, showing connections and thresholds.
result Performance thresholds for database alignment converge to planted matching when feature dimensionality is sufficiently high.

We consider the problem of aligning a pair of databases with jointly Gaussian features. We consider two algorithms, complete database alignment via MAP estimation among all possible database alignments, and partial alignment via a thresholding approach of log likelihood ratios. We derive conditions on mutual informatio…

2019-03-04abs ↗pdf ↗

We improve private training accuracy with learning rate schedules and matrix factorizations.

problem Private training with learning rate schedules and correlated noise.
method General upper and lower bounds for learning rate schedules, memory-efficient constructions, and schedule-aware factorizations.
result Schedule-aware factorizations improve accuracy in private training.

In this work we examine some of the problems associated with the development of machine learning models with the objective to achieve robust generalization capabilities on common-task multiple-database scenarios. Referred to as the "database variability problem", we focus on a specific medical domain (sleep staging in …

2019-06-16abs ↗pdf ↗

Deep learning (DL) training-as-a-service (TaaS) is an important emerging industrial workload. The unique challenge of TaaS is that it must satisfy a wide range of customers who have no experience and resources to tune DL hyper-parameters, and meticulous tuning for each user's dataset is prohibitively expensive. Therefo…

2016-11-18abs ↗pdf ↗

Graph database outperforms in filtering ESG stocks efficiently.

problem Efficiently filtering ESG stocks from large lists of equities.
method Compared SQL, No-SQL, and graph databases; used Python for database interactions; collected data from stock price and financial news.
result Graph database is more efficient for ESG stock filtering.

CwA optimizes search performance by jointly learning a balanced database partition and a neural probing function.

problem Suboptimal search performance due to mismatched database and query distributions.
method CwA jointly learns a balanced database partition and a neural probing function to optimize search performance directly for the query distribution.
result CwA achieves up to 4.7x throughput over state-of-the-art methods at equal recall.

Deep learning (DL) is one of the most prominent branches of machine learning. Due to the immense computational cost of DL workloads, industry and academia have developed DL libraries with highly-specialized kernels for each workload/architecture, leading to numerous, complex code-bases that strive for performance, yet …

2019-06-15abs ↗pdf ↗

Bayesian entity resolution merges together multiple, noisy databases and returns the minimal collection of unique individuals represented, together with their true, latent record values. Bayesian methods allow flexible generative models that share power across databases as well as principled quantification of uncertain…

2014-10-17abs ↗pdf ↗

We present a database of parliamentary debates that contains the complete record of parliamentary speeches from Dáil Éireann, the lower house and principal chamber of the Irish parliament, from 1919 to 2013. In addition, the database contains background information on all TDs (Teachta Dála, members of parliament), such…

2017-08-15abs ↗pdf ↗