New methods speed up Bayesian experimental design.
problem Difficulty in estimating expected information gain.
method Amortized variational inference for fast EIG estimation.
result Significant gains in speed and accuracy.
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.
169,042 papers · 148 categories
Trend · papers per month
48 results for “experimental resource efficiency”
PASHA optimizes model tuning for large datasets with limited resources.
problem Expensive HPO and NAS for large datasets.
method Dynamic resource allocation approach.
result Significantly reduces computational resources while maintaining performance.
Proposes rounding method for precise treatment effect estimation under budget constraints.
problem Resource-constrained experimental design for precise treatment effect estimation.
method Dependent randomized rounding procedure to convert assignment probabilities into binary treatment decisions.
result Improved estimator precision through variance reduction and efficient inference.
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.
ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learningcs.LG
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.
New CNN layer selects important channels to improve model capacity.
problem Improving model capacity under resource constraints.
method Selective allocation of channels in convolutional layers.
result New layer allows new optima that generalize better.
DSA efficiently allocates sparsity across layers for budgeted pruning.
problem Efficiently distributing resources (sparsity) across layers in pruning under resource constraints.
method DSA uses differentiable pruning to find continuous layer-wise pruning ratios via gradient-based optimization.
result DSA achieves superior performance and significantly reduces the time cost of pruning.
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.
EagerNet: Early Predictions of Neural Networks for Computationally Efficient Intrusion Detectioncs.LG
EagerNet detects network attacks quickly with less resources.
problem Efficiently detecting network attacks with minimal resources.
method Proposes a new architecture that trades prediction speed for accuracy, evaluating only a subset of layers.
result Comparable accuracies to simple FCNNs achieved with early predictions, saving energy and computational efforts.
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.
Novel neural architecture improves Bayesian experimental design efficiency.
problem Intractable evaluation of expected information gain (EIG) in Bayesian optimal experimental design.
method Develops a neural architecture that optimizes a single variational model for estimating EIG across many designs, using a lower bound for computational efficiency.
result Significantly improves accuracy in Bayesian experimental design with better sample efficiency.
Many Internet-of-Things (IoT) applications demand fast and accurate understanding of a few key events in their surrounding environment. Deep Convolutional Neural Networks (CNNs) have emerged as an effective approach to understand speech, images, and similar high dimensional data types. Algorithmic performance of modern…
Mechanisms for fair resource allocation learn user preferences online.
problem Fair resource allocation among users with unknown requirements.
method Repeated allocation rounds with user feedback for learning preferences.
result Mechanisms achieve efficiency, fairness, and strategy-proofness.
Designs for allocating resources to prioritize needy applicants while estimating treatment effects.
problem Resource allocation under uncertainty with prioritized queues.
method Priority-queue randomization for treatment assignment and estimation of treatment effects.
result Identification of causal effects under different arrival and treatment assignment scenarios.
CPP improves predictive model outputs for better intervention decisions.
problem Predictive models often misguide resource allocation.
method Causal post-processing techniques using limited experimental data.
result CPP can improve intervention decisions, especially with imperfect causal signals.
Bayesian experimental design involves the optimal allocation of resources in an experiment, with the aim of optimising cost and performance. For implicit models, where the likelihood is intractable but sampling from the model is possible, this task is particularly difficult and therefore largely unexplored. This is mai…
We propose a simple approach which, given distributed computing resources, can nearly achieve the accuracy of -NN prediction, while matching (or improving) the faster prediction time of -NN. The approach consists of aggregating denoised -NN predictors over a small number of distributed subsamples. We show, bot…
New study shows non-adaptive trials can be outperformed by adaptive designs in treatment selection.
problem Determining the best allocation of resources in clinical trials.
method Analysis of batched arm elimination designs and comparison with completely randomized trials.
result Simple adaptive designs universally and strictly dominate non-adaptive completely randomized trials for at least three treatment arms.
BOED improves SBI by optimizing experimental designs and inference functions.
problem Efficiently use experimental resources for better inference on complex models.
method Link mutual information bounds between SBI and BOED, optimizing both design and inference.
result BOED improves inference in real-world simulators in epidemiology and biology.
Nucleosome positioning is an important process required for proper genome packing and its accessibility to execute the genetic program in a cell-specific, timely manner. In the recent years hundreds of papers have been devoted to the bioinformatics, physics and biology of nucleosome positioning. The purpose of this rev…
Efficient neural networks for resource-constrained systems.
problem Reducing resource consumption in machine learning models for embedded systems.
method Quantized neural networks, network pruning, structural efficiency.
result Finding good trade-offs between resource efficiency and prediction quality is challenging.
Review of efficient neural networks for TinyML on resource-constrained devices.
problem Resource constraints on ultra-low power MCUs for deep learning models.
method Model compression, quantization, low-rank factorization, model pruning, hardware acceleration, algorithm-architecture co-design.
result Optimized neural network architectures for minimal resource utilization on MCUs.
Extracts patterns from mobile network data for better resource management.
problem Improving network efficiency and resource allocation for mobile users.
method Spatiotemporal analysis of internet activity records (IARs) data.
result Developed a mobile traffic partitioning scheme.
HATCH learns optimal recommendations with resource constraints.
problem Resource-constrained recommendation systems.
method Hierarchical adaptive contextual bandits with adaptive resource allocation.
result HATCH achieves a regret bound of .
Adaptive Bayesian Optimization for resource-constrained experiments with switching costs.
problem Sequential experimental design with varying costs for changing design variables.
method Adapted batch algorithms to sequential problem, proposing cost-aware and cost-ignorant methods.
result Cost-aware algorithm outperforms tuned process-constrained algorithms in all settings considered.
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.
CHOOSE enhances shallow Transformers for wireless symbol detection.
problem Improving wireless symbol detection with shallow Transformers.
method Introducing autoregressive latent reasoning steps within hidden space.
result Lightweight Transformers achieve comparable performance to deep models.
This work explores feature learning tradeoffs in neural networks.
problem Resource tradeoffs in neural feature learning.
method Theoretical and experimental investigation of offline sparse parity learning.
result Width improves sample efficiency in sparse feature learning.
Efficiently identifies key input variables for expensive functions using active learning.
problem Efficiently identify key input variables for expensive, black-box functions.
method Proposes novel active learning acquisition functions targeting derivative-based global sensitivity measures (DGSMs) under Gaussian process surrogate models.
result Active learning substantially enhances sample efficiency of DGSM estimation, especially with limited evaluation budgets.
This study uses OPE methods to quickly assess auction policies.
problem Rapid decision-making in dynamic auction environments.
method Off-Policy Evaluation and counterfactual methods.
result Improved policy selection and optimization.
New graph attention operators improve performance and reduce computational costs.
problem Excessive computational resources in graph attention operators.
method Proposed hGAO and cGAO using hard and channel-wise attention mechanisms.
result Improved performance and computational savings with new operators.
Automatically balances blockchain network resources to boost market efficiency.
problem Extractable value leakage and execution frictions in blockchain networks.
method Systematically uses idle network resources for arbitrage, incentivizing transactions.
result Reduces network inventory risk while enhancing price formation and liquidity.
FAVANO improves federated learning for resource-constrained environments.
problem Asynchronous communication in federated learning leads to bias and scalability issues.
method FAVANO is a novel asynchronous federated learning framework for resource-constrained environments.
result FAVANO outperforms existing methods on standard benchmarks.
Proposes a new framework for resource-limited recommendation.
problem Resource constraints affect user choices in recommendation tasks.
method Interest-behavior multiplicative network with MRRNNs and resource-limited branch.
result Framework effectively predicts user interactions considering resource limitations.
Paper introduces MTGP for engineering tasks with sparse data.
problem Challenges of data sparsity and varying task correlations in engineering.
method Multi-Task Gaussian Processes (MTGP) framework.
result Improves predictive performance and reduces computational costs.
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.
Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints - i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predic…
GP-TS optimizes TLM pre-training hyperparameters efficiently.
problem Resource inefficiency in TLM pre-training.
method Bayesian optimization with Thompson sampling and Gaussian process.
result GP-TS achieves lower MLM loss in fewer epochs.
Generative profiling improves real-time task timing for varied resource contexts.
problem Inaccurate task timing analysis for complex hardware architectures.
method Nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation for synthesizing context-dependent timing profiles.
result Maximum likelihood accurate execution profiles for unseen resource contexts.
Predicts user traffic for better resource management in cellular networks.
problem Lack of research on traffic prediction in cellular networks at the user level.
method Statistical, rule-based, and deep machine learning methods.
result Deep machine learning outperforms linear statistical learning after a threshold number of previous observations.
Study introduces KorFinMTEB for Korean financial texts, revealing model limitations.
problem Limited evaluation benchmarks for low-resource domains, especially Korean.
method Developed KorFinMTEB, a tailored benchmark for Korean financial texts.
result Models perform better on translated benchmarks than on domain-specific ones.
DARC learns resource-efficient models by replacing expensive components with cheaper ones.
problem Resource constraints at inference time are more severe than at training time.
method Combines model compression and architecture search to learn resource-efficient models.
result Improves inference speed and memory footprint with minimal accuracy loss.
New method uses observational data to improve trial design efficiency.
problem Scarce randomized controlled trials; inefficiency of using observational data.
method Active Residual Learning, R-Design framework, R-EPIG criterion.
result Efficiently estimating residuals to correct observational bias improves trial design.
Paper proposes an efficient method for bounding box annotation in object detection.
problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.
The paper tackles decision-oriented communications for energy-efficient resource allocation.
problem Maximizing utility functions under quantized information.
method Develops solutions for quantizing information to maximize utility functions under known and observed conditions.
result Quantizing the state roughly is optimal for sum-rate maximization but not for energy-efficiency metrics.
We propose a practical and scalable Gaussian process model for large-scale nonlinear probabilistic regression. Our mixture-of-experts model is conceptually simple and hierarchically recombines computations for an overall approximation of a full Gaussian process. Closed-form and distributed computations allow for effici…
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.
PePR scores assess DL model performance per resource unit, promoting smaller, more efficient models.
problem Limited access to large-scale resources hinders medical image analysis research.
method Introduced PePR score to measure DL model performance per resource unit.
result Small-scale, specialized models outperform large-scale models in resource-constrained settings.