Infinite CNNs lose spatial correlations, but can be restored by correlated weights.
problem Infinite CNNs lose spatial correlations, which are crucial for their performance.
method Introduced correlated weights to restore spatial correlations in infinite CNNs.
result Optimal performance is achieved with a moderate level of weight correlation.
This paper introduces hierarchical Gaussian process priors for neural networks to capture weight correlations and inductive biases.
problem Capturing weight correlations and inductive biases in neural networks.
method Hierarchical Gaussian process priors with unit embeddings and input-dependent kernels.
result Hierarchical Gaussian process priors provide competitive predictive performance and desirable uncertainty estimates.
New method improves convergence of spatial filters in neural networks.
problem Poor convergence behavior of spatial filters in neural networks.
method Correlated initialization for spatial filters.
result Uncorrelated initialization leads to poor convergence and slow training of some parameters.
The study examines correlations of logarithms of integers at different scalings.
problem Analyzing pair correlations of logarithms of integers at various scalings.
method Examined correlations of logarithms of positive integers at different scalings, proving the existence of pair correlation functions.
result Level repulsion at linear scaling, total loss of mass at superlinear scalings, and Poissonian behavior at sublinear scalings.
We discuss a weighted estimation of correlation and covariance matrices from historical financial data. To this end, we introduce a weighting scheme that accounts for similarity of previous market conditions to the present one. The resulting estimators are less biased and show lower variance than either unweighted or e…
Standardizes weighted ranking correlation coefficients to maintain zero expected value.
problem Measuring correlation between weighted rankings of items.
method Develops a standardization function g(·) that transforms coefficients to zero expected value under randomness.
result A general standardization function g(Γ) that preserves the domain [-1,1] and reduces to the identity for coefficients already satisfying zero-expected-value property.
Bayesian priors for neural networks are improved by incorporating weight correlations and tail behavior.
problem Improving Bayesian priors for neural networks to better reflect true beliefs and performance.
method Analyzed summary statistics of neural network weights in different architectures and incorporated these observations into new priors.
result Improved performance on image classification datasets by using new priors that account for weight correlations and tail behavior.
The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and define a matching error as the weighted sum of squared distances between transformed vectors with respect…
Abstract result on correlations of pairs in exponentially growing discrete subsets.
problem Pair correlations in exponentially growing discrete subsets with weight functions.
method Proved abstract result on correlations of pairs of elements in an exponentially growing discrete subset with a weight function.
result Distribution function of unscaled differences is t↦2δe−∣t∣, and pair correlation exhibits Poissonian behavior under certain conditions. Losaw improves FI scores by decorrelating features in ML models.
problem Feature correlation distorts feature importance scores in ML models.
method Losaw uses local sample weighting to decorrelate features.
result Losaw consistently improves feature importance scores and prediction accuracy.
New method detects intrinsic cross-correlations in non-stationary time series affected by common factors.
problem Bias in cross-correlation analysis due to common external factors.
method Multifractal temporally weighted detrended partial cross-correlation analysis (MF-TWDPCCA).
result MF-TWDPCCA accurately detects intrinsic cross-correlations between non-stationary time series.
Given two data matrices X and Y, sparse canonical correlation analysis (SCCA) is to seek two sparse canonical vectors u and v to maximize the correlation between Xu and Yv. However, classical and sparse CCA models consider the contribution of all the samples of data matrices and thus cannot identify an unde…
Improves Lasso's stability in correlated predictor settings.
problem Lasso's selection stability deteriorates with correlated predictors.
method Integrates a weighting scheme into the Lasso penalty function, using a correlation-adjusted ranking.
result Demonstrates improved selection stability on simulated and real-world datasets.
We develop correlated random measures, random measures where the atom weights can exhibit a flexible pattern of dependence, and use them to develop powerful hierarchical Bayesian nonparametric models. Hierarchical Bayesian nonparametric models are usually built from completely random measures, a Poisson-process based c…
A new algorithm removes unexpected correlations in biased data for better clustering.
problem Clustering with selection bias in data.
method Decorrelation regularized K-Means (DCKM) algorithm.
result DCKM achieves significant performance gains on real-world datasets.
Improved multiclass classification with class-weighted nearest neighbors.
problem Multiclass classification with large or imbalanced classes.
method Class-weighted k-nearest neighbors algorithm, derived bounds on accuracy and risk.
result Optimized classification metrics like F1 score or Matthew's Correlation Coefficient.
New method speeds up neural network training by preprocessing weight-data correlation.
problem Slow neural network training due to high time complexity.
method Stores weight-data correlation in a tree structure for quick detection of firing neurons.
result Achieves o(nmd) time per iteration with only O(nmd) preprocessing time. Non-negative matrix factorization is a basic tool for decomposing data into the feature and weight matrices under non-negativity constraints, and in practice is often solved in the alternating minimization framework. However, it is unclear whether such algorithms can recover the ground-truth feature matrix when the wei…
A new method cleans and analyzes stock return correlation matrices.
problem Improving the accuracy of covariance/correlation matrices in financial data.
method Constrained principal component analysis using financial data and optimal portfolios.
result Identified stylized patterns in correlation matrix eigenvalues and weights.
Modern deep neural networks require a tremendous amount of data to train, often needing hundreds or thousands of labeled examples to learn an effective representation. For these networks to work with less data, more structure must be built into their architectures or learned from previous experience. The learned weight…
Gradient descent aligns neural feature matrices with pre-activation tangent features.
problem Understanding neural feature learning mechanisms.
method Analytical proof of alignment between weight matrices and pre-activation tangent features.
result Derivative alignment occurs almost surely in high-dimensional settings.
Sparse models for high-dimensional linear regression and machine learning have received substantial attention over the past two decades. Model selection, or determining which features or covariates are the best explanatory variables, is critical to the interpretability of a learned model. Much of the current literature…
Interpretable machine-learning models can be unstable under multicollinearity, leading to oscillatory weights that do not reflect meaningful contributions.
problem Interpretable machine-learning models can be unstable under multicollinearity.
method Theoretical analysis of eigenmodes of the feature correlation matrix.
result Small-eigenvalue modes associated with multicollinearity amplify fluctuations in the weights and generate oscillatory patterns that do not necessarily reflect meaningful contributions.
CDEFs reduce model complexity and uncover time correlations.
problem Model complexity and data efficiency in probabilistic modeling.
method Builds on deep exponential families, ties weights for reduced parameters.
result CDEFs uncover time correlations with fewer parameters.
New method embeds correlation networks to reveal underlying time series patterns.
problem Analyzing correlation networks derived from time series data.
method Spectral embedding of noisy correlation networks, leveraging Fourier basis elements.
result Spectral embedding recovers true vertex-level latent representations under suitable assumptions.
Study on MC dropout in wide neural networks and its convergence to Gaussian processes.
problem Understanding the behavior of Monte Carlo dropout in wide neural networks.
method Rigorously studied the limiting distribution of wide untrained NNs under dropout, proving convergence to Gaussian processes. Investigated correlations and non-Gaussian behavior in finite width NNs.
result Wide untrained neural networks under dropout converge to Gaussian processes for fixed sets of weights and biases.
Research examines correlations of complex logarithms of lattice points, showing level repulsion and Poissonian behavior.
problem Analyzing correlations of complex logarithms of lattice points.
method Proving existence of pair correlation functions and examining behavior at various scalings.
result Level repulsion observed at linear scaling, Poissonian behavior at sublinear scalings.
We analyze correlations among stock returns via a series of widely adopted parameters which we refer to as explanatory variables. We subsequently exploit the results to propose a long only quantitative adaptive technique to construct a profitable portfolio of assets which exhibits minor drawdowns and higher recoveries …
With the widespread engineering applications ranging from artificial intelligence and big data decision-making, originally a lot of tedious financial data processing, processing and analysis have become more and more convenient and effective. This paper aims to improve the accuracy of stock price forecasting. It improv…
The instability of historical risk factor correlations renders their use in estimating portfolio risk extremely questionable. In periods of market stress correlations of risk factors have a tendency to quickly go well beyond estimated values. For instance, in times of severe market stress, one would expect with certain…
Develops a new random forest method for clustered data with improved prediction and inference.
problem Improving prediction and inference accuracy for clustered data with within-cluster dependence.
method Clustered Random Forests, using weighted least squares estimators for leaf predictions.
result Optimal prediction and inference weights vary under covariate shift, necessitating user-chosen weights.
Residual Network (ResNet) is the state-of-the-art architecture that realizes successful training of really deep neural network. It is also known that good weight initialization of neural network avoids problem of vanishing/exploding gradients. In this paper, simplified models of ResNets are analyzed. We argue that good…
A new method for faster prediction in distributed Gaussian processes.
problem Inefficient aggregation of distributed Gaussian processes with correlations.
method Proposes a novel approach for aggregated prediction in distributed GPs that incorporates correlations among experts.
result Results in more stable predictions in less time compared to state-of-the-art methods.
We describe a new optimization scheme for finding high-quality correlation clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our a…
This paper studies ordered weighted L1 (OWL) norm regularization for sparse estimation problems with strongly correlated variables. We prove sufficient conditions for clustering based on the correlation/colinearity of variables using the OWL norm, of which the so-called OSCAR is a particular case. Our results extend pr…
We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs. Extending the exact recovery guarantees established in the companion paper for Gaussian weights, in this work,…
The study analyzes XRP transaction networks to understand market dynamics.
problem Understanding market dynamics of XRP through transaction data.
method Weekly weighted directed networks are embedded into a vector space using network embedding techniques. A correlation tensor is calculated and analyzed using singular value decomposition.
result The correlation tensor provides insights into the system's behavior and dependence on model parameters.
New method improves portfolio allocation using local Gaussian correlation.
problem Asymmetric dependence in asset returns.
method Local Gaussian correlation to extend mean-variance framework.
result New method outperforms existing portfolios for monthly asset returns.
Novel method decorrelates neurons for better deep learning model generalization.
problem High correlations between neurons limit deep learning model generalization.
method Regularization terms from minimum spanning tree of neuron cliques, using correlation dissimilarities.
result Our regularizers outperform existing methods and minimize neuron redundancies.
This paper introduces anti-correlation networks to study China's stock market.
problem Previous studies ignored anti-correlation in financial networks.
method Constructed weighted temporal anti-correlation and positive correlation networks.
result Unveiled differences in topological measurements between anti-correlation and positive correlation networks.
This paper explores the relationships between migration and trade using a complex-network approach. We show that: (i) both weighted and binary versions of the networks of international migration and trade are strongly correlated; (ii) such correlations can be mostly explained by country economic/demographic size and ge…
A new weighted MLMC method improves efficiency in Monte Carlo simulations.
problem Improving efficiency in Monte Carlo simulations with correlated coarse level approximations.
method Generalization of MLMC to any number of levels with control variates and weights.
result Significant efficiency improvements possible, especially when coarse level approximations are poorly correlated.
We formulate learning of a binary autoencoder as a biconvex optimization problem which learns from the pairwise correlations between encoded and decoded bits. Among all possible algorithms that use this information, ours finds the autoencoder that reconstructs its inputs with worst-case optimal loss. The optimal decode…
WICA improves ICA results with a new method.
problem Finding independent components in nonlinear data.
method New nonlinear ICA model (WICA) with efficient correlation coefficient verification.
result WICA yields better and more stable results than other algorithms.
New tensor framework connects Fisher information, hypergraphs, and multi-observable correlations.
problem Missing structure in pairwise Fisher graphs for multi-observable radiation patterns.
method Higher-order Fisher tensors and natural exponential-family coordinates.
result Exact triality of Fisher tensors, cumulants, and hypergraphs.
A new methodology for incorporating LGD correlation effects into the Basel II risk weight functions is introduced. This methodology is based on modelling of LGD and default event with a single loss variable. The resulting formulas for capital charges are numerically compared to the current proposals by the Basel Commit…
New feature selection method DRPT reduces genomic datasets by removing irrelevant features and detecting correlations.
problem Feature selection in high-dimensional genomic datasets.
method DRPT method: 1. Remove irrelevant features, 2. Detect correlations in reduced matrix.
result DRPT outperforms state-of-the-art methods in feature selection over multiple genetic datasets.
We study graph matching with correlated Gaussian features and find thresholds for exact recovery.
problem Graph matching with correlated Gaussian features.
method Information-theoretic thresholds and conditions for exact and almost exact recovery.
result Contextual information introduces a richer structure, with thresholds for exact and almost exact recovery no longer coinciding.