Related papers: An efficient streaming algorithm for spectral prop…
This paper develops a spectral fitting technology based on the particle swarm optimization (PSO) algorithm, which is applied to a calibration-free wavelength modulation spectroscopy system to achieve concentration retrieval. As compared…
We introduce a streaming framework for analyzing stochastic approximation/optimization problems. This streaming framework is analogous to solving optimization problems using time-varying mini-batches that arrive sequentially. We provide…
Smoothed Dissipative Particle Dynamics (SDPD) is a mesoscopic particle method which allows to select the level of resolution at which a fluid is simulated. The numerical integration of its equations of motion still suffers from the lack of…
Spectral dimensionality reduction is frequently used to identify low-dimensional structure in high-dimensional data. However, learning manifolds, especially from the streaming data, is computationally and memory expensive. In this paper, we…
Recently [Bhattacharya et al., STOC 2015] provide the first non-trivial algorithm for the densest subgraph problem in the streaming model with additions and deletions to its edges, i.e., for dynamic graph streams. They present a…
The Dynamic Mode Decomposition (DMD) and the more general Extended DMD (EDMD) are powerful tools for computational analysis of dynamical systems in data-driven scenarios. They are built on the theoretical foundation of the Koopman…
Signal decomposition and multiscale signal analysis provide many useful tools for time-frequency analysis. We proposed a random feature method for analyzing time-series data by constructing a sparse approximation to the spectrogram. The…
We consider the problem of high-dimensional heavy-tailed statistical estimation in the streaming setting, which is much harder than the traditional batch setting due to memory constraints. We cast this problem as stochastic convex…
Large Eddy Simulation is based on decomposition of turbulent flow structures to large energy containing scales and small subgrid scales. The present study captures all flow low energy modes of a sample shear layer using the proper…
One of the most common methods to train machine learning algorithms today is the stochastic gradient descent (SGD). In a distributed setting, SGD-based algorithms have been shown to converge theoretically under specific circumstances. A…
A semi-streaming algorithm in dynamic graph streams processes any $n$-vertex graph by making one or multiple passes over a stream of insertions and deletions to edges of the graph and using $O(n \cdot \mbox{polylog}(n))$ space.…
Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not…
Dynamic mode decomposition (DMD) represents an effective means for capturing the essential features of numerically or experimentally generated flow fields. In order to achieve a desirable tradeoff between the quality of approximation and…
A novel data-driven method of modal analysis for complex flow dynamics, termed as reduced-order variational mode decomposition (RVMD), has been proposed, combining the idea of the separation of variables and a state-of-the-art nonstationary…
We consider a smoothed online convex optimization (SOCO) problem with predictions, where the learner has access to a finite lookahead window of time-varying stage costs, but suffers a switching cost for changing its actions at each stage.…
It is expensive to compute residual diffusivity in chaotic in-compressible flows by solving advection-diffusion equation due to the formation of sharp internal layers in the advection dominated regime. Proper orthogonal decomposition (POD)…
Turbulent flows, despite their apparent randomness, exhibit coherent structures that underpin their dynamics. Proper orthogonal decomposition (POD) has been widely used to extract these structures from experimental data. While periodic…
Asynchronous parallel optimization algorithms for solving large-scale machine learning problems have drawn significant attention from academia to industry recently. This paper proposes a novel algorithm, decoupled asynchronous proximal…
We adapt a well known streaming algorithm for approximating item frequencies to the matrix sketching setting. The algorithm receives the rows of a large matrix $A \in \R^{n \times m}$ one after the other in a streaming fashion. It maintains…
Representation learning often plays a critical role in reinforcement learning by managing the curse of dimensionality. A representative class of algorithms exploits a spectral decomposition of the stochastic transition dynamics to construct…