A new scheme reduces global search cost by a square root factor.
problem Challenges in finding global minimum of cost functions.
method Gradient descent combined with a biased crossover of two good solutions.
result Quadratic speedup of global search efficiency.
Cost-effective feature selection improves network model choice.
problem Selecting informative features from noisy candidates in network models.
method Adapted feature selection methods to account for feature costs and used pilot simulations.
result Reduced computational cost by two orders of magnitude without sacrificing model accuracy.
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.
This work reduces computation cost for on-device CNN training.
problem High computation cost during on-device CNN training.
method Self-supervised instance filtering and error map pruning.
result Substantial computation saving without significant accuracy loss.
Paper presents a faster method for computing cost of equity and performing comparable company analysis.
problem Tedium and subjectivity in traditional cost of equity and comparable company analysis methods.
method Uses spectral and agglomerative clustering to compute cost of equity and perform comparable company analysis.
result Reduces time required for comps by orders of magnitude and improves consistency and reliability.
Recently, machine learning algorithms have successfully entered large-scale real-world industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during test time must be budgeted and accounted for. In this paper, we address the challenge of balancing the test-time cost and the classifier …
Optimizes K inner simulations for least-square Monte Carlo to reduce computational cost.
problem Computing conditional expectation E[f (Y)|X] with limited samples.
method Determines optimal number of Y samples (K) for given computational budget.
result Computational gain is maximized when sampling Y given X is inexpensive.
Two-layer networks struggle with high frequencies due to numerical and computational limitations.
problem High frequency approximation and learning in shallow networks.
method Mathematical and computational analysis focusing on numerical error, computational cost, and stability.
result Explicit answers to fundamental computational issues in shallow networks' high frequency handling.
Sparsity helps reduce diffusion model costs.
problem High computational costs in diffusion models.
method Introduced sparsity concept to reduce input dimensionality.
result Sparsity reduces computational complexity to intrinsic data dimension.
New estimator reduces nested expectation estimation costs.
problem Estimating repeatedly nested expectations is computationally expensive.
method Recursive Estimator for Arbitrary Depth (READ) using randomized multilevel Monte Carlo.
result Optimal computational cost of O(ε^(-2)) for every fixed D.
The Cheap Gradient Principle (Griewank 2008) --- the computational cost of computing the gradient of a scalar-valued function is nearly the same (often within a factor of 5) as that of simply computing the function itself --- is of central importance in optimization; it allows us to quickly obtain (high dimensional) …
Chebyshev technique reduces FRTB-IMA equity autocallables computation costs by 90%.
problem Efficient computation of FRTB-IMA capital for equity autocallables.
method Orthogonal Chebyshev Sliding Technique applied to equity autocallables.
result Computational cost reduction of about 90% for equity autocallables.
Investigates portfolio selection with transaction costs and stochastic volatility, using deep learning for computation.
problem Optimal portfolio selection with transaction costs and stochastic volatility.
method Two-factor stochastic volatility model, option-implied utility function, deep learning policy iteration.
result Deep learning method effectively computes optimal investment decisions under transaction costs and stochastic volatility.
This paper studies a theoretical pruning method for RNNs to reduce computational costs.
problem High computational costs in recurrent neural networks (RNNs).
method Spectral pruning inspired approach for RNNs.
result Generalization error bounds for compressed RNNs are provided.
Bayesian optimization reduces hyperparameter tuning cost for stochastic models.
problem Hyperparameter tuning under uncertainty in noisy function evaluations.
method Bayesian optimization framework for scale parameter in stochastic models, using statistical surrogate and closed-form optimizer.
result Significant reduction in computational cost (40 times fewer data points, 40-fold reduction in cost).
Introduces a Cost function to measure Legendrian knot obstructions.
problem Measuring obstructions for Legendrian knot isotopies.
method Introduces a non-negative integer-valued Cost function.
result Cost function induces a metric on topologically isotopic Legendrian knots.
Variational Prediction simplifies Bayesian inference without test time costs.
problem Bayesian inference's computational costs and posterior predictive distribution marginalization.
method Variational Prediction learns a variational approximation to the posterior predictive distribution using a variational bound.
result Directly learns a variational approximation to the posterior predictive distribution without test time marginalization costs.
Efficiently estimates material parameter space with multifidelity Gaussian process modeling.
problem Estimating a region of material parameter space with similar precipitate shapes.
method Multifidelity Gaussian process modeling to reduce computational cost.
result Significant reduction in sampling cost for accurate LER estimation.
New method reduces computational cost for estimating PAC-Bayes bounds.
problem High computational cost in estimating PAC-Bayes bounds.
method General alternative method that makes computational savings.
result Reduces computational cost on the order of the dataset size.
Estimates returns for dollar cost averaging using geometric Brownian motion.
problem Estimating returns for dollar cost averaging investing strategy.
method Uses geometric Brownian motion and log-Normal distribution to construct a lower bound for returns. Computes parameters recursively and in closed form for dollar cost averaging. Compares to lump sum investing for matching wealth distributions.
result Probability of negative returns is less than 2.5% for 40 years of annual dollar cost averaging.
DCMAP optimizes clustering in Bayesian Networks with dependent costs.
problem Optimal clustering in Bayesian Networks with cost dependency.
method DCMAP algorithm that iteratively finds near-optimal cluster mappings.
result DCMAP finds all least cost cluster mappings optimally with minimal iterations.
Researchers develop neural optimal transport with Lagrangian costs for efficient computation.
problem Optimal transport between measures with Lagrangian costs for systems with geometric constraints.
method Neural network approach to compute geodesics and optimal transport maps efficiently.
result Efficient computation of geodesics and optimal transport maps without ODE solvers.
The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.
problem Creating an arbitrage-free interpolation for option pricing models.
method Generalizing the local variance gamma model to a piecewise quadratic local variance function.
result The quadratic model results in an arbitrage-free interpolation of class C3, reducing knots and computational cost.
Despite recent advances in architectures for mobile devices, deep learning computational requirements remains prohibitive for most embedded devices. To address that issue, we envision sharing the computational costs of inference between local devices and the cloud, taking advantage of the compression performed by the f…
We present an approach to market-consistent multi-period valuation of insurance liability cash flows based on a two-stage valuation procedure. First, a portfolio of traded financial instrument aimed at replicating the liability cash flow is fixed. Then the residual cash flow is managed by repeated one-period replicatio…
Study calculates liquidity costs for delta hedging of European options.
problem Determining expected liquidity costs in delta hedging.
method Derives an integration formula for liquidity costs, including option prices and delta process.
result Expected liquidity costs can be calculated faster than Monte Carlo simulations.
Improved Bayesian inference for neuronal ensemble inference reduces computational cost.
problem Efficient inference of neuronal ensembles from activity data.
method Modified MCMC algorithm with simulated annealing for hyperparameter control.
result Our method reduces computational cost while maintaining or improving inference accuracy.
SideNet adapts MainNet's complexity based on input, reducing compute cost.
problem Reducing deep neural network computational cost while maintaining performance.
method Attach a SideNet to a MainNet to adaptively process inputs.
result SideNet allows for substantial decreases in compute with minimal performance drops.
The paper teaches robots to navigate by learning costs from expert demonstrations.
problem Teaching robots to navigate autonomously using only expert observations.
method Developed a map encoder and cost encoder to infer semantic class probabilities and a cost function from expert observations.
result Robots can learn to follow traffic rules in a simulator using only semantic observations.
Improved Gaussian process inference for spatio-temporal data.
problem Cubic computational costs in Gaussian process inference, especially in spatio-temporal settings.
method Proposes the Vanilla-SPDE Exchange, leveraging an equivalence between standard and SPDE formulations to achieve improved computational cost.
result Demonstrates improved computational efficiency through complexity analysis and numerical experiments.
Poyiadjis et al. (2011) show how particle methods can be used to estimate both the score and the observed information matrix for state space models. These methods either suffer from a computational cost that is quadratic in the number of particles, or produce estimates whose variance increases quadratically with the am…
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.
New features reduce computational cost of variational inference.
problem Efficiently compute ELBO with reduced computational cost.
method Developed features that reduce O(M3) to O(ildeNT+MT) for large M. result Unbiased ELBO estimation with reduced computational complexity.
Serverless cloud computing speeds up double machine learning model estimation.
problem Efficiently estimating double machine learning models with minimal cloud resource management.
method Serverless computing with AWS Lambda for repeated cross-fitting.
result Demonstrates significant reduction in estimation times and costs.
Empirical error estimates improve graph sparsification reliability.
problem Uncertainty in sparsification error limits downstream computations reliability.
method Data-driven approach to compute empirical error estimates.
result Empirical error estimates provide theoretical guarantees and are computationally feasible.
Deep RNNs compute American option prices and deltas efficiently.
problem Computing prices and deltas of high-dimensional American options.
method Two deep RNNs, one for price and one for delta, learn over spacetime.
result Linear time and constant memory cost compared to feedforward networks.
In this paper, we propose a communication- and computation-efficient algorithm to solve a convex consensus optimization problem defined over a decentralized network. A remarkable existing algorithm to solve this problem is the alternating direction method of multipliers (ADMM), in which at every iteration every node up…
A new method speeds up computation of Sinkhorn divergences to linear time.
problem Expensive computation of Sinkhorn divergences for comparing probability distributions.
method Using positive features to approximate ground costs, reducing computation time to linear.
result Sinkhorn divergences can be computed in linear time, scaling as O(nr).
New BNN architectures reduce computational cost for uncertainty quantification.
problem High computational cost in Bayesian neural networks.
method Partial trace-class Bayesian neural networks (PaTraC BNNs).
result Comparable uncertainty quantification with fewer parameters.
Linear cost method approximates Gaussian Matérn processes with exponentially convergent accuracy.
problem High computational cost for Gaussian process inference and prediction.
method Optimal rational approximation of spectral density for Gaussian processes on bounded intervals.
result Exponential decrease in covariance error with increasing order of approximation.
Label tree-based algorithms are widely used to tackle multi-class and multi-label problems with a large number of labels. We focus on a particular subclass of these algorithms that use probabilistic classifiers in the tree nodes. Examples of such algorithms are hierarchical softmax (HSM), designed for multi-class class…
Enhances LMC for log-concave sampling, reducing computational cost.
problem High computational cost of LMC for high-dimensional problems.
method Random coordinate descent (RCD) combined with variance reduction techniques (SAGA, SVRG).
result Achieves computational cost reduction compared to classical LMC, same number of iterations as LMC.
The paper reduces xVA calculations by approximating sensitivities.
problem Nested expectation problem and computational expense in xVA calculations.
method Polynomial approximations of shocked and unshocked valuation functions, and their difference.
result High accuracy and remarkable computational cost reduction demonstrated.
Pruning filters in neural networks improves performance and reduces costs.
problem Large neural networks have high inference costs and limited resource usage.
method Batch Bridgeout for efficient pruning of convolutional filters.
result Batch Bridgeout trained networks achieve higher accuracy across various pruning intensities.
This survey is an introduction to asymptotic methods for portfolio-choice problems with small transaction costs. We outline how to derive the corresponding dynamic programming equations and simplify them in the small-cost limit. This allows to obtain explicit solutions in a wide range of settings, which we illustrate f…
This paper optimizes AI inference on edge devices with reduced communication and computation costs.
problem Efficiently performing AI inference on resource-constrained edge devices with reduced communication and computation costs.
method A three-step framework for effective inference: model split point selection, communication-aware model compression, and task-oriented encoding of intermediate features.
result Our proposed framework achieves a better trade-off and significantly reduces inference latency compared to baseline methods.
Two preprocessing techniques reduce neural network training cost.
problem Training over-parameterized neural networks efficiently.
method Two novel preprocessing techniques to reduce training cost.
result Training cost reduced to sublinear per iteration.
E2GC optimizes energy efficiency in DNNs by balancing computational and data movement costs.
problem Imbalance between computational complexity and data reuse in GConv leads to suboptimal energy efficiency.
method Developed an optimum group size model and proposed E2GC module with constant group size.
result E2GC modules improve energy efficiency by 10.8% and 4.73% on P100 and P4000 GPUs, respectively.