Digital twin reduces costs in various fields.
problem High costs in decision-making processes.
method Use of digital twin model for cost reduction.
result Digital twin acts as a cost reduction method.
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 “Process cost reduction”
Bayesian framework reduces high-dimensional GP modeling costs.
problem Challenges in fitting Gaussian processes to high-dimensional inputs.
method Hierarchical Bayesian model with orthonormal projection matrix, incorporating Deep Gaussian Processes.
result Improves predictive performance and uncertainty quantification.
New sparsity operator reduces variance reduction methods' computational cost.
problem Reduce computational cost of variance reduction methods.
method Introduce random-top-k operator to estimate gradient sparsity and reduce operations per update.
result Our algorithm consistently outperforms SpiderBoost in various tasks.
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.
Novel approach uses inductive biases for semiconductor etching.
problem Significant violations of physics in etching process predictions.
method Introduced deep learning model with inductive biases.
result Fits measurements faster and follows physical behavior.
Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signalsstat.ML
In this work, we revisit fast dimension reduction approaches, as with random projections and random sampling. Our goal is to summarize the data to decrease computational costs and memory footprint of subsequent analysis. Such dimension reduction can be very efficient when the signals of interest have a strong structure…
This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.
problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.
Novel confidence intervals improve convergence rates for sparse kernel-based models.
problem High computational cost in kernel-based learning models.
method Novel confidence intervals for Nyström method and sparse variational Gaussian process approximation.
result Improved performance bounds in regression and optimization problems.
A deep learning algorithm designs low-cost SPP films.
problem Designing SPP films with high accuracy and low cost.
method Guided deep learning algorithm with low-cost sample replacement.
result Deep CNN learns to replace precious metals with ordinary metals, reducing cost.
Paper proposes FedQ-Advantage for federated Q-learning with near-optimal regret and low communication cost.
problem Near-optimal federated Q-learning with low communication cost.
method Reference-advantage decomposition for variance reduction, synchronization between agents and server, policy update.
result Achieves almost optimal regret and near-linear regret speedup compared to single-agent learning.
Additive Gaussian process framework handles monotonicity constraints in high dimensions.
problem Handling monotonicity constraints in high-dimensional data.
method Additive Gaussian process framework with MaxMod algorithm for dimension reduction.
result Framework enables to satisfy monotonicity constraints everywhere in the input space.
Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimationstat.ML
We present a new algorithm, truncated variance reduction (TruVaR), that treats Bayesian optimization (BO) and level-set estimation (LSE) with Gaussian processes in a unified fashion. The algorithm greedily shrinks a sum of truncated variances within a set of potential maximizers (BO) or unclassified points (LSE), which…
LightOn OPUs accelerate randomized numerical linear algebra, reducing computational costs.
problem Computational bottleneck in randomization step for large-scale linear algebra.
method Near constant-time linear random projections from LightOn OPUs.
result Significant acceleration of RandNLA algorithms with negligible precision loss.
The sophisticated structure of Convolutional Neural Network (CNN) allows for outstanding performance, but at the cost of intensive computation. As significant redundancies inevitably present in such a structure, many works have been proposed to prune the convolutional filters for computation cost reduction. Although ex…
New method assesses energy storage value beyond cost reduction.
problem Improving energy storage value beyond cost reduction.
method Market potential method to evaluate and compare energy storage technologies.
result High-cost hydrogen storage can be more valuable than low-cost hydrogen storage.
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.
A Strategy for Adaptive Sampling of Multi-fidelity Gaussian Process to Reduce Predictive Uncertaintystat.ML
Multi-fidelity Gaussian process is a common approach to address the extensive computationally demanding algorithms such as optimization, calibration and uncertainty quantification. Adaptive sampling for multi-fidelity Gaussian process is a changing task due to the fact that not only we seek to estimate the next samplin…
We discuss investment allocation to multiple alpha streams traded on the same execution platform with internal crossing of trades and point out differences with allocating investment when alpha streams are traded on separate execution platforms with no crossing. First, in the latter case allocation weights are non-nega…
Deep learning predicts market sensitivities for cost-effective index tracking.
problem Costly and impractical replication of index funds.
method Learning to predict market sensitivities using deep learning models.
result Significant reduction in prediction errors compared to historical methods.
Multitask Gaussian process regression reduces data generation costs for molecular property prediction.
problem Data bottleneck in training surrogate models for molecular properties.
method Multitask Gaussian process regression over heterogeneous data sources (CC and DFT).
result Predicts at CC-level accuracy with over an order of magnitude reduction in data generation cost.
CTS machines improve screen development in printing industries, reducing costs and increasing profitability.
problem Inefficient screen development process in heat transfer printing and labeling.
method Implementation of CTS (computer-to-screen) technology for screen development.
result Reduction in material and operational costs, leading to profitability.
Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learningstat.ML
New RL algorithms reduce costs for single-agent and federated learning.
problem Minimizing costs in RL and federated RL settings.
method Q-EarlySettled-LowCost and FedQ-EarlySettled-LowCost algorithms.
result First algorithms to achieve low burn-in and logarithmic switching costs.
This thesis explores fast algorithms for large matrices and data augmentation to improve model efficiency.
problem Efficient handling of large models and data in scientific computing and machine learning.
method Randomized low-rank decomposition algorithms and data augmentation techniques.
result Improved sample efficiency and generalization of machine learning models.
We study the complexity of sampling from a distribution over all index subsets of the set with the probability of a subset proportional to the determinant of the submatrix of some p.s.d. matrix , where corresponds to the entries of ind…
Deep neural networks improve ensemble weather forecasts.
problem Improving accuracy and efficiency of ensemble weather forecasts.
method Mixed model combining subset of trajectories with deep neural networks for post-processing.
result Achieved over 14% relative improvement in ensemble forecast skill.
TERA method speeds up derivative Gaussian processes in high dimensions.
problem High-dimensional function evaluations and gradient computations are computationally expensive.
method TERA uses exact gradient reduction to decouple and from the computational cost.
result TERA achieves state-of-the-art predictive accuracy with orders of magnitude faster computation.
State-of-the-art convolutional neural networks (CNNs) used in vision applications have large models with numerous weights. Training these models is very compute- and memory-resource intensive. Much research has been done on pruning or compressing these models to reduce the cost of inference, but little work has address…
Significant advances have been made in Natural Language Processing (NLP) modelling since the beginning of 2018. The new approaches allow for accurate results, even when there is little labelled data, because these NLP models can benefit from training on both task-agnostic and task-specific unlabelled data. However, the…
The fast demographic growth, together with the concentration of the population in cities and the increasing amount of daily waste, are factors that push to the limit the ability of waste assimilation by Nature. Therefore, we need technological means to make an optimal management of the waste collection process, which r…
We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a new notion of regret, also known as policy regret, which better captures the adversary's adaptiveness…
Optimizes fund portfolio updates using linear programming and heuristic search.
problem Efficiently updating mutual fund portfolios with various instruments.
method Linear programming and heuristic search approaches.
result Cost improvements over traditional methods.
MASnet enhances speech on mobile devices with low latency.
problem Efficiently enhancing speech on mobile devices with low latency.
method MASnet processes linear-scale spectrograms, using ratio masks to enhance noisy frames, and operates in low-latency incremental inference mode.
result MASnet achieves efficient speech enhancement with low latency, reducing FMA/s operations.
This paper uses Reinforcement Learning to select features from a large dataset.
problem Selecting the best features to minimize variance and bias in machine learning models.
method Formulated the feature selection problem as a Markov Decision Process (MDP) and used Temporal Difference (TD) algorithm.
result The approach using Reinforcement Learning outperformed other methods in selecting features.
We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in ord…
DFR reduces the computational cost of sparse-group lasso and adaptive sparse-group lasso.
problem Sparse-group lasso's computational expense and need for tuning.
method Dual Feature Reduction (DFR) using strong screening rules and dual norms.
result DFR drastically reduces computational cost without affecting solution optimality.
A new parallel algorithm for learning optimal policies in MDPs with low communication costs.
problem Learning optimal policies for infinite-horizon MDPs.
method Primal-Dual Stochastic Mirror Descent for convex programming problems with inexact constraints.
result First parallel algorithm for average-reward MDPs with generative model and low communication costs.
BO limits search to lower dimensions with LGPR, improving efficiency and accuracy.
problem High computational costs in BO for high-dimensional optimization.
method Limits search region to lower dimensions and uses LGPR for local Gaussian process regression.
result Search efficiencies improved by about 69% and 40% for Ackley and Rosenbrock functions.
New method reduces deep learning training costs by approximating vector-jacobian products.
problem Efficiently training deep neural networks with reduced computational and memory costs.
method Randomized, unbiased approximations of vector-jacobian products during backpropagation.
result Validated potential for reducing deep learning training costs through unbiased estimates.
Designs a neural network to reduce training cost by mapping to higher dimensions.
problem High training cost in neural networks.
method Maps feature vectors to higher dimensional space, designs weight matrices to reduce cost, uses convex constraints.
result Reduces training cost as the number of layers increases, without cross-validation.
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.
Deep learning improves oilfield equipment maintenance and reduces downtime.
problem Predicting equipment failure in oilrigs to minimize downtime.
method Developed and tested neural networks on oilfield datasets, using data processing and feature extraction.
result Deep learning can predict oilfield equipment failure with reduced downtime.
A new method reduces speckles in high contrast imaging.
problem Over-subtraction from speckles and self-subtraction in data reduction.
method Data Imputation concept using Karhunen-Loève transform (DIKL).
result DIKL achieves high-quality results with significantly reduced computational cost.
This work extends reduction processes for nonholonomic discrete mechanical systems.
problem Nonholonomic discrete mechanical systems and their reductions.
method Introduces a category of discrete-time dynamical systems and a two-stage reduction process.
result Two-stage reduction process produces systems isomorphic to one-stage reduction.
Optimal energy trading strategy for intraday markets using Hawkes processes.
problem Optimal execution in intraday energy markets with specific trading patterns.
method Calibrated Hawkes process model with transient price impact.
result Substantial cost reductions in TWAP and VWAP benchmarks.
Holistic Bioprocess Development Across Scales Using Multi-Fidelity Batch Bayesian Optimizationq-bio.QM
Bayesian optimization speeds up bioprocess development across scales.
problem Costly and complex bioprocess development across scales and biocatalyst selection.
method Multi-fidelity batch Bayesian optimization framework integrating Gaussian Processes and mixed-variable optimization.
result Reduction in experimental costs and increased yield in bioprocess optimization.
We present a theoretical analysis and empirical evaluations of a novel set of techniques for computational cost reduction of classifiers that are based on learned transform and soft-threshold. By modifying optimization procedures for dictionary and classifier training, as well as the resulting dictionary entries, our t…
A Monte Carlo method for pairs trading on mean-reverting spreads with Lévy processes.
problem Trading on mean-reverting spreads with flexible models.
method Monte Carlo simulation with variance gamma and alpha-gamma driving processes.
result Optimal trading strategies are affected by model parameters and correlation.
A Gaussian Process Ordinary Differential Equation framework for large continuous dynamical systems
problem Forecasting complex dynamical systems
method Kernel autonomous ODE approach based on Gaussian Processes and Quadratic Order Model Reduction
result Full model outperforms ROM methods in terms of accuracy or computational costs