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

Trend · papers per month

1.5%2.9%4.4%5.9% · Sep 201819922001200920172026
48 results for Memory Consumption

Improved EXACT strategy reduces GNN memory consumption and runtime.

problem Efficiently training large-scale GNNs with reduced memory usage.
method Block-wise quantization of intermediate activation maps with improved variance minimization.
result Further reduction in memory consumption (>15%) and runtime speedup (5%) with similar performance trade-offs.

The paper benchmarks data stream classifiers for human activity recognition on connected devices.

problem Challenges in human activity recognition on connected devices, particularly high memory consumption and low F1 scores.
method Evaluation of five stream classification algorithms on real and synthetic datasets, measuring both performance and resource consumption.
result HT and MF classifiers show superior performance and resilience to concept drift compared to other algorithms.

SGQuant reduces GNN memory usage without significant accuracy loss.

problem High memory consumption in GNNs limits their applicability on memory-constrained devices.
method Proposes a specialized GNN quantization scheme (SGQuant) with a quantization algorithm, fine-tuning scheme, and multi-granularity strategy.
result SGQuant reduces GNN memory footprint from 4.25x to 31.9x with minimal accuracy loss.

POET enables large neural network training on tiny devices with reduced energy.

problem Training large neural networks on memory-limited edge devices.
method Jointly optimizes rematerialization and paging for memory reduction, formulating an MILP for energy-efficient training.
result POET trains ResNet-18 and BERT within Cortex-M memory constraints, outperforming current methods in energy efficiency.

TensorOpt finds optimal parallelization strategies for DNN training.

problem Finding efficient parallelization strategies for DNN training.
method TensorOpt uses an algorithm (FT) to search for an optimal set of parallelization strategies considering multiple objectives.
result TensorOpt provides accurate runtime cost estimation and adapts to resource availability.

Tail averaging consists in averaging the last examples in a stream. Common techniques either have a memory requirement which grows with the number of samples to average, are not available at every timestep or do not accomodate growing windows. We propose two techniques with a low constant memory cost that perform tail …

2019-02-13abs ↗pdf ↗

Paper proposes a new method to select memory data for online class-incremental learning.

problem Selecting which buffered images to replay for online class-incremental learning.
method Adversarial Shapley value scoring method to preserve latent decision boundaries.
result Proposed ASER method provides competitive or improved performance compared to state-of-the-art methods.

State-of-the-art models are now trained with billions of parameters, reaching hardware limits in terms of memory consumption. This has created a recent demand for memory-efficient optimizers. To this end, we investigate the limits and performance tradeoffs of memory-efficient adaptively preconditioned gradient methods.…

2019-02-12abs ↗pdf ↗

The paper tackles scalability issues in Graph Representation Learning.

problem Prohibitive time and memory complexities in Graph Representation Learning.
method Leveraging the K-Core Decomposition property of Graphs to reduce time and memory consumption.
result Proposed techniques significantly reduce computational resources without compromising embedding quality.

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.

HomoODE connects DEQs and Neural ODEs via homotopy continuation, improving accuracy and memory efficiency.

problem Connecting DEQs and Neural ODEs for better model performance and efficiency.
method Established a connection between DEQs and Neural ODEs using homotopy continuation, proposing HomoODE.
result HomoODE outperforms existing implicit models in accuracy and memory consumption.

Model quantization is leveraged to reduce the memory consumption and the computation time of deep neural networks. This is achieved by representing weights and activations with a lower bit resolution when compared to their high precision floating point counterparts. The suitable level of quantization is directly relate…

2019-08-02abs ↗pdf ↗

Kernel methods have great promise for learning rich statistical representations of large modern datasets. However, compared to neural networks, kernel methods have been perceived as lacking in scalability and flexibility. We introduce a family of fast, flexible, lightly parametrized and general purpose kernel learning …

2014-12-19abs ↗pdf ↗

DPZero fine-tunes large models privately without backpropagation.

problem Memory and privacy challenges in fine-tuning large language models.
method DPZero uses zeroth-order methods for private fine-tuning, avoiding backpropagation.
result DPZero achieves private fine-tuning of RoBERTa and OPT on various tasks.

Deep neural networks (DNNs) depend on the storage of a large number of parameters, which consumes an important portion of the energy used during inference. This paper considers the case where the energy usage of memory elements can be reduced at the cost of reduced reliability. A training algorithm is proposed to optim…

2019-12-23abs ↗pdf ↗

This paper proposes a hardware-oriented dropout algorithm, which is efficient for field programmable gate array (FPGA) implementation. In deep neural networks (DNNs), overfitting occurs when networks are overtrained and adapt too well to training data. Consequently, they fail in predicting unseen data used as test data…

2019-11-14abs ↗pdf ↗

Deep neural networks solve stochastic control problems with delay.

problem Challenges in stochastic control problems with delay due to path-dependence and high dimensions.
method Employing recurrent neural networks (RNNs) to parameterize policies and optimize objectives.
result RNNs, especially LSTMs, efficiently capture path-dependence and outperform feedforward networks in training and performance.

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.

Training a neural network using backpropagation algorithm requires passing error gradients sequentially through the network. The backward locking prevents us from updating network layers in parallel and fully leveraging the computing resources. Recently, there are several works trying to decouple and parallelize the ba…

2018-07-12abs ↗pdf ↗

A new deep learning method using Boolean logic reduces training and inference energy.

problem High computational and energy costs in deep learning training and inference.
method Introduces Boolean weights and inputs for efficient training using Boolean logic.
result Achieves full-precision accuracy in ImageNet classification and surpasses state-of-the-art results in semantic segmentation.

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an…

2008-08-29abs ↗pdf ↗

We present a new approach to modeling sequential data: the deep equilibrium model (DEQ). Motivated by an observation that the hidden layers of many existing deep sequence models converge towards some fixed point, we propose the DEQ approach that directly finds these equilibrium points via root-finding. Such a method is…

2019-09-03abs ↗pdf ↗

Memory-augmented neural networks (MANNs) refer to a class of neural network models equipped with external memory (such as neural Turing machines and memory networks). These neural networks outperform conventional recurrent neural networks (RNNs) in terms of learning long-term dependency, allowing them to solve intrigui…

2017-11-10abs ↗pdf ↗

Recurrent neural networks (RNNs) have shown excellent performance in processing sequence data. However, they are both complex and memory intensive due to their recursive nature. These limitations make RNNs difficult to embed on mobile devices requiring real-time processes with limited hardware resources. To address the…

2018-09-28abs ↗pdf ↗

Study optimal retirement time and consumption with habitual persistence.

problem Understanding retirement consumption patterns with habitual persistence.
method Established concise habitual evolution, used martingale and duality methods.
result Optimal consumption declines sharply at retirement but excess consumption increases.

Thermal dynamics modeling has been a critical issue in building heating, ventilation, and air-conditioning (HVAC) systems, which can significantly affect the control and maintenance strategies. Due to the uniqueness of each specific building, traditional thermal dynamics modeling approaches heavily depending on physics…

2019-11-08abs ↗pdf ↗