arXiv research

Research examines the distribution of curve components in random multicurves.

We consider a random link, which is defined as the closure of a braid obtained from a random walk on the braid group. For such a random link, the expected value for the number of components was calculated by Jiming Ma. In this paper, we determine the most expected number of components for a random link, and further, co…

New algorithms solve tensor problems with random components using SDP.

We consider vector fixed point (FP) equations in large dimensional spaces involving random variables, and study their realization-wise solutions. We have an underlying directed random graph, that defines the connections between various components of the FP equations. Existence of an edge between nodes i, j implies the …

Principal Components Regression (PCR) is a traditional tool for dimension reduction in linear regression that has been both criticized and defended. One concern about PCR is that obtaining the leading principal components tends to be computationally demanding for large data sets. While random projections do not possess…

The paper studies multiple descent in multi-component prediction models.

Optimal transport is #P-hard when components are independent, even with approximate solutions.

It is hypothesized that price charts can be empirically decomposed into two components as random and non random. The non random component, which can be treated as approximately regular behavior of the prices (trend) in an epoch, is a geometric line. Thus, the random component fluctuates around the non random component …

Paper optimizes tensor deflation for non-orthogonal signals.

We investigate financial market correlations using random matrix theory and principal component analysis. We use random matrix theory to demonstrate that correlation matrices of asset price changes contain structure that is incompatible with uncorrelated random price changes. We then identify the principal components o…

The performance of the Self-Organizing Map (SOM) algorithm is dependent on the initial weights of the map. The different initialization methods can broadly be classified into random and data analysis based initialization approach. In this paper, the performance of random initialization (RI) approach is compared to that…

A new method for efficient nonlinear process monitoring using random Bernoulli features.

We introduce a new method for sparse principal component analysis, based on the aggregation of eigenvector information from carefully-selected axis-aligned random projections of the sample covariance matrix. Unlike most alternative approaches, our algorithm is non-iterative, so is not vulnerable to a bad choice of init…

If we pick $n$ random points uniformly in $[0,1]^d$ and connect each point to its $k-$nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in $[0,1]^d$ it suffices to connect every point to $c_{d,1} \log{\log{n}}$ points chosen randomly among its $…

Study reveals a universal formula for knotting in random equilateral polygons.

Study on typical knots and links using grid diagrams, focusing on size, components, and writhe.

Spectral denoising recovers meaningful network structure from noisy financial correlations.

Proposes BATer for improved adversarial example detection.

Continual learning based on data stream mining deals with ubiquitous sources of Big Data arriving at high-velocity and in real-time. Adaptive Random Forest ({\em ARF}) is a popular ensemble method used for continual learning due to its simplicity in combining adaptive leveraging bagging with fast random Hoeffding trees…

One technique to visualize the training of neural networks is to perform PCA on the parameters over the course of training and to project to the subspace spanned by the first few PCA components. In this paper we compare this technique to the PCA of a high dimensional random walk. We compute the eigenvalues and eigenvec…

We describe a method for unmixing mixtures of freely independent random variables in a manner analogous to the independent component analysis (ICA) based method for unmixing independent random variables from their additive mixtures. Random matrices play the role of free random variables in this context so the method we…

Study on length distribution of random multicurves on large genus surfaces converging to Poisson-Dirichlet distribution.

For very large datasets, random projections (RP) have become the tool of choice for dimensionality reduction. This is due to the computational complexity of principal component analysis. However, the recent development of randomized principal component analysis (RPCA) has opened up the possibility of obtaining approxim…

Study shows a central limit theorem for random coverings of manifolds with nilpotent groups.

Let $(M,g)$ be a smooth compact Riemannian surface with no boundary. Given a smooth vector field $V$ with finitely many zeroes on $M$, we study the distribution of the number of tangencies to $V$ of the nodal components of random band-limited functions. It is determined that in the high-energy limit, these obey a unive…

Research has shown that widely used deep neural networks are vulnerable to carefully crafted adversarial perturbations. Moreover, these adversarial perturbations often transfer across models. We hypothesize that adversarial weakness is composed of three sources of bias: architecture, dataset, and random initialization.…

Enhances functional classifier performance with new tree-based methods and unbiased feature importance assessment.

Neural networks learn patterns in random data, improving downstream performance.

Paper extends RPD for better handling multiple modalities and non-convexity.

Independent component analysis (ICA) is a method for recovering statistically independent signals from observations of unknown linear combinations of the sources. Some of the most accurate ICA decomposition methods require searching for the inverse transformation which minimizes different approximations of the Mutual I…

New tools in nonlinear random matrices improve understanding of the Sum of Squares hierarchy.

Classical methods such as Principal Component Analysis (PCA) and Canonical Correlation Analysis (CCA) are ubiquitous in statistics. However, these techniques are only able to reveal linear relationships in data. Although nonlinear variants of PCA and CCA have been proposed, these are computationally prohibitive in the …

With the rapid development and evolution of sophisticated algorithms for statistical analysis of time series data, the research community has started spending considerable effort in technical analysis of such data. Forecasting is also an area which has witnessed a paradigm shift in its approach. In this work, we have u…

In this paper we consider a class of BSDEs with drivers of quadratic growth, on a stochastic basis generated by continuous local martingales. We first derive the Markov property of a forward--backward system (FBSDE) if the generating martingale is a strong Markov process. Then we establish the differentiability of a FB…

Randomly glued tetrahedra form connected 3-manifolds with a single boundary.

Correspondence analysis (CA) is a multivariate statistical tool used to visualize and interpret data dependencies by finding maximally correlated embeddings of pairs of random variables. CA has found applications in fields ranging from epidemiology to social sciences; however, current methods do not scale to large, hig…

Dimensional reduction of high dimensional data can be achieved by keeping only the relevant eigenmodes after principal component analysis. However, differentiating relevant eigenmodes from the random noise eigenmodes is problematic. A new method based on the random matrix theory and a statistical goodness-of-fit test i…

Due to advances in sensors, growing large and complex medical image data have the ability to visualize the pathological change in the cellular or even the molecular level or anatomical changes in tissues and organs. As a consequence, the medical images have the potential to enhance diagnosis of disease, prediction of c…

Study of random multicurves and square-tiled surfaces on large genus surfaces.

Framework for robust matrix estimation with side information.

New method improves deep CCA by modeling private components conditionally independent of common factors.

We analyzed cross-correlations between price fluctuations of global financial indices (20 daily stock indices over the world) and local indices (daily indices of 200 companies in the Korean stock market) by using random matrix theory (RMT). We compared eigenvalues and components of the largest and the second largest ei…

A method for inferring graph from multivariate time series using ADMM.

The rebmix package provides R functions for random univariate and multivariate finite mixture model generation, estimation, clustering and classification. The paper is focused on multivariate normal mixture models with unrestricted variance-covariance matrices. The objective is to show how to generate datasets for a kn…

New lower bounds for gradient methods in strongly convex finite-sum optimization.

We present sharp tail asymptotics for the density and the distribution function of linear combinations of correlated log-normal random variables, that is, exponentials of components of a correlated Gaussian vector. The asymptotic behavior turns out to depend on the correlation between the components, and the explicit s…

Independent Component Analysis (ICA) is a statistical tool that decomposes an observed random vector into components that are as statistically independent as possible. ICA over finite fields is a special case of ICA, in which both the observations and the decomposed components take values over a finite alphabet. This p…

Tractable yet expressive density estimators are a key building block of probabilistic machine learning. While sum-product networks (SPNs) offer attractive inference capabilities, obtaining structures large enough to fit complex, high-dimensional data has proven challenging. In this paper, we present random sum-product …