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

1234 · Jun 202019922001200920172026
48 results for resource-efficient

Resource-efficient oblique trees reduce neural signal classification costs.

problem Implementing efficient neural signal classifiers on resource-constrained devices.
method Integrating model compression, probabilistic routing, and cost-aware learning.
result Significant reduction in model size and feature extraction cost compared to state-of-the-art models.

Optimal design portfolios improve energy efficiency and reduce risk in uncertain reservoirs.

problem Uncertain reservoir conditions lead to unstable gas recovery and low resource efficiency.
method Developed optimal portfolios of well designs based on reservoir conditions and probabilities.
result Remarkable reduction in variation and substantial increase in energy efficiency achieved.

While machine learning is traditionally a resource intensive task, embedded systems, autonomous navigation, and the vision of the Internet of Things fuel the interest in resource-efficient approaches. These approaches aim for a carefully chosen trade-off between performance and resource consumption in terms of computat…

2020-01-07abs ↗pdf ↗

We propose doubly nested network(DNNet) where all neurons represent their own sub-models that solve the same task. Every sub-model is nested both layer-wise and channel-wise. While nesting sub-models layer-wise is straight-forward with deep-supervision as proposed in \cite{xie2015holistically}, channel-wise nesting has…

2018-06-20abs ↗pdf ↗

Paper presents efficient algorithms for convolutional neural networks using Winograd minimal filtering.

problem Resource-efficient implementation of convolutional neural networks.
method Winograd minimal filtering trick applied to M-tap filters (M=3,5,7,9,11) for parallel hardware implementation.
result Approximately 30% reduction in multipliers for fully parallel hardware implementation.

iMOCA optimizes multiple objectives with continuous approximations for resource efficiency.

problem Optimizing multiple objectives with continuous function approximations that balance accuracy and evaluation cost.
method Information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations (iMOCA) selects input and function approximations to maximize information gain per unit cost.
result iMOCA significantly improves over existing single-fidelity methods in approximating the optimal Pareto set.

ATA optimizes task allocation in distributed machine learning.

problem Greedy task allocation leads to inefficiencies in distributed machine learning.
method Adaptive Task Allocation (ATA) adapts to unknown computation time distributions.
result ATA identifies optimal task allocation without prior knowledge of computation times.

SEFR is a fast, energy-efficient classifier for ultra-low power devices.

problem Running machine learning on battery-powered devices is challenging due to time and energy constraints.
method SEFR is an ultra-low power classifier with linear time complexity for training and testing.
result SEFR is 63 times faster and 70 times more energy efficient than state-of-the-art classifiers.

SAM improves deep learning tasks by promoting balancedness, reducing outlier impact.

problem Improving generalization in deep learning tasks, especially with scale-invariant problems.
method Introduces balancedness as a new concept to depict global behaviors of SAM, focusing on the difference between squared norms of two variables.
result SAM promotes balancedness and is data-responsive, outperforming SGD in outlier scenarios.

DESTRESS optimizes decentralized nonconvex optimization with optimal IFO complexity and efficient communication.

problem Decentralized nonconvex finite-sum optimization in multi-agent systems.
method DESTRESS uses stochastic recursive gradient updates, gradient tracking, and careful hyper-parameter choices to achieve optimal IFO complexity with efficient communication.
result DESTRESS matches the optimal IFO complexity of centralized algorithms while maintaining communication efficiency.

Unified scoring model improves efficiency and performance across multiple tasks.

problem Efficient and resource-efficient automated scoring for diverse tasks.
method Knowledge-distilled multi-task Mixture-of-Experts (MoE) approach.
result Comparable performance to task-specific models with significantly less storage and training resources.

The paper presents a method to reduce computational and storage costs in PCA and spectral clustering.

problem Efficiently reducing computational and storage costs in PCA and spectral clustering.
method Randomly 'puncturing' the data matrix and kernel matrix through Bernoulli masks.
result The spectral behavior of the resulting kernel is fully tractable and can be drastically punctured without significant loss in performance.

We describe a general framework -- compressive statistical learning -- for resource-efficient large-scale learning: the training collection is compressed in one pass into a low-dimensional sketch (a vector of random empirical generalized moments) that captures the information relevant to the considered learning task. A…

2017-06-22abs ↗pdf ↗

While machine learning is traditionally a resource intensive task, embedded systems, autonomous navigation and the vision of the Internet-of-Things fuel the interest in resource efficient approaches. These approaches require a carefully chosen trade-off between performance and resource consumption in terms of computati…

2018-12-05abs ↗pdf ↗

New asynchronous SGD algorithms achieve optimal performance in distributed learning.

problem Asynchronous training introduces staleness, complicating optimization analysis.
method Developed rigorous framework for asynchronous first order stochastic optimization.
result Asynchronous SGD can achieve optimal time complexity, matching synchronous methods.

Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a s…

2018-04-20abs ↗pdf ↗

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 ↗

The task of accelerating large neural networks on general purpose hardware has, in recent years, prompted the use of channel pruning to reduce network size. However, the efficacy of pruning based approaches has since been called into question. In this paper, we turn to distillation for model compression---specifically,…

2018-10-24abs ↗pdf ↗

Study compares LSTM and ANN architectures for forex prediction, finding ANN more efficient.

problem Forex time series prediction efficiency and resource usage.
method Comparison of Long Short-Term Memory (LSTM) and specialized ANN architectures.
result Specialized ANN architecture performs better with fewer resources and faster execution.

Common event-triggered state estimation (ETSE) algorithms save communication in networked control systems by predicting agents' behavior, and transmitting updates only when the predictions deviate significantly. The effectiveness in reducing communication thus heavily depends on the quality of the dynamics models used …

2018-03-05abs ↗pdf ↗

Pseudo rehearsal uses non-photo-realistic images to save resources without sacrificing performance.

problem Catastrophic forgetting in neural networks when learning new tasks.
method Synthetically generate non-photo-realistic images to rehearse previous tasks.
result Non-photo-realistic images can be used for rehearsal without sacrificing performance and significantly reduce resource consumption.

This paper proposes a decentralized reinforcement learning method for multi-agent resource allocation.

problem Allocating heterogeneous resources among multiple agents in a decentralized manner.
method Liquid-Graph-Time Clustering-IPPO, integrating dynamic cluster consensus.
result LGTC-IPPO achieves more stable rewards, better coordination, and robust performance.

Two methods reduce BN and DNN complexity, balancing size and accuracy.

problem Balancing model size and prediction accuracy in Bayesian networks and deep neural networks.
method Quantization-aware training and tree-augmented naive Bayes structure learning extension.
result Pareto optimal models found for small-scale scenarios.

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 many learning situations, resources at inference time are significantly more constrained than resources at training time. This paper studies a general paradigm, called Differentiable ARchitecture Compression (DARC), that combines model compression and architecture search to learn models that are resource-efficient a…

2019-05-20abs ↗pdf ↗

Despite recent advances in training recurrent neural networks (RNNs), capturing long-term dependencies in sequences remains a fundamental challenge. Most approaches use backpropagation through time (BPTT), which is difficult to scale to very long sequences. This paper proposes a simple method that improves the ability …

2018-03-01abs ↗pdf ↗

We propose a new formulation for pruning convolutional kernels in neural networks to enable efficient inference. We interleave greedy criteria-based pruning with fine-tuning by backpropagation - a computationally efficient procedure that maintains good generalization in the pruned network. We propose a new criterion ba…

2016-11-19abs ↗pdf ↗

Large learning rates enhance model robustness and compressibility.

problem Achieving robustness and resource-efficiency in machine learning models.
method Identifying and utilizing large learning rates as a facilitator for robustness and compressibility.
result Large learning rates produce desirable representation properties and compare favorably to other methods.

Large scale machine learning (ML) systems such as the Alexa automatic speech recognition (ASR) system continue to improve with increasing amounts of manually transcribed training data. Instead of scaling manual transcription to impractical levels, we utilize semi-supervised learning (SSL) to learn acoustic models (AM) …

2019-04-24abs ↗pdf ↗

LEMON uses pre-trained models to scale neural networks efficiently.

problem Efficiency in scaling deep neural networks, especially Transformers, which are resource-intensive to train from scratch.
method LEMON initializes scaled models using pre-trained weights and optimizes learning rates.
result Significant reduction in training time and computational costs for Vision Transformers and BERT.

Collaborative personalization, such as through learned user representations (embeddings), can improve the prediction accuracy of neural-network-based models significantly. We propose Federated User Representation Learning (FURL), a simple, scalable, privacy-preserving and resource-efficient way to utilize existing neur…

2019-09-27abs ↗pdf ↗

This paper defines a new learning architecture, Layered Self-Organizing Maps (LSOMs), that uses the SOM and supervised-SOM learning algorithms. The architecture is validated with the MNIST database of hand-written digit images. LSOMs are similar to convolutional neural nets (covnets) in the way they sample data, but di…

2018-03-23abs ↗pdf ↗