New algorithms secure IoT edge computing from jamming attacks.
problem Secure mobile edge computing in IoT under jamming attacks.
method Online learning tools for developing SAVE-S and SAVE-A algorithms.
result Achieves sublinear regret without extra resources.
New method speeds up knot computations in 3D.
problem Computational complexity in knot theory.
method 3D representation of knots for faster computation.
result Savings in computational complexity for knot invariants.
SAVE combines Q-learning and MCTS with amortized value estimates for improved performance.
problem Combining model-free Q-learning and model-based MCTS for efficient learning and planning.
method SAVE uses a learned prior to guide MCTS, which estimates improved state-action values. These estimates are used to update the prior, creating a cooperative relationship between learning and search.
result SAVE achieves higher rewards with fewer training steps and strong performance with small search budgets.
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.
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.
Adaptive methods optimize machine learning training faster.
problem Non-adaptive stochastic optimization requires tuning for each application.
method Develop adaptive stochastic optimization methods.
result Adaptive methods offer computational savings for large-scale systems.
New algorithms save computation in agnostic learning with membership queries.
problem Efficiently learning touchstone classes with membership queries.
method Designing agnostic learning algorithms for circuits with sublinear gates.
result Agnostic learning algorithms for circuits with sublinear gates achieve significant computational savings.
Early stopping method saves up to 75% computation time in policy search tasks.
problem Lengthy evaluation times in optimization problems, especially in robotics.
method A generalized early stopping criterion that only uses objective value at each time step.
result The method saves up to 75% computation time compared to no stopping.
Paper presents ADEPOS framework for energy-efficient anomaly detection.
problem Energy and bandwidth limitations in IoT systems.
method Low precision computing and adaptive neural networks.
result 8.95X energy savings with no loss in detection accuracy.
mfEGRA uses active learning to efficiently locate failure boundaries in reliability analysis.
problem Prohibitive cost of reliability analysis using Monte Carlo sampling for high-fidelity models.
method Develops a multifidelity active learning method using data-driven adaptively refined surrogates.
result Significant computational savings (46-48%) compared to single-fidelity EGRA.
Quantum computing offers energy savings over classical computing.
problem Energy efficiency in computing services.
method Cournot competition model constrained by energy usage.
result Quantum computing firms can outperform classical counterparts in energy efficiency.
Gradient-based sampling improves LS problem solving efficiency.
problem Computational difficulties in large sample size data analysis.
method Adaptive sampling dependent on input and output gradients.
result Gradient-based sampling improves statistical efficiency and computational saving.
TCA algorithm saves up to 40% energy in IoT devices.
problem Energy consumption and user comfort trade-off in IoT devices.
method Incremental learning Temporal Clustering Algorithm (TCA) for IoT devices.
result Achieved up to 40% energy savings with high success rate.
Optimizes memory and computation in wearable systems.
problem Minimizing resource usage in real-time classification for wearable systems.
method Hierarchical SVM classifier structure and memory optimization techniques.
result Up to 56% reduction in memory storage for activity recognition.
Efficiently computes indices for UCB and DMED algorithms in reinforcement learning.
problem Efficiently compute indices for UCB and DMED algorithms in reinforcement learning.
method Developed efficient methods to compute indices for UCB and DMED algorithms by solving systems of equations.
result Significant computational time savings and improved regret performance demonstrated.
Active learning has shown to reduce the number of experiments needed to obtain high-confidence drug-target predictions. However, in order to actually save experiments using active learning, it is crucial to have a method to evaluate the quality of the current prediction and decide when to stop the experimentation proce…
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.
Investors choose between bonds and savings accounts based on utility maximization.
problem Determining the optimal investment strategy in a stochastic interest rate environment.
method Analyzes utility maximization under two investment scenarios using affine term structure models.
result Bond indifference prices are found to be the roots of integral expressions.
Argentum is a crypto coin for saving and investment in unstable countries.
problem Stable purchasing power for savings in unstable economies.
method Designing a crypto coin backed by investment instruments.
result Provides a stabilization instrument for savings in unstable economies.
Paper uses Koopman operator and Nyström method for efficient nonlinear control.
problem Control of nonlinear dynamical systems.
method Combines Koopman operator framework with Nyström approximation for kernel methods.
result Theoretical guarantees on the convergence rates of the approximated Riccati operator and regulator objective.
E2-Train reduces training energy by 80%+ for state-of-the-art CNNs.
problem Efficient training of energy-hungry CNNs on edge devices.
method Selective layer update, stochastic mini-batch dropping, and sign prediction for low-precision backpropagation.
result Achieves >90% energy savings for training ResNet-74 on CIFAR-10.
Researchers save memory on MCUs by reordering neural network operators.
problem Memory constraints on microcontrollers for neural network inference.
method Operator reordering to save memory, orthogonal to other compression methods.
result Reduced memory footprint of a CNN to deploy on an MCU with 512KB SRAM.
EuSN uses Euler discretization for stable, non-dissipative reservoir computing.
problem Designing stable and efficient reservoir computing models.
method Forward Euler discretization and antisymmetric recurrent matrices.
result EuSN outperforms standard RC models in long-term memory tasks and time-series classification.
Prize linked savings accounts provide a return in the form of randomly chosen accounts receiving large cash prizes, in lieu of a guaranteed and uniform interest rate. This model became legal for American national banks upon bipartisan passage of the American Savings Promotion Act in December 2014, and many states have …
Study on pooled annuity funds and how initial savings affect income stability.
problem Analyzing the stability of income payments in pooled annuity funds.
method Examining the influence of initial savings on income fluctuations and developing a criterion for pooling funds.
result Identification of a term, the 'implied number of homogeneous members', linking initial savings to income fluctuations.
PETRA enables parallel training of deep models with reversible architectures.
problem Challenges in parallelizing deep model training.
method Introduces PETRA, a novel approach for parallelizing gradient computations in reversible architectures.
result Achieves competitive accuracies on CIFAR-10, ImageNet32, and ImageNet using ResNet models.
Estimates cost savings from early cancer diagnosis.
problem Improving early cancer diagnosis to reduce treatment costs.
method Combining published cancer treatment cost estimates by stage with incidence rates by stage at diagnosis, and extrapolating to other cancer sites.
result Estimates U.S. national annual treatment cost-savings from early cancer diagnosis in the trillions.
The effects of saving and spending patterns on holding time distribution of money are investigated based on the ideal gas-like models. We show the steady-state distribution obeys an exponential law when the saving factor is set uniformly, and a power law when the saving factor is set diversely. The power distribution c…
In this paper we present a slight modification of the Fourier estimation method of the spot volatility (matrix) process of a continuous Itô semimartingale where the estimators are always non-negative definite. Since the estimators are factorized, computational cost will be saved a lot.
Data science reveals co-evolution of income inequality and savings across countries.
problem Understanding the co-evolution of income inequality and savings across countries.
method Time series data for Gini indices and Gross Domestic Savings (% of GDP) were used to construct correlation and similarity matrices, and a multi-dimensional scaling technique was applied. Linear regression was used to test the empirical linkage between income inequality and savings.
result The empirical model proposed by Chakraborti-Chakrabarti (2000) holds reasonably true for many economies of the world, showing a moderate relationship between income inequality and savings.
We analyze the ideal gas like models of markets and review the different cases where a `savings' factor changes the nature and shape of the distribution of wealth. These models can produce similar distribution of wealth as observed across varied economies. We present a more realistic model where the saving factor can v…
Entropy-based model for hierarchical learning from multiscale data.
problem Learning from data with auxiliary information and multiscale target functions.
method Entropy-based hierarchical learning model with multiscale entropies.
result Entropy-based model yields stronger guarantees than uniform convergence bounds.
This work tackles exploding inverses in INNs, revealing and mitigating their numerical non-invertibility.
problem Exploding inverses in INNs cause numerical non-invertibility, leading to failures in various tasks.
method Derived bi-Lipschitz properties of INN building blocks, proposed regularizers for local invertibility, and stable INN designs for global invertibility.
result Bi-Lipschitz properties and stable INN designs are crucial for addressing numerical non-invertibility.
We review a simple model of closed economy, where the economic agents make money transactions and a saving criterion is present. We observe the Gibbs distribution for zero saving propensity, and non-Gibbs distributions otherwise. While the exact solution in the case of zero saving propensity is already known to be give…
We consider a simple model of a closed economic system where the total money is conserved and the number of economic agents is fixed. In analogy to statistical systems in equilibrium, money and the average money per economic agent are equivalent to energy and temperature, respectively. We investigate the effect of the …
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.
SAVED safely learns robot tasks with sparse rewards.
problem Challenges in reinforcement learning for robotics, especially sparse rewards and complex constraints.
method SAVED uses supervision to constrain exploration and learn efficiently, handling complex constraints.
result SAVED outperforms state-of-the-art methods in success rate, constraint satisfaction, and sample efficiency.
Paper proposes MCMA architecture for neural approximate computing with higher invocation rate and energy savings.
problem Limited invocation rate of neural approximators leading to suboptimal energy efficiency.
method Introduces MCMA architecture with a multiclass classifier and multiple approximators, sharing hardware resources and efficiently swapping approximators.
result Significantly higher invocation rate and energy savings compared to existing methods.
Study explores factors influencing saving behavior among Dhaka employees.
problem Factors influencing saving behavior among Dhaka employees.
method Quantitative approach with cross-sectional survey design, structured questionnaire, descriptive statistics, reliability analysis, regression analysis.
result Only financial management practices had a significant positive relationship with saving behavior.
This paper proposes two mixed models to study a consumer's optimal saving in the presence of two types of risk.
New GPU kernels boost deep learning speed and memory efficiency.
problem Sparse deep learning matrices are not well-suited for existing sparse kernels.
method Identified favorable properties of sparse matrices from deep learning, developed high-performance GPU kernels for sparse matrix operations.
result 27% of single-precision peak performance on Nvidia V100 GPUs achieved with new kernels.
New principle reduces load imbalance in LLM serving systems, saving up to 52% energy.
problem Wasted computational power due to load imbalance in LLM serving systems.
method Developed a universal load-balancing principle for barrier-synchronized systems with non-migratable state.
result Proves worst-case theoretical guarantees for imbalance reduction and energy savings.
We discuss the ideal gas like models of a trading market. The effect of savings on the distribution have been thoroughly reviewed. The market with fixed saving factors leads to a Gamma-like distribution. In a market with quenched random saving factors for its agents we show that the steady state income (m) distributi…
We mathematically analyze a simple market model where trading at each point in time involves only two agents with the sum of their money being conserved and with neither parties resulting with negative money after the interaction process. The exchange involves random re-distribution among the two players of a fixed fra…
Risk control improves EENNs to make faster predictions without sacrificing accuracy.
problem Determining safe times for EENNs to exit early without degrading performance.
method Adapting risk control frameworks to EENNs to tune their exiting mechanism.
result Risk control enables EENNs to make faster predictions while maintaining user-specified performance goals.
New method saves computational budget by ranking and transferring learning curves.
problem Expensive automated machine learning methods for hyperparameter and neural architecture optimization.
method Tackles as a ranking and transfer learning problem, optimizing a pairwise ranking loss and leveraging learning curves from other datasets.
result Accelerates neural architecture search by a factor of up to 100 without significant performance degradation.
Study on optimal portfolio selection with varying borrowing and saving rates in continuous-time markets.
problem Optimal portfolio selection in markets with different borrowing and saving rates.
method Hamilton-Jacobi-Bellman equation, partial differential equation, verification argument.
result Existence and smoothness of the value function, identification of trading regions and strategies.
New Bitcoin coin selection method improves cost savings.
problem Improving cost savings in Bitcoin coin selection.
method Coin selection with leverage, allowing user-tunable parameters.
result Natural replacement for standard knapsack method.