Custom Tailored Suite of Random Forests for Prefetcher Adaptation

• URL: http://arxiv.org/abs/2008.00176v1
• Date: Sat, 1 Aug 2020 05:43:38 GMT
• Title: Custom Tailored Suite of Random Forests for Prefetcher Adaptation
• Abstract summary: SuitAP is a hardware prefetcher adapter that uses a suite of random forests to determine at runtime which prefetcher should be ON at each memory level. Compared to a design with no prefetchers, using SuitAP we improve IPC by 46% on average across traces generated from SPEC 2017 suite with 12KB overhead.
• Score: 2.466065249430994
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To close the gap between memory and processors, and in turn improve performance, there has been an abundance of work in the area of data/instruction prefetcher designs. Prefetchers are deployed in each level of the memory hierarchy, but typically, each prefetcher gets designed without comprehensively accounting for other prefetchers in the system. As a result, these individual prefetcher designs do not always complement each other, and that leads to low average performance gains and/or many negative outliers. In this work, we propose SuitAP (Suite of random forests for Adaptation of Prefetcher system configuration), which is a hardware prefetcher adapter that uses a suite of random forests to determine at runtime which prefetcher should be ON at each memory level, such that they complement each other. Compared to a design with no prefetchers, using SuitAP we improve IPC by 46% on average across traces generated from SPEC2017 suite with 12KB overhead. Moreover, we also reduce negative outliers using SuitAP.

Related papers

• PreFT: Prefill-only finetuning for efficient inference [54.58291801311547]
  We develop and release an efficient implementation of two prefill-only PEFTs, LoRA and ReFT, on the vLLM inference engine.<n>We show that serving multi-user PreFTs is more efficient than traditional PEFTs ($1.9times$ the throughput when serving $512$ adapters on Llama 3.1 70B)
  arXiv  Detail & Related papers  (2026-05-14T00:19:41Z)
• Lightening the Load: A Cluster-Based Framework for A Lower-Overhead, Provable Website Fingerprinting Defense [2.4810953761205314]
  Website fingerprinting (WF) attacks remain a significant threat to encrypted traffic.<n>We present a unified framework for designing an adaptive WF defense that combines the effectiveness of regularization with the provable security of supersequence-style grouping.<n>We instantiate the design as Adaptive Tamaraw, a variant of Tamaraw that assigns padding parameters on a per-cluster basis.
  arXiv  Detail & Related papers  (2025-09-01T01:07:02Z)
• coverforest: Conformal Predictions with Random Forest in Python [0.0]
  coverforest is a Python package that implements efficient conformal prediction methods specifically optimized for random forests. Our experiments demonstrate that coverforest's predictions achieve the desired level of coverage.
  arXiv  Detail & Related papers  (2025-01-24T15:24:37Z)
• Not All Adapters Matter: Selective Adapter Freezing for Memory-Efficient Fine-Tuning of Language Models [10.593991842751631]
  We propose SAFE, which gradually freezes less-important adapters that do not contribute to adaptation during the early training steps. In our experiments, SAFE reduces memory usage, computation amount, and training time by 42.85%, 34.59%, and 11.82%, respectively.
  arXiv  Detail & Related papers  (2024-11-26T08:41:45Z)
• Accelerating Direct Preference Optimization with Prefix Sharing [0.9194662383948566]
  We introduce prefix sharing for preference tuning, a novel technique that processes chosen and rejected responses as one sequence with a shared prefix. Our method achieves $1.1$-$1.5times$ improvement in training throughput on popular DPO datasets, without any effect on convergence. Our work contributes to making preference-based fine-tuning more accessible for a wider range of applications and model sizes.
  arXiv  Detail & Related papers  (2024-10-27T02:06:17Z)
• Preference Diffusion for Recommendation [50.8692409346126]
  We propose PreferDiff, a tailored optimization objective for DM-based recommenders. PreferDiff transforms BPR into a log-likelihood ranking objective to better capture user preferences. It is the first personalized ranking loss designed specifically for DM-based recommenders.
  arXiv  Detail & Related papers  (2024-10-17T01:02:04Z)
• Pear: Pruning and Sharing Adapters in Visual Parameter-Efficient Fine-Tuning [6.068296063531189]
  adapters can exhibit redundancy, leading to unnecessary storage overhead and inferior performance. We propose Prune and Share (Pear), a novel adapter-pruning framework for efficient fine-tuning of pretrained visual foundation models.
  arXiv  Detail & Related papers  (2024-09-29T15:18:38Z)
• Adaptive Preference Scaling for Reinforcement Learning with Human Feedback [103.36048042664768]
  Reinforcement learning from human feedback (RLHF) is a prevalent approach to align AI systems with human values. We propose a novel adaptive preference loss, underpinned by distributionally robust optimization (DRO) Our method is versatile and can be readily adapted to various preference optimization frameworks.
  arXiv  Detail & Related papers  (2024-06-04T20:33:22Z)
• Rewarded soups: towards Pareto-optimal alignment by interpolating weights fine-tuned on diverse rewards [101.7246658985579]
  Foundation models are first pre-trained on vast unsupervised datasets and then fine-tuned on labeled data. We propose embracing the heterogeneity of diverse rewards by following a multi-policy strategy. We demonstrate the effectiveness of our approach for text-to-text (summarization, Q&A, helpful assistant, review), text-image (image captioning, text-to-image generation, visual grounding, VQA), and control (locomotion) tasks.
  arXiv  Detail & Related papers  (2023-06-07T14:58:15Z)
• PerAda: Parameter-Efficient Federated Learning Personalization with Generalization Guarantees [95.87604231887353]
  Existing pFL methods introduce high communication and computation costs or are vulnerable to test communication. In PerAda, a parameter distillation and pFL pFL has superior performance, especially under test-time distribution. Our code is available at https://github.com/NV/PerAda.
  arXiv  Detail & Related papers  (2023-02-13T19:00:37Z)
• SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters [96.52807311742198]
  We re-examine the parameter-efficiency of Adapters through the lens of network pruning. We find that SparseAdapter can achieve comparable or better performance than standard Adapters when the sparse ratio reaches up to 80%.
  arXiv  Detail & Related papers  (2022-10-09T15:28:48Z)
• Puppeteer: A Random Forest-based Manager for Hardware Prefetchers across the Memory Hierarchy [1.5049442691806052]
  We propose Puppeteer as a hardware prefetcher manager that uses a suite of random forest regressors to determine at runtime which prefetcher should be ON at each level in the memory hierarchy. Using Puppeteer we improve IPC by 46.4% in 1 Core (1C), 25.8% in 4 Core (4C), and 11.9% in 8 Core (8C) processors on average across traces generated from SPEC 2017, SPEC2006, and Cloud suites with 10KB overhead.
  arXiv  Detail & Related papers  (2022-01-28T10:25:12Z)
• PredProp: Bidirectional Stochastic Optimization with Precision Weighted Predictive Coding [1.5229257192293197]
  We present PredProp, a method for optimization of weights and states in predictive coding networks (PCNs) PredProp addresses inference and learning via gradient descent and adaptively updates parameter by approximate curvature. We demonstrate PredProp's effectiveness in the context of dense decoder networks and simple image benchmark datasets.
  arXiv  Detail & Related papers  (2021-11-16T21:43:15Z)
• Control Variates for Slate Off-Policy Evaluation [112.35528337130118]
  We study the problem of off-policy evaluation from batched contextual bandit data with multidimensional actions. We obtain new estimators with risk improvement guarantees over both the PI and self-normalized PI estimators.
  arXiv  Detail & Related papers  (2021-06-15T06:59:53Z)
• ConVEx: Data-Efficient and Few-Shot Slot Labeling [72.00513667636801]
  ConVEx is an efficient pretraining and fine-tuning neural approach for slot-labeling dialog tasks. We report state-of-the-art performance of ConVEx across a range of diverse domains and data sets for dialog slot-labeling.
  arXiv  Detail & Related papers  (2020-10-22T15:13:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.