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.
Most of real-world graphs are dynamic, i.e., they change over time by a sequence of update operations. While the regression problem has been studied for static graphs and temporal graphs, it is not investigated for general dynamic graphs. In this paper, we study regression over dynamic graphs. First, we present the not…
Develops a regression model for partially observed dynamic tensor data.
problem Characterizing the relationship between dynamic tensor data and external covariates when data is only partially observed.
method Introduces low-rank, sparsity, and fusion structures on the regression coefficient tensor, and uses a loss function projected over observed entries. Developed an efficient non-convex alternating updating algorithm.
result Derived finite-sample error bounds for the estimator.
Dynamic Time Warping improves regression accuracy on spectroscopy data.
problem Improving regression accuracy on spectroscopy data with DTW when data is across multiple wavelengths.
method Illustrated DTW's effectiveness on spectroscopy time-series data, showing its benefits in improving regression accuracy when only a single wavelength is considered. DTW combined with k-Nearest Neighbour reveals similarities and differences at the time-series level.
result DTW improves regression accuracy on spectroscopy data, especially when considering a single wavelength.
The regression of multiple inter-connected sequence data is a problem in various disciplines. Formally, we name the regression problem of multiple inter-connected data entities as the "dynamic network regression" in this paper. Within the problem of stock forecasting or traffic speed prediction, we need to consider bot…
Dynamic Mode Decomposition (DMD) yields a linear, approximate model of a system's dynamics that is built from data. We seek to reduce the order of this model by identifying a reduced set of modes that best fit the output. We adopt a model selection algorithm from statistics and machine learning known as Least Angle Reg…
Study shows how mini-batch GD with random reshuffling affects least squares regression dynamics.
problem Analyzing the error dynamics of mini-batch GD with random reshuffling for least squares regression.
method Represented training and generalization errors through a sample cross-covariance matrix Z, compared with sample covariance matrix of original features X, and used linear scaling rule for analysis.
result Mini-batch GD with random reshuffling exhibits subtle step-size dependence not detectable by gradient flow analysis, converging to a limit dependent on the step size.
Prediction of dynamical time series with additive noise using support vector machines or kernel based regression has been proved to be consistent for certain classes of discrete dynamical systems. Consistency implies that these methods are effective at computing the expected value of a point at a future time given the …
Recently there has been substantial interest in spectral methods for learning dynamical systems. These methods are popular since they often offer a good tradeoff between computational and statistical efficiency. Unfortunately, they can be difficult to use and extend in practice: e.g., they can make it difficult to inco…
A well-known problem in data science and machine learning is {\em linear regression}, which is recently extended to dynamic graphs. Existing exact algorithms for updating the solution of dynamic graph regression require at least a linear time (in terms of n: the size of the graph). However, this time complexity might…
A machine learning approach for dynamic stock recommendation outperforms traditional strategies.
problem Lack of time for analysts to check all S&P 500 stocks and the need for a reliable stock selection strategy.
method Selecting representative stock indicators, using five machine learning methods, and choosing the model with the lowest Mean Square Error to rank stocks.
result The proposed scheme outperforms the long-only strategy on the S&P 500 index in terms of Sharpe ratio and cumulative returns.
We study the performance of sparse regression methods and propose new techniques to distill the governing equations of dynamical systems from data. We first look at the generic methodology of learning interpretable equation forms from data, proposed by Brunton et al., followed by performance of LASSO for this purpose. …
In the present paper, a fuzzy logic based method is combined with wavelet decomposition to develop a step-by-step dynamic hybrid model for the estimation of financial time series. Empirical tests on fuzzy regression, wavelet decomposition as well as the new hybrid model are conducted on the well known SP500 index fin…
Spectral decomposition of the Koopman operator is attracting attention as a tool for the analysis of nonlinear dynamical systems. Dynamic mode decomposition is a popular numerical algorithm for Koopman spectral analysis; however, we often need to prepare nonlinear observables manually according to the underlying dynami…
In this work we study the non-parametric reconstruction of spatio-temporal dynamical Gaussian processes (GPs) via GP regression from sparse and noisy data. GPs have been mainly applied to spatial regression where they represent one of the most powerful estimation approaches also thanks to their universal representing p…