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.
TTRP method preserves distances in high-dimensional data with reduced storage and speed.
problem Preserving distances in high-dimensional datasets efficiently and accurately.
method Tensor train random projection (TTRP) using TT-ranks of one.
result TTRP is an expected isometric projection with bounded variance.
Deep learning calibrates CO2 storage formations from seismic and well data.
problem Uncertainty in CO2 storage formation properties.
method Two deep learning models for well and seismic data, integrated into MCMC history matching.
result Significant uncertainty reduction in key parameters and accurate CO2 plume predictions.
A new ADMM variant reduces storage needs while maintaining fast convergence.
problem High storage requirements in ADMM variants.
method Integrates SVRG with ADMM, reducing storage needs.
result Converges faster and uses less memory than existing methods.
GrateTile optimizes CNN feature map storage for efficient data access.
problem Efficient storage and access of sparse CNN feature maps.
method Divides feature maps into uneven-sized subtensors, compresses and stores them in a compressed yet accessible format.
result Average 55% DRAM bandwidth reduction with minimal indexing overhead.
We focus in this paper on dataset reduction techniques for use in k-nearest neighbor classification. In such a context, feature and prototype selections have always been independently treated by the standard storage reduction algorithms. While this certifying is theoretically justified by the fact that each subproblem …
Paper proposes a method to prune neural networks, reducing storage and computation costs.
problem Reduction of storage and computational costs for deep neural networks.
method Statistical analysis of component significance using F-statistic-based screening technique.
result Pruned models are highly competitive with state-of-the-art approaches.
CSE-FSL reduces communication and storage costs in federated learning.
problem High communication and storage costs in federated learning.
method CSE-FSL uses an auxiliary network to locally update client models and sends only selected epochs' smashed data.
result Significant communication reduction with state-of-the-art convergence and model accuracy.
SmartDeal reduces energy and storage costs for deep neural networks.
problem Heavy parameterization of deep neural networks leads to inefficient use of DRAM.
method SmartDeal decomposes weights into a small basis matrix and a structurally sparse coefficient matrix, quantized to power-of-2.
result Up to 2.44x energy efficiency improvement in inference and 10.56x reduction in training energy.
Proposes TTNPE for tensor data embedding with improved trade-offs.
problem Embedding multi-dimensional tensor data into low dimensions.
method Tensor Train Neighborhood Preserving Embedding (TTNPE) with novel optimization approaches.
result Improves classification, computation, and dimensionality reduction trade-offs.
The paper presents a method to reduce computational and storage costs in PCA and spectral clustering.
problem Efficiently reducing computational and storage costs in PCA and spectral clustering.
method Randomly 'puncturing' the data matrix and kernel matrix through Bernoulli masks.
result The spectral behavior of the resulting kernel is fully tractable and can be drastically punctured without significant loss in performance.
Variance reduction (VR) methods boost the performance of stochastic gradient descent (SGD) by enabling the use of larger, constant stepsizes and preserving linear convergence rates. However, current variance reduced SGD methods require either high memory usage or an exact gradient computation (using the entire dataset)…
Model predicts BESS interactions and price impacts in energy markets.
problem Understanding BESS interactions and price formation in energy markets.
method Stochastic game-theoretic model with linear-quadratic differential game.
result Equilibrium controls and prices derived for BESSs in both heterogeneous and homogeneous settings.
Paper reduces recommender system model size by 90%.
problem Large model size in recommender systems.
method Hybrid frequency and double hashing for model size reduction.
result 90% reduction in model size with no performance loss.
RSAC improves lightweight continuous learning efficiency.
problem Excessive training time and memory usage in continuous learning.
method Regularized subspace approximation classifier with feature reduction and regularization.
result RSAC achieves more efficient continuous learning than prior methods.
Game theory models storage investment to balance market competition and profits.
problem Strategic storage investment impacts electricity market prices and revenues.
method Formulated a non-cooperative game between investors to model strategic storage decisions.
result Increasing storage capacity reduces individual profits but increases total investment.
QABBA improves time series storage efficiency while preserving shape information.
problem Efficient storage and shape preservation of time series data.
method Quantized symbolic time series approximation (QABBA) using ABBA technique.
result QABBA achieves a new state-of-the-art on Monash regression dataset.
A method distills GANs for mobile devices, reducing computation and storage.
problem Heavy computation and storage cost of GANs on mobile devices.
method Knowledge distillation to train a smaller generator with inherited information from a larger teacher generator, including a discriminator.
result Portable GAN models with strong performance achieved.
Study reduces redundant information in multi-modal datasets.
problem Redundant information increases data size and costs.
method Multimodal framework using entropy, mutual info, Lasso, SHAP, PCA, topic modeling.
result Significant feature space can be pruned with minimal loss in performance.
The paper analyzes how larger minibatch sizes in SG-MCMC lead to faster convergence.
problem Theoretical analysis of impact of minibatch size on SG-MCMC convergence rate.
method Proposes a variance-reduction technique for SG-MCMC and proves its faster convergence rate.
result The proposed variance-reduction technique leads to a faster convergence rate than standard SG-MCMC.
Global convergence of an online (stochastic) limited memory version of the Broyden-Fletcher- Goldfarb-Shanno (BFGS) quasi-Newton method for solving optimization problems with stochastic objectives that arise in large scale machine learning is established. Lower and upper bounds on the Hessian eigenvalues of the sample …
New ATD methods improve TD learning efficiency and stability.
problem Improving TD learning efficiency and stability.
method Accelerated Gradient Temporal Difference (ATD) methods.
result ATD methods provide similar data efficiency to least squares methods with reduced computation and storage requirements and improved parameter sensitivity.
Study on energy storage's impact on electricity prices and profitability.
problem Analyzing the profitability of energy storage in electricity markets.
method Characterized optimal operating strategy for storage systems, determined equilibrium price in a market with storage, renewables, and conventional producers, and characterized price process using stochastic differential equations.
result Increased average revenues and interquantile ranges for storage assets in energy transition scenarios.
Hybrid neural-tree networks reduce IoT model size and computation by 52.2% and 11.1% respectively.
problem Power and storage constraints in IoT devices limit the deployment of modern neural networks.
method Combines neural and tree-based learning with ternary quantization.
result Significant reduction in model size and computation with minimal accuracy loss.
Paper provides a method to price electricity storage contracts using COS technique.
problem Valuation of electricity storage contracts considering physical and operational constraints.
method Uses Fourier-based COS method to price contracts based on stochastic polynomial process.
result The COS method accurately and efficiently prices electricity storage contracts.
Generative models improve carbon storage site prediction using Bayesian inversion.
problem Predicting suitable geologic sites for long-term carbon dioxide storage.
method Generative adversarial networks and Bayesian inversion to condition models on physical measurements and historic data.
result Improved resolution of carbon dioxide storage capacity forecasts.
Paper proposes a risk-averse approach to energy storage price arbitrage using conformal uncertainty quantification.
problem Inherent volatility and uncertainty of real-time electricity prices create financial risks for storage arbitrage.
method Two-layer prediction model with conformal uncertainty quantification for high coverage of real-time price uncertainty.
result The framework achieves good profit margins with minimal losses, demonstrating effectiveness in real-time market.
It has been known for a long time that the classical spherical perceptrons can be used as storage memories. Seminal work of Gardner, \cite{Gar88}, started an analytical study of perceptrons storage abilities. Many of the Gardner's predictions obtained through statistical mechanics tools have been rigorously justified. …
Deep learning reduces memory and computation for MRF recovery.
problem Heavy storage and computation requirements of dictionary-matching in MRF recovery.
method MRF-Net with dimensionality reduction and manifold clustering.
result MRF-Net saves over 60 times memory and computation.
Framework uses RL and simulation for optimal microgrid energy storage planning.
problem Optimal investment in diverse energy storage technologies for microgrids.
method Combines reinforcement learning with simulation-based optimization for long-term planning.
result Derives better engineering solutions for future microgrid applications.
Paper proposes a new model to assess risks in energy storage systems considering both exogenous and endogenous uncertainties.
problem Current risk assessment ignores the stochastic nature of energy storage availability.
method Data-driven unified model with exogenous and endogenous uncertainty description for four types of generic energy storage.
result Comparative results show more severe risks for endogenous uncertainty, suggesting new strategies for system operators.
Unified algorithm for solving stochastic storage problems using statistical learning.
problem Solving stochastic storage problems through regression Monte Carlo methods.
method Developed the dynamic emulation algorithm (DEA) that unifies different approaches.
result Illustrated the DEA template with examples from natural gas storage and microgrid control.
Adaptive sampling method reduces variance in stochastic optimization.
problem Reducing variance in stochastic optimization with limited gradient computations.
method Adaptive increase in sample size based on inner product test.
result Algorithm converges globally on nonconvex functions and linearly on strongly convex functions.
Study estimates risks of nuclear waste storage projects.
problem Cost and schedule risks in nuclear waste storage projects.
method Reference class of 216 past projects for cost risk, 200 for schedule risk.
result Cost and schedule risks are substantial for nuclear waste storage projects.
AppStreamer reduces mobile game storage by predicting needed files.
problem Expanding storage needs of mobile games and apps.
method Predictive streaming of app files from cloud or edge servers.
result Reduces storage by 87% for Dead Effect 2 and 86% for Fire Emblem Heroes.
Deep learning optimizes gas storage operations.
problem Optimizing underground natural gas storage operations.
method Reinforcement learning techniques applied to high-dimensional forward markets with constraints.
result Performance of deep learning method superior to least-squares Monte-Carlo approach.
RL agent learns to save costs by managing household energy storage.
problem Maximizing cost savings in smart grids with household energy storage.
method Data-driven RL agent learns from tariff structures and storage capacity.
result RL agent explains its learning process and strategies.
SER tool predicts storage capacity risk with probabilistic accuracy.
problem Managing data storage growth to avoid financial losses.
method Stochastic Estimated Risk (SER) using Brownian motion with drift model.
result Probabilistic approach is more accurate for non-linear storage patterns.
Two SGD-like algorithms reduce memory usage for stochastic optimization with infinite data.
problem Optimizing with infinite data sets resulting from random noise.
method Proposes SSAG and S-SAGA algorithms for expected risk minimization.
result SSAG has faster convergence rate than SGD with comparable space requirement.
Optimizes energy storage under fluctuating prices and partial information.
problem Optimizing energy storage in a changing economic environment with partial information.
method Applying filtering theory to derive an adapted state process, solving the Hamilton-Jacobi-Bellman equation, and proving existence and uniqueness of a solution.
result Derives an optimal control policy for energy storage, proving its admissibility.
Study on neural networks' storage capacity and solution space structure.
problem Understanding the storage capacity and solution space structure of neural networks.
method Replica method from statistical physics.
result Storage capacity per parameter remains finite even with infinite width and weights exhibit negative correlations.
New approach for feature evolution in streaming data with limited storage.
problem Rarely-provided labels in feature evolving streams.
method Incorporates manifold regularization and a buffer to adapt to different storage budgets.
result Preserves the performance of feature evolving learning across different storage budgets.
This study optimizes energy storage scheduling under price uncertainty, balancing risk and reward.
problem Optimizing energy storage operation under price uncertainty and risk.
method Two-stage stochastic risk-constrained approach using conditional value-at-risk.
result Increasing risk aversion leads to substantial benefits in terms of risk reduction and expected reward.
New framework predicts future shipments with less error and saves labor.
problem Optimizing storage assignment in warehouses under uncertainty.
method Introduces a new framework that combines neural networks to predict future shipments and integrates it into a storage assignment system.
result Achieves up to 29% decrease in MAPE compared to CNN-LSTM on unseen future shipments.
Introduces an unobservable intrinsic electricity price to link storage theory with risk premium.
problem Connecting storage theory with risk premium in electricity markets.
method Introduces an unobservable intrinsic electricity price and derives prices for various contracts.
result Finds an overall negative risk premium in empirical analysis.
Subspace clustering refers to the problem of clustering unlabeled high-dimensional data points into a union of low-dimensional linear subspaces, assumed unknown. In practice one may have access to dimensionality-reduced observations of the data only, resulting, e.g., from "undersampling" due to complexity and speed con…
Deep learning reconstructs pressure fields and classifies leakage rates in CCS storage sites.
problem Monitoring CO2 leakage in CCS storage sites.
method Variational auto-encoder tailored for pressure field reconstruction and leakage rate classification.
result Uncertainty estimates of predictions illustrated on synthetic data.
Paper introduces a new volatility model for natural gas markets and discusses swing option pricing.
problem Modeling price and storage dynamics in natural gas markets with path-dependent volatility.
method Developed a novel stochastic path-dependent volatility model and used deep learning for swing option pricing.
result Proposed a deep learning method for numerical approximations of swing option pricing.