Research
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,657 papers · 148 categories

Trend · papers per month

3266519771,302 · Jun 202019922001200920172026
48 results for Accelerated Power Method

We accelerate the power method for strong low-rank approximation using fast sketching.

problem Efficiency bottleneck in power method for large target ranks.
method Developed an algorithmic and theoretical framework for accelerating the power method using fast sketching.
result Simple and provably efficient methods for singular value decomposition, low-rank factorization, and Nyström approximation.

Principal component analysis (PCA) is one of the most powerful tools in machine learning. The simplest method for PCA, the power iteration, requires O(1/Δ)\mathcal O(1/Δ) full-data passes to recover the principal component of a matrix with eigen-gap ΔΔ. Lanczos, a significantly more complex method, achieves an accelerated…

2017-07-10abs ↗pdf ↗

Accelerators with power-law memory are proposed in the framework of the discrete time approach. To describe discrete accelerators we use the capital stock adjustment principle, which has been suggested by Matthews.The suggested discrete accelerators with memory describe the economic processes with the power-law memory …

2016-12-23abs ↗pdf ↗

FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.

problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.

New method accelerates CNNs for mobile devices by approximating tensors and quantizing weights.

problem Efficiently compress and accelerate CNNs for mobile devices.
method Low-rank tensor approximation in Tucker format combined with quantization of weights and activations.
result Our method significantly improves CNN performance on various classification tasks.

Hardware-accelerated RBM solves large combinatorial problems and integer factorization.

problem Solving large combinatorial optimization and integer factorization problems.
method Logically synthesized RBM architecture, hardware acceleration, and efficient training methods.
result Hardware-accelerated RBM factorizes 16-bit numbers with 10000x speed and 32x power improvements.

Stochastic gradient descent (\textsc{Sgd}) methods are the most powerful optimization tools in training machine learning and deep learning models. Moreover, acceleration (a.k.a. momentum) methods and diagonal scaling (a.k.a. adaptive gradient) methods are the two main techniques to improve the slow convergence of \text…

2018-10-01abs ↗pdf ↗

This research analyzes and accelerates score-based diffusion models using discretization and Hessian information.

problem Theoretical foundations and convergence analysis of score-based diffusion models.
method Investigation of various discretization schemes, including Euler, exponential integrators, and midpoint randomization. Proposal of an accelerated sampler based on local linearization method.
result Hessian-based approach achieves faster convergence rates of order $\widetilde{\mathcal{O}}\left(\frac{1}{\varepsilon} ight)$, significantly improving upon vanilla diffusion models.

The development of machine learning is promoting the search for fast and stable minimization algorithms. To this end, we suggest a change in the current gradient descent methods that should speed up the motion in flat regions and slow it down in steep directions of the function to minimize. It is based on a "power grad…

2019-06-11abs ↗pdf ↗

Survey of RL methods for optimizing power grid topologies.

problem Optimizing power grid operation with adaptive control strategies.
method Reinforcement Learning (RL) for dynamic and uncertain environments.
result Comprehensive evaluation of RL-based methods for power grid topology optimization.

A new method solves diagonally constrained SDPs quickly and accurately.

problem Solving large-scale diagonally constrained SDPs efficiently.
method Combines momentum from convex optimization with coordinate descent and matrix factorization.
result Local linear convergence and first-order critical point convergence proved.

In recent years, Convolutional Neural Network (CNN) based methods have achieved great success in a large number of applications and have been among the most powerful and widely used techniques in computer vision. However, CNN-based methods are computational-intensive and resource-consuming, and thus are hard to be inte…

2019-11-15abs ↗pdf ↗

Gradient Boosting Machine (GBM) is an extremely powerful supervised learning algorithm that is widely used in practice. GBM routinely features as a leading algorithm in machine learning competitions such as Kaggle and the KDDCup. In this work, we propose Accelerated Gradient Boosting Machine (AGBM) by incorporating Nes…

2019-03-20abs ↗pdf ↗

A new KDE model prevents singular solutions and accelerates optimization for probabilistic modeling.

problem Adapting to varying densities in data regions for probabilistic modeling.
method Adaptive KDE model with individual bandwidths, LOO-MLL criterion, and modified EM algorithm.
result The proposed models prevent singular solutions and have promising performance.

Interpreting gradient methods as fixed-point iterations, we provide a detailed analysis of those methods for minimizing convex objective functions. Due to their conceptual and algorithmic simplicity, gradient methods are widely used in machine learning for massive data sets (big data). In particular, stochastic gradien…

2017-06-29abs ↗pdf ↗

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.

Optimized neural networks for Edge TPU achieve high accuracy in real-time image classification.

problem Designing neural networks for hardware accelerators to achieve optimal performance.
method Hardware-aware neural architecture search and model customization for Edge TPU.
result Improved accuracy-latency tradeoff on Pixel 4's Edge TPU compared to existing models.

A new family of momentum coefficients improves the convergence rate of accelerated algorithms.

problem Improving the convergence rate of accelerated gradient methods for strongly convex functions.
method Introducing a family of controllable momentum coefficients for forward-backward accelerated methods.
result Established a controllable $O\left(1/k^{2α} ight)$ convergence rate for the NAG-αα method.

This paper speeds up simulations of hypersonic reentry by combining traditional and neural methods.

problem Accurately simulating hypersonic reentry with chemical reactions is computationally expensive.
method A hybrid simulation code combining a traditional fluid dynamics solver with a neural network approximating chemical reactions.
result Achieved significant acceleration factors (imes10 imes 10 to imes18.6 imes 18.6) while maintaining accuracy.

Paper tackles NAS problem by modeling it as a sparse supernet.

problem Neural Architecture Search (NAS) problem, particularly Mixed-Path Search.
method Model NAS as a sparse supernet with sparsity constraints. Use hierarchical accelerated proximal gradient algorithm for optimization.
result Proposed method finds compact, general, and powerful neural architectures.