The notion of expense in Bayesian optimisation generally refers to the uniformly expensive cost of function evaluations over the whole search space. However, in some scenarios, the cost of evaluation for black-box objective functions is non-uniform since different inputs from search space may incur different costs for …
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,742 papers · 148 categories
Trend · papers per month
48 results for “expensive costs”
Bayesian optimization (BO) and its batch extensions are successful for optimizing expensive black-box functions. However, these traditional BO approaches are not yet ideal for optimizing less expensive functions when the computational cost of BO can dominate the cost of evaluating the blackbox function. Examples of the…
Cost-aware SBI reduces expensive simulations in complex models.
problem High computational cost in simulating complex models.
method Combination of rejection and self-normalised importance sampling.
result Significant reduction in overall cost of inference.
MCAL reduces labeling costs by 6x for auto-labeling data sets.
problem Expensive human annotation for ground-truth data sets.
method Iterative approach that trains a classifier to auto-label part of the data set, determining which samples to label using humans and which to label using the classifier at each step.
result 6x lower overall cost compared to human labeling the entire data set, always cheaper than competing strategies.
NoFAS combines variational inference and adaptive surrogate models for efficient inference of computationally expensive models.
problem Efficient inference of parameters from data with computationally expensive models.
method Variational inference with normalizing flow and adaptive surrogate model training.
result NoFAS reduces computational cost without sacrificing inferential accuracy.
FlexiBO optimizes deep neural networks by balancing cost and performance.
problem Optimizing deep neural networks for multiple objectives incurs high costs.
method Decouples and weights cost in multi-objective Bayesian optimization.
result FlexiBO discovers designs with lower hypervolume error.
BOKE optimizes expensive functions with reduced computational costs.
problem High computational cost of Gaussian process-based Bayesian optimization.
method Kernel regression and density-based exploration integrated into confidence bounds.
result BOKE achieves global convergence and superior computational efficiency.
In predictive maintenance, model performance is usually assessed by means of precision, recall, and F1-score. However, employing the model with best performance, e.g. highest F1-score, does not necessarily result in minimum maintenance cost, but can instead lead to additional expenses. Thus, we propose to perform model…
Framework optimizes expensive manufacturing processes efficiently.
problem Optimizing input parameters for advanced manufacturing methods.
method Bayesian optimization with tailored acquisition function and parallel acquisition.
result Framework efficiently finds optimal parameters with minimal process cost.
UCRL-CMDP algorithm optimizes RL with constraints on average costs.
problem Optimizing RL in MDPs with average cost constraints.
method Model-based RL algorithms maximizing reward while keeping costs within bounds.
result UCRL-CMDP algorithm's expected regret is upper-bounded by $T^{2\slash 3}$.
The paper proposes a technique to speed up evolutionary algorithms by using lower-cost approximations of the objective function.
problem Evolutionary algorithms require many evaluations to solve computationally expensive black-box optimization problems.
method The paper introduces a technique to choose an appropriate approximate function cost during the execution of the optimization algorithm.
result The proposed approach can reach the same objective value in less than half the time in certain cases.
We present a simple one-parameter model for spatially localised evolving agents competing for spatially localised resources. The model considers selling agents able to evolve their pricing strategy in competition for a fixed market. Despite its simplicity, the model displays extraordinarily rich behavior. In addition t…
Bayesian search optimizes exploration of feasible solutions under expensive constraints.
problem Identifying feasible solutions in computationally expensive constraint spaces.
method Bayesian models with an acquisition function for efficient exploration and exploitation.
result The proposed acquisition function improves the prediction of feasibility.
Bayesian quadrature (BQ) is a sample-efficient probabilistic numerical method to solve integrals of expensive-to-evaluate black-box functions, yet so far,active BQ learning schemes focus merely on the integrand itself as information source, and do not allow for information transfer from cheaper, related functions. Here…
Data-efficient PDE operator learning without expensive simulations.
problem Expensive numerical PDE solutions limit data efficiency in machine learning.
method Unsupervised pretraining and in-context learning.
result Highly data-efficient and more generalizable than conventional models.
Bayesian optimization tackles expensive cascade processes.
problem Optimizing multistage decision-making processes with expensive costs.
method Formulated as Bayesian optimization framework with two types of acquisition functions.
result Demonstrated effectiveness through numerical experiments and a solar cell simulator application.
Most cryptocurrencies rely on Proof-of-Work (PoW) "mining" for resistance to Sybil and double-spending attacks, as well as a mechanism for currency issuance. Hashcash PoW has successfully secured the Bitcoin network since its inception, however, as the network has expanded to take on additional value storage and transa…
Cost-aware BO minimizes function evaluations with varying costs.
problem Optimization with varying evaluation costs in expensive functions.
method Cost Apportioned Bayesian Optimization (CArBO) combining initial and cost-cooled phases.
result CArBO finds better hyperparameter configurations with the same cost budget.
The graphics processing unit (GPU) has emerged as a powerful and cost effective processor for general performance computing. GPUs are capable of an order of magnitude more floating-point operations per second as compared to modern central processing units (CPUs), and thus provide a great deal of promise for computation…
Neural SDEs improve time series generation efficiency.
problem High memory and computational costs in GANs for time series.
method Conditional Neural Stochastic Differential Equations (SDEs).
result More memory efficient and faster than traditional methods.
CAGES: Cost-Aware Gradient Entropy Search for Efficient Local Multi-Fidelity Bayesian Optimizationcs.LG
CAGES optimizes expensive RL problems by efficiently learning gradients from multiple sources.
problem Optimizing expensive-to-evaluate functions in high-dimensional spaces.
method Cost-Aware Gradient Entropy Search (CAGES) for multi-fidelity Bayesian optimization.
result Significant performance improvements on synthetic and RL benchmark problems.
A new method for faster multi-objective optimization by evaluating objectives separately.
problem Finding the Pareto front of trade-offs between multiple objectives efficiently.
method Knowledge Gradient with decoupled evaluations, accounting for different costs.
result The method significantly outperforms existing approaches in terms of evaluation cost.
A framework for efficient multi-objective optimization using entropy search.
problem Optimizing expensive black-box functions with multiple objectives.
method Output space entropy search (OSE) to minimize resource cost.
result Improves efficiency and accuracy in multi-objective optimization.
Uncertainty-Aware Surrogate-based Amortized Bayesian Inference for Computationally Expensive Modelsstat.ML
UA-SABI uses surrogates to speed up Bayesian inference for expensive models.
problem Inference for computationally expensive models is slow and uncertain.
method Combines surrogate modeling with Amortized Bayesian Inference (ABI) to propagate uncertainties.
result Reliable, fast, and repeated Bayesian inference for expensive models is achieved.
This work improves surrogate models for balancing accuracy and cost in multi-fidelity methods.
problem Balancing accuracy and computational cost in multi-fidelity methods.
method Develops context-aware surrogate models for multi-fidelity importance sampling and Bayesian inverse problems.
result Context-aware surrogate models can lead to runtime speedups of up to one order of magnitude.
New method optimizes costly evaluations in Bayesian optimization.
problem Costly evaluations in BO methods, especially in hyperparameter tuning.
method Formulated as a CMDP, developed rollout approximation for optimal policy.
result Improved cost efficiency over standard BO methods.
Improved MCMC sampling for expensive, irregular likelihoods.
problem Bayesian inference challenges with irregular, expensive likelihoods.
method Adapt subset samplers, introduce data-driven proxies, adaptive controller.
result Improved HINTS algorithm achieves best sampling error in fixed budget.
Adaptive BO improves solder joint reliability by 3% with half the computational cost.
problem Improving solder joint reliability under thermomechanical loading.
method Adaptive Bayesian optimization with Gaussian process regression.
result Adaptive BO outperforms regular BO by 3% on average at any given computational budget.
CARV reduces compute cost for downstream pipelines using diffusion models.
problem High variance in Monte Carlo estimators from diffusion models limits compute efficiency.
method CARV uses hierarchical MC estimation with amortized upstream computation and stratified-inverse-CDF.
result CARV delivers 2-3x effective compute multipliers without changing the objective.
Latent-IMH improves Bayesian inference for expensive operators.
problem Efficient sampling from posterior distributions in inverse problems with computationally expensive operators.
method Metropolis-Hastings independence sampler using approximate and exact operators.
result Latent-IMH outperforms existing methods in computational efficiency.
Proposes a method to train neural networks that solve differential equations faster.
problem Training neural networks that solve differential equations becomes computationally expensive.
method Introduces a differentiable surrogate for numerical solver time cost using higher-order derivatives.
result Trains models that are faster to solve while maintaining nearly the same accuracy.
This work improves cost-aware Bayesian optimization by introducing Pareto-efficient acquisition functions.
problem Cost variability in hyperparameter evaluations affects the efficiency of Bayesian optimization.
method Reformulated cost-aware Bayesian optimization as Pareto efficiency, proposing a novel Pareto-efficient expected improvement.
result Pareto-efficient acquisition functions significantly outperform previous solutions, providing finer control over cost-accuracy trade-offs.
This work analyzes and optimizes memory and compute costs of learned optimizers.
problem High memory and compute costs of learned optimizers.
method Identified and quantified design features of learned and hand-designed optimizers, constructed a more efficient learned optimizer.
result A learned optimizer that is faster and more memory efficient than previous work.
BMBO-DARN optimizes expensive functions with varying fidelities.
problem Optimizing expensive, multi-fidelity functions efficiently.
method Batch Multi-fidelity Bayesian Optimization with Deep Auto-Regressive Networks.
result BMBO-DARN improves surrogate learning and optimization performance.
Parallel computing has played an important role in speeding up convex optimization methods for big data analytics and large-scale machine learning (ML). However, the scalability of these optimization methods is inhibited by the cost of communicating and synchronizing processors in a parallel setting. Iterative ML metho…
"No free lunch" results state the impossibility of obtaining meaningful bounds on the error of a learning algorithm without prior assumptions and modelling. Some models are expensive (strong assumptions, such as as subgaussian tails), others are cheap (simply finite variance). As it is well known, the more you pay, the…
This paper analyzes air pollution trends in Rwanda using low-cost sensors and machine learning.
problem Lack of reliable air pollution data in Rwanda due to high costs of equipment.
method Analysis of existing data and development of forecasting models using low-cost sensors and machine learning.
result Proposes forecasting models for air pollution data collected by low-cost sensors.
Score calibration enables automatic speaker recognizers to make cost-effective accept / reject decisions. Traditional calibration requires supervised data, which is an expensive resource. We propose a 2-component GMM for unsupervised calibration and demonstrate good performance relative to a supervised baseline on NIST…
New method reduces training cost by using approximate gradients.
problem Training neural networks is computationally expensive.
method Uses control variates to approximate gradients without full backward pass.
result Efficacy demonstrated on a vision transformer classification task.
A new approach to cost-sensitive multiclass classification prioritizes certain classes over others.
problem Cost-sensitive multiclass classification where some classes are more important than others.
method Apportioned margin framework that shifts the decision boundary to prioritize certain classes.
result The method improves the error rate for important classes while reducing overall error.
Market price simulator based on analog electrical circuitcond-mat.stat-mech
We constructed an analog electrical circuit which generates fluctuations in which probability density function has power law tails. In the circuit fluctuations with an arbitrary exponent of the power law can be obtained by adjusting the resistance. With this low cost circuit the random fluctuations which have the simil…
Optimizes package types for e-commerce to reduce damage and costs.
problem Sub-optimal package types lead to damaged shipments and high costs.
method Multi-stage approach that balances shipment and damage costs using a scalable algorithm.
result Significant cost savings of tens of millions of dollars achieved.
New method finds optimal learning rates for neural nets.
problem Finding optimal learning rates in stochastic neural networks.
method Gradient-only line searches using Non-negative Associative Gradient Projection Points (NN-GPPs).
result Learning rates can be reliably resolved as step sizes along search directions.
Optimal biomarker combinations for treatment-selection can be derived by minimizing total burden to the population caused by the targeted disease and its treatment. However, when multiple biomarkers are present, including all in the model can be expensive and hurt model performance. To remedy this, we consider feature …
In this paper, optimal consumption and investment decisions are studied for an investor who can invest in a fixed interest rate bank account and a stock whose price is a log normal diffusion. We present the method of the HJB equation in order to explicitly solve problems of this type with modifications such as a fixed …
State-of-the-art adversarial attacks on neural networks use expensive iterative methods and numerous random restarts from different initial points. Iterative FGSM-based methods without restarts trade off performance for computational efficiency because they do not adequately explore the image space and are highly sensi…
Method minimizes total cost of classification by acquiring covariates efficiently.
problem Minimizing total cost of classification in applications with covariate acquisition costs.
method Formalizes optimization goal using Bayes risk, introduces assumptions for computable solution.
result Proposed method achieves lowest total costs compared to previous methods on medical datasets.
SnAp approximates RTRL for online training of sparse recurrent networks.
problem Training large sparse recurrent networks online is computationally expensive.
method Sparse n-step Approximation (SnAp) of the RTRL influence matrix.
result SnAp with n=2 remains tractable for highly sparse networks and outperforms backpropagation through time.