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

Trend · papers per month

23466891 · Jun 202019922001200920172026
48 results for resource usage

Method predicts hardware resource usage by control software with guaranteed linear convergence.

problem Predicting time-varying hardware resource availability in control software.
method Path structured multimarginal Schrödinger bridge (MSBP) for learning stochastic resource usage.
result Guaranteed linear convergence to accurate prediction of hardware resource utilization.

A new model improves homogeneity in burn patient reimbursement.

problem Incomplete homogeneity checks for burn patients using LOS as a proxy.
method Cost-sensitive decision tree model considering patient-level cost and severity of burn.
result Identified groups with increased homogeneity compared to current HRG groups.

Large multi-tenant production clusters often have to handle a variety of jobs and applications with a variety of complex resource usage characteristics. It is non-trivial and non-optimal to manually create placement rules for scheduling that would decide which applications should co-locate. In this paper, we present De…

2019-07-30abs ↗pdf ↗

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.

New framework guides resource usage to achieve sublinear regret in adversarial settings.

problem Achieving sublinear regret in online decision making with changing reward and cost distributions.
method General primal-dual methods guided by spending plans that ensure balanced resource usage.
result Achieves sublinear regret with respect to spending plans that balance resource usage.

We consider a fundamental dynamic allocation problem motivated by the problem of securities lending\textit{securities lending} in financial markets, the mechanism underlying the short selling of stocks. A lender would like to distribute a finite number of identical copies of some scarce resource to nn clients, each of whom has a priv…

2019-12-12abs ↗pdf ↗

EEG-TCNet improves MI-BMIs with high accuracy and low resource usage.

problem Improving motor-imagery brain-machine interfaces with high accuracy and low resource usage.
method Proposes EEG-TCNet, a novel TCN for embedded MI-BMIs.
result EEG-TCNet achieves 83.84% classification accuracy on MOABB, outperforming SoA by 0.25.

The paper identifies when larger models improve predictions and proposes a switcher model.

problem Understanding when larger models benefit from added complexity.
method Numerical studies on T5 architecture to analyze predictive uncertainty and model performance.
result Large models improve on examples where small models are uncertain, but not on certain examples.

SCENE-Net improves 3D point cloud segmentation with low resource usage and transparency.

problem Lack of resources and transparency in 3D semantic segmentation models.
method SCENE-Net uses signature shapes identified via GENEOs to achieve semantic segmentation with minimal resources.
result SCENE-Net achieves comparable IoU to state-of-the-art methods with less data and computational resources.

RSmote improves PINNs accuracy with less memory usage.

problem Imbalanced learning in Physics-Informed Neural Networks (PINNs).
method Residual-based Smote (RSmote) for local adaptive sampling.
result RSmote achieves or exceeds accuracy of state-of-the-art methods while reducing memory usage.

HIVE-COTE v1.0 improves time series classification with enhanced usability.

problem Improving time series classification accuracy and usability.
method Presented a walkthrough guide and extensive experimental evaluation of HIVE-COTE v1.0.
result HIVE-COTE v1.0 outperforms three recently proposed algorithms in predictive performance and resource usage.

EERO optimizes resource usage for efficient classification.

problem Managing computational resources in complex machine learning models.
method EERO uses multiple classifiers with a reject option to adaptively shorten processing paths.
result EERO effectively manages budget allocation and enhances accuracy in complex scenarios.

CICLAD efficiently mines frequent closed itemsets from data streams with minimal memory usage.

problem Mining frequent closed itemsets from data streams is resource-intensive.
method CICLAD is an intersection-based sliding-window FCI miner that optimizes memory usage while maintaining performance.
result CICLAD achieves significantly lower memory footprint compared to existing methods.

DE is a new exploration method that limits resource usage based on expected improvement and surprise.

problem Limited exploration in large action spaces when resources are scarce.
method Delight-gated exploration (DE) that limits exploration actions based on a gate price set by the product of expected improvement and surprise.
result DE outperforms ε\varepsilon-greedy and Thompson Sampling in terms of regret across various bandit and MDP settings.

Machine learning models are often used at test-time subject to constraints and trade-offs not present at training-time. For example, a computer vision model operating on an embedded device may need to perform real-time inference, or a translation model operating on a cell phone may wish to bound its average compute tim…

2017-02-24abs ↗pdf ↗

Continuous-depth Evoformer reduces protein folding prediction time and resource usage.

problem Efficient protein structure prediction with reduced computational costs.
method Continuous-depth formulation of Evoformer using Neural Ordinary Differential Equations (Neural ODEs).
result The continuous-time Evoformer achieves constant memory cost and improved efficiency.

Propagates adversarial robustness in federated learning.

problem Heterogeneous federated users with non-iid data and limited resources.
method Adversarial robustness propagation through batch-normalization.
result Federated models achieve remarkable robustness even with limited adversarial training.

Supermarkets need to ensure clean and safe environments for both shoppers and employees. Slips, trips, and falls can result in injuries that have a physical as well as financial cost. Timely detection of hazardous conditions such as spilled liquids or fallen items on supermarket floors can reduce the chances of serious…

2020-02-29abs ↗pdf ↗

The authors characterize flexibility in power and energy markets considering time, spatiality, resource, and risk.

problem Evaluating and maximizing flexibility in power systems and markets.
method Characterization of flexibility dimensions (time, spatiality, resource, risk) and their interrelations with flexibility assets, products, and services.
result Flexibility should be evaluated based on multiple dimensions for efficient power systems and markets.

T-Basis represents neural network tensors with fewer parameters.

problem Efficiently representing neural network tensors with fewer parameters.
method T-Basis uses Tensor Rings to represent tensors in a neural network, parameterizing them with a small number of coefficients.
result T-Basis achieves high compression rates with minimal performance loss.

The convolutional layers are core building blocks of neural network architectures. In general, a convolutional filter applies to the entire frequency spectrum of the input data. We explore artificially constraining the frequency spectra of these filters and data, called band-limiting, during training. The frequency dom…

2019-11-21abs ↗pdf ↗

Innovative neural networks reduce memory usage for efficient, accurate segmentation.

problem Efficiently segmenting large graphs with limited memory.
method Iterative neural networks with loops and multiple outputs.
result State-of-the-art semantic segmentation results on demanding datasets.

Top-KAST maintains constant sparsity in large neural networks, improving performance and reducing resource usage.

problem Training large sparse neural networks is computationally expensive and resource-intensive.
method Top-KAST preserves constant sparsity in both forward and backward passes during training.
result Top-KAST outperforms previous methods on the ImageNet benchmark and language modeling tasks.

We propose two optimization techniques to minimize memory usage and computation while meeting system timing constraints for real-time classification in wearable systems. Our method derives a hierarchical classifier structure for Support Vector Machine (SVM) in order to reduce the amount of computations, based on the pr…

2019-07-07abs ↗pdf ↗

Deep neural networks (DNNs) have been expanded into medical fields and triggered the revolution of some medical applications by extracting complex features and achieving high accuracy and performance, etc. On the contrast, the large-scale network brings high requirements of both memory storage and computation resource,…

2019-11-04abs ↗pdf ↗